Login Register

std::unordered_map::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

Constant 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_map/count

doc_CPP

2016-10-11 10:07:48

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

std::unordered_map Defined in header <unordered_map> template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual =

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

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

std::unordered_map::empty bool empty() const; (since C++11) Checks if the container has no elements, i.e. whether begin() == end(). Parameters (none). Return valu