std::remove_copy, std::remove_copy_if

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class OutputIterator, class T >

OutputIterator remove_copy( InputIterator first,
                            InputIterator last,
                            OutputIterator d_first,

                            const T& value );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class OutputIterator, class UnaryPredicate >

OutputIterator remove_copy_if( InputIterator first,
                               InputIterator last,
                               OutputIterator d_first,

                               UnaryPredicate p );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Copies elements from the range [first, last), to another range beginning at d_first, omitting the elements which satisfy specific criteria. The first version ignores the elements that are equal to value, the second version ignores the elements for which predicate p returns Template:cpp. Source and destination ranges cannot overlap.

Parameters

first, last	-	the range of elements to copy
d_first	-	the beginning of the destination range.
value	-	the value of the elements not to copy

Return value

iterator to the element past the last element copied.

Complexity

Exactly last - first applications of the predicate.

See also

Template:cpp/algorithm/dcl list remove