Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:numbers1 (Results 1 - 12 of 12) sorted by null

/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) );

Completed in 70 milliseconds