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.
Declared in <absl/algorithm/container.h>
template<
typename Sequence,
typename T>
constexpr
/* implementation-defined */
c_lower_bound(
Sequence& sequence,
T const& value);An iterator to the first element not less than value.
| Name | Description |
|---|---|
| sequence | The sorted container to search. |
| value | The value to compare against. |