Header file range/v3/algorithm/partial_sort.hpp

#include <range/v3/range_fwd.hpp>

#include <range/v3/begin_end.hpp>

#include <range/v3/range_concepts.hpp>

#include <range/v3/range_traits.hpp>

#include <range/v3/utility/iterator.hpp>

#include <range/v3/utility/iterator_concepts.hpp>

#include <range/v3/utility/iterator_traits.hpp>

#include <range/v3/utility/functional.hpp>

#include <range/v3/algorithm/heap_algorithm.hpp>

#include <range/v3/utility/static_const.hpp>

namespace ranges
{
    inline namespace v3
    {
        struct partial_sort_fn;
        
        inline namespace 
        {
            constexpr auto& partial_sort = static_const<with_braced_init_args<partial_sort_fn>>::value;
        }
    }
}

Class ranges::v3::partial_sort_fn

struct partial_sort_fn
{
    template <typename I, typename S, typename C = ordered_less, typename P = ident, int _concept_requires_37 = 42, typename std::enable_if<(_concept_requires_37==43)||(Sortable<I, C, P>()&&RandomAccessIterator<I>()&&Sentinel<S, I>()), int>::type=0>
    I operator()(I begin, I middle, S end, C pred_ = C{}, P proj_ = P{}) const;
    
    template <typename Rng, typename C = ordered_less, typename P = ident, typename I = range_iterator_t<Rng>, int _concept_requires_60 = 42, typename std::enable_if<(_concept_requires_60==43)||(Sortable<I, C, P>()&&RandomAccessRange<Rng>()), int>::type=0>
    range_safe_iterator_t<Rng> operator()(Rng&& rng, I middle, C pred = C{}, P proj = P{}) const;
};

@{


Variable ranges::v3::partial_sort

constexpr auto& partial_sort = static_const<with_braced_init_args<partial_sort_fn>>::value;

partial_sort_fn