stl remove algorithm

/*********************************************************************** * File : remove.cpp * Author : Saurabh Gupta * Desc : stl remove algorithm c++ * Source : http://ccplusplus/2011/10/standard-template-library.html * Created : PM 10:44 09 January 2012 * Note : ************************************************************************/ #include <iostream> #include <list> #include <algorithm> #include <iterator> using namespace std; int main() { list<int> coll; //insert elements from 6 to 1 and 1 to 6 for (int i=1; i<=6; ++i) { coll.push_front(i); coll.push_back(i); } //print all elements of the collection copy (coll.begin(), coll.end(), ostream_iterator<int>(cout," ")); cout << endl; //remove all elements with value 3 // - retain new end list<int>::iterator end = remove (coll.begin(), coll.end(), 3); //print resulting elements of the collection copy (coll.begin(), end, ostream_iterator<int>(cout," ")); cout << endl; //print number of resulting elements cout << "number of removed elements: " << distance(end,coll.end()) << endl; //remove "removed'' elements coll.erase (end, coll.end()); //print all elements of the modified collection copy (coll.begin(), coll.end(), ostream_iterator<int>(cout," ")); cout << endl; } /* * OUTPUT * [sgupta@rhel6x64 algorithm]$ c++ remove.cpp -o remove [sgupta@rhel6x64 algorithm]$ ./remove 6 5 4 3 2 1 1 2 3 4 5 6 6 5 4 2 1 1 2 4 5 6 number of removed elements: 2 6 5 4 2 1 1 2 4 5 6 [sgupta@rhel6x64 algorithm]$ */

See Also:

Standard Template Library Concepts and sample codes in C++