#include <hashlib.h>
Data Fields | |
| ub4 | tablesize |
| t_cf_hash_cleanup | destroy |
| t_cf_hash_entry ** | table |
Definition at line 74 of file hashlib.h.
|
|
For element cleanups we need a callback function. This callback function has to cleanup the structure we saved. |
|
|
We save only pointers because in each element we have a linked list of elements |
|
|
The higher the tablesize, the smaller the possibility of a double hash value. This goes on the cost of memory... a pointer to a t_cf_hashentry type has 4 byte, so 512 entries have 2048 bytes (2kb!). This is very big... so be patiant! |
1.3.5