A map: insert pair, find, end


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

int main()
{
  map<char, int> mapObject;
  int i;

  for(i = 0; i <10; i++) {
    mapObject.insert(pair<char, int>('A'+i, i));
  }

  char ch;
  cout << "Enter key: ";
  cin >> ch;

  map<char, int>::iterator p;
  
  p = mapObject.find(ch);
  if(p != mapObject.end()) 
    cout << p->second;
  else
    cout << "Key not in map.\n";

  return 0;
}

1.	A map of opposites.
2.	A map of word opposites, using strings.
3.	Cycle through a map using an iterator.
4.	Cycle through a map in reverse.
5.	Using [] in Map
6.	[] automatically inserts elements.
7.	Maps can store only unique keys.
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

A map: insert pair, find, end : Map « Data Structure « C++

Related examples in the same category