replace |
Replace a specified value in a sequence with another value.
Replace every occurrence of old_value in the range [ first ... last ) with new_value .
#include <algorithm>
template< class ForwardIterator, class T >
void replace
(
ForwardIterator first,
ForwardIterator last,
const T& old_value,
const T& new_value
);
Time complexity is linear, as (
last - first )
comparisons are performed. Space complexity is constant.
Copyright©1994-2026 Recursion Software LLC
All Rights Reserved - For use by licensed users only.