Difference between revisions of "cpp/algorithm/remove copy"
(→Example: +return) |
m (Text replace - " return 0; }" to "}") |
||
| Line 81: | Line 81: | ||
std::ostream_iterator<char>(std::cout), ' '); | std::ostream_iterator<char>(std::cout), ' '); | ||
std::cout << '\n'; | std::cout << '\n'; | ||
| − | |||
| − | |||
} | } | ||
| output= | | output= | ||
Revision as of 04:20, 24 August 2011
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 >OutputIterator remove_copy( InputIterator first,
InputIterator last,
OutputIterator d_first,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >OutputIterator remove_copy_if( InputIterator first,
InputIterator last,
OutputIterator d_first,
<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.
Contents |
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.
