void erase ( iterator position );
size_type erase ( const key_type& x );
void erase ( iterator first, iterator last ); |
|
Erase elements
Removes from the multimap container either a single element or a range of elements ([first,last)).
This effectively reduces the container size by the number of elements removed, calling each element's destructor.
Parameters
- position
- Iterator pointing to a single element to be removed from the multimap.
iterator is a member type, defined as a bidirectional iterator type.
- x
- Key value of the elements to be removed from the multimap.
key_type is a member type defined in multimap containers as an alias of Key, which is the first template parameter and the type of the elements' keys.
- first, last
- Iterators specifying a range within the multimap 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.
Return value
Only for the second version, the function returns the number of elements erased (which may be zero if
x does not match any element in the container).
Example
// erasing from multimap
#include <iostream>
#include <map>
using namespace std;
int main ()
{
multimap<char,int> mymultimap;
multimap<char,int>::iterator it;
// insert some values:
mymultimap.insert(pair<char,int>('a',10));
mymultimap.insert(pair<char,int>('b',20));
mymultimap.insert(pair<char,int>('b',30));
mymultimap.insert(pair<char,int>('c',40));
mymultimap.insert(pair<char,int>('d',50));
mymultimap.insert(pair<char,int>('d',60));
mymultimap.insert(pair<char,int>('e',70));
mymultimap.insert(pair<char,int>('f',80));
it=mymultimap.find('b');
mymultimap.erase (it); // erasing by iterator (1 element)
mymultimap.erase ('d'); // erasing by key (2 elements)
it=mymultimap.find ('e');
mymultimap.erase ( it, mymultimap.end() ); // erasing by range
// show content:
for ( it=mymultimap.begin() ; it != mymultimap.end(); it++ )
cout << (*it).first << " => " << (*it).second << endl;
return 0;
}
|
Output:
Complexity
For the first version (
erase(position) ), amortized constant.
For the second version (
erase(x) ), logarithmic in container
size plus linear in number of element removed (destructors).
For the last version (
erase(first,last) ), logarithmic in container
size plus linear in the distance between
first and
last.
See also
