Namespaces
Variants
Views
Actions

std::unordered_set::find

From cppreference.com
< cpp‎ | container‎ | unordered set
Revision as of 19:39, 31 May 2013 by P12bot (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 <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";
    }
}

Output:

Found 2

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