std::set::erase

Parameters

position

Iterator pointing to a single element to be removed from the set.
Member types iterator and const_iterator are bidirectional iterator types that point to elements.

val

Value to be removed from the set.
Member type value_type is the type of the elements in the container, defined in set as an alias of its first template parameter (T).

first, last

Iterators specifying a range within the set 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

// erasing from set
#include <iostream>
#include <set>
int main ()
{
  std::set<int> myset;
  std::set<int>::iterator it;
  // insert some values:
  for (int i=1; i<10; i++) myset.insert(i*10);  // 10 20 30 40 50 60 70 80 90
  it = myset.begin();
  ++it;                                         // "it" points now to 20
  myset.erase (it);
  myset.erase (40);
  it = myset.find (60);
  myset.erase (it, myset.end());
  std::cout << "myset contains:";
  for (it=myset.begin(); it!=myset.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';
  return 0;
}

myset contains: 10 30 50

Complexity

Iterator validity

Data races

Exception safety

See also

set::clear

Clear content (public member function)

set::insert

Insert element (public member function)

set::find

Get iterator to element (public member function)