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

`c_is_sorted_until` overloads

== Synopses

Declared in `<absl/algorithm/container.h>`

Container‐based version of the <algorithm> `std::is_sorted_until()` function to return the first element within a container that is not sorted in ascending order as an iterator.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<typename C>
constexpr
/* implementation-defined */
xref:absl/c_is_sorted_until-09.adoc[c_is_sorted_until](C& c);
----

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

Overload of `c_is_sorted_until()` for performing a `comp` comparison other than the default `operator<`.


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

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

== Return Value

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

== Parameters

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


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