Login Register

std::unordered_multiset::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_multiset/hash_function

doc_CPP

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

std::unordered_multiset Defined in header <unordered_set> template< class Key, class Hash = std::hash<Key>, class KeyEqual = std::equal_to

std::unordered_multiset::reserve void reserve( size_type count ); (since C++11) Sets the number of buckets to the number needed to accomodate at least count elements without

std::unordered_multiset::size size_type size() const; (since C++11) Returns the number of elements in the container, i.e. std::distance(begin(), end()). Parameters (non

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