c_is_heap_until overloads

Synopses

Declared in <absl/algorithm/container.h>

Container‐based version of the <algorithm> std::is_heap_until() function to find the first element in a given container which is not in heap order.

template<typename RandomAccessContainer>
constexpr
/* implementation-defined */
c_is_heap_until(RandomAccessContainer& sequence);

» more...

Overload of c_is_heap_until() for performing heap comparisons using a comp other than operator<

template<
    typename RandomAccessContainer,
    typename LessThan>
constexpr
/* implementation-defined */
c_is_heap_until(
    RandomAccessContainer& sequence,
    LessThan&& comp);

» more...

Return Value

  • An iterator to the first element not in heap order, or the end iterator if the whole container is a heap.

  • An iterator to the first element not in heap order under comp, or the end iterator if the whole container is a heap.

Parameters

Name

Description

sequence

The container to inspect.

comp

The comparison used to order the heap.

Created with MrDocs