Home
last modified time | relevance | path

Searched refs:numbers1 (Results 1 – 8 of 8) sorted by relevance

/ndk/tests/device/test-gnustl-full/unit/
Dincludes_test.cpp40 int numbers1[5] = { 1, 2, 3, 4, 5 }; in incl0() local
43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); in incl0()
Dmerge_test.cpp37 int numbers1[5] = { 1, 6, 13, 25, 101 }; in merge0() local
41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result); in merge0()
Dadj_test.cpp43 int numbers1 [5] = { 1, 2, 4, 8, 16 }; in adjfind0() local
46 int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5); in adjfind0()
47 CPPUNIT_ASSERT(location == numbers1 + 5); // no adj so loc should be _last in adjfind0()
Dequal_test.cpp131 int numbers1[5] = { 1, 2, 3, 4, 5 }; in equal0() local
135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); in equal0()
136 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) ); in equal0()
/ndk/tests/device/test-stlport/unit/
Dincludes_test.cpp40 int numbers1[5] = { 1, 2, 3, 4, 5 }; in incl0() local
43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); in incl0()
Dmerge_test.cpp37 int numbers1[5] = { 1, 6, 13, 25, 101 }; in merge0() local
41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result); in merge0()
Dadj_test.cpp43 int numbers1 [5] = { 1, 2, 4, 8, 16 }; in adjfind0() local
46 int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5); in adjfind0()
47 CPPUNIT_ASSERT(location == numbers1 + 5); // no adj so loc should be _last in adjfind0()
Dequal_test.cpp131 int numbers1[5] = { 1, 2, 3, 4, 5 }; in equal0() local
135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); in equal0()
136 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) ); in equal0()