Home
last modified time | relevance | path

Searched refs:make_heap (Results 1 – 25 of 52) sorted by relevance

123

/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A Dranges_make_heap.pass.cpp17 // ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
22 // ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
40 concept HasMakeHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, comp); };
51 concept HasMakeHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
75 std::same_as<Iter> decltype(auto) last = std::ranges::make_heap(b, e); in test_one()
85 std::same_as<Iter> decltype(auto) last = std::ranges::make_heap(range); in test_one()
134 auto last = std::ranges::make_heap(in.begin(), in.end(), std::ranges::greater{}); in test()
141 auto last = std::ranges::make_heap(in, std::ranges::greater{}); in test()
157 auto last = std::ranges::make_heap(in.begin(), in.end(), {}, &A::a); in test()
163 auto last = std::ranges::make_heap(i in test()
[all...]
H A Dmake_heap.pass.cpp29 std::make_heap(Iter(work), Iter(work+n)); in test()
37 std::make_heap(Iter(input), Iter(input + 5)); in test()
H A Dmake_heap_comp.pass.cpp30 std::make_heap(Iter(work), Iter(work+n), std::greater<T>()); in test()
38 std::make_heap(Iter(input), Iter(input + 5), std::greater<T>()); in test()
/llvm-project/libcxx/test/libcxx/algorithms/alg.sorting/assert.sort.invalid_comparator/
H A Dassert.sort.invalid_comparator.pass.cpp64 … TEST_LIBCPP_ASSERT_FAILURE(std::make_heap(copy.begin(), copy.end(), fixture.checked_predicate()), in check_oob_sort_read()
97 …std::ranges::make_heap(copy, fixture.checked_predicate()), "Comparator does not induce a strict we… in check_oob_sort_read()
154 std::make_heap(floats.begin(), floats.end()); in check_nan_floats()
162 std::ranges::make_heap(floats, std::less()); in check_nan_floats()
173 std::make_heap(v.begin(), v.end(), std::greater_equal<int>()); in check_irreflexive()
180 std::ranges::make_heap(v, std::greater_equal<int>()); in check_irreflexive()
/llvm-project/libcxx/include/__algorithm/
H A Dmake_heap.h46 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in make_heap() function
52 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { in make_heap() function
53 std::make_heap(std::move(__first), std::move(__last), __less<>()); in make_heap()
H A Dranges_make_heap.h13 #include <__algorithm/make_heap.h>
71 inline constexpr auto make_heap = __make_heap{};
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.heap.operations/
H A Dis_heap.pass.cpp107 std::make_heap(in.begin(), in.begin() + n / 4, comp); in test_is_heap_by_type()
110 std::make_heap(in.begin(), in.begin() + n / 3, comp); in test_is_heap_by_type()
113 std::make_heap(in.begin(), in.end(), comp); in test_is_heap_by_type()
/llvm-project/libcxx/include/
H A Dqueue260 # include <__algorithm/make_heap.h>
579 std::make_heap(c.begin(), c.end(), comp);
642 std::make_heap(c.begin(), c.end(), comp);
650 std::make_heap(c.begin(), c.end(), comp);
672 std::make_heap(c.begin(), c.end(), comp);
768 std::make_heap(c.begin(), c.end(), comp);
776 std::make_heap(c.begin(), c.end(), comp);
786 std::make_heap(c.begin(), c.end(), comp);
795 std::make_heap(c.begin(), c.end(), comp);
806 std::make_heap(
[all...]
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
H A Dranges_sort_heap.pass.cpp42 concept HasSortHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, comp); };
53 concept HasSortHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
245 std::make_heap(first, last, &MyInt::Comp); in test_complexity()
H A Dsort_heap.pass.cpp32 std::make_heap(work, work+n); in test()
H A Dsort_heap_comp.pass.cpp32 std::make_heap(work, work+n, std::greater<T>()); in test()
H A Dcomplexity.pass.cpp67 std::make_heap(first, last); in main()
/llvm-project/clang-tools-extra/clangd/index/
H A DBackgroundQueue.cpp111 std::make_heap(Queue.begin(), Queue.end()); in append()
132 std::make_heap(Queue.begin(), Queue.end()); in boost()
/llvm-project/libcxx/test/libcxx/fuzzing/
H A Dmake_heap.pass.cpp20 std::make_heap(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
H A Dpop_heap.pass.cpp22 std::make_heap(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
H A Dpush_heap.pass.cpp25 std::make_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
/llvm-project/libcxx/benchmarks/algorithms/
H A Dranges_make_heap.bench.cpp
H A Dmake_heap.bench.cpp
H A Dranges_make_heap_then_sort_heap.bench.cpp
H A Dmake_heap_then_sort_heap.bench.cpp
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/
H A Dranges_push_heap.pass.cpp40 concept HasPushHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, comp); };
51 concept HasPushHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dranges_pop_heap.pass.cpp40 concept HasPopHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, comp); };
51 concept HasPopHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
/llvm-project/libcxx/test/libcxx/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A Dcomplexity.pass.cpp14 // void make_heap(Iter first, Iter last);
65 std::make_heap(v.begin(), v.end()); in main()
/llvm-project/llvm/include/llvm/ADT/
H A DPriorityQueue.h71 std::make_heap(this->c.begin(), this->c.end(), this->comp); in reheapify()
/llvm-project/libcxx/test/libcxx/algorithms/
H A Drobust_against_cpp20_hostile_iterators.compile.pass.cpp148 (void) std::make_heap(it, it); in test()
149 (void) std::make_heap(it, it, pred); in test()

123