| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
35 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
39 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
|
| /ndk/tests/device/test-stlport/unit/ |
| D | lexcmp_test.cpp | 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); in lexcmp1()
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>()); in lexcmp2()
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | lexcmp_test.cpp | 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); in lexcmp1()
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>()); in lexcmp2()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| D | next_permutation.pass.cpp | 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
|
| D | prev_permutation.pass.cpp | 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
|
| D | next_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
|
| D | prev_permutation_comp.pass.cpp | 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _relops_cont.h | 17 return lexicographical_compare(__x.begin(), __x.end(),
|
| D | _algobase.h | 578 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
582 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
587 lexicographical_compare(const unsigned char* __first1, in lexicographical_compare() function
602 inline bool lexicographical_compare(const char* __first1, const char* __last1, in lexicographical_compare() function
607 return lexicographical_compare((const unsigned char*) __first1, in lexicographical_compare()
|
| D | _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, in lexicographical_compare() function
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, in lexicographical_compare() function
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| D | set_intersection.pass.cpp | 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_intersection_comp.pass.cpp | 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| D | set_union.pass.cpp | 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_union_comp.pass.cpp | 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| D | set_symmetric_difference.pass.cpp | 41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| D | set_symmetric_difference_comp.pass.cpp | 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| D | set_difference.pass.cpp | 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0); in test()
|
| D | set_difference_comp.pass.cpp | 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0); in test()
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0); in test()
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| D | array.hpp | 347 return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); in operator <()
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/ |
| D | iterator_range_core.hpp | 69 return std::lexicographical_compare( boost::begin(l), in less_than()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| D | array | 247 …return _VSTD::lexicographical_compare(__x.__elems_, __x.__elems_ + _Size, __y.__elems_, __y.__elem…
|
| D | set | 750 return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
1154 return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
|
| D | algorithm | 596 …lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputI…
600 lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
5559 // lexicographical_compare
5579 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5595 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5598 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,
|
| D | map | 1471 return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
2012 return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
|