Demonstrating multiset erase a found element : multiset erase « Set Multiset « C++






  1. C++
  2. Set Multiset
  3. multiset erase

Demonstrating multiset erase a found element

  
 
#include <iostream>
#include <cassert>
#include <list>
#include <string>
#include <set>
using namespace std;
#include <functional>

int main()
{
  string s("There is no distinctly native American criminal class");

  list<char> list1(s.begin(), s.end());

  // Put the characters in list1 into multiset1:
  multiset<char> multiset1;
  copy(list1.begin(), list1.end(),inserter(multiset1, multiset1.end()));
  multiset1.erase('a');

  multiset<char>::iterator i = multiset1.find('e');

  multiset1.erase(i);


  multiset<char>::iterator k;
  for (k = multiset1.begin(); k != multiset1.end(); ++k)
    cout << *k;

  return 0;
}

 /* 
       ATccccdeeehiiiiiiilllmmnnnnnorrrsssstttvy"
 */








Related examples in the same category

1.Remove all elements up to element with value 3
2.Remove all elements with value 5
3.Demonstrating multiset erase functions: erase a range
4.Demonstrating multiset erase functions
5.Using the erase Member Function on a Multiset