13#ifndef RANGES_V3_ALGORITHM_REMOVE_COPY_IF_HPP
14#define RANGES_V3_ALGORITHM_REMOVE_COPY_IF_HPP
20#include <range/v3/algorithm/result_types.hpp>
29#include <range/v3/utility/static_const.hpp>
31#include <range/v3/detail/prologue.hpp>
37 template<
typename I,
typename O>
38 using remove_copy_if_result = detail::in_out_result<I, O>;
40 RANGES_FUNC_BEGIN(remove_copy_if)
47 constexpr remove_copy_if_result<I, O>
48 RANGES_FUNC(remove_copy_if)(I
first, S last, O out, C pred, P proj = P{})
55 *out = (
decltype(x) &&)x;
63 template(
typename Rng,
typename O,
typename C,
typename P =
identity)(
67 constexpr remove_copy_if_result<borrowed_iterator_t<Rng>, O>
68 RANGES_FUNC(remove_copy_if)(Rng && rng, O out, C pred, P proj = P{})
71 begin(rng), end(rng), std::move(out), std::move(pred), std::move(proj));
74 RANGES_FUNC_END(remove_copy_if)
78 using ranges::remove_copy_if;
79 using ranges::remove_copy_if_result;
84#include <range/v3/detail/epilogue.hpp>
The indirect_unary_predicate concept.
The indirectly_copyable concept.
The sentinel_for concept.
The weakly_incrementable concept.
template(typename Rng, typename O, typename C, typename P=identity)(AND weakly_incrementable< O > AND indirect_unary_predicate< C
This is an overloaded member function, provided for convenience. It differs from the above function o...
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