| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| H A D | is_sorted_until.pass.cpp | 38 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
50 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
55 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
60 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
66 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
76 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); in test()
86 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
91 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
[all …]
|
| H A D | is_sorted_until_comp.pass.cpp | 39 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); in test()
40 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
56 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
61 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
67 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
72 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); in test()
77 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
82 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
[all …]
|
| H A D | ranges.is_sorted_until.pass.cpp | 65 std::same_as<Iter> auto ret = std::ranges::is_sorted_until(range); in test_iterators()
73 auto ret = std::ranges::is_sorted_until(Iter(a), Sent(Iter(a + 5))); in test_iterators()
79 auto ret = std::ranges::is_sorted_until(range); in test_iterators()
87 auto ret = std::ranges::is_sorted_until(Iter(a), Sent(Iter(a + 5))); in test_iterators()
93 auto ret = std::ranges::is_sorted_until(range); in test_iterators()
115 auto ret = std::ranges::is_sorted_until(Iter(a), Sent(Iter(a))); in test_iterators()
121 auto ret = std::ranges::is_sorted_until(range); in test_iterators()
135 auto ret = std::ranges::is_sorted_until(range); in test_iterators()
157 auto ret = std::ranges::is_sorted_until(a, a + 3, {}, &S::i); in test()
162 auto ret = std::ranges::is_sorted_until(a, {}, &S::i); in test()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/ |
| H A D | is_sorted.pass.cpp | 33 auto iexam = is_sorted_until(first, last); in operator ()()
34 auto ires = is_sorted_until(exec, first, last); in operator ()()
40 iexam = is_sorted_until(first, last, std::less<T>()); in operator ()()
41 ires = is_sorted_until(exec, first, last, std::less<T>()); in operator ()()
83 is_sorted_until(exec, iter, iter, std::less<T>()); in operator ()()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | is_sorted_until.h | 42 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in is_sorted_until() function
50 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) in is_sorted_until() function
52 …return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::… in is_sorted_until()
|
| H A D | ranges_is_sorted_until.h | 68 inline constexpr auto is_sorted_until = __is_sorted_until::__fn{};
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 135 (void) std::is_sorted_until(it, it); in test()
136 (void) std::is_sorted_until(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 139 (void)std::ranges::is_sorted_until(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
140 (void)std::ranges::is_sorted_until(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 122 (void)std::ranges::is_sorted_until(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::ranges::is_sorted_until(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 141 (void)std::is_sorted_until(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 104 (void)std::is_sorted_until(first, last); in all_the_algorithms()
105 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 141 (void)std::is_sorted_until(first, last); in all_the_algorithms()
142 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 108 test(std::ranges::is_sorted_until, in, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 102 test(std::ranges::is_sorted_until, in); in run_tests()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 131 dangling_1st(std::ranges::is_sorted_until, in); in test_all()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 115 test(std::ranges::is_sorted_until, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/ |
| H A D | nodiscard_extensions.pass.cpp | 92 std::is_sorted_until(std::begin(arr), std::end(arr)); in test_algorithms()
93 std::is_sorted_until(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
|
| H A D | nodiscard_extensions.verify.cpp | 159 std::is_sorted_until(std::begin(arr), std::end(arr)); in test_algorithms()
162 std::is_sorted_until(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 95 static_assert(test(std::ranges::is_sorted_until, a));
|
| /llvm-project-15.0.7/pstl/include/pstl/internal/ |
| H A D | glue_algorithm_defs.h | 386 is_sorted_until(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Comp…
390 is_sorted_until(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last);
|
| H A D | glue_algorithm_impl.h | 781 is_sorted_until(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Comp… in is_sorted_until() function
793 is_sorted_until(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last) in is_sorted_until() function
796 …return is_sorted_until(std::forward<_ExecutionPolicy>(__exec), __first, __last, std::less<_InputTy… in is_sorted_until()
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 31 Read-only,is_sorted_until,Nikolas Klauser,`D125608 <https://llvm.org/D125608>`_,✅
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 478 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
483 …ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
1406 is_sorted_until(ForwardIterator first, ForwardIterator last);
1410 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1756 #include <__algorithm/is_sorted_until.h>
|
| H A D | CMakeLists.txt | 42 __algorithm/is_sorted_until.h
|
| /llvm-project-15.0.7/libcxx/docs/ |
| H A D | UsingLibcxx.rst | 399 * ``is_sorted_until``
|