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

`c&lowbar;is&lowbar;sorted&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;sorted&lowbar;until()` function to return the first element within a container that is not sorted in ascending order as an iterator&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;typename C&gt;
constexpr
&sol;&ast; implementation-defined &ast;&sol;
xref:absl/c_is_sorted_until-09.adoc[c&lowbar;is&lowbar;sorted&lowbar;until](C& c);
----

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

Overload of `c&lowbar;is&lowbar;sorted&lowbar;until()` for performing a `comp` comparison other than the default `operator&lt;`&period;


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

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

== Return Value

* An iterator to the first element that breaks ascending order, or the end iterator if the container is fully sorted&period;
* An iterator to the first element that breaks the order under `comp`, or the end iterator if the container is fully sorted&period;

== Parameters

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


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