< cpp‎ | container‎ | multimap

iterator find( const Key& key );
const_iterator find( const Key& key ) const;
template< class K > iterator find( const K& x );
(3) (since C++14)
template< class K > const_iterator find( const K& x ) const;
(4) (since C++14)
1,2) Finds an element with key equivalent to key. If there are several elements with key in the container, any of them may be returned.
3,4) Finds an element with key that compares equivalent to the value x. These templates only participate in overload resolution if the type Compare::is_transparent exists. They allow calling this function without constructing an instance of Key


[edit] Parameters

key - key value of the element to search for
x - a value of any type that can be transparently compared with a key

[edit] Return value

Iterator to an element with key equivalent to key. If no such element is found, past-the-end (see end()) iterator is returned.

[edit] Complexity

Logarithmic in the size of the container.

[edit] Example

#include <iostream>
#include <map>
int main()
    std::multimap<int,char> example = {{1,'a'},{2,'b'}};
    auto search = example.find(2);
    if(search != example.end()) {
        std::cout << "Found " << search->first << " " << search->second << '\n';
    else {
        std::cout << "Not found\n";


Found 2 b

[edit] See also

returns the number of elements matching specific key
(public member function)
returns range of elements matching a specific key
(public member function)