Erasing Elements while Iterating

Erasing elements from a std::unordered_set while iterating over it can lead to undefined behavior. The iterator can become invalidated after an erase operation, causing issues if you continue to use it.

However, std::unordered_set provides a safe way to erase elements during iteration using the return value of the erase() method:

1#include <iostream>
2#include <unordered_set>
3
4int main() {
5  std::unordered_set<int> Numbers{1, 2, 3, 4, 5};
6
7  auto it = Numbers.begin();
8  while (it != Numbers.end()) {
9    if (*it % 2 == 0) {
10      it = Numbers.erase(it);  
11    } else {
12      ++it;
13    }
14  }
15
16  for (int Num : Numbers) {
17    std::cout << Num << " ";
18  }
19}

11 3 5

When erasing an element, erase() returns an iterator to the next element in the container. By assigning the return value of erase() back to the iterator, we ensure that the iterator remains valid and points to the next element after the erased one.

In the example above, we safely erase all even numbers from the set while iterating over it. The odd numbers remain in the set, as seen in the output.