Login Register

std::unordered_map::key_eq

1	`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_map/key_eq

doc_CPP

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

std::unordered_map Defined in header <unordered_map> template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual =

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

operators (std::unordered_map) template< class Key, class T, class Hash, class KeyEqual, class Allocator > bool operator==( const unordered_map<Key,T,Hash,KeyEqual,Alloca

std::unordered_map::insert std::pair<iterator,bool> insert( const value_type& value ); (1) (since C++11) template< class P > std::pair<iterator,bool&g