[#absl-c_is_heap_until-04b]
= xref:absl.adoc[absl]::c&lowbar;is&lowbar;heap&lowbar;until
:relfileprefix: ../
:mrdocs:

`c&lowbar;is&lowbar;heap&lowbar;until` overloads

== Synopses

Declared in `&lt;absl&sol;algorithm&sol;container&period;h&gt;`

Container&hyphen;based version of the &lt;algorithm&gt; `std&colon;&colon;is&lowbar;heap&lowbar;until()` function to find the first element in a given container which is not in heap order&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;typename RandomAccessContainer&gt;
constexpr
&sol;&ast; implementation-defined &ast;&sol;
xref:absl/c_is_heap_until-0f.adoc[c&lowbar;is&lowbar;heap&lowbar;until](RandomAccessContainer& sequence);
----

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

Overload of `c&lowbar;is&lowbar;heap&lowbar;until()` for performing heap comparisons using a `comp` other than `operator&lt;`


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    typename RandomAccessContainer,
    typename LessThan&gt;
constexpr
&sol;&ast; implementation-defined &ast;&sol;
xref:absl/c_is_heap_until-040.adoc[c&lowbar;is&lowbar;heap&lowbar;until](
    RandomAccessContainer& sequence,
    LessThan&& comp);
----

[.small]#xref:absl/c_is_heap_until-040.adoc[_» more&period;&period;&period;_]#

== Return Value

* An iterator to the first element not in heap order, or the end iterator if the whole container is a heap&period;
* An iterator to the first element not in heap order under `comp`, or the end iterator if the whole container is a heap&period;

== Parameters

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


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