std::map::erase

Parameters

position

Iterator pointing to a single element to be removed from the map.
This shall point to a valid and dereferenceable element.
Member types iterator and const_iterator are bidirectional iterator types that point to elements.

k

Key of the element to be removed from the map.
Member type key_type is the type of the elements in the container, defined in map as an alias of its first template parameter (Key).

first, last

Iterators specifying a range within the map 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.
Member types iterator and const_iterator are bidirectional iterator types that point to elements.

Return value

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

// erasing from map
#include <iostream>
#include <map>
int main ()
{
  std::map<char,int> mymap;
  std::map<char,int>::iterator it;
  // insert some values:
  mymap['a']=10;
  mymap['b']=20;
  mymap['c']=30;
  mymap['d']=40;
  mymap['e']=50;
  mymap['f']=60;
  it=mymap.find('b');
  mymap.erase (it);                   // erasing by iterator
  mymap.erase ('c');                  // erasing by key
  it=mymap.find ('e');
  mymap.erase ( it, mymap.end() );    // erasing by range
  // show content:
  for (it=mymap.begin(); it!=mymap.end(); ++it)
    std::cout << it->first << " => " << it->second << '\n';
  return 0;
}

a => 10
d => 40

Complexity

Iterator validity

Data races

Exception safety

See also

map::clear

Clear content (public member function)

map::insert

Insert elements (public member function)

map::find

Get iterator to element (public member function)