Horizon
Namespaces | Functions
partial_sort.hpp File Reference
#include <functional>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/heap_algorithm.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/functional/invoke.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/dangling.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/detail/prologue.hpp>
#include <range/v3/detail/epilogue.hpp>

Go to the source code of this file.

Namespaces

 ranges::cpp20
 

Functions

 ranges::template (typename I, typename S, typename C=equal_to, typename P=identity)(requires forward_iterator< I > AND sentinel_for< S
 function template adjacent_find More...
 
P AND random_access_iterator< I > AND constexpr sentinel_for< S, I > I RANGES_FUNC() ranges::partial_sort (I first, I middle, S last, C pred=C{}, P proj=P{})
 
 ranges::template (typename Rng, typename C=equal_to, typename P=identity)(requires forward_range< Rng > AND indirect_relation< C
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
P AND constexpr random_access_range< Rng > borrowed_iterator_t< Rng > RANGES_FUNC() ranges::partial_sort (Rng &&rng, iterator_t< Rng > middle, C pred=C{}, P proj=P{})