| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 78 std::same_as<Iter> decltype(auto) last = std::ranges::sort_heap(b, e); in test_one()
88 std::same_as<Iter> decltype(auto) last = std::ranges::sort_heap(range); in test_one()
132 auto last = std::ranges::sort_heap(in.begin(), in.end(), comp); in test()
139 auto last = std::ranges::sort_heap(in, comp); in test()
155 auto last = std::ranges::sort_heap(in.begin(), in.end(), {}, &A::a); in test()
161 auto last = std::ranges::sort_heap(in, {}, &A::a); in test()
181 auto last = std::ranges::sort_heap(in.begin(), in.end(), &A::comparator, &A::projection); in test()
187 auto last = std::ranges::sort_heap(in, &A::comparator, &A::projection); in test()
197 …auto last = std::ranges::sort_heap(in.begin(), in.end(), [](int i, int j) { return BooleanTestable… in test()
203 auto last = std::ranges::sort_heap(in, [](int i, int j) { return BooleanTestable{i < j}; }); 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()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | sort_heap.h | 40 void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in sort_heap() function
49 void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { in sort_heap() function
50 std::sort_heap(std::move(__first), std::move(__last), in sort_heap()
|
| H A D | ranges_sort_heap.h | 72 inline constexpr auto sort_heap = __sort_heap::__fn{};
|
| /llvm-project-15.0.7/libcxx/benchmarks/algorithms/ |
| H A D | ranges_sort_heap.bench.cpp | 21 [](auto& Copy) { std::ranges::sort_heap(Copy); }); in run()
|
| H A D | sort_heap.bench.cpp | 21 [](auto& Copy) { std::sort_heap(Copy.begin(), Copy.end()); }); in run()
|
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | 22 std::ranges::sort_heap(Copy); in run()
|
| H A D | make_heap_then_sort_heap.bench.cpp | 22 std::sort_heap(Copy.begin(), Copy.end()); in run()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | complexity.pass.cpp | 65 std::sort_heap(v.begin(), v.end()); in main()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 208 (void) std::sort_heap(it, it); in test()
209 (void) std::sort_heap(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 212 (void)std::ranges::sort_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
213 (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 | 203 (void)std::ranges::sort_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
204 (void)std::ranges::sort_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 196 (void)std::sort_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/ |
| H A D | Quality.h | 216 std::sort_heap(Heap.begin(), Heap.end(), Greater); in items()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 200 (void)std::sort_heap(first, last); in all_the_algorithms()
201 (void)std::sort_heap(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 235 (void)std::sort_heap(first, last); in all_the_algorithms()
236 (void)std::sort_heap(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 141 test(std::ranges::sort_heap, in, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 170 test(std::ranges::sort_heap, in); in run_tests()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 203 dangling_1st(std::ranges::sort_heap, in); in test_all()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 170 test(std::ranges::sort_heap, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/benchmarks/ |
| H A D | CMakeLists.txt | 175 algorithms/sort_heap.bench.cpp
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 141 static_assert(test(std::ranges::sort_heap, a));
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 84 Permutation,sort_heap,Konstantin Varlamov,`D128115 <https://llvm.org/D128115>`_,✅
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 327 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
332 …ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++…
1578 sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1582 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1892 #include <__algorithm/sort_heap.h>
|