//myMapequal_range2.cpp
#include <iostream>
#include <map>
#include <string>
using namespace std; 
//insertion compared with insert with pair
 int main()
 {
 map<string, int> m1,m2; 
 //map<int,int>::size_type isize;
 map<string, int>::iterator it, mit;  
 //won't compile-- pair<string , int > my_pair;
typedef pair<string , int > my_pair; 
//
m1.insert(my_pair("A1",1001));
m1.insert(my_pair("A2",1002));
m1.insert(my_pair("A3",1003));
m1.insert(my_pair("A4",1004));
//
m2.insert(my_pair("B1",2001));
//
//two iterators defining the range of single element
 pair<map<string, int>:: 
 	iterator,map<string, int>:: iterator>equal;
for(it= m1.begin(); it !=m1.end(); it++)
 {
 	equal = m2.equal_range("B1");

	cout<<"\n" << (*it).first << " ::: " << (*it).second; 
	for(mit=equal.first; mit!=equal.second; mit++)
	{
		cout<<"\n \t vintage " << (*mit).first 
		<< " ::" << (*mit).second; 
	}

 }
  
return 0;
}