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