summaryrefslogtreecommitdiff
path: root/README
diff options
context:
space:
mode:
Diffstat (limited to 'README')
-rw-r--r--README6
1 files changed, 4 insertions, 2 deletions
diff --git a/README b/README
index be2fe40..fb85a68 100644
--- a/README
+++ b/README
@@ -13,8 +13,10 @@ with rehashing. The table stores for each entry:
* pointer to the data.
Inserts occur at key->hash % hash->size. When an insert collides, the insert
-reattempts at (key->hash % hash->size + hash->reprobe) % hash->size, and
-onwards at increments of reprobe until a free or dead entry is found.
+steps through the table using the reprobe stride until a free or dead entry is
+found. When an insert occurs with a key matching a key already in the table,
+the new data is associated with the key. Note that old key/data is not freed,
+so if memory management is required, do a search before insert.
When searching, the search starts at key % hash_size and continues at
increments of reprobe as with inserts, until the matching entry or an