16#ifndef RANGES_V3_ALGORITHM_MINMAX_ELEMENT_HPP
17#define RANGES_V3_ALGORITHM_MINMAX_ELEMENT_HPP
21#include <range/v3/algorithm/result_types.hpp>
31#include <range/v3/utility/static_const.hpp>
33#include <range/v3/detail/prologue.hpp>
40 using minmax_element_result = detail::min_max_result<I, I>;
42 RANGES_FUNC_BEGIN(minmax_element)
45 template(
typename I,
typename S,
typename C =
less,
typename P = identity)(
46 requires forward_iterator<I> AND sentinel_for<S, I> AND
47 indirect_strict_weak_order<C, projected<I, P>>)
48 constexpr minmax_element_result<I>
49 RANGES_FUNC(minmax_element)(I
first, S last, C pred = C{}, P proj = P{})
52 if(first == last || ++first == last)
58 while(++first != last)
91 template(
typename Rng,
typename C =
less,
typename P = identity)(
92 requires forward_range<Rng> AND
93 indirect_strict_weak_order<C, projected<iterator_t<Rng>, P>>)
94 constexpr minmax_element_result<borrowed_iterator_t<Rng>>
95 RANGES_FUNC(minmax_element)(Rng && rng, C pred = C{}, P proj = P{})
97 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
100 RANGES_FUNC_END(minmax_element)
104 using ranges::minmax_element;
105 using ranges::minmax_element_result;
110#include <range/v3/detail/epilogue.hpp>
typename Fn::template invoke< Args... > invoke
Evaluate the invocable Fn with the arguments Args.
Definition meta.hpp:541
front< Pair > first
Retrieve the first element of the pair Pair.
Definition meta.hpp:2251
bool_<(T::type::value< U::type::value)> less
A Boolean integral constant wrapper around true if T::type::value is less than U::type::value; false,...
Definition meta.hpp:255