|
|
|
|
|
|
|
| |
With this change inserting elements into a hashtable_t object is now
nearly as fast as inserting them into a linked_list_t object, whereas
before it was up to seven times slower. Additionally, the memory
footprint of a hashtable is now significantly smaller. The lookup
performance is also nearly doubled.
|