Difference between revisions of "cpp/algorithm/replace"
m (Text replace - "{{example}}" to "===Example===") |
m (Text replace - "{{see also}}" to "===See also===") |
||
| Line 96: | Line 96: | ||
<!-- ======== --> | <!-- ======== --> | ||
| − | + | ===See also=== | |
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/algorithm/dcl list replace_copy}} | {{dcl list template | cpp/algorithm/dcl list replace_copy}} | ||
{{dcl list end}} | {{dcl list end}} | ||
Revision as of 17:59, 2 August 2011
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >void replace( ForwardIterator first, ForwardIterator last,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void replace_if( ForwardIterator first, ForwardIterator last,
<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.
Contents |
Parameters
| 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 |
| new_value | - | the value to use as replacement |
Return value
Complexity
linear in the distance between first and last
