Horizon
Loading...
Searching...
No Matches
Functions
stable_sort.hpp File Reference
#include <functional>
#include <iterator>
#include <memory>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/inplace_merge.hpp>
#include <range/v3/algorithm/merge.hpp>
#include <range/v3/algorithm/min.hpp>
#include <range/v3/algorithm/sort.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/move_iterators.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/memory.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
 
I I RANGES_FUNC() ranges::stable_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.