Login Register

std::unordered_multimap::hash_function

hasher hash_function() const;

(since C++11)

Returns the function that hashes the keys.

Parameters

(none).

Return value

The hash function.

Complexity

Constant.

See also

returns the function used to compare keys for equality
(public member function)

Links:

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

doc_CPP

2016-10-11 10:07:56

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 Defined in header <unordered_map> template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual =

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

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