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