Difference between revisions of "cpp/algorithm/remove copy"

Revision as of 15:32, 19 April 2012

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

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

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

<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

Return value

iterator to the element past the last element copied.

Complexity

Exactly last - first applications of the predicate.

Possible implementation

Template:eq fun cpp

Example

#include <algorithm>
#include <iterator>
#include <string>
#include <iostream>
int main()
{
    std::string str = "Text with some   spaces";
    std::cout << "before: " << str << "\n";
 
    std::cout << "after:  ";
    std::remove_copy(str.begin(), str.end(),
                     std::ostream_iterator<char>(std::cout), ' ');
    std::cout << '\n';
}

before: Text with some   spaces
after:  Textwithsomespaces

See also