| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | ranges_partial_sort.pass.cpp | 42 std::ranges::partial_sort(first, mid, last, comp);
55 std::ranges::partial_sort(range, mid, comp);
74 std::same_as<Iter> decltype(auto) last = std::ranges::partial_sort(begin, mid, end); in test_one()
87 std::same_as<Iter> decltype(auto) last = std::ranges::partial_sort(range, mid); in test_one()
156 auto last = std::ranges::partial_sort(b, m, in.end(), std::ranges::greater{}); in test()
166 auto last = std::ranges::partial_sort(in, m, std::ranges::greater{}); in test()
185 auto last = std::ranges::partial_sort(b, m, in.end(), {}, &A::a); in test()
197 auto last = std::ranges::partial_sort(in, m, {}, &A::a); in test()
|
| H A D | partial_sort.pass.cpp | 30 std::partial_sort(Iter(work), Iter(work+m), Iter(work+n)); in test()
43 std::partial_sort(Iter(input), Iter(input + 3), Iter(input + 5)); in test()
55 std::partial_sort(&i, &i, &i); // no-op in main()
|
| H A D | partial_sort_comp.pass.cpp | 32 std::partial_sort(Iter(work), Iter(work+m), Iter(work+n), std::greater<T>()); in test()
45 std::partial_sort(Iter(input), Iter(input + 3), Iter(input + 5), std::greater<T>()); in test()
57 std::partial_sort(&i, &i, &i, std::greater<int>()); // no-op in main()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | partial_sort_stability.pass.cpp | 50 std::partial_sort(v.begin(), v.begin() + kSize / 2, v.end()); in test_randomization()
69 std::partial_sort(v.begin(), v.begin() + kSize / 2, v.end()); in test_same()
70 std::partial_sort(snapshot_v.begin(), snapshot_v.begin() + kSize / 2, snapshot_v.end()); in test_same()
71 …std::partial_sort(snapshot_custom_v.begin(), snapshot_custom_v.begin() + kSize / 2, snapshot_custo… in test_same()
90 std::partial_sort(v.begin(), v.begin() + 5, v.end()); in test_constexpr()
|
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 164 (void) std::partial_sort(it, it, it); in test()
165 (void) std::partial_sort(it, it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 174 (void)std::ranges::partial_sort(first, mid, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
175 (void)std::ranges::partial_sort(a, mid, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 157 (void)std::ranges::partial_sort(first, mid, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
158 (void)std::ranges::partial_sort(a, mid, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 174 (void)std::partial_sort(first, mid, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | partial_sort.h | 77 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort() function
89 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator _… in partial_sort() function
91 _VSTD::partial_sort(__first, __middle, __last, in partial_sort()
|
| H A D | ranges_partial_sort.h | 69 inline constexpr auto partial_sort = __partial_sort::__fn{};
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/ |
| H A D | partial_sort.pass.cpp | 75 std::partial_sort(exp_first, m2, exp_last, compare); in operator ()()
77 std::partial_sort(exec, first, m1, last, compare); in operator ()()
129 partial_sort(exec, iter, iter, iter, non_const(std::less<T>())); in operator ()()
|
| /llvm-project-15.0.7/pstl/ |
| H A D | README.md | 24 …`partial_sort`, `partial_sort_copy`, `set_difference`, `set_intersection`, `set_symmetric_differen…
29 * For `max_element`, `min_element`, `minmax_element`, `partial_sort`, `partial_sort_copy`, `sort`, …
33 …`partial_sort`, `partial_sort_copy`, `partition_copy`, `remove`, `remove_if`, `rotate`, `sort`, `s…
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | ptr-sort.cpp | 16 std::partial_sort(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting()
26 …std::partial_sort(V2.begin(), V2.begin() + 1, V2.end()); // expected-warning {{Sorting pointer-lik… in PointerSorting()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/ |
| H A D | partial_sort.pass.cpp | 25 std::partial_sort(working.begin(), sort_iter, working.end()); in LLVMFuzzerTestOneInput()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 192 (void)std::partial_sort(first, mid, last); in all_the_algorithms()
193 (void)std::partial_sort(first, mid, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 134 test_mid(std::ranges::partial_sort, in, mid, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 163 test_mid(std::ranges::partial_sort, in, mid); in run_tests()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 196 dangling_1st(std::ranges::partial_sort, in, mid); in test_all()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 163 test_mid(std::ranges::partial_sort, in, mid, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/docs/DesignDocs/ |
| H A D | UnspecifiedBehaviorRandomization.rst | 81 * ``std::partial_sort``, there is no guarantee on the order of equal elements and
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 112 static_assert(test(std::ranges::partial_sort, a, a+5));
|
| /llvm-project-15.0.7/pstl/include/pstl/internal/ |
| H A D | glue_algorithm_defs.h | 363 partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __midd…
368 partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __midd…
|
| H A D | glue_algorithm_impl.h | 738 partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __midd… in partial_sort() function
749 partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __midd… in partial_sort() function
753 std::partial_sort(__exec, __first, __middle, __last, std::less<_InputType>()); in partial_sort()
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 79 Permutation,partial_sort,Konstantin Varlamov,`D128744 <https://llvm.org/D128744>`_,✅
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 384 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
389 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
1430 … partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1434 …partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, C…
1775 #include <__algorithm/partial_sort.h>
|