A hash table consists of: a class type, a parent type, and a set of key-value pairs. The keys and values can be anything. The access functions below accept a key and return the corresponding value. For details of the mechanism underlying this, see hashing.
There is a subclass of HashTable called MutableHashTable which consists of those hash tables whose entries can be changed.
Access functions:
Query functions:
Structural functions:
Other functions:
Examining hash tables:
Types of hash tables:
Go to main index.
Go to concepts index.