|
| ranges::template (typename I, typename S, typename C=equal_to, typename P=identity)(AND sentinel_for< S |
| function template adjacent_find
|
|
I AND indirect_strict_weak_order< C, projected< I, P > > constexpr 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)(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.
|
|
projected< iterator_t< Rng >, P > constexpr borrowed_iterator_t< Rng > RANGES_FUNC() | ranges::is_heap_until (Rng &&rng, C pred=C{}, P proj=P{}) |
|
I AND indirect_strict_weak_order< C, projected< I, P > > constexpr bool RANGES_FUNC() | ranges::is_heap (I first, S last, C pred=C{}, P proj=P{}) |
|
projected< iterator_t< Rng >, P > constexpr bool RANGES_FUNC() | ranges::is_heap (Rng &&rng, C pred=C{}, P proj=P{}) |
|
I AND sortable< I, C, P > constexpr I RANGES_FUNC() | ranges::push_heap (I first, S last, C pred=C{}, P proj=P{}) |
|
P constexpr borrowed_iterator_t< Rng > RANGES_FUNC() | ranges::push_heap (Rng &&rng, C pred=C{}, P proj=P{}) |
|
I AND sortable< I, C, P > constexpr I RANGES_FUNC() | ranges::pop_heap (I first, S last, C pred=C{}, P proj=P{}) |
|
P constexpr borrowed_iterator_t< Rng > RANGES_FUNC() | ranges::pop_heap (Rng &&rng, C pred=C{}, P proj=P{}) |
|
I AND sortable< I, C, P > constexpr I RANGES_FUNC() | ranges::make_heap (I first, S last, C pred=C{}, P proj=P{}) |
|
P constexpr borrowed_iterator_t< Rng > RANGES_FUNC() | ranges::make_heap (Rng &&rng, C pred=C{}, P proj=P{}) |
|
I AND sortable< I, C, P > constexpr I RANGES_FUNC() | ranges::sort_heap (I first, S last, C pred=C{}, P proj=P{}) |
|
P constexpr borrowed_iterator_t< Rng > RANGES_FUNC() | ranges::sort_heap (Rng &&rng, C pred=C{}, P proj=P{}) |
|