13 #ifndef RANGES_V3_ALGORITHM_FIND_IF_NOT_HPP
14 #define RANGES_V3_ALGORITHM_FIND_IF_NOT_HPP
28 #include <range/v3/utility/static_const.hpp>
30 #include <range/v3/detail/prologue.hpp>
36 RANGES_FUNC_BEGIN(find_if_not)
48 template(
typename I,
typename S,
typename F,
typename P = identity)(
49 requires input_iterator<I> AND sentinel_for<S, I> AND
51 constexpr I RANGES_FUNC(find_if_not)(I
first, S last, F pred, P proj = P{})
60 template(
typename Rng,
typename F,
typename P = identity)(
61 requires input_range<Rng> AND
63 constexpr borrowed_iterator_t<Rng>
64 RANGES_FUNC(find_if_not)(Rng && rng, F pred, P proj = P{})
66 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
69 RANGES_FUNC_END(find_if_not)
73 using ranges::find_if_not;
78 #include <range/v3/detail/epilogue.hpp>
CPP_concept indirect_unary_predicate
\concept indirect_unary_predicate
Definition: concepts.hpp:632
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