1 --- blt2.4z/src/bltTree.c.64bit-fixes 2002-09-29 07:44:12.000000000 +0200
2 +++ blt2.4z/src/bltTree.c 2003-07-31 12:22:53.000000000 +0200
3 @@ -95,17 +95,16 @@ static Value *TreeNextValue _ANSI_ARGS_(
6 #define REBUILD_MULTIPLIER 3
7 +#define START_LOGSIZE 5 /* Initial hash table size is 32. */
8 +#define MAX_LIST_VALUES 20 /* Convert to hash table when node
9 + * value list gets bigger than this
12 #if (SIZEOF_VOID_P == 8)
13 #define RANDOM_INDEX(i) HashOneWord(mask, downshift, i)
14 #define BITSPERWORD 64
17 -#define START_LOGSIZE 5 /* Initial hash table size is 32. */
18 -#define MAX_LIST_VALUES 20 /* Convert to hash table when node
19 - * value list gets bigger than this
23 * The following macro takes a preliminary integer hash value and
24 * produces an index into a hash tables bucket list. The idea is