heap_algorithm.hpp File Reference

## Functions

template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::is_heap (I first, S last, C pred=C{}, P proj=P{}) -> bool requires random_access_iterator< I > &&sentinel_for< S, I > &&indirect_strict_weak_order< C, projected< I, P >>
| function template `is_heap`
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::is_heap (Rng &&rng, C pred=C{}, P proj=P{}) -> bool requires random_access_range< Rng > &&indirect_strict_weak_order< C, projected< iterator_t< Rng >, P >>
template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::is_heap_until (I first, S last, C pred=C{}, P proj=P{}) -> I requires random_access_iterator< I > &&sentinel_for< S, I > &&indirect_strict_weak_order< C, projected< I, P >>
| function template `is_heap_until`
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::is_heap_until (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires random_access_range< Rng > &&indirect_strict_weak_order< C, projected< iterator_t< Rng >, P >>
template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::make_heap (I first, S last, C pred=C{}, P proj=P{}) -> I requires random_access_iterator< I > &&sentinel_for< S, I > &&sortable< I, C, P >
| function template `make_heap`
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::make_heap (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires random_access_range< Rng > &&sortable< iterator_t< Rng >, C, P >
template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::pop_heap (I first, S last, C pred=C{}, P proj=P{}) -> I requires random_access_iterator< I > &&sentinel_for< S, I > &&sortable< I, C, P >
| function template `pop_heap`
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::pop_heap (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires random_access_range< Rng > &&sortable< iterator_t< Rng >, C, P >
template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::push_heap (I first, S last, C pred=C{}, P proj=P{}) -> I requires random_access_iterator< I > &&sentinel_for< S, I > &&sortable< I, C, P >
| function template `push_heap`
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::push_heap (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires random_access_range< Rng > &&sortable< iterator_t< Rng >, C, P >
template<typename I , typename S , typename C = less, typename P = identity>
auto | ranges::sort_heap (I first, S last, C pred=C{}, P proj=P{}) -> I requires random_access_iterator< I > &&sentinel_for< S, I > &&sortable< I, C, P >
template<typename Rng , typename C = less, typename P = identity>
auto | ranges::sort_heap (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires random_access_range< Rng &> &&sortable< iterator_t< Rng >, C, P >