| /openbsd-current/gnu/gcc/libstdc++-v3/include/backward/ |
| H A D | heap.h | 64 using std::make_heap;
|
| H A D | algo.h | 124 using std::make_heap;
|
| /openbsd-current/gnu/lib/libstdc++/libstdc++/include/backward/ |
| H A D | heap.h | 64 using std::make_heap;
|
| H A D | algo.h | 124 using std::make_heap;
|
| /openbsd-current/gnu/llvm/libcxx/include/__algorithm/ |
| H A D | make_heap.h | 43 void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { function
49 void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { function
50 std::make_heap(std::move(__first), std::move(__last),
|
| H A D | ranges_make_heap.h | 13 #include <__algorithm/make_heap.h>
72 inline constexpr auto make_heap = __make_heap::__fn{}; member in namespace:ranges::__cpo
|
| H A D | partial_sort.h | 15 #include <__algorithm/make_heap.h>
|
| H A D | partial_sort_copy.h | 15 #include <__algorithm/make_heap.h>
|
| /openbsd-current/gnu/llvm/libcxx/benchmarks/algorithms/ |
| H A D | make_heap.bench.cpp | 21 [](auto& Copy) { std::make_heap(Copy.begin(), Copy.end()); });
|
| H A D | ranges_make_heap.bench.cpp | 21 [](auto& Copy) { std::ranges::make_heap(Copy); });
|
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | 21 std::ranges::make_heap(Copy);
|
| H A D | make_heap_then_sort_heap.bench.cpp | 21 std::make_heap(Copy.begin(), Copy.end());
|
| H A D | common.h | 172 std::make_heap(V.begin(), V.end());
|
| /openbsd-current/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| H A D | split_join_fn_imps.hpp | 116 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
117 std::make_heap(other.m_a_entries, other.m_a_entries + other.m_size, static_cast<entry_cmp& >(other));
166 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
|
| H A D | constructors_destructor_fn_imps.hpp | 71 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
|
| H A D | erase_fn_imps.hpp | 158 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
|
| /openbsd-current/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/ |
| H A D | heap.cc | 56 // make_heap and sort_heap are not checked (they could be).
73 // sort array s2 using make_heap/sort_heap
78 std::make_heap(s2, s2 + N);
110 // sort array s2 using make_heap/sort_heap
115 std::make_heap(s2, s2 + N, gt);
|
| /openbsd-current/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 71 std::make_heap(this->c.begin(), this->c.end(), this->comp);
|
| /openbsd-current/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_queue.h | 353 { std::make_heap(c.begin(), c.end(), comp); }
378 std::make_heap(c.begin(), c.end(), comp);
|
| H A D | stl_heap.h | 113 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
344 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function
384 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, function
|
| H A D | stl_algo.h | 2479 std::make_heap(__first, __middle);
2499 std::make_heap(__first, __middle, __comp);
2644 std::make_heap(__result_first, __result_real_last);
2713 std::make_heap(__result_first, __result_real_last, __comp);
|
| /openbsd-current/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | stl_heap.h | 66 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
226 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function in namespace:std
251 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, function in namespace:std
|
| H A D | stl_queue.h | 335 { make_heap(c.begin(), c.end(), comp); }
358 make_heap(c.begin(), c.end(), comp);
|
| /openbsd-current/gnu/llvm/llvm/lib/Analysis/ |
| H A D | InlineOrder.cpp | 270 std::make_heap(Heap.begin(), Heap.end(), isLess);
|
| /openbsd-current/gnu/llvm/llvm/lib/Transforms/IPO/ |
| H A D | FunctionSpecialization.cpp | 308 std::make_heap(BestSpecs.begin(), BestSpecs.begin() + NSpecs, CompareGain);
|