/external/libcxx/test/utilities/template.bitset/bitset.members/ |
H A D | test.pass.cpp | 31 const std::bitset<N> v1 = make_bitset<N>(); local 34 bool b = v1.test(50); 35 if (50 >= v1.size()) 37 assert(b == v1[50]);
|
H A D | index.pass.cpp | 31 std::bitset<N> v1 = make_bitset<N>(); local 34 assert(v1[N/2] == v1.test(N/2)); 35 typename std::bitset<N>::reference r = v1[N/2]; 36 assert(r == v1.test(N/2)); 37 typename std::bitset<N>::reference r2 = v1[N/2]; 39 assert(r == v1.test(N/2)); 42 assert(v1.test(N/2) == false); 45 assert(v1.test(N/2) == true); 48 assert(v1 [all...] |
/external/libcxx/test/utilities/template.bitset/bitset.operators/ |
H A D | op_and.pass.cpp | 31 std::bitset<N> v1 = make_bitset<N>(); local 33 std::bitset<N> v3 = v1; 34 assert((v1 & v2) == (v3 &= v2));;
|
H A D | op_not.pass.cpp | 31 std::bitset<N> v1 = make_bitset<N>(); local 33 std::bitset<N> v3 = v1; 34 assert((v1 ^ v2) == (v3 ^= v2));;
|
H A D | op_or.pass.cpp | 31 std::bitset<N> v1 = make_bitset<N>(); local 33 std::bitset<N> v3 = v1; 34 assert((v1 | v2) == (v3 |= v2));;
|
/external/nanopb-c/examples/using_double_on_avr/ |
H A D | decode_double.c | 19 float v1 = double_to_float(message.field1); local 22 printf("Values: %f %f\n", v1, v2); 24 if (v1 == 1234.5678f &&
|
/external/stlport/test/unit/ |
H A D | fib.h | 6 Fibonacci() : v1(0), v2(1) {} 9 int v1; member in class:Fibonacci 16 int r = v1 + v2; 17 v1 = v2; 19 return v1;
|
H A D | perm_test.cpp | 44 int v1[3] = { 0, 1, 2 }; local 45 prev_permutation(v1, v1 + 3); 47 CPPUNIT_ASSERT(v1[0]==2); 48 CPPUNIT_ASSERT(v1[1]==1); 49 CPPUNIT_ASSERT(v1[2]==0); 53 vector <int> v1(3); 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1 137 int v1[3] = { 0, 1, 2 }; local [all...] |
H A D | setinter_test.cpp | 39 int v1[3] = { 13, 18, 23 }; local 43 set_intersection((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 53 vector <int> v1(10); 54 __iota(v1.begin(), v1.end(), 0); 59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
|
H A D | setunion_test.cpp | 39 int v1[3] = { 13, 18, 23 }; local 43 set_union((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 56 vector <int> v1(10); 57 __iota(v1.begin(), v1.end(), 0); 62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
|
/external/chromium_org/third_party/skia/tests/ |
H A D | InterpolatorTest.cpp | 21 SkScalar v1[3], v2[3], v[3]; local 24 inter.setKeyFrame(0, 100, iset(v1, 10, 20, 30), 0); 29 REPORTER_ASSERT(reporter, memcmp(v, v1, sizeof(v)) == 0); 33 REPORTER_ASSERT(reporter, memcmp(v, v1, sizeof(v)) == 0); 37 REPORTER_ASSERT(reporter, memcmp(v, v1, sizeof(v)) == 0);
|
H A D | PathOpsDVectorTest.cpp | 25 SkDVector v1 = tests[index + 1] - tests[index]; local 26 SkASSERT(ValidVector(v1)); 29 v1 += v2; 30 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); 35 v1 = tests[index + 1] - tests[index]; 36 v1 /= 2; 37 v1 *= 2; 38 v1 -= tests[index + 1] - tests[index]; 39 REPORTER_ASSERT(reporter, v1 [all...] |
/external/chromium_org/ui/views/ |
H A D | view_model_unittest.cc | 40 View v1; local 42 model.Add(&v1, 0); 44 EXPECT_EQ(&v1, model.view_at(0)); 48 EXPECT_EQ(0, model.GetIndexOfView(&v1)); 52 View v1, v2, v3; local 53 v1.set_id(0); 57 model.Add(&v1, 0); 68 View v1, v2, v3; local 69 v1.set_id(0); 73 model.Add(&v1, [all...] |
/external/clang/test/CodeGen/ |
H A D | mmx-inline-asm.c | 9 __m64 v1, v2, v3, v4, v5, v6, v7; local 19 : "=&y" (v1), "=&y" (v2), "=&y" (v3),
|
H A D | vld_dup.c | 8 int32x2x3_t v1; local 16 v1 = vld3_dup_s32(v0);
|
/external/clang/test/SemaCXX/ |
H A D | attr-cleanup-gcc.cpp | 13 int v1 __attribute__((cleanup(N::c1))); // expected-warning {{GCC does not allow the 'cleanup' attribute argument to be anything other than a simple identifier}} local
|
/external/libcxx/test/numerics/numarray/template.valarray/valarray.members/ |
H A D | apply_cref.pass.cpp | 29 std::valarray<T> v1(a1, N1); 30 std::valarray<T> v2 = v1.apply(f); 37 std::valarray<T> v1; local 38 std::valarray<T> v2 = v1.apply(f); 45 std::valarray<T> v1(a1, N1); 46 std::valarray<T> v2 = (v1+v1).apply(f);
|
H A D | apply_value.pass.cpp | 29 std::valarray<T> v1(a1, N1); 30 std::valarray<T> v2 = v1.apply(f); 37 std::valarray<T> v1; local 38 std::valarray<T> v2 = v1.apply(f); 45 std::valarray<T> v1(a1, N1); 46 std::valarray<T> v2 = (v1+v1).apply(f);
|
H A D | swap.pass.cpp | 27 std::valarray<T> v1(a1, N1); 29 std::valarray<T> v1_save = v1; 31 v1.swap(v2); 32 assert(v1.size() == v2_save.size()); 33 for (int i = 0; i < v1.size(); ++i) 34 assert(v1[i] == v2_save[i]); 44 std::valarray<T> v1(a1, N1); 46 std::valarray<T> v1_save = v1; 48 v1.swap(v2); 49 assert(v1 61 std::valarray<T> v1; local 77 std::valarray<T> v1; local [all...] |
/external/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.special/ |
H A D | swap.pass.cpp | 29 std::valarray<T> v1(a1, N1); 31 std::valarray<T> v1_save = v1; 33 swap(v1, v2); 34 assert(v1.size() == v2_save.size()); 35 for (int i = 0; i < v1.size(); ++i) 36 assert(v1[i] == v2_save[i]); 46 std::valarray<T> v1(a1, N1); 48 std::valarray<T> v1_save = v1; 50 swap(v1, v2); 51 assert(v1 63 std::valarray<T> v1; local 79 std::valarray<T> v1; local [all...] |
/external/mdnsresponder/Clients/ |
H A D | ClientCommon.c | 58 int v1 = cstr[ 0] - '0'; local 60 int val = v0 * 100 + v1 * 10 + v2;
|
/external/qemu/android/base/containers/ |
H A D | PodVector_unittest.cpp | 107 PodVector<int> v1; local 110 v1.append(hashIndex(n)); 112 EXPECT_EQ(kMaxCount, v1.size()); 115 v2 = v1; 117 v1.reserve(0);
|
/external/skia/tests/ |
H A D | PathOpsDVectorTest.cpp | 25 SkDVector v1 = tests[index + 1] - tests[index]; local 26 SkASSERT(ValidVector(v1)); 29 v1 += v2; 30 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); 35 v1 = tests[index + 1] - tests[index]; 36 v1 /= 2; 37 v1 *= 2; 38 v1 -= tests[index + 1] - tests[index]; 39 REPORTER_ASSERT(reporter, v1 [all...] |
/external/valgrind/main/none/tests/s390x/ |
H A D | bfp-3.c | 6 void maebr(float v1, float v2, float v3) argument 8 float r1 = v1; 12 printf("maebr %f * %f + %f -> %f\n", v2, v3, v1, r1); 15 void madbr(double v1, double v2, double v3) argument 17 double r1 = v1; 21 printf("madbr %f * %f + %f -> %f\n", v2, v3, v1, r1); 24 void msebr(float v1, float v2, float v3) argument 26 float r1 = v1; 30 printf("msebr %f * %f - %f -> %f\n", v2, v3, v1, r1); 33 void msdbr(double v1, doubl argument [all...] |
H A D | bfp-4.c | 5 void cebr(float v1, float v2) argument 12 : [psw]"=d"(cc) : [r1]"f"(v1), [r2]"f"(v2) : "cc"); 14 printf("cfebr: %f == %f\n", v1, v2); 16 printf("cfebr: %f < %f\n", v1, v2); 18 printf("cfebr: %f > %f\n", v1, v2); 21 void cdbr(double v1, double v2) argument 28 : [psw]"=d"(cc) : [r1]"f"(v1), [r2]"f"(v2) : "cc"); 30 printf("cdebr: %f == %f\n", v1, v2); 32 printf("cdebr: %f < %f\n", v1, v2); 34 printf("cdebr: %f > %f\n", v1, v [all...] |