13#ifndef RANGES_V3_ALGORITHM_MIN_ELEMENT_HPP
14#define RANGES_V3_ALGORITHM_MIN_ELEMENT_HPP
28#include <range/v3/utility/static_const.hpp>
30#include <range/v3/detail/prologue.hpp>
36 RANGES_FUNC_BEGIN(min_element)
39 template(
typename I,
typename S,
typename C =
less,
typename P =
identity)(
42 constexpr I RANGES_FUNC(min_element)(I
first, S last, C pred = C{}, P proj = P{})
45 for(
auto tmp = next(first); tmp != last; ++tmp)
52 template(
typename Rng,
typename C =
less,
typename P =
identity)(
55 constexpr borrowed_iterator_t<Rng>
56 RANGES_FUNC(min_element)(Rng && rng, C pred = C{}, P proj = P{})
58 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
61 RANGES_FUNC_END(min_element)
65 using ranges::min_element;
70#include <range/v3/detail/epilogue.hpp>
The forward_iterator concept.
The forward_range concept.
The indirect_strict_weak_order concept.
The sentinel_for concept.
decltype(begin(declval(Rng &))) iterator_t
Definition access.hpp:698
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
Definition adjacent_find.hpp:67
Definition identity.hpp:25
Definition comparisons.hpp:50