Loading...
Searching...
No Matches
heap_algorithm.hpp File Reference

## Functions

template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && indirect_strict_weak_order<C, projected<I, P>>
constexpr bool | ranges::is_heap (I first, S last, C pred=C{}, P proj=P{})
| function template `is_heap`
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng> && indirect_strict_weak_order<C, projected<iterator_t<Rng>, P>>
constexpr bool | ranges::is_heap (Rng &&rng, C pred=C{}, P proj=P{})
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && indirect_strict_weak_order<C, projected<I, P>>
constexpr I | ranges::is_heap_until (I first, S last, C pred=C{}, P proj=P{})
| function template `is_heap_until`
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng> && indirect_strict_weak_order<C, projected<iterator_t<Rng>, P>>
constexpr borrowed_iterator_t< Rng > | ranges::is_heap_until (Rng &&rng, C pred=C{}, P proj=P{})
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P>
constexpr I | ranges::make_heap (I first, S last, C pred=C{}, P proj=P{})
| function template `make_heap`
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P>
constexpr borrowed_iterator_t< Rng > | ranges::make_heap (Rng &&rng, C pred=C{}, P proj=P{})
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P>
constexpr I | ranges::pop_heap (I first, S last, C pred=C{}, P proj=P{})
| function template `pop_heap`
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P>
constexpr borrowed_iterator_t< Rng > | ranges::pop_heap (Rng &&rng, C pred=C{}, P proj=P{})
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P>
constexpr I | ranges::push_heap (I first, S last, C pred=C{}, P proj=P{})
| function template `push_heap`
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P>
constexpr borrowed_iterator_t< Rng > | ranges::push_heap (Rng &&rng, C pred=C{}, P proj=P{})
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename I , typename S , typename C = less, typename P = identity> requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P>
constexpr I | ranges::sort_heap (I first, S last, C pred=C{}, P proj=P{})
template<typename Rng , typename C = less, typename P = identity> requires random_access_range<Rng &> && sortable<iterator_t<Rng>, C, P>
constexpr borrowed_iterator_t< Rng > | ranges::sort_heap (Rng &&rng, C pred=C{}, P proj=P{})