Difference between revisions of "cpp/algorithm/replace"

Revision as of 17:55, 2 August 2011

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

<td>

Defined in header <algorithm>

</td>

<td >

template< class ForwardIterator, class T >

void replace( ForwardIterator first, ForwardIterator last,

const T& old_value, const T& new_value );

</td>

<td >

template< class ForwardIterator, class UnaryPredicate, class T >

void replace_if( ForwardIterator first, ForwardIterator last,

UnaryPredicate p, const T& new_value );

</td>

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

Replaces all elements satisfying specific criteria with new_value in the range [first, last). The first version replaces the elements that are equal to old_value, the second version replaces elements for which predicate p returns Template:cpp.

first, last	-	the range of elements to process
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