HomeSort by relevance Sort by last modified time
    Searched refs:lexicographical_compare (Results 1 - 25 of 102) sorted by null

1 2 3 4 5

  /ndk/sources/cxx-stl/llvm-libc++/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));
  /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>());
  /ndk/sources/cxx-stl/llvm-libc++/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/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
algobase.h 50 // NB: equal and lexicographical_compare require mismatch.
162 lexicographical_compare(InputIterator1 begin1, InputIterator1 end1, function in namespace:std::__parallel
165 { return _GLIBCXX_STD_P::lexicographical_compare(begin1, end1,
172 lexicographical_compare(InputIterator1 begin1, InputIterator1 end1, function in namespace:std::__parallel
175 { return _GLIBCXX_STD_P::lexicographical_compare(begin1, end1,
185 { return _GLIBCXX_STD_P::lexicographical_compare(begin1, end1,
188 // Parallel lexicographical_compare for random access iterators
236 return _GLIBCXX_STD_P::lexicographical_compare(begin1, end1,
243 lexicographical_compare(InputIterator1 begin1, InputIterator1 end1, function in namespace:std::__parallel
264 lexicographical_compare(InputIterator1 begin1, InputIterator1 end1 function in namespace:std::__parallel
    [all...]
  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 43 return std::lexicographical_compare(A.rbegin(), A.rend(),
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.difference/
set_difference.pass.cpp 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
set_difference_comp.pass.cpp 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.intersection/
set_intersection.pass.cpp 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_intersection_comp.pass.cpp 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
set_symmetric_difference.pass.cpp 41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_symmetric_difference_comp.pass.cpp 44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.union/
set_union.pass.cpp 40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
set_union_comp.pass.cpp 42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);

Completed in 328 milliseconds

1 2 3 4 5