std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count

size_type count( const Key& key ) const;

size_type count( const Key& key, std::size_t hash ) const;

template< class K > 
size_type count( const K& x ) const;

template< class K > 
size_type count( const K& x, std::size_t hash ) const;

1) Returns the number of elements with key that compares equal to the specified argument key, which is either 1 or 0 since this container does not allow duplicates.

2) Returns the number of elements with key that compares equivalent to the specified argument x. This overload only participates in overload resolution if the qualified-id Hash::transparent_key_equal is valid and denotes a type. This assumes that such Hash is callable with both K and Key type, and that its key_equal is transparent, which, together, allows calling this function without constructing an instance of Key.

1) Number of elements with key key, that is either 1 or 0.

2) Number of elements with key that compares equivalent to x.