From 7c7d3e26da0e9e49c3b179403a7b9217d4e9cb18 Mon Sep 17 00:00:00 2001 From: Eric Anholt Date: Tue, 24 Nov 2009 03:02:38 +0100 Subject: Add deleted entry management by rehashing on insert when appropriate. --- README | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'README') diff --git a/README b/README index 877314b..be2fe40 100644 --- a/README +++ b/README @@ -37,8 +37,8 @@ Performance considerations: This means that a table that was filled, then emptied, will have performance for unsuccessful searches in O(hash->size) - The solution here is to decide when the table is too full of deleted - entries and recompute the data into a clean version of the hashtable. + This is worked around in practice by later inserts into a hash table + with many deletes in it triggering a rehash at the current size. * The data pointer increases space consumption for the hash table by around 50% -- cgit v1.2.3