[#absl-c_lower_bound-03]
= xref:absl.adoc[absl]::c_lower_bound
:relfileprefix: ../
:mrdocs:

`c_lower_bound` overloads

== Synopses

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

Container‐based version of the <algorithm> `std::lower_bound()` function to return an iterator pointing to the first element in a sorted container which does not compare less than `value`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename Sequence,
    typename T>
constexpr
/* implementation-defined */
xref:absl/c_lower_bound-04.adoc[c_lower_bound](
    Sequence& sequence,
    T const& value);
----

[.small]#xref:absl/c_lower_bound-04.adoc[_» more..._]#

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename Sequence,
    typename T,
    typename LessThan>
constexpr
/* implementation-defined */
xref:absl/c_lower_bound-0c.adoc[c_lower_bound](
    Sequence& sequence,
    T const& value,
    LessThan&& comp);
----

[.small]#xref:absl/c_lower_bound-0c.adoc[_» more..._]#

== Return Value

* An iterator to the first element not less than `value`.
* An iterator to the first element not ordered before `value`.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *sequence*
| The sorted container to search.
| *value*
| The value to compare against.
| *comp*
| The comparison used to order the elements.
|===


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