Question

use C++ std:: map.

Use necessary methods from the library.

First Name	Last Name
“Jane”	“Smith”
“John”	“Do”
“Susan”	“Collins”
“Bill”	“Rodgers”
“Eric”	“Jones”
“Bill”	“Wright”
“Mike”	“Bader”

Use Conventional Method Names Insert, Remove, Search:

insert(key, value)

insert(“First”, “Last”)

Search(“First”) → Method will return value

Remove(“First”) → Method will delete key and value

Answer 1

/*
 *  C++ Program to perform basic operations on STL MAP
 */

#include <iostream>
#include <string>
#include <map>
#include <iterator>

using namespace std;

map <string, string> names;

void insert(string key, string value)
{
  names.insert(pair<string, string>(key, value));
}

string search(string key)
{
  return names[key];
}

void remove(string key)
{
  names.erase(key);
}

void display()
{
  map <string, string>::iterator it;

  for (it = names.begin(); it != names.end(); ++it)
  {
    cout << it->first << ' ' << it->second << endl;
  }
}

int main()
{
  insert("Jane", "Smith");
  insert("John","Do");
  insert("Susan","Collins");
  insert("Bill","Rodgers");
  insert("Eric","Jones");
  insert("Billy","Wright");
  insert("Mike","Bader");

  cout << "Results after insertion -" << endl;
  display();
  cout << endl;

  string toSearch = "John";
  cout << "Search Results for " << toSearch << ": " << search(toSearch) << endl << endl;

  string toRemove = "Mike";
  remove(toRemove);
  cout << "Result after removing " << toRemove <<" -"<< endl;
  display();

  return 0;
}
/*  Program ends here */

Note: For queries, drop comment.