/// \file // Range v3 library // // Copyright Eric Niebler 2014 // // Use, modification and distribution is subject to the // Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Project home: https://github.com/ericniebler/range-v3 // #ifndef RANGES_V3_ALGORITHM_TRANSFORM_HPP #define RANGES_V3_ALGORITHM_TRANSFORM_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace ranges { inline namespace v3 { /// \ingroup group-concepts template using Transformable1 = meta::strict_and< InputIterator, WeaklyIncrementable, CopyConstructible, Writable)>>>; /// \ingroup group-concepts template using Transformable2 = meta::strict_and< InputIterator, InputIterator, WeaklyIncrementable, CopyConstructible, Writable, projected)>>>; /// \addtogroup group-algorithms /// @{ struct transform_fn { // Single-range variant template() && Transformable1())> tagged_pair operator()(I begin, S end, O out, F fun, P proj = P{}) const { for(; begin != end; ++begin, ++out) *out = invoke(fun, invoke(proj, *begin)); return {begin, out}; } template, CONCEPT_REQUIRES_(Range() && Transformable1())> tagged_pair), tag::out(O)> operator()(Rng &&rng, O out, F fun, P proj = P{}) const { return (*this)(begin(rng), end(rng), std::move(out), std::move(fun), std::move(proj)); } // Double-range variant, 4-iterator version template() && Sentinel() && Transformable2())> tagged_tuple operator()(I0 begin0, S0 end0, I1 begin1, S1 end1, O out, F fun, P0 proj0 = P0{}, P1 proj1 = P1{}) const { for(; begin0 != end0 && begin1 != end1; ++begin0, ++begin1, ++out) *out = invoke(fun, invoke(proj0, *begin0), invoke(proj1, *begin1)); return tagged_tuple{begin0, begin1, out}; } template, typename I1 = iterator_t, CONCEPT_REQUIRES_(Range() && Range() && Transformable2())> tagged_tuple< tag::in1(safe_iterator_t), tag::in2(safe_iterator_t), tag::out(O)> operator()(Rng0 &&rng0, Rng1 &&rng1, O out, F fun, P0 proj0 = P0{}, P1 proj1 = P1{}) const { return (*this)(begin(rng0), end(rng0), begin(rng1), end(rng1), std::move(out), std::move(fun), std::move(proj0), std::move(proj1)); } // Double-range variant, 3-iterator version template() && Transformable2())> tagged_tuple operator()(I0 begin0, S0 end0, I1 begin1, O out, F fun, P0 proj0 = P0{}, P1 proj1 = P1{}) const { return (*this)(std::move(begin0), std::move(end0), std::move(begin1), unreachable{}, std::move(out), std::move(fun), std::move(proj0), std::move(proj1)); } template, typename I0 = iterator_t, CONCEPT_REQUIRES_(Range() && Iterator() && Transformable2())> tagged_tuple), tag::in2(I1), tag::out(O)> operator()(Rng0 &&rng0, I1Ref &&begin1, O out, F fun, P0 proj0 = P0{}, P1 proj1 = P1{}) const { return (*this)(begin(rng0), end(rng0), std::forward(begin1), unreachable{}, std::move(out), std::move(fun), std::move(proj0), std::move(proj1)); } }; /// \sa `transform_fn` /// \ingroup group-algorithms RANGES_INLINE_VARIABLE(with_braced_init_args, transform) /// @} } // namespace v3 } // namespace ranges #endif // include guard