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


[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 <unordered_set>
int main()
    std::unordered_set<int> example = {1, 2, 3, 4};
    auto search = example.find(2);
    if(search != example.end()) {
        std::cout << "Found " << (*search) << '\n';
    else {
        std::cout << "Not found\n";


Found 2

[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)