14#ifndef RANGES_V3_ALGORITHM_ADJACENT_REMOVE_IF_HPP
15#define RANGES_V3_ALGORITHM_ADJACENT_REMOVE_IF_HPP
32#include <range/v3/utility/static_const.hpp>
34#include <range/v3/detail/prologue.hpp>
40 RANGES_FUNC_BEGIN(adjacent_remove_if)
47 template(typename I, typename S, typename Pred, typename Proj =
identity)(
50 constexpr I RANGES_FUNC(adjacent_remove_if)(I first, S last, Pred pred = {}, Proj proj = {})
52 first = adjacent_find(std::move(first), last, ranges::ref(pred), ranges::ref(proj));
57 for(
auto j = ++i; ++j != last; ++i)
61 *
first = iter_move(i);
66 *
first = iter_move(i);
72 template(
typename Rng,
typename Pred,
typename Proj =
identity)(
76 constexpr borrowed_iterator_t<Rng>
77 RANGES_FUNC(adjacent_remove_if)(Rng && rng, Pred pred, Proj proj = {})
79 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
81 RANGES_FUNC_END(adjacent_remove_if)
85 using ranges::adjacent_remove_if;
90#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 identity.hpp:25