| /external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa));
34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3));
35 assert(!std::lexicographical_compare(ib+1, ib+3, ia, ia+sa));
|
| lexicographical_compare_comp.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1,
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c));
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c));
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c));
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c));
38 assert(!std::lexicographical_compare(ia, ia+sa, ib+1, ib+3, c));
39 assert(std::lexicographical_compare(ib+1, ib+3, ia, ia+sa, c));
|
| Android.mk | 23 test_name := algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare
24 test_src := lexicographical_compare.pass.cpp
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)));
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3)));
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)));
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3)));
35 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)));
|
| lexicographical_compare_comp.pass.cpp | 16 // lexicographical_compare(Iter1 first1, Iter1 last1,
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c));
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c));
39 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c));
|
| /external/stlport/test/unit/ |
| lexcmp_test.cpp | 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| lexcmp_test.cpp | 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| /ndk/tests/device/test-stlport/unit/ |
| lexcmp_test.cpp | 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /external/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| algobase.h | 49 // NB: equal and lexicographical_compare require mismatch.
161 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
164 { return _GLIBCXX_STD_A::lexicographical_compare(__begin1, __end1,
170 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
173 { return _GLIBCXX_STD_A::lexicographical_compare(
184 { return _GLIBCXX_STD_A::lexicographical_compare(
187 // Parallel lexicographical_compare for random access iterators
234 return _GLIBCXX_STD_A::lexicographical_compare(
241 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
261 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1 function in namespace:__parallel
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| algobase.h | 49 // NB: equal and lexicographical_compare require mismatch.
161 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
164 { return _GLIBCXX_STD_A::lexicographical_compare(__begin1, __end1,
170 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
173 { return _GLIBCXX_STD_A::lexicographical_compare(
184 { return _GLIBCXX_STD_A::lexicographical_compare(
187 // Parallel lexicographical_compare for random access iterators
234 return _GLIBCXX_STD_A::lexicographical_compare(
241 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, function in namespace:__parallel
261 lexicographical_compare(_IIter1 __begin1, _IIter1 __end1 function in namespace:__parallel
[all...] |
