Maps can store only unique keys.

#include <iostream>
#include <map>
using namespace std;

int main()
{
  map<char, int> mapObject;
  pair<map<char,int>::iterator, bool> res;

  res = mapObject.insert(pair<char, int>('A', 65));
  if(res.second) 
     cout << "Insertion occured.\n";

  res = mapObject.insert(pair<char, int>('A', 99));
  if(!res.second) 
     cout << "Duplicate not allowed.\n";

  map<char, int>::iterator p;
  
  p = mapObject.find('A');
  cout << "Its ASCII value is " << p->second;

  return 0;
}

1.	A map: insert pair, find, end
2.	A map of opposites.
3.	A map of word opposites, using strings.
4.	Cycle through a map using an iterator.
5.	Cycle through a map in reverse.
6.	Using [] in Map
7.	[] automatically inserts elements.
8.	Use a map to create a phone directory: string class
9.	Use the greater function object in Map
10.	Demonstrating a multimap.
11.	Use a multimap to create the phone directory.
12.	A simple map: char and int
13.	Use a map of strings to create a phone directory.
14.	File and map

Maps can store only unique keys. : Map « Data Structure « C++

Related examples in the same category