Demonstrating a multimap.

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

int main()
{
  multimap<string, string> names;
  string n;

  names.insert(pair<string, string>("Z", "F"));
  names.insert(pair<string, string>("Z", "A"));

  names.insert(pair<string, string>("S", "T"));
  names.insert(pair<string, string>("S", "A"));
  names.insert(pair<string, string>("S", "J"));

  names.insert(pair<string, string>("D", "H"));
  names.insert(pair<string, string>("D", "W"));
  names.insert(pair<string, string>("D", "R"));

  multimap<string, string>::iterator p;
  
  cout << "Enter last name: ";
  cin >> n;

  p = names.find(n);
  if(p != names.end()) { // found a name
    do {
      cout << n << ", " << p->second;
      cout << endl;
      p++;
    } while (p != names.upper_bound(n));
  }
  else{
    cout << "Name not found.\n";
  }
  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.	Maps can store only unique keys.
9.	Use a map to create a phone directory: string class
10.	Use the greater function object in Map
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

Demonstrating a multimap. : Map « Data Structure « C++

Related examples in the same category