Namespaces
Variants
Views
Actions

std::unordered_map::find

From cppreference.com
iterator find( const Key& key );
(1)
const_iterator find( const Key& key ) const;
(2)
1,2) Finds an element with key equivalent to key.


Contents

[edit] Parameters

key - key value of the element to search for


[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

Constant on average, worst case linear in the size of the container.

[edit] Example

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

Output:

Found 1 a

[edit] See also

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