#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/heap_algorithm.hpp>
#include <range/v3/algorithm/move_backward.hpp>
#include <range/v3/algorithm/partial_sort.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/operations.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.

Functions
	ranges::template (typename I, typename S, typename C=equal_to, typename P=identity)(AND sentinel_for< S
	function template `adjacent_find` More...

I constexpr I RANGES_FUNC()	ranges::sort (I first, S end_, C pred=C{}, P proj=P{})

	ranges::template (typename Rng, typename C=less, typename P=identity)(AND random_access_range< Rng >) const expr borrowed_iterator_t< Rng > RANGES_FUNC(partial_sort)(Rng &&rng
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Functions