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)
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>
The forward_iterator concept.
The forward_range concept.
The indirect_relation 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 comparisons.hpp:28
Definition identity.hpp:25