#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/result_types.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.
|
template<typename I > |
using | ranges::minmax_element_result = detail::min_max_result< I, I > |
|
|
| ranges::template (typename I, typename S, typename C=equal_to, typename P=identity)(AND sentinel_for< S |
| function template adjacent_find
|
|
I AND indirect_strict_weak_order< C, projected< I, P > > constexpr minmax_element_result< I > RANGES_FUNC() | ranges::minmax_element (I first, S last, C pred=C{}, P proj=P{}) |
|
| ranges::template (typename Rng, typename C=equal_to, typename P=identity)(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.
|
|
projected< iterator_t< Rng >, P > constexpr minmax_element_result< borrowed_iterator_t< Rng > > RANGES_FUNC() | ranges::minmax_element (Rng &&rng, C pred=C{}, P proj=P{}) |
|