c_partial_sort overloads

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...

Parameters

Name

Description

sequence

The container to partially sort.

middle

An iterator to the end of the range to be sorted.

comp

The comparison used to order the elements.

Created with MrDocs