/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
H A D | ranges_partial_sort_copy.pass.cpp | 50 std::ranges::partial_sort_copy(std::forward<Iter1>(first1), std::forward<Sent1>(last1), 96 std::ranges::partial_sort_copy(std::forward<Range1>(range1), std::forward<Range2>(range2), 142 std::same_as<ResultT> decltype(auto) result = std::ranges::partial_sort_copy( in test_one() 159 … std::same_as<ResultT> decltype(auto) result = std::ranges::partial_sort_copy(in_range, out_range); in test_one() 247 … auto result = std::ranges::partial_sort_copy(in.begin(), in.end(), out.begin(), out.end(), comp); in test() 254 auto result = std::ranges::partial_sort_copy(in, out, comp); in test() 278 … auto result = std::ranges::partial_sort_copy(in.begin(), in.end(), out.begin(), out.end(), {}); in test() 281 …result = std::ranges::partial_sort_copy(in.begin(), in.end(), out.begin(), out.end(), {}, proj1, p… in test() 288 auto result = std::ranges::partial_sort_copy(in, out, {}); in test() 290 result = std::ranges::partial_sort_copy(in, out, {}, proj1, proj2); in test()
|
H A D | partial_sort_copy.pass.cpp | 33 … OutIter it = std::partial_sort_copy(Iter(orig), Iter(orig+n), OutIter(work), OutIter(work+m)); in test() 55 std::partial_sort_copy(Iter(input), Iter(input + 5), OutIter(output), OutIter(output + 3)); in test() 67 std::partial_sort_copy(&i, &i, &j, &j); // no-op in main()
|
H A D | partial_sort_copy_comp.pass.cpp | 36 …OutIter it = std::partial_sort_copy(Iter(orig), Iter(orig+n), OutIter(work), OutIter(work+m), std:… in test() 58 …std::partial_sort_copy(Iter(input), Iter(input + 5), OutIter(output), OutIter(output + 3), std::gr… in test() 70 std::partial_sort_copy(&i, &i, &j, &j, std::greater<int>()); // no-op in main()
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort_copy.pass.cpp | 95 … RandomAccessIterator exp = std::partial_sort_copy(first, last, exp_first, exp_last, compare); in operator ()() 96 … RandomAccessIterator res = std::partial_sort_copy(exec, first, last, d_first, d_last, compare); in operator ()() 107 RandomAccessIterator exp = std::partial_sort_copy(first, last, exp_first, exp_last); in operator ()() 108 RandomAccessIterator res = std::partial_sort_copy(exec, first, last, d_first, d_last); in operator ()() 176 … partial_sort_copy(exec, input_iter, input_iter, out_iter, out_iter, non_const(std::less<T>())); in operator ()()
|
/llvm-project/libcxx/include/__algorithm/ |
H A D | partial_sort_copy.h | 73 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator partial_sort_copy( in partial_sort_copy() function 94 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator partial_sort_copy( in partial_sort_copy() function 99 return std::partial_sort_copy(__first, __last, __result_first, __result_last, __less<>()); in partial_sort_copy()
|
H A D | ranges_partial_sort_copy.h | 15 #include <__algorithm/partial_sort_copy.h> 100 inline constexpr auto partial_sort_copy = __partial_sort_copy{};
|
/llvm-project/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/libcxx/test/libcxx/algorithms/alg.sorting/assert.sort.invalid_comparator/ |
H A D | assert.sort.invalid_comparator.pass.cpp | 78 …std::partial_sort_copy(copy.begin(), copy.end(), results.begin(), results.end(), fixture.checked_p… in check_oob_sort_read() 109 …TEST_LIBCPP_ASSERT_FAILURE(std::ranges::partial_sort_copy(copy, results, fixture.checked_predicate… in check_oob_sort_read()
|
/llvm-project/libcxx/test/libcxx/fuzzing/ |
H A D | partial_sort_copy.pass.cpp | 24 (void)std::partial_sort_copy(data + 1, data + size, results.begin(), results.end()); in LLVMFuzzerTestOneInput()
|
/llvm-project/libcxx/test/std/algorithms/ |
H A D | ranges_robust_against_dangling.pass.cpp | 173 dangling_1st<partial_sort_copy_result<dangling, InIter>>(std::ranges::partial_sort_copy, in, in2); in test_all() 174 dangling_2nd<partial_sort_copy_result<InIter, dangling>>(std::ranges::partial_sort_copy, in, in2); in test_all() 175 dangling_both<partial_sort_copy_result<dangling, dangling>>(std::ranges::partial_sort_copy, in, in2); in test_all()
|
H A D | robust_against_adl.compile.pass.cpp | 162 (void)std::partial_sort_copy(first, last, first2, mid2); in all_the_algorithms() 163 (void)std::partial_sort_copy(first, last, first2, mid2, std::less<void*>()); in all_the_algorithms()
|
H A D | ranges_robust_against_differing_projections.pass.cpp | 70 test(std::ranges::partial_sort_copy, in, in2, less, proj1, proj2); in test_all()
|
H A D | robust_re_difference_type.compile.pass.cpp | 200 (void)std::partial_sort_copy(first, last, first2, mid2); in all_the_algorithms() 201 (void)std::partial_sort_copy(first, last, first2, mid2, std::less<void*>()); in all_the_algorithms()
|
H A D | ranges_robust_against_proxy_iterators.pass.cpp | 151 test(std::ranges::partial_sort_copy, in, in2); in run_tests()
|
H A D | ranges_robust_against_omitting_invoke.pass.cpp | 151 test(std::ranges::partial_sort_copy, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
|
H A D | ranges_robust_against_nonbool.compile.pass.cpp | 210 in_in_pred(std::ranges::partial_sort_copy, pred2); in f()
|
/llvm-project/libcxx/test/libcxx/algorithms/ |
H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 167 (void) std::partial_sort_copy(it, it, it, it); in test() 168 (void) std::partial_sort_copy(it, it, it, it, pred); in test()
|
H A D | ranges_robust_against_copying_comparators.pass.cpp | 188 (void)std::ranges::partial_sort_copy(first, last, first2, mid2, Less(&copies)); assert(copies == 0); in all_the_algorithms() 189 (void)std::ranges::partial_sort_copy(a, b, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
H A D | ranges_robust_against_copying_projections.pass.cpp | 185 (void)std::ranges::partial_sort_copy(first, last, first2, mid2, Less(), Proj(&copies), Proj(&copies)); assert(copies == 0); in all_the_algorithms() 186 (void)std::ranges::partial_sort_copy(a, b, Less(), Proj(&copies), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
H A D | robust_against_copying_comparators.pass.cpp | 177 (void)std::partial_sort_copy(first, last, first2, mid2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
/llvm-project/clang-tools-extra/docs/clang-tidy/checks/modernize/ |
H A D | use-ranges.rst | 69 ``std::partial_sort_copy``,
|
/llvm-project/clang-tools-extra/docs/clang-tidy/checks/boost/ |
H A D | use-ranges.rst | 68 ``std::partial_sort_copy``,
|
/llvm-project/libcxx/modules/std/ |
H A D | algorithm.inc | 386 using std::partial_sort_copy; 389 using std::ranges::partial_sort_copy;
|
/llvm-project/libcxx/test/std/library/description/conventions/customization.point.object/ |
H A D | niebloid.compile.pass.cpp | 128 static_assert(test(std::ranges::partial_sort_copy, a, a));
|
/llvm-project/pstl/include/pstl/internal/ |
H A D | glue_algorithm_defs.h | 375 partial_sort_copy(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, 380 partial_sort_copy(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last,
|