absl::c_partial_sort_copy

Synopses

Declared in <absl/algorithm/container.h>

Container-based version of the <algorithm> std::partial_sort_copy() function to sort the elements in the given range result within the larger sequence in ascending order (and using result as the output parameter). At most min(result.last - result.first, sequence.last - sequence.first) elements from the sequence will be stored in the result.

template<
    typename C,
    typename RandomAccessContainer>
constexpr
/* implementation-defined */
c_partial_sort_copy(
    C const& sequence,
    RandomAccessContainer& result);

» more...

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

template<
    typename C,
    typename RandomAccessContainer,
    typename LessThan>
constexpr
/* implementation-defined */
c_partial_sort_copy(
    C const& sequence,
    RandomAccessContainer& result,
    LessThan&& comp);

» more...