13 #ifndef RANGES_V3_ALGORITHM_REMOVE_IF_HPP
14 #define RANGES_V3_ALGORITHM_REMOVE_IF_HPP
30 #include <range/v3/utility/static_const.hpp>
32 #include <range/v3/detail/prologue.hpp>
38 RANGES_FUNC_BEGIN(remove_if)
41 template(
typename I,
typename S,
typename C,
typename P = identity)(
42 requires permutable<I> AND sentinel_for<S, I> AND
44 constexpr I RANGES_FUNC(remove_if)(I
first, S last, C pred, P proj = P{})
49 for(I i = next(
first); i != last; ++i)
53 *
first = iter_move(i);
62 template(
typename Rng,
typename C,
typename P = identity)(
63 requires forward_range<Rng> AND
permutable<iterator_t<Rng>> AND
65 constexpr borrowed_iterator_t<Rng> RANGES_FUNC(remove_if)(Rng && rng, C pred, P proj = P{})
67 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
70 RANGES_FUNC_END(remove_if)
74 using ranges::remove_if;
79 #include <range/v3/detail/epilogue.hpp>
CPP_concept permutable
\concept permutable
Definition: concepts.hpp:840
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
_t< detail::find_if_< L, Fn > > find_if
Return the tail of the list L starting at the first element A such that invoke<Fn,...
Definition: meta.hpp:2506