Login Register

std::unordered_set::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_set/hash_function

doc_CPP

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

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

std::unordered_set::erase iterator erase( const_iterator pos ); (1) (since C++11) iterator erase( const_iterator first, const_iterator last ); (2) (since C++11) s

std::unordered_set::insert std::pair<iterator,bool> insert( const value_type& value ); (1) (since C++11) std::pair<iterator,bool> insert( value_type&

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