Difference between revisions of "cpp/algorithm/replace copy"
m (Text replace - "{{returns}}" to "===Return value===") |
m (Text replace - "{{complex}}" to "===Complexity===") |
||
| Line 39: | Line 39: | ||
<!-- ======== --> | <!-- ======== --> | ||
| − | + | ===Complexity=== | |
linear in the distance between {{tt|first}} and {{tt|last}} | linear in the distance between {{tt|first}} and {{tt|last}} | ||
Revision as of 17:54, 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 >OutputIterator replace_copy( InputIterator first,
InputIterator last,
OutputIterator d_first,
const T& old_value,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >OutputIterator replace_copy_if( InputIterator first,
InputIterator last,
OutputIterator d_first,
UnaryPredicate p,
<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.
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 |
| new_value | - | the value to use as replacement |
Return value
iterator to the element past the last element copied.
Complexity
linear in the distance between first and last
| This section is incomplete Reason: no eq fun |
| This section is incomplete Reason: no example |
