/external/stlport/test/unit/ |
fib.h | 6 Fibonacci() : v1(0), v2(1) {} 10 int v2; member in class:Fibonacci 16 int r = v1 + v2; 17 v1 = v2; 18 v2 = r;
|
includes_test.cpp | 49 vector<int> v2(3); 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 58 for (i = 0; (size_t)i < v2.size(); ++i) 59 v2[i] = i + 3; 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 73 vector <char const*> v2(2); 75 v2[0] = "foo"; 76 v2[1] = "bar" [all...] |
rotate_test.cpp | 108 vector <int> v2(v1.size()); 110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin()); 111 CPPUNIT_ASSERT(v2[0]==1); 112 CPPUNIT_ASSERT(v2[1]==2); 113 CPPUNIT_ASSERT(v2[2]==3); 114 CPPUNIT_ASSERT(v2[3]==4); 115 CPPUNIT_ASSERT(v2[4]==5); 116 CPPUNIT_ASSERT(v2[5]==6); 117 CPPUNIT_ASSERT(v2[6]==7); 118 CPPUNIT_ASSERT(v2[7]==8) [all...] |
search_test.cpp | 42 int v2[6] = { 0, 1, 2, 3, 4, 5 }; local 49 location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2); 50 CPPUNIT_ASSERT(location != v2 + 6); 51 CPPUNIT_ASSERT(location - v2 == 3); 58 IntVec v2(3); 59 __iota(v2.begin(), v2.end(), 50); 62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end()) [all...] |
swap_test.cpp | 91 queue<Obj> v2; local 98 v2.push( Obj() ); 99 v2.back().v = 10; 100 v2.push( Obj() ); 101 v2.back().v = 11; 102 v2.push( Obj() ); 103 v2.back().v = 12; 106 CPPUNIT_CHECK( v2.size() == 3 ); 108 swap( v1, v2 ); // this shouldn't try make it as v1.swap( v2 ), no queue::swap method 134 vector<Obj> v2; local [all...] |
setdiff_test.cpp | 46 int v2[4] = { 10, 13, 17, 23 }; local 49 set_symmetric_difference((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 60 vector<int> v2(10); 61 __iota(v2.begin(), v2.end(), 7); 64 set_symmetric_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff)); 90 int v2[4] = { 10, 13, 17, 23 }; local 95 set_difference((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result) [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
fib.h | 6 Fibonacci() : v1(0), v2(1) {} 10 int v2; member in class:Fibonacci 16 int r = v1 + v2; 17 v1 = v2; 18 v2 = r;
|
includes_test.cpp | 49 vector<int> v2(3); 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 58 for (i = 0; (size_t)i < v2.size(); ++i) 59 v2[i] = i + 3; 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 73 vector <char const*> v2(2); 75 v2[0] = "foo"; 76 v2[1] = "bar" [all...] |
rotate_test.cpp | 108 vector <int> v2(v1.size()); 110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin()); 111 CPPUNIT_ASSERT(v2[0]==1); 112 CPPUNIT_ASSERT(v2[1]==2); 113 CPPUNIT_ASSERT(v2[2]==3); 114 CPPUNIT_ASSERT(v2[3]==4); 115 CPPUNIT_ASSERT(v2[4]==5); 116 CPPUNIT_ASSERT(v2[5]==6); 117 CPPUNIT_ASSERT(v2[6]==7); 118 CPPUNIT_ASSERT(v2[7]==8) [all...] |
search_test.cpp | 42 int v2[6] = { 0, 1, 2, 3, 4, 5 }; local 49 location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2); 50 CPPUNIT_ASSERT(location != v2 + 6); 51 CPPUNIT_ASSERT(location - v2 == 3); 58 IntVec v2(3); 59 __iota(v2.begin(), v2.end(), 50); 62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end()) [all...] |
swap_test.cpp | 91 queue<Obj> v2; local 98 v2.push( Obj() ); 99 v2.back().v = 10; 100 v2.push( Obj() ); 101 v2.back().v = 11; 102 v2.push( Obj() ); 103 v2.back().v = 12; 106 CPPUNIT_CHECK( v2.size() == 3 ); 108 swap( v1, v2 ); // this shouldn't try make it as v1.swap( v2 ), no queue::swap method 134 vector<Obj> v2; local [all...] |
/ndk/tests/device/test-stlport/unit/ |
fib.h | 6 Fibonacci() : v1(0), v2(1) {} 10 int v2; member in class:Fibonacci 16 int r = v1 + v2; 17 v1 = v2; 18 v2 = r;
|
includes_test.cpp | 49 vector<int> v2(3); 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 58 for (i = 0; (size_t)i < v2.size(); ++i) 59 v2[i] = i + 3; 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 73 vector <char const*> v2(2); 75 v2[0] = "foo"; 76 v2[1] = "bar" [all...] |
rotate_test.cpp | 108 vector <int> v2(v1.size()); 110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin()); 111 CPPUNIT_ASSERT(v2[0]==1); 112 CPPUNIT_ASSERT(v2[1]==2); 113 CPPUNIT_ASSERT(v2[2]==3); 114 CPPUNIT_ASSERT(v2[3]==4); 115 CPPUNIT_ASSERT(v2[4]==5); 116 CPPUNIT_ASSERT(v2[5]==6); 117 CPPUNIT_ASSERT(v2[6]==7); 118 CPPUNIT_ASSERT(v2[7]==8) [all...] |
search_test.cpp | 42 int v2[6] = { 0, 1, 2, 3, 4, 5 }; local 49 location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2); 50 CPPUNIT_ASSERT(location != v2 + 6); 51 CPPUNIT_ASSERT(location - v2 == 3); 58 IntVec v2(3); 59 __iota(v2.begin(), v2.end(), 50); 62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end()) [all...] |
swap_test.cpp | 91 queue<Obj> v2; local 98 v2.push( Obj() ); 99 v2.back().v = 10; 100 v2.push( Obj() ); 101 v2.back().v = 11; 102 v2.push( Obj() ); 103 v2.back().v = 12; 106 CPPUNIT_CHECK( v2.size() == 3 ); 108 swap( v1, v2 ); // this shouldn't try make it as v1.swap( v2 ), no queue::swap method 134 vector<Obj> v2; local [all...] |
/cts/tools/dx-tests/src/dxc/junit/opcodes/invokestatic/jm/ |
T_invokestatic_4.java | 21 static long v2 = 123456789l; field in class:T_invokestatic_4 24 return v2;
|
/external/chromium/sdch/open-vcdiff/src/gtest/ |
gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 136 const T2& v2) { 137 if (pred(v1, v2)) return AssertionSuccess(); 144 << "\n" << e2 << " evaluates to " << v2; local 150 #define GTEST_PRED_FORMAT2(pred_format, v1, v2, on_failure)\ 151 GTEST_ASSERT(pred_format(#v1, #v2, v1, v2),\ 156 #define GTEST_PRED2(pred, v1, v2, on_failure) [all...] |
/external/chromium/testing/gtest/include/gtest/ |
gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 134 const T2& v2) { 135 if (pred(v1, v2)) return AssertionSuccess(); 141 << "\n" << e2 << " evaluates to " << v2; 146 #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ 147 GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ 152 #define GTEST_PRED2_(pred, v1, v2, on_failure) [all...] |
/external/gtest/include/gtest/ |
gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 136 const T2& v2) { 137 if (pred(v1, v2)) return AssertionSuccess(); 144 << "\n" << e2 << " evaluates to " << v2; local 150 #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ 151 GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ 156 #define GTEST_PRED2_(pred, v1, v2, on_failure) [all...] |
/external/llvm/utils/unittest/googletest/include/gtest/ |
gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 134 const T2& v2) { 135 if (pred(v1, v2)) return AssertionSuccess(); 141 << "\n" << e2 << " evaluates to " << v2; 146 #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ 147 GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ 152 #define GTEST_PRED2_(pred, v1, v2, on_failure) [all...] |
/external/protobuf/gtest/include/gtest/ |
gtest_pred_impl.h | 47 // ASSERT_PRED_FORMAT2(pred_format, v1, v2) 59 // ASSERT_PRED2(pred, v1, v2) 63 // and the values v1, v2, ..., must support the << operator for 136 const T2& v2) { 137 if (pred(v1, v2)) return AssertionSuccess(); 144 << "\n" << e2 << " evaluates to " << v2; local 150 #define GTEST_PRED_FORMAT2_(pred_format, v1, v2, on_failure)\ 151 GTEST_ASSERT_(pred_format(#v1, #v2, v1, v2),\ 156 #define GTEST_PRED2_(pred, v1, v2, on_failure) [all...] |
/external/clang/test/SemaTemplate/ |
qualified-names-diag.cpp | 14 vector<Real> v2; local 15 v1 = v2; // expected-error{{no viable overloaded '='}}
|
/dalvik/dx/tests/096-dex-giant-catch/ |
Blort.java | 18 static public void blort(long v1, long v2, long v3, long v4,
|
/system/extras/tests/bionic/libc/other/ |
test_aligned.c | 10 unsigned v2; local 20 v2 = *(unsigned*)(tab+o); 22 if (v2 != val) { 23 printf( "FAIL (%08x)\n", v2 ); 33 unsigned v2; local 40 v2 = ((unsigned)tab[o+0] << 24) | 45 if (v2 != val) { 46 printf( "FAIL (%08x)\n", v2 ); 56 unsigned short v2; local 64 v2 = *(unsigned short*)(tab+o) 77 unsigned short v2; local [all...] |