KJS::HashTable Struct Reference
A hash table Usually the hashtable is generated by the create_hash_table script, from a .table file. More...
#include <lookup.h>
Collaboration diagram for KJS::HashTable:

Public Attributes | |
int | type |
type is a version number. | |
int | size |
size is the total number of entries in the hashtable, including the null entries, i.e. | |
const HashEntry * | entries |
pointer to the array of entries Mind that some entries in the array are null (0,0,0,0). | |
int | hashSize |
the maximum value for the hash. |
Detailed Description
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 72 of file lookup.h.
Member Data Documentation
|
type is a version number. Currently always 2 |
|
size is the total number of entries in the hashtable, including the null entries, i.e. the size of the "entries" array. Used to iterate over all entries in the table |
|
pointer to the array of entries Mind that some entries in the array are null (0,0,0,0).
|
|
the maximum value for the hash. Always smaller than size. |
The documentation for this struct was generated from the following file: