std::replace_copy, std::replace_copy_if

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class OutputIterator, class T >

OutputIterator replace_copy( InputIterator first,
                             InputIterator last,
                             OutputIterator d_first,
                             const T& old_value,

                             const T& new_value );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class OutputIterator, class UnaryPredicate, class T >

OutputIterator replace_copy_if( InputIterator first,
                                InputIterator last,
                                OutputIterator d_first,
                                UnaryPredicate p,

                                const T& new_value );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Copies the all elements from the range [first, last) to another range beginning at d_first replacing all elements satisfying specific criteria with new_value. The first version replaces the elements that are equal to old_value, the second version replaces elements for which predicate p returns Template:cpp. The source and destination ranges cannot overlap.

Parameters

first, last	-	the range of elements to copy
d_first	-	the beginning of the destination range
old_value	-	the value of elements to replace
p	-	unary predicate which returns ​true if the element value should be replaced. The expression p(v) must be convertible to bool for every argument v of type (possibly const) VT, where VT is the value type of ForwardIterator, regardless of value category, and must not modify v. Thus, a parameter type of VT&is not allowed, nor is VT unless for VT a move is equivalent to a copy(since C++11). ​
new_value	-	the value to use as replacement

Return value

iterator to the element past the last element copied.

Complexity

Exactly last - first applications of the predicate.

See also

Template:cpp/algorithm/dcl list remove