It seems like i have to compare every element in the map.
so is this efficient enough ?
for(iter = mymap.begin(); iter != mymap.end(); iter++)
cout << endl;
for(iter1 = mymap.begin(); iter1 != mymap.end(); iter1++)
if(*iter != *iter1)
// if two elements are equal, then print out "Equal"
cout << " iter: " << iter->second << " iter1: " << iter1->second << endl;
If not, please suggest a better solution.