A hash table Usually the hashtable is generated by the create_hash_table script, from a .table file.
The implementation uses an array of entries, "size" is the total size of that array. The entries between 0 and hashSize-1 are the entry points for each hash value, and the entries between hashSize and size-1 are the overflow entries for the hash values that need one. The "next" pointer of the entry links entry points to overflow entries, and links overflow entries between them.
Definition at line 74 of file lookup.h.