(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
size_type count(const Key& key)const; | (1) | (since C++23) (constexpr since C++26) |
template<class K> size_type count(const K& x)const; | (2) | (since C++23) (constexpr since C++26) |
Returns the number of elements with key that compares equivalent to the specified argument.
Compare istransparent. It allows calling this function without constructing an instance ofKey.Contents |
| key | - | key value of the elements to count |
| x | - | alternative value to compare to the keys |
Number of elements with key that compares equivalent tokey orx.
Logarithmic in the size of the container plus linear in the number of elements found.
| This section is incomplete Reason: no example |
| finds element with specific key (public member function)[edit] | |
| returns range of elements matching a specific key (public member function)[edit] |
