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.

template<typename C>
constexpr
/* implementation-defined */
c_is_sorted_until(C& c);

» more...

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

template<
    typename C,
    typename LessThan>
constexpr
/* implementation-defined */
c_is_sorted_until(
    C& c,
    LessThan&& comp);

» 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

Name

Description

c

The container to inspect.

comp

The comparison used to order the elements.

Created with MrDocs