absl::c_partial_sort

Synopses

Declared in <absl/algorithm/container.h>

Container-based version of the <algorithm> std::partial_sort() function to rearrange elements within a container such that elements before middle are sorted in ascending order.

template<typename RandomAccessContainer>
constexpr
void
c_partial_sort(
    RandomAccessContainer& sequence,
    /* implementation-defined */ middle);

» more...

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

template<
    typename RandomAccessContainer,
    typename LessThan>
constexpr
void
c_partial_sort(
    RandomAccessContainer& sequence,
    /* implementation-defined */ middle,
    LessThan&& comp);

» more...