Highlevel lib: use dynamically resized hash table

Use dynamically resized hash table for looking up by name and node ID.

The chosen implementation is linear hashing, which features gradual
rehashing when while the size of the table increases.

1 files changed, 5 insertions, 0 deletions

diff --git a/ChangeLog b/ChangeLog
index 2cf7052..1a9e602 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,8 @@
+2010-12-13  Miklos Szeredi <miklos@szeredi.hu>
+
+	* Highlevel lib: use dynamically resized hash table for looking up
+	by name and node ID.
+
 2010-11-10  Miklos Szeredi <miklos@szeredi.hu>
 
 	* Add new write_buf() method to the highlevel API.  Similarly to