A map of word opposites, using strings. : Map « Data Structure « C++

1. C++
2. Data Structure
3. Map

A map of word opposites, using strings.

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

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

  mapObject.insert(pair<string, string>("yes", "no"));
  mapObject.insert(pair<string, string>("up", "down"));
  mapObject.insert(pair<string, string>("left", "right"));
  mapObject.insert(pair<string, string>("good", "bad"));

  string s;
  cout << "Enter word: ";
  cin >> s;

  map<string, string>::iterator p;
  
  p = mapObject.find(s);
  if(p != mapObject.end()) 
    cout << "Opposite: " << p->second;
  else
    cout << "Word not in map.\n";

  return 0;
}



           
       

Related examples in the same category

1.	A map: insert pair, find, end
2.	A map of opposites.
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