std::replace, std::replace_if
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
(none)
Complexity
Exactly last - first
applications of the predicate.
Possible implementation
Example
The following code at first replaces all occurrences of Template:cpp with Template:cpp in a vector of integers. Then it replaces all values less than Template:cpp with 55.
#include <algorithm> #include <array> #include <iostream> #include <functional> int main() { std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3}; std::replace(s.begin(), s.end(), 8, 88); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; std::replace_if(s.begin(), s.end(), std::bind(std::less<int>(), std::placeholders::_1, 5), 55); for (int a : s) { std::cout << a << " "; } std::cout << '\n'; }
Output:
5 7 4 2 88 6 1 9 0 3 5 7 55 55 99 6 55 9 55 55