std::unordered_set::find
From cppreference.com
< cpp | container | unordered set
iterator find( const Key& key ); |
(1) | |
const_iterator find( const Key& key ) const; |
(2) | |
1,2) Finds an element with key equivalent to
key
.
Parameters
key | - | key value of the element to search for
|
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.
Complexity
Constant on average, worst case linear in the size of the container.