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.
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] See also
| returns the number of elements matching specific key (public member function) |
|
| returns range of elements matching a specific key (public member function) |
|