[#absl-c_is_heap_until-04b]
= xref:absl.adoc[absl]::c_is_heap_until
:relfileprefix: ../
:mrdocs:

`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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<typename RandomAccessContainer>
constexpr
/* implementation-defined */
xref:absl/c_is_heap_until-0f.adoc[c_is_heap_until](RandomAccessContainer& sequence);
----

[.small]#xref:absl/c_is_heap_until-0f.adoc[_» more..._]#

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename RandomAccessContainer,
    typename LessThan>
constexpr
/* implementation-defined */
xref:absl/c_is_heap_until-040.adoc[c_is_heap_until](
    RandomAccessContainer& sequence,
    LessThan&& comp);
----

[.small]#xref:absl/c_is_heap_until-040.adoc[_» 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

[cols="1,4"]
|===
| Name| Description
| *sequence*
| The container to inspect.
| *comp*
| The comparison used to order the heap.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#