*Definitions*

*Definitions*

*
*A *hash function* for a Hashed Associative Container *X* is a Unary Function whose argument type is *X::key_type* and whose return type is *size_t*. A hash function must be deterministic (that is, it must always return the same value whenever it is called with the same argument), but return values of the hash function should be as uniform as possible: ideally, no two keys will hash to the same value. [2]

Elements in a Hashed Associative Container are organized into *buckets*. A Hashed Associative Container uses the value of the hash function to determine which bucket an element is assigned to.

The number of elements in a Hashed Associative Container divided by the number of buckets is called the *load factor*. A Hashed Associative Container with a small load factor is faster than one with a large load factor.