| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 17 // ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
22 // ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
79 std::same_as<Iter> decltype(auto) last = std::ranges::sort_heap(b, e); in test_one()
89 std::same_as<Iter> decltype(auto) last = std::ranges::sort_heap(range); in test_one()
133 auto last = std::ranges::sort_heap(in.begin(), in.end(), comp); in test()
140 auto last = std::ranges::sort_heap(in, comp); in test()
156 auto last = std::ranges::sort_heap(in.begin(), in.end(), {}, &A::a); in test()
162 auto last = std::ranges::sort_heap(in, {}, &A::a); in test()
182 auto last = std::ranges::sort_heap(in.begin(), in.end(), &A::comparator, &A::projection); in test()
188 auto last = std::ranges::sort_heap(i in test()
[all...] |
| H A D | sort_heap.pass.cpp | 33 std::sort_heap(Iter(work), Iter(work+n)); in test()
42 std::sort_heap(Iter(input), Iter(input + 5)); in test()
|
| H A D | sort_heap_comp.pass.cpp | 33 std::sort_heap(Iter(work), Iter(work+n), std::greater<T>()); in test()
42 std::sort_heap(Iter(input), Iter(input + 5), std::greater<T>()); in test()
|
| H A D | complexity.pass.cpp | 14 // void sort_heap(Iter first, Iter last);
70 std::sort_heap(first, last); in main()
|
| /llvm-project/libcxx/test/libcxx/algorithms/alg.sorting/assert.sort.invalid_comparator/ |
| H A D | assert.sort.invalid_comparator.pass.cpp | 66 … TEST_LIBCPP_ASSERT_FAILURE(std::sort_heap(copy.begin(), copy.end(), fixture.checked_predicate()), in check_oob_sort_read()
99 …std::ranges::sort_heap(copy, fixture.checked_predicate()), "Comparator does not induce a strict we… in check_oob_sort_read()
156 …std::sort_heap(floats.begin(), floats.end()), "Your comparator is not a valid strict-weak ordering… in check_nan_floats()
164 …std::ranges::sort_heap(floats, std::less()), "Your comparator is not a valid strict-weak ordering"… in check_nan_floats()
174 TEST_LIBCPP_ASSERT_FAILURE(std::sort_heap(v.begin(), v.end(), std::greater_equal<int>()), in check_irreflexive()
182 …std::ranges::sort_heap(v, std::greater_equal<int>()), "Comparator does not induce a strict weak or… in check_irreflexive()
|
| /llvm-project/libcxx/include/__algorithm/ |
| H A D | sort_heap.h | 46 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in sort_heap() function
55 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { in sort_heap() function
56 std::sort_heap(std::move(__first), std::move(__last), __less<>()); in sort_heap()
|
| H A D | ranges_sort_heap.h | 14 #include <__algorithm/sort_heap.h>
71 inline constexpr auto sort_heap = __sort_heap{};
|
| /llvm-project/libcxx/benchmarks/algorithms/ |
| H A D | ranges_sort_heap.bench.cpp | |
| H A D | sort_heap.bench.cpp | |
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | |
| H A D | make_heap_then_sort_heap.bench.cpp | |
| /llvm-project/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 213 (void) std::sort_heap(it, it); in test()
214 (void) std::sort_heap(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 224 (void)std::ranges::sort_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
225 (void)std::ranges::sort_heap(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 229 (void)std::ranges::sort_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
230 (void)std::ranges::sort_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 203 (void)std::sort_heap(first, last); in all_the_algorithms()
204 (void)std::sort_heap(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 241 (void)std::sort_heap(first, last); in all_the_algorithms()
242 (void)std::sort_heap(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 182 test(std::ranges::sort_heap, in); in run_tests()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 179 test(std::ranges::sort_heap, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 213 dangling_1st(std::ranges::sort_heap, in); in test_all()
|
| /llvm-project/clang-tools-extra/clangd/ |
| H A D | Quality.h | 217 std::sort_heap(Heap.begin(), Heap.end(), Greater); in items()
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/modernize/ |
| H A D | use-ranges.rst | 93 ``std::sort_heap``,
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/boost/ |
| H A D | use-ranges.rst | 92 ``std::sort_heap``,
|
| /llvm-project/libcxx/modules/std/ |
| H A D | algorithm.inc | 530 using std::sort_heap;
533 using std::ranges::sort_heap;
|
| /llvm-project/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 156 static_assert(test(std::ranges::sort_heap, a));
|
| /llvm-project/libcxx/benchmarks/ |
| H A D | CMakeLists.txt | |