public member function
<unordered_map>
std::unordered_multimap::finditerator find ( const key_type& k );const_iterator find ( const key_type& k ) const;
Get iterator to element
Searches the container for an element with k as key and returns an iterator to it if found, otherwise it returns an iterator to unordered_multimap::end (the element past the end of the container).To obtain a range with all the elements whose key is k you can use member function equal_range.
Member types iterator and const_iterator are forward iterator types.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// unordered_multimap::find
#include <iostream>
#include <string>
#include <unordered_map>
int main ()
{
std::unordered_multimap<std::string,std::string> mymap = {
{"mom","church"},
{"mom","college"},
{"dad","office"},
{"bro","school"} };
std::cout << "one of the values for 'mom' is: ";
std::cout << mymap.find("mom")->second;
std::cout << std::endl;
return 0;
}
one of the values from 'mom' is: church
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4