std::unordered_multiset::find
From cppreference.com
< cpp | container | unordered multiset
| iterator find( const Key& key ); |
||
| const_iterator find( const Key& key ) const; |
||
Finds an element with key key.
Contents |
[edit] Parameters
| key | - | key value of the element to search for |
[edit] Return value
Iterator to an element with key key. If no such element is found, past-the-end (see end()) iterator is returned.
[edit] Complexity
Amortized 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) | |
