14#ifndef RANGES_V3_ALGORITHM_UNSTABLE_REMOVE_IF_HPP
15#define RANGES_V3_ALGORITHM_UNSTABLE_REMOVE_IF_HPP
33#include <range/v3/utility/static_const.hpp>
35#include <range/v3/detail/prologue.hpp>
45 RANGES_FUNC_BEGIN(unstable_remove_if)
48 template(typename I, typename C, typename P =
identity)(
51 constexpr I RANGES_FUNC(unstable_remove_if)(I first, I last, C pred, P proj = {})
55 first = find_if(std::move(first), last, ranges::ref(pred), ranges::ref(proj));
59 last = next(find_if_not(make_reverse_iterator(std::move(last)),
60 make_reverse_iterator(next(first)),
67 *first = iter_move(last);
75 template(
typename Rng,
typename C,
typename P = identity)(
76 requires bidirectional_range<Rng> AND common_range<Rng> AND
77 permutable<iterator_t<Rng>> AND
78 indirect_unary_predicate<C, projected<iterator_t<Rng>, P>>)
79 constexpr borrowed_iterator_t<Rng>
80 RANGES_FUNC(unstable_remove_if)(Rng && rng, C pred, P proj = P{})
82 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
85 RANGES_FUNC_END(unstable_remove_if)
89#include <range/v3/detail/epilogue.hpp>
The bidirectional_iterator concept.
The indirect_unary_predicate concept.
Definition identity.hpp:25