erase function is used to erase elements from the unordered_map. There are three type of erase functions supported by unordered_map :
- erasing by iterator: It takes an iterator as a parameter and erases the key and value present at that iterator.
Syntax
unordered_map.erase(const iterator);
- erasing by key: It takes a key as a parameter and erases the key and value.
Syntax
unordered_map.erase(const key);
- erase by range: It takes two iterators as a parameter and erases all the key and values present in between (including the starting iterator and excluding the end iterator).
Syntax:
unordered_map.erase(const iteratorStart, const iteratorEnd);
#include <bits/stdc++.h>
using namespace std;
int main()
{
unordered_map< int , bool > um;
um[12] = true ;
um[4189] = false ;
um[519] = true ;
um[40] = false ;
um[4991] = true ;
cout << "Contents of the unordered_map : \n" ;
for ( auto p : um)
cout << p.first << "==>" << p.second << "\n" ;
cout << "\n" ;
cout << "After erasing by Iterator : \n" ;
um.erase(um.begin());
for ( auto p : um)
cout << p.first << "==>" << p.second << "\n" ;
cout << "\n" ;
cout << "After erasing by Key : \n" ;
um.erase(4189);
for ( auto p : um)
cout << p.first << "==>" << p.second << "\n" ;
cout << "\n" ;
cout << "After erasing by Range : \n" ;
auto it = um.begin();
it++;
um.erase(it, um.end());
for ( auto p : um)
cout << p.first << "==>" << p.second << "\n" ;
cout << "\n" ;
return 0;
}
|
Output:
Contents of the unordered_map :
4991==>1
519==>1
40==>0
12==>1
4189==>0
After erasing by Iterator :
519==>1
40==>0
12==>1
4189==>0
After erasing by Key :
519==>1
40==>0
12==>1
After erasing by Range :
519==>1
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
24 Dec, 2018
Like Article
Save Article