Internal object that implements a key, value pair plus linked list. More...
#include <hashtable.h>
Data Fields | |
| void * | key |
| key (original) needed for comparisons | |
| void * | value |
| the item value being stored | |
| unsigned long | hashcode |
| save calculated hash-code of the key | |
| struct _cp_hashtable_entry * | next |
| link to next entry | |
Internal object that implements a key, value pair plus linked list.
Entries which are stored under the same index in the hashtable are stored in a linked list. The algorithm of the hashtable has to ensure that the lists do not get too long.
1.7.1