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.
Declared in <absl/algorithm/container.h>
template<typename C>
constexpr
/* implementation-defined */
c_is_sorted_until(C& c);An iterator to the first element that breaks ascending order, or the end iterator if the container is fully sorted.
| Name | Description |
|---|---|
| c | The container to inspect. |