//myMapequal_range1.cpp
#include <iostream>
#include <map>
#include <string>
using namespace std; 
//insertion compared with insert with pair
 int main()
 {
 map<string, string> m1,m2; 
 map<int,int>::size_type isize;
 map<string, string>::iterator it, mit;  
 typedef pair<string , string > my_pair; 
// inserting data using pair
m1.insert(my_pair("A1","Allela"));
m1.insert(my_pair("A2","Alexander Valley"));
m1.insert(my_pair("A","Alsac"));
m1.insert(my_pair("B","Barossa"));
m1.insert(my_pair("B1","Bordeux"));
m1.insert(my_pair("B2","Burgandy"));
m2.insert(my_pair("2","2001"));
// uisng map instances
m1["C"] ="Congnac"; 
m1["C1"] ="Chile"; 
m1["D"] ="Devon Valley"; 
//two iterators defining the range of single element
 pair<map<string, string>:: 
 	iterator,map<string, string>:: iterator>equal;
	// =m1.equal_range("2");

 for(it= m1.begin(); it !=m1.end(); it++)
 {
 	equal = m2.equal_range("2");

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