Previous fileTop of DocumentContentsIndex pageNext file
Apache C++ Standard Library Reference Guide


Library:  Algorithms


Local Index

No Entries


An algorithm that substitutes elements in a sequence with new values, and moves the revised sequence into result


#include <algorithm>

namespace std {
  template <class InputIterator,
            class OutputIterator,
            class T>
  OutputIterator replace_copy(InputIterator start,
                              InputIterator finish,
                              OutputIterator result,
                              const T& old_value,
                              const T& new_value);


The replace_copy() algorithm leaves the original sequence intact and places the revised sequence into result. For the range [start, finish), the algorithm compares elements referred to by iterator i with old_value. If *i does not compare equal to old_value, then replace_copy() copies *i to result+(start-i). If *i==old_value, then replace_copy() copies new_value to result+(start-i). replace_copy() returns result+(finish-start).


Exactly finish - start comparisons between values are done.


See Also

replace(), replace_if(), replace_copy_if()

Standards Conformance

ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.2.4

Previous fileTop of DocumentContentsIndex pageNext file