Login Register

std::unordered_set::key_eq

key_equal key_eq() const;

(since C++11)

Returns the function that compares keys for equality.

Parameters

(none).

Return value

The key comparison function.

Complexity

Constant.

See also

returns function used to hash the keys
(public member function)

Links:

http://en.cppreference.com/w/cpp/container/unordered_set/key_eq

doc_CPP

2016-10-11 10:08:07

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

std::unordered_set::find iterator find( const Key& key ); (1) const_iterator find( const Key& key ) const; (2) 1,2) Finds an element with key equivalen

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