std::unordered_multiset::count
From cppreference.com
< cpp | container | unordered multiset
| size_type count( const Key& key ) const;
|
(1) | (since C++11) |
Returns the number of elements with key key.
Contents |
[edit] Parameters
| key | - | key value of the elements to count |
[edit] Return value
Number of elements with key key.
[edit] Complexity
Constant on average, worst case linear in the size of the container.
Notes
Typical implementations execute one constant-type hash lookup followed by as many equality comparisons as there are elements with the keys that compare equal to key, so the actual complexity is linear in the number of matching elements.
[edit] See also
| finds element with specific key (public member function) |
|
| returns range of elements matching a specific key (public member function) |
|