13#ifndef RANGES_V3_ALGORITHM_REMOVE_COPY_HPP
14#define RANGES_V3_ALGORITHM_REMOVE_COPY_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_result = detail::in_out_result<I, O>;
40 RANGES_FUNC_BEGIN(remove_copy)
43 template(typename I, typename S, typename O, typename T, typename P =
identity)(
48 constexpr remove_copy_result<I, O> RANGES_FUNC(remove_copy)(
49 I first, S last, O out, T const & val, P proj = P{})
51 for(; first != last; ++first)
54 if(!(invoke(proj, x) == val))
56 *out = (
decltype(x) &&)x;
64 template(
typename Rng,
typename O,
typename T,
typename P =
identity)(
68 constexpr remove_copy_result<borrowed_iterator_t<Rng>, O>
69 RANGES_FUNC(remove_copy)(Rng && rng, O out, T
const & val, P proj = P{})
71 return (*
this)(begin(rng), end(rng), std::move(out), val, std::move(proj));
74 RANGES_FUNC_END(remove_copy)
78 using ranges::remove_copy;
79 using ranges::remove_copy_result;
84#include <range/v3/detail/epilogue.hpp>
The indirect_relation concept.
The indirectly_copyable concept.
The sentinel_for concept.
The weakly_incrementable concept.
decltype(begin(declval(Rng &))) iterator_t
Definition access.hpp:698
front< Pair > first
Retrieve the first element of the pair Pair.
Definition meta.hpp:2251
Definition comparisons.hpp:28
Definition identity.hpp:25