1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/* $Header: hash.h,v 4.0 91/03/20 01:57:53 lwall Locked $
*
* Copyright (c) 1989, Larry Wall
*
* You may distribute under the terms of the GNU General Public License
* as specified in the README file that comes with the perl 3.0 kit.
*
* $Log: hash.h,v $
* Revision 4.0 91/03/20 01:57:53 lwall
* 4.0 baseline.
*
*/
#define FILLPCT 60 /* don't make greater than 99 */
#ifdef DOINIT
char coeff[] = {
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1,
61,59,53,47,43,41,37,31,29,23,17,13,11,7,3,1};
#else
extern char coeff[];
#endif
typedef struct hentry HENT;
struct hentry {
HENT *hent_next;
char *hent_key;
STR *hent_val;
int hent_hash;
};
struct htbl {
HENT **tbl_array;
int tbl_max;
int tbl_fill;
int tbl_riter; /* current root of iterator */
HENT *tbl_eiter; /* current entry of iterator */
};
STR *hfetch();
bool hstore();
bool hdelete();
HASH *hnew();
int hiterinit();
HENT *hiternext();
char *hiterkey();
STR *hiterval();
|
