13 #ifndef RANGES_V3_ALGORITHM_REMOVE_HPP
14 #define RANGES_V3_ALGORITHM_REMOVE_HPP
30 #include <range/v3/utility/static_const.hpp>
32 #include <range/v3/detail/prologue.hpp>
38 RANGES_FUNC_BEGIN(remove)
41 template(
typename I,
typename S,
typename T,
typename P = identity)(
42 requires permutable<I> AND sentinel_for<S, I> AND
44 constexpr I RANGES_FUNC(remove)(I
first, S last, T
const & val, P proj = P{})
49 for(I i = next(
first); i != last; ++i)
51 if(!(
invoke(proj, *i) == val))
53 *
first = iter_move(i);
62 template(
typename Rng,
typename T,
typename P = identity)(
63 requires forward_range<Rng> AND
permutable<iterator_t<Rng>> AND
65 constexpr borrowed_iterator_t<Rng>
66 RANGES_FUNC(remove)(Rng && rng, T
const & val, P proj = P{})
68 return (*
this)(begin(rng), end(rng), val, std::move(proj));
71 RANGES_FUNC_END(remove)
80 #include <range/v3/detail/epilogue.hpp>
CPP_concept permutable
\concept permutable
Definition: concepts.hpp:840
CPP_concept indirect_relation
\concept indirect_relation
Definition: concepts.hpp:670
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
drop< L, min< find_index< L, T >, size< L > >> find
Return the tail of the list L starting at the first occurrence of T, if any such element exists; the ...
Definition: meta.hpp:2388