/// \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_REPLACE_COPY_IF_HPP #define RANGES_V3_ALGORITHM_REPLACE_COPY_IF_HPP #include #include #include #include #include #include #include #include #include #include #include namespace ranges { inline namespace v3 { /// \ingroup group-concepts template using ReplaceCopyIfable = meta::strict_and< InputIterator, OutputIterator, IndirectlyCopyable, IndirectPredicate>>; /// \addtogroup group-algorithms /// @{ struct replace_copy_if_fn { template() && Sentinel())> tagged_pair operator()(I begin, S end, O out, C pred, T const & new_value, P proj = {}) const { for(; begin != end; ++begin, ++out) { auto &&x = *begin; if(invoke(pred, invoke(proj, x))) *out = new_value; else *out = (decltype(x) &&) x; } return {begin, out}; } template, CONCEPT_REQUIRES_(ReplaceCopyIfable() && Range())> tagged_pair), tag::out(O)> operator()(Rng &&rng, O out, C pred, T const & new_value, P proj = {}) const { return (*this)(begin(rng), end(rng), std::move(out), std::move(pred), new_value, std::move(proj)); } }; /// \sa `replace_copy_if_fn` /// \ingroup group-algorithms RANGES_INLINE_VARIABLE(with_braced_init_args, replace_copy_if) /// @} } // namespace v3 } // namespace ranges #endif // include guard