std::map<char,int> mymap; std::map<char, set<string> > mmap; mmap['a'].insert("hello"); mmap['a'].insert("hello1"); map<char, set<string> >::iterator iter = mmap.begin(); for(;iter!=mmap.end();++iter){ cout << iter->first << endl; set<string>::iterator itt = iter->second.begin(); for (; here! = iter-> second.end (); ++ here) { cout << *itt << endl; } } // first insert function version (single parameter): mymap.insert ( std::pair<char,int>('a',100) ); mymap.insert ( std::pair<char,int>('z',200) ); std::pair<std::map<char,int>::iterator,bool> ret; ret = mymap.insert ( std::pair<char,int>('z',500) ); if (ret.second==false) { std::cout << "element 'z' already existed"; std::cout << " with a value of " << ret.first->second << '\n'; }
std::map
Guess you like
Origin http://10.200.1.11:23101/article/api/json?id=327059886&siteId=291194637
Recommended
Ranking