Chapter 4. WvHashTable - type-safe hash tables and iterators

WvHashTable works a lot like WvLinkList, except it allows for fast indexing of objects in the table (or "dictionary") using the [] operator.

We implement a hash table as a fixed-size array of WvLinkLists. Someday, we might change the implementation to use a self-resizing array instead.

Iterators work with WvHashTable in exactly the same way as with WvLinkList.

WvHashTable usage is described more fully, along with examples, in wvhashtable.h.