std::unordered_multiset::find
From cppreference.com
< cpp | container | unordered multiset
| 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.
Example
Run this code
#include <iostream> #include <unordered_set> int main() { std::unordered_multiset<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
See also
| returns the number of elements matching specific key (public member function) | |
| returns range of elements matching a specific key (public member function) |