Add a one-item cache into the hash table. This reduces the number of hash computations by roughly 20%

darcs-hash:20070116163707-ac50b-214a16d4210d32fb50693e71a14b6b8f3fededfe.gz

1 files changed, 2 insertions, 0 deletions

diff --git a/util.h b/util.h
index c5590c4a..a84378e0 100644
--- a/util.h
+++ b/util.h
@@ -73,6 +73,8 @@ typedef struct hash_table
 {
 	/** The array containing the data */
 	hash_struct_t *arr;
+	/** A simple one item cache. This should always point to the index of the last item to be used */
+	int cache;	
 	/** Number of elements */
 	int count;
 	/** Length of array */