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