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)(
44 constexpr I RANGES_FUNC(remove)(I
first, S last, T
const & val, P proj = P{})
46 first = find(std::move(first), last, val, ranges::ref(proj));
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)(
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>
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 adjacent_find.hpp:67
Definition comparisons.hpp:28
Definition identity.hpp:25