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.
Synopsis
Declared in <absl/algorithm/container.h>
template<typename RandomAccessContainer>
constexpr
/* implementation-defined */
c_is_heap_until(RandomAccessContainer& sequence);Return Value
An iterator to the first element not in heap order, or the end iterator if the whole container is a heap.
Parameters
Name |
Description |
sequence |
The container to inspect. |
Created with MrDocs