Remove pair from map by key - C++ STL

Description

Remove pair from map by key

Demo Code

#include <iostream>
#include <string>
#include <map>
using namespace std;
void show(const char *msg, map<string, int> mp);
int main() {/*from ww  w.  j  av a  2 s. com*/
   // Declare an empty map that holds key/value pairs
   // in which the key is a string and the value is an int.
   map<string, int> m;
   // Insert characters into m. An iterator to the inserted
   // object is returned.
   m.insert(pair<string, int>("Alpha", 100));
   m.insert(pair<string, int>("Gamma", 300));
   m.insert(pair<string, int>("Beta", 200));
   // Declare an iterator to a map<string, itr>.
   map<string, int>::iterator itr;
   // Declare a reverse iterator to a map<string, itr>.
   map<string, int>::reverse_iterator ritr;
   // Create another map that is the same as the first.
   map<string, int> m2(m);
   show("Contents of m2: ", m2);
   // Remove the Beta from m.
   m.erase("Beta");
   show("m after removing Beta: ", m);
   return 0;
}
// Display the contents of a map<string, int> by using
// an iterator.
void show(const char *msg, map<string, int> mp) {
   map<string, int>::iterator itr;
   cout << msg << endl;
   for(itr=mp.begin(); itr != mp.end(); ++itr)
      cout << "  " << itr->first << ", " << itr->second << endl;
   cout << endl;
}

Result

• Previous
• Next

Related Tutorials

• Creates a map that works as a phone directory, in which a person's name is the key and the phone number is the value.
• Remove all pair from map using clear()
• Exchange the contents of two map
• Compare two map for lexicographical compare, the first non-matching element in the container determines the order
• Create pair from string and int, then add to map