std::unordered_multiset::erase

Parameters

position

Iterator pointing to a single element to be removed from the unordered_multiset.
Member type const_iterator is a forward iterator type.

k

Value of the elements to be erased.
Member type key_type is the type of the elements in the container. In unordered_multiset containers it is the same as value_type, defined as an alias of the class's first template parameter (Key).

first, last

Iterators specifying a range within the unordered_multiset container to be removed: [first,last). i.e., the range includes all the elements between first and last, including the element pointed by first but not the one pointed by last.
Notice that unordered_multiset containers do not follow any particular order to organize its elements, therefore the effect of range deletions may not be easily predictable.
Member type const_iterator is a forward iterator type.

Return value

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

// unordered_multiset::erase
#include <iostream>
#include <string>
#include <unordered_set>
int main ()
{
  std::unordered_multiset<std::string> myums =
  {"fish","duck","cow","cow","pig","hen","sheep"};
  myums.erase ( myums.begin() );                    // erasing by iterator
  myums.erase ( "sheep" );                          // erasing by key
  myums.erase ( myums.find("fish"), myums.end() );  // erasing by range
  std::cout << "myums contains:";
  for ( const std::string& x: myums ) std::cout << " " << x;
  std::cout << std::endl;
  return 0;
}

myums contains: pig cow cow

Complexity

Iterator validity

See also

unordered_multiset::clear

Clear content (public member function)

unordered_multiset::insert

Insert elements (public member function)

unordered_multiset::find

Get iterator to element (public member function)