Difference between revisions of "cpp/algorithm/ranges/replace copy"
(created a page for ranges::replace_copy + example) |
m (- ranges::, fmt) |
||
Line 5: | Line 5: | ||
{{dcl h | Call signature}} | {{dcl h | Call signature}} | ||
{{dcl | since=c++20 | num=1 |1= | {{dcl | since=c++20 | num=1 |1= | ||
− | template <std::input_iterator I, std::sentinel_for<I> S, class T1, class T2, | + | template< std::input_iterator I, std::sentinel_for<I> S, class T1, class T2, |
− | + | std::output_iterator<const T2&> O, class Proj = std::identity > | |
− | requires std::indirectly_copyable<I, O> && | + | requires std::indirectly_copyable<I, O> && |
− | + | std::indirect_binary_predicate<ranges::equal_to, std::projected<I, Proj>, | |
− | + | const T1*> | |
− | constexpr | + | constexpr replace_copy_result<I, O> |
− | + | replace_copy( I first, S last, O result, const T1& old_value, const T2& new_value, | |
− | + | Proj proj = {} ); | |
}} | }} | ||
{{dcl | since=c++20 | num=2 |1= | {{dcl | since=c++20 | num=2 |1= | ||
− | template <ranges::input_range R, class T1, class T2, | + | template< ranges::input_range R, class T1, class T2, |
− | + | std::output_iterator<const T2&> O, class Proj = std::identity > | |
− | requires std::indirectly_copyable<ranges::iterator_t<R>, O> && | + | requires std::indirectly_copyable<ranges::iterator_t<R>, O> && |
− | + | std::indirect_binary_predicate<ranges::equal_to, | |
− | + | std::projected<ranges::iterator_t<R>, Proj>, const T1*> | |
− | constexpr | + | constexpr replace_copy_result<ranges::borrowed_iterator_t<R>, O> |
− | + | replace_copy( R&& r, O result, const T1& old_value, const T2& new_value, | |
− | + | Proj proj = {} ); | |
}} | }} | ||
{{dcl | since=c++20 | num=3 |1= | {{dcl | since=c++20 | num=3 |1= | ||
− | template <std::input_iterator I, std::sentinel_for<I> S, class T, | + | template< std::input_iterator I, std::sentinel_for<I> S, class T, |
− | + | std::output_iterator<const T&> O, | |
− | + | class Proj = std::identity, std::indirect_unary_predicate< | |
− | + | std::projected<I, Proj>> Pred > | |
− | requires std::indirectly_copyable<I, O> | + | requires std::indirectly_copyable<I, O> |
− | constexpr | + | constexpr replace_copy_if_result<I, O> |
− | + | replace_copy_if( I first, S last, O result, Pred pred, const T& new_value, | |
− | + | Proj proj = {} ); | |
}} | }} | ||
{{dcl | since=c++20 | num=4 |1= | {{dcl | since=c++20 | num=4 |1= | ||
− | template <ranges::input_range R, class T, std::output_iterator<const T&> O, | + | template< ranges::input_range R, class T, std::output_iterator<const T&> O, |
− | + | class Proj = std::identity, | |
− | + | std::indirect_unary_predicate<std::projected<ranges::iterator_t<R>, Proj>> Pred > | |
− | requires std::indirectly_copyable<ranges::iterator_t<R>, O> | + | requires std::indirectly_copyable<ranges::iterator_t<R>, O> |
− | constexpr | + | constexpr replace_copy_if_result<ranges::borrowed_iterator_t<R>, O> |
− | + | replace_copy_if( R&& r, O result, Pred pred, const T& new_value, | |
− | + | Proj proj = {} ); | |
}} | }} | ||
{{dcl h | Helper types}} | {{dcl h | Helper types}} | ||
{{dcl | num=5 | since=c++20 |1= | {{dcl | num=5 | since=c++20 |1= | ||
− | template<class I, class O> | + | template< class I, class O > |
using replace_copy_result = ranges::in_out_result<I, O>; | using replace_copy_result = ranges::in_out_result<I, O>; | ||
}} | }} | ||
{{dcl | num=6 | since=c++20 |1= | {{dcl | num=6 | since=c++20 |1= | ||
− | template<class I, class O> | + | template< class I, class O > |
using replace_copy_if_result = ranges::in_out_result<I, O>; | using replace_copy_if_result = ranges::in_out_result<I, O>; | ||
}} | }} | ||
Line 56: | Line 56: | ||
Copies the elements from the source range {{tt|[first, last)}} to the destination range beginning at {{tt|result}} replacing all elements satisfying specific criteria with {{tt|new_value}}. ''Precondition:'' the source and destination ranges must not overlap. | Copies the elements from the source range {{tt|[first, last)}} to the destination range beginning at {{tt|result}} replacing all elements satisfying specific criteria with {{tt|new_value}}. ''Precondition:'' the source and destination ranges must not overlap. | ||
− | @1@ Replaces all elements that are equal to {{tt|old_value}}, using {{c|1=std:: | + | @1@ Replaces all elements that are equal to {{tt|old_value}}, using {{c|1=std::invoke(proj, *(first + (i - result))) == old_value}} to compare. |
− | @3@ Replaces all elements for which the predicate {{tt|pred}} evaluates to {{tt|true}}, where the evaluating expression is {{ | + | @3@ Replaces all elements for which the predicate {{tt|pred}} evaluates to {{tt|true}}, where the evaluating expression is {{c|1=std::invoke(pred, std::invoke(proj, *(first + (i - result))))}}. |
@2,4@ Same as {{v|1,3}}, but uses {{tt|r}} as the soruce range, as if using {{c|ranges::begin(r)}} as {{tt|first}}, and {{c|ranges::end(r)}} as {{tt|last}}. | @2,4@ Same as {{v|1,3}}, but uses {{tt|r}} as the soruce range, as if using {{c|ranges::begin(r)}} as {{tt|first}}, and {{c|ranges::end(r)}} as {{tt|last}}. |
Revision as of 16:37, 8 July 2021
Defined in header <algorithm>
|
||
Call signature |
||
template< std::input_iterator I, std::sentinel_for<I> S, class T1, class T2, std::output_iterator<const T2&> O, class Proj = std::identity > |
(1) | (since C++20) |
template< ranges::input_range R, class T1, class T2, std::output_iterator<const T2&> O, class Proj = std::identity > |
(2) | (since C++20) |
template< std::input_iterator I, std::sentinel_for<I> S, class T, std::output_iterator<const T&> O, |
(3) | (since C++20) |
template< ranges::input_range R, class T, std::output_iterator<const T&> O, class Proj = std::identity, |
(4) | (since C++20) |
Helper types |
||
template< class I, class O > using replace_copy_result = ranges::in_out_result<I, O>; |
(5) | (since C++20) |
template< class I, class O > using replace_copy_if_result = ranges::in_out_result<I, O>; |
(6) | (since C++20) |
Copies the elements from the source range [first, last)
to the destination range beginning at result
replacing all elements satisfying specific criteria with new_value
. Precondition: the source and destination ranges must not overlap.
old_value
, using std::invoke(proj, *(first + (i - result))) == old_value to compare.pred
evaluates to true
, where the evaluating expression is std::invoke(pred, std::invoke(proj, *(first + (i - result)))).r
as the soruce range, as if using ranges::begin(r) as first
, and ranges::end(r) as last
.The function-like entities described on this page are niebloids, that is:
- Explicit template argument lists cannot be specified when calling any of them.
- None of them are visible to argument-dependent lookup.
- When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup is inhibited.
In practice, they may be implemented as function objects, or with special compiler extensions.
Contents |
Parameters
first, last | - | the range of elements to copy |
r | - | the range of elements to copy |
result | - | the beginning of the destination range |
old_value | - | the value of elements to replace |
new_value | - | the value to use as a replacement |
pred | - | predicate to apply to the projected elements |
proj | - | projection to apply to the elements. |
Return value
An object equal to {last, result + (last - first)}.
Complexity
Exactly ranges::distance(first, last) applications of the corresponding predicate comp
and any projection proj
.
Possible implementation
First version |
---|
struct replace_copy_fn { template <std::input_iterator I, std::sentinel_for<I> S, class T1, class T2, std::output_iterator<const T2&> O, class Proj = std::identity> requires std::indirectly_copyable<I, O> && std::indirect_binary_predicate<ranges::equal_to, std::projected<I, Proj>, const T1*> constexpr ranges::replace_copy_result<I, O> operator()( I first, S last, O result, const T1& old_value, const T2& new_value, Proj proj = {} ) const { for (; first != last; ++first, ++result) { *result = (std::invoke(proj, *first) == old_value) ? new_value : *first; } return {std::move(first), std::move(result)}; } template <ranges::input_range R, class T1, class T2, std::output_iterator<const T2&> O, class Proj = std::identity> requires std::indirectly_copyable<ranges::iterator_t<R>, O> && std::indirect_binary_predicate<ranges::equal_to, std::projected<ranges::iterator_t<R>, Proj>, const T1*> constexpr ranges::replace_copy_result<ranges::borrowed_iterator_t<R>, O> operator()( R&& r, O result, const T1& old_value, const T2& new_value, Proj proj = {} ) const { return (*this)(ranges::begin(r), ranges::end(r), std::move(result), old_value, new_value, std::move(proj)); } }; inline constexpr replace_copy_fn replace_copy{}; |
Second version |
struct replace_copy_if_fn { template <std::input_iterator I, std::sentinel_for<I> S, class T, std::output_iterator<const T&> O, class Proj = std::identity, std::indirect_unary_predicate< std::projected<I, Proj>> Pred> requires std::indirectly_copyable<I, O> constexpr ranges::replace_copy_if_result<I, O> operator()( I first, S last, O result, Pred pred, const T& new_value, Proj proj = {} ) const { for (; first != last; ++first, ++result) { *result = std::invoke(pred, std::invoke(proj, *first)) ? new_value : *first; } return {std::move(first), std::move(result)}; } template <ranges::input_range R, class T, std::output_iterator<const T&> O, class Proj = std::identity, std::indirect_unary_predicate<std::projected<ranges::iterator_t<R>, Proj>> Pred> requires std::indirectly_copyable<ranges::iterator_t<R>, O> constexpr ranges::replace_copy_if_result<ranges::borrowed_iterator_t<R>, O> operator()( R&& r, O result, Pred pred, const T& new_value, Proj proj = {} ) const { return (*this)(ranges::begin(r), ranges::end(r), std::move(result), std::move(pred), new_value, std::move(proj)); } }; inline constexpr replace_copy_if_fn replace_copy_if{}; |
Example
#include <algorithm> #include <array> #include <iostream> #include <vector> int main() { auto print = [](const auto rem, const auto& v) { std::cout << rem << ": "; for (const auto& e : v) { std::cout << e << ' '; } std::cout << '\n'; }; std::vector<int> o; std::array p{1, 6, 1, 6, 1, 6}; o.resize(p.size()); print("p", p); std::ranges::replace_copy(p, o.begin(), 6, 9); print("o", o); std::array q{1, 2, 3, 6, 7, 8, 4, 5}; o.resize(q.size()); print("q", q); std::ranges::replace_copy_if(q, o.begin(), [](int x){ return 5 < x; }, 5); print("o", o); }
Output:
p: 1 6 1 6 1 6 o: 1 9 1 9 1 9 q: 1 2 3 6 7 8 4 5 o: 1 2 3 5 5 5 4 5
See also
(C++20)(C++20) |
replaces all values satisfying specific criteria with another value (niebloid) |
copies a range, replacing elements satisfying specific criteria with another value (function template) |