Home
last modified time | relevance | path

Searched refs:numbers2 (Results 1 – 6 of 6) sorted by relevance

/ndk/tests/device/test-stlport/unit/
Dadj_test.cpp44 int numbers2 [5] = { 5, 3, 2, 1, 1 }; in adjfind0() local
49 location = adjacent_find((int*)numbers2, (int*)numbers2 + 5); in adjfind0()
50 CPPUNIT_ASSERT(location != numbers2 + 5); // adj location off should be 3 (first 1) in adjfind0()
51 CPPUNIT_ASSERT((location - numbers2)==3); in adjfind0()
Dmerge_test.cpp38 int numbers2[5] = {-5, 26, 36, 46, 99 }; in merge0() local
41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result); in merge0()
Dequal_test.cpp132 int numbers2[5] = { 1, 2, 4, 8, 16 }; in equal0() local
135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); in equal0()
/ndk/tests/device/test-gnustl-full/unit/
Dadj_test.cpp44 int numbers2 [5] = { 5, 3, 2, 1, 1 }; in adjfind0() local
49 location = adjacent_find((int*)numbers2, (int*)numbers2 + 5); in adjfind0()
50 CPPUNIT_ASSERT(location != numbers2 + 5); // adj location off should be 3 (first 1) in adjfind0()
51 CPPUNIT_ASSERT((location - numbers2)==3); in adjfind0()
Dmerge_test.cpp38 int numbers2[5] = {-5, 26, 36, 46, 99 }; in merge0() local
41 merge((int*)numbers1, (int*)numbers1 + 5, (int*)numbers2, (int*)numbers2 + 5, (int*)result); in merge0()
Dequal_test.cpp132 int numbers2[5] = { 1, 2, 4, 8, 16 }; in equal0() local
135 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); in equal0()