|
 |
62bed18 |
diff -r -u blt2.4z.orig/src/bltTree.c blt2.4z/src/bltTree.c
|
|
|
62bed18 |
--- blt2.4z.orig/src/bltTree.c 2002-09-29 07:44:12.000000000 +0200
|
|
|
62bed18 |
+++ blt2.4z/src/bltTree.c 2004-11-05 12:27:45.797366712 +0100
|
|
|
62bed18 |
@@ -95,17 +95,16 @@
|
|
|
62bed18 |
*/
|
|
|
62bed18 |
|
|
|
62bed18 |
#define REBUILD_MULTIPLIER 3
|
|
|
62bed18 |
+#define START_LOGSIZE 5 /* Initial hash table size is 32. */
|
|
|
62bed18 |
+#define MAX_LIST_VALUES 20 /* Convert to hash table when node
|
|
|
62bed18 |
+ * value list gets bigger than this
|
|
|
62bed18 |
+ * many values. */
|
|
|
62bed18 |
|
|
|
62bed18 |
#if (SIZEOF_VOID_P == 8)
|
|
|
62bed18 |
#define RANDOM_INDEX(i) HashOneWord(mask, downshift, i)
|
|
|
62bed18 |
#define BITSPERWORD 64
|
|
|
62bed18 |
#else
|
|
|
62bed18 |
|
|
|
62bed18 |
-#define START_LOGSIZE 5 /* Initial hash table size is 32. */
|
|
|
62bed18 |
-#define MAX_LIST_VALUES 20 /* Convert to hash table when node
|
|
|
62bed18 |
- * value list gets bigger than this
|
|
|
62bed18 |
- * many values. */
|
|
|
62bed18 |
-
|
|
|
62bed18 |
/*
|
|
|
62bed18 |
* The following macro takes a preliminary integer hash value and
|
|
|
62bed18 |
* produces an index into a hash tables bucket list. The idea is
|