C / C++ / MFC

multimap<string, string> mymap;
string strKey;

:
:

multimap<string, string>::iterator it;
:
it = mymap.find( strKey );
if(it != mymap.end())
{
    do
    {
        cout << strKey << " = " << it->second << "\n";
        it++;
    }
    while( it != mymap.upper_bound( strKey ));
}

// MultiMap.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <string>
#include <map>

void Go()
{
	using namespace std;

	typedef multimap<int, string> Tmm;
	typedef Tmm::value_type TmmVal;
	typedef Tmm::const_iterator TmmIt;
	Tmm mm;

	mm.insert(TmmVal(1, "One"));
	mm.insert(TmmVal(1, "Single"));
	mm.insert(TmmVal(2, "Two"));
	mm.insert(TmmVal(2, "1+1"));
	mm.insert(TmmVal(2, "Duo"));
	mm.insert(TmmVal(3, "Three"));

	pair<TmmIt, TmmIt> ip = mm.equal_range(2);
	for (TmmIt it=ip.first; it!=ip.second; ++it)
	{
		cout << it->first << " : " << it->second << endl;
	}

}

int main(int argc, char* argv[])
{
	Go();

	return 0;
}

2 : Two
2 : 1+1
2 : Duo

john5632 wrote:

I am thinking to use std::map becuase of ease of searching.

Is map can hold more than 1 lakhs entires? If not what data strucure should I use to perform fast search opeartion?

   map<int,int> intMap;
for(int i=0;i<100000;i++)
{
    intMap.insert(map<int,int>::value_type(i,i));
}