<hash_map> Members

Reference

Hash_map version	Hash_multimap version	Description
operator!= (hash_map)	operator!= (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is not equal to the hash_map or hash_multimap object on the right side.
operator< (hash_map)	operator< (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is less than the hash_map or hash_multimap object on the right side.
operator<= (hash_map)	operator<= (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is less than or equal to the hash_map or hash_multimap object on the right side.
operator== (hash_map)	operator== (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is equal to the hash_map or hash_multimap object on the right side.
operator> (hash_map)	operator> (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is greater than the hash_map or hash_multimap object on the right side.
operator>= (hash_map)	operator>= (hash_multimap)	Tests if the hash_map or hash_multimap object on the left side of the operator is greater than or equal to the hash_map or hash_multimap object on the right side.

Hash_map version	Hash_multimap version	Description
swap (hash_map)	swap (hash_multimap)	Exchanges the elements of two hash_maps or hash_multimaps.

hash_compare Class	Describes an object that can be used by any of the hash associative containers — hash_map, hash_multimap, hash_set, or hash_multiset — as a default Traits parameter object to order and hash the elements they contain.
value_compare Class	Provides a function object that can compare the elements of a hash_map by comparing the values of their keys to determine their relative order in the hash_map.
hash_map Class	Used for the storage and fast retrieval of data from a collection in which each element is a pair that has a sort key whose value is unique and an associated data value.
hash_multimap Class	Used for the storage and fast retrieval of data from a collection in which each element is a pair that has a sort key whose value need not be unique and an associated data value.