13#ifndef RANGES_V3_ALGORITHM_TRANSFORM_HPP
14#define RANGES_V3_ALGORITHM_TRANSFORM_HPP
22#include <range/v3/algorithm/result_types.hpp>
32#include <range/v3/utility/static_const.hpp>
34#include <range/v3/detail/prologue.hpp>
40 template<
typename I,
typename O>
41 using unary_transform_result = detail::in_out_result<I, O>;
43 template<
typename I1,
typename I2,
typename O>
44 using binary_transform_result = detail::in1_in2_out_result<I1, I2, O>;
46 RANGES_FUNC_BEGIN(transform)
50 template(
typename I,
typename S,
typename O,
typename F,
typename P = identity)(
51 requires input_iterator<I> AND sentinel_for<S, I> AND
52 weakly_incrementable<O> AND copy_constructible<F> AND
53 indirectly_writable<O, indirect_result_t<F &, projected<I, P>>>)
54 constexpr unary_transform_result<I, O>
55 RANGES_FUNC(transform)(I
first, S last, O out, F fun, P proj = P{})
63 template(
typename Rng,
typename O,
typename F,
typename P = identity)(
64 requires input_range<Rng> AND weakly_incrementable<O> AND
65 copy_constructible<F> AND
66 indirectly_writable<O, indirect_result_t<F &, projected<iterator_t<Rng>, P>>>)
67 constexpr unary_transform_result<borrowed_iterator_t<Rng>, O>
68 RANGES_FUNC(transform)(Rng && rng, O out, F fun, P proj = P{})
71 begin(rng), end(rng), std::move(out), std::move(fun), std::move(proj));
89 indirect_result_t<F &, projected<I0, P0>, projected<I1, P1>>>)
90 constexpr binary_transform_result<I0, I1, O>
91 RANGES_FUNC(transform)(I0 begin0,
100 for(; begin0 != end0 && begin1 != end1; ++begin0, ++begin1, ++out)
102 return {begin0, begin1, out};
106 template(
typename Rng0,
116 indirect_result_t<F &,
119 constexpr binary_transform_result<borrowed_iterator_t<Rng0>,
120 borrowed_iterator_t<Rng1>,
122 RANGES_FUNC(transform)(
123 Rng0 && rng0, Rng1 && rng1, O out, F fun, P0 proj0 = P0{}, P1 proj1 = P1{})
125 return (*
this)(begin(rng0),
137 template(
typename I0,
146 copy_constructible<F> AND
149 indirect_result_t<F &, projected<I0, P0>, projected<I1, P1>>>)
151 "Use the variant of ranges::transform that takes an upper bound "
152 "for both input ranges")
153 binary_transform_result<I0, I1, O>
154 RANGES_FUNC(transform)(I0 begin0,
162 return (*
this)(std::move(begin0),
173 template(
typename Rng0,
183 indirect_result_t<F &,
185 projected<uncvref_t<I1Ref>, P1>>>)
187 "Use the variant of ranges::transform that takes an upper bound "
188 "for both input ranges")
189 binary_transform_result<borrowed_iterator_t<Rng0>, uncvref_t<I1Ref>, O>
190 RANGES_FUNC(transform)(Rng0 && rng0,
197 return (*
this)(begin(rng0),
199 static_cast<I1Ref &&
>(begin1),
207 RANGES_FUNC_END(transform)
211 using ranges::binary_transform_result;
212 using ranges::transform;
213 using ranges::unary_transform_result;
218#include <range/v3/detail/epilogue.hpp>
The indirectly_writable concept.
The sentinel_for concept.
The weakly_incrementable 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