13 #ifndef RANGES_V3_ALGORITHM_ADJACENT_FIND_HPP
14 #define RANGES_V3_ALGORITHM_ADJACENT_FIND_HPP
26 #include <range/v3/utility/static_const.hpp>
28 #include <range/v3/detail/prologue.hpp>
34 RANGES_FUNC_BEGIN(adjacent_find)
44 constexpr I RANGES_FUNC(adjacent_find)(I
first, S last, C pred = C{}, P proj = P{})
49 for(; ++inext != last;
first = inext)
57 requires forward_range<Rng> AND
59 constexpr borrowed_iterator_t<Rng>
60 RANGES_FUNC(adjacent_find)(Rng && rng, C pred = C{}, P proj = P{})
62 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
64 RANGES_FUNC_END(adjacent_find)
68 using ranges::adjacent_find;
73 #include <range/v3/detail/epilogue.hpp>
template(typename Rng, typename C=equal_to, typename P=identity)(requires forward_range< Rng > AND indirect_relation< C
This is an overloaded member function, provided for convenience. It differs from the above function o...
CPP_concept sentinel_for
\concept sentinel_for
Definition: concepts.hpp:306
CPP_concept indirect_relation
\concept indirect_relation
Definition: concepts.hpp:670
CPP_concept forward_iterator
\concept forward_iterator
Definition: concepts.hpp:370
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
bool_< T::type::value==U::type::value > equal_to
A Boolean integral constant wrapper around the result of comparing T::type::value and U::type::value ...
Definition: meta.hpp:237
Definition: comparisons.hpp:28
Definition: identity.hpp:25