HashTableDef

Hash Table

Our current implementation of the hash table uses a chained approach. Each bucket is represented with a linked list, and the object is constructed with a fixed number of buckets. The hash table can delete its elements upon destruction (this is known as adoption), or it can allow the user to retain ownership. Each of this mechanisms is used at some point within the library. The hash table was designed to be flexible, and allows custom hash functions to be set. It also supports 'foreach' operations, given users a function object to traverse data with. It also contains iterators to allow the user to traverse the data within the hash.
The hash table is most notably used as the data model for TREs and for extension segments.