/external/chromium_org/v8/test/webkit/ |
array-sort-reentrance.js | 28 var numbers1 = [1, 2, 3, 4, 5, 6, 7]; variable 29 var numbers2 = numbers1.slice(); 36 numbers1.sort(compareFn1);
|
/external/stlport/test/unit/ |
includes_test.cpp | 40 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2);
|
merge_test.cpp | 37 int numbers1[5] = { 1, 6, 13, 25, 101 }; local 41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result);
|
adj_test.cpp | 43 int numbers1 [5] = { 1, 2, 4, 8, 16 }; local 46 int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5); 47 CPPUNIT_ASSERT(location == numbers1 + 5); // no adj so loc should be _last
|
equal_test.cpp | 131 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); 136 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) );
|
/ndk/tests/device/test-gnustl-full/unit/ |
includes_test.cpp | 40 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2);
|
merge_test.cpp | 37 int numbers1[5] = { 1, 6, 13, 25, 101 }; local 41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result);
|
adj_test.cpp | 43 int numbers1 [5] = { 1, 2, 4, 8, 16 }; local 46 int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5); 47 CPPUNIT_ASSERT(location == numbers1 + 5); // no adj so loc should be _last
|
equal_test.cpp | 131 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); 136 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) );
|
/ndk/tests/device/test-stlport/unit/ |
includes_test.cpp | 40 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2);
|
merge_test.cpp | 37 int numbers1[5] = { 1, 6, 13, 25, 101 }; local 41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result);
|
adj_test.cpp | 43 int numbers1 [5] = { 1, 2, 4, 8, 16 }; local 46 int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5); 47 CPPUNIT_ASSERT(location == numbers1 + 5); // no adj so loc should be _last
|
equal_test.cpp | 131 int numbers1[5] = { 1, 2, 3, 4, 5 }; local 135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); 136 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) );
|