dict: consider dummy entries when determining when to expand hash table

This issue was caused by the fix in 24b234543c7322d2dd20339b45367fa3f4c53495

Because we used closed hashing for the dict hash table, it is important
that the table doesn't get too full, as it gets very inefficient due to
hash collisions. When allowing for space, also consider dummy entries that
consume slots. If there are too many dummy slots, the hash table is expanded,
clearing out the dummy slots.

Without this fix it is possible to get unlucky when filling a dictionary
and emptying it again (twice) will result all slots become dummy slots
and thus no more entries can be added.

See REGTEST 54

Signed-off-by: Steve Bennett <steveb@workware.net.au>

1 files changed, 1 insertions, 0 deletions

diff --git a/jim.h b/jim.h
index 3021216..9e11260 100644
--- a/jim.h
+++ b/jim.h
@@ -478,6 +478,7 @@ typedef struct Jim_Dict {
     Jim_Obj **table;            /* Table of alternating key, value elements */
     int len;                    /* Number of used elements in table */
     int maxLen;                 /* Allocated length of table */
+    unsigned int dummy;         /* Number of dummy entries */
 } Jim_Dict;
 
 /* A command is implemented in C if isproc is 0, otherwise