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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
implement Int_Hashtab;
include "sys.m";
include "draw.m";
include "tk.m";
include "tcl.m";
include "tcllib.m";
include "utils.m";
hashasu(key : string,n : int): int{
i, h : int;
h=0;
i=0;
while(i<len key){
h = 10*h + key[i];
h = h%n;
i++;
}
return h%n;
}
alloc(size : int) : ref IHash {
h : IHash;
t : list of H_link;
t=nil;
h.size= size;
h.tab = array[size] of {* => t};
return ref h;
}
IHash.insert(h : self ref IHash,name: string,val:int) : int {
link : H_link;
hash,found : int;
nlist : list of H_link;
nlist=nil;
found=0;
hash = hashasu(name,h.size);
tmp:=(h.tab)[hash];
for(;tmp!=nil;tmp = tl tmp){
link=hd tmp;
if (link.name==name){
found=1;
link.val = val;
}
nlist = link :: nlist;
}
if (!found){
link.name=name;
link.val=val;
(h.tab)[hash]= link :: (h.tab)[hash];
}else
(h.tab)[hash]=nlist;
return 1;
}
IHash.find(h : self ref IHash,name : string) : (int, int){
hash,flag : int;
nlist : list of H_link;
retval:=0;
flag=0;
nlist=nil;
hash = hashasu(name,h.size);
tmp:=(h.tab)[hash];
for(;tmp!=nil;tmp = tl tmp){
link:=hd tmp;
if ((hd tmp).name==name){
flag = 1;
retval = (hd tmp).val;
}
nlist = link :: nlist;
}
(h.tab)[hash]=nlist;
return (flag,retval);
}
IHash.delete(h : self ref IHash,name : string) : int {
hash,flag : int;
nlist : list of H_link;
flag=0;
nlist=nil;
hash = hashasu(name,h.size);
tmp:=(h.tab)[hash];
for(;tmp!=nil;tmp = tl tmp){
link:=hd tmp;
if (link.name==name)
flag = 1;
else
nlist = link :: nlist;
}
(h.tab)[hash]=nlist;
return flag;
}
|
