/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;
|
setinter_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_intersection((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 55 vector <int> v2(10); 56 __iota(v2.begin(), v2.end(), 7); 59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
|
setunion_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_union((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 58 vector <int> v2(10); 59 __iota(v2.begin(), v2.end(), 7); 62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
|
copy_test.cpp | 90 vector<int> v2(v1.size()); 91 copy(v1.begin(), v1.end(), v2.begin()); 93 CPPUNIT_ASSERT( v2 == v1 ); 100 vector<int> v2; local 101 insert_iterator<vector<int> > i(v2, v2.begin()); 104 CPPUNIT_ASSERT( v2 == v1 ); 112 vector<int> v2(v1.size()); 113 copy_backward(v1.begin(), v1.end(), v2.end()); 115 CPPUNIT_ASSERT( v2 == v1 ) [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...] |
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...] |
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-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;
|
setinter_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_intersection((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 55 vector <int> v2(10); 56 __iota(v2.begin(), v2.end(), 7); 59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
|
setunion_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_union((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 58 vector <int> v2(10); 59 __iota(v2.begin(), v2.end(), 7); 62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
|
copy_test.cpp | 90 vector<int> v2(v1.size()); 91 copy(v1.begin(), v1.end(), v2.begin()); 93 CPPUNIT_ASSERT( v2 == v1 ); 100 vector<int> v2; local 101 insert_iterator<vector<int> > i(v2, v2.begin()); 104 CPPUNIT_ASSERT( v2 == v1 ); 112 vector<int> v2(v1.size()); 113 copy_backward(v1.begin(), v1.end(), v2.end()); 115 CPPUNIT_ASSERT( v2 == v1 ) [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...] |
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...] |
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;
|
setinter_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_intersection((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 55 vector <int> v2(10); 56 __iota(v2.begin(), v2.end(), 7); 59 set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(inter));
|
setunion_test.cpp | 40 int v2[4] = { 10, 13, 17, 23 }; local 43 set_union((int*)v1, (int*)v1 + 3, (int*)v2, (int*)v2 + 4, (int*)result); 58 vector <int> v2(10); 59 __iota(v2.begin(), v2.end(), 7); 62 set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), back_inserter(diff));
|
copy_test.cpp | 90 vector<int> v2(v1.size()); 91 copy(v1.begin(), v1.end(), v2.begin()); 93 CPPUNIT_ASSERT( v2 == v1 ); 100 vector<int> v2; local 101 insert_iterator<vector<int> > i(v2, v2.begin()); 104 CPPUNIT_ASSERT( v2 == v1 ); 112 vector<int> v2(v1.size()); 113 copy_backward(v1.begin(), v1.end(), v2.end()); 115 CPPUNIT_ASSERT( v2 == v1 ) [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...] |
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...] |
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/tests/tests/view/src/android/view/cts/ |
View_FocusHandlingTest.java | 146 View v2 = activity.findViewById(R.id.view2); local 151 assertNotNull(v2); 157 assertFalse(v2.isFocusable()); 162 v2.setFocusable(true); 167 assertTrue(v2.isFocusable()); 174 v2.setNextFocusLeftId(R.id.view1); 175 v2.setNextFocusDownId(R.id.view4); 187 assertEquals(R.id.view1, v2.getNextFocusLeftId()); 188 assertEquals(R.id.view4, v2.getNextFocusDownId()); 197 assertSame(v2, v1.focusSearch(View.FOCUS_RIGHT)) [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;
|
/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...] |
/external/dropbear/libtommath/ |
bn_mp_exteuclid.c | 23 mp_int u1,u2,u3,v1,v2,v3,t1,t2,t3,q,tmp; local 26 if ((err = mp_init_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL)) != MP_OKAY) { 34 /* initialize, (v1,v2,v3) = (0,1,b) */ 35 mp_set(&v2, 1); 43 /* (t1,t2,t3) = (u1,u2,u3) - (v1,v2,v3)q */ 46 if ((err = mp_mul(&v2, &q, &tmp)) != MP_OKAY) { goto _ERR; } 51 /* (u1,u2,u3) = (v1,v2,v3) */ 53 if ((err = mp_copy(&v2, &u2)) != MP_OKAY) { goto _ERR; } 56 /* (v1,v2,v3) = (t1,t2,t3) */ 58 if ((err = mp_copy(&t2, &v2)) != MP_OKAY) { goto _ERR; [all...] |