std::multiset<Key,Compare,Allocator>::count (3) - Linux Manuals

std::multiset<Key,Compare,Allocator>::count: std::multiset<Key,Compare,Allocator>::count

NAME

std::multiset<Key,Compare,Allocator>::count - std::multiset<Key,Compare,Allocator>::count

Synopsis


size_type count( const Key& key ) const; (1)
template< class K > (2) (since C++14)
size_type count( const K& x ) const;


Returns the number of elements with key that compares equivalent to the specified argument.
1) Returns the number of elements with key key.
2) Returns the number of elements with key that compares equivalent to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. They allow calling this function without constructing an instance of Key.

Parameters


key - key value of the elements to count
x - alternative value to compare to the keys

Return value


Number of elements with key that compares equivalent to key or x.

Complexity


Logarithmic in the size of the container plus linear in the number of the elements found.

See also


            finds element with specific key
find (public member function)
            returns range of elements matching a specific key
equal_range (public member function)