Login Register

std::unordered_multimap::count

size_type count( const Key& key ) const;

(1)

(since C++11)

Returns the number of elements with key key.

Parameters

key

-

key value of the elements to count

Return value

Number of elements with key key.

Complexity

linear in the number of elements with key key on average, worst case linear in the size of the container.

See also

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

Links:

http://en.cppreference.com/w/cpp/container/unordered_multimap/count

doc_CPP

2016-10-11 10:07:55

Comments

Leave a Comment

Please login to continue.

Popular Articles

std::unordered_multimap::unordered_multimap (1) explicit unordered_multimap( size_type bucket_count = /*implementation-defined*/, const Hash& hash = Hash(),

std::unordered_multimap::rehash void rehash( size_type count ); (since C++11) Sets the number of buckets to count and rehashes the container, i.e. puts the elements into app

operators (std::unordered_multimap) template< class Key, class T, class Hash, class KeyEqual, class Allocator > bool operator==( const unordered_multimap<Key,T,Hash,KeyEqual,A

std::unordered_multimap::bucket size_type bucket( const Key& key ) const; (since C++11) Returns the index of the bucket for key key. Elements (if any) with keys equivale

std::unordered_multimap::bucket_count size_type bucket_count() const; (since C++11) Returns the number of buckets in the container. Parameters (none). Return value The numbe