|Category: algorithms ||Component type: function |
template <class InputIterator, class OutputIterator, class T>
OutputIterator remove_copy(InputIterator first, InputIterator last,
OutputIterator result, const T& value);
Remove_copy copies elements that are not equal to
value from the range
[first, last) to a range beginning at
result. The return value is the end of the resulting range. This operation is stable, meaning that the relative order of the elements that are copied is the same as in the range
Defined in the standard header algorithm, and in the nonstandard backward-compatibility header algo.h.
Requirements on types
InputIterator is a model of InputIterator.
OutputIterator is a model of OutputIterator.
InputIterator's value type is convertible to a type in
OutputIterator's set of value types.
T is a model of EqualityComparable.
Objects of type
T can be compared for equality with objects of
InputIterator's value type.
[first, last) is a valid range.
There is enough space in the output range to store the copied values. That is, if there are
n elements in
[first, last) that are not equal to
[result, result+n) is a valid range.
result is not an iterator in the range
last - first comparisons for equality, and at most
last - first assignments.
Print all nonzero elements of a vector on the standard output.