/
hashcons.ml.html
281 lines (247 loc) · 19.8 KB
/
hashcons.ml.html
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
<html><body>
<pre><font color="990000">(**************************************************************************)</font>
<font color="990000">(* *)</font>
<font color="990000">(* Copyright (C) Jean-Christophe Filliatre *)</font>
<font color="990000">(* *)</font>
<font color="990000">(* This software is free software; you can redistribute it and/or *)</font>
<font color="990000">(* modify it under the terms of the GNU Library General Public *)</font>
<font color="990000">(* License version 2.1, with the special exception on linking *)</font>
<font color="990000">(* described in file LICENSE. *)</font>
<font color="990000">(* *)</font>
<font color="990000">(* This software is distributed in the hope that it will be useful, *)</font>
<font color="990000">(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)</font>
<font color="990000">(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)</font>
<font color="990000">(* *)</font>
<font color="990000">(**************************************************************************)</font>
<font color="990000">(*s Hash tables for hash-consing. (Some code is borrowed from the ocaml</font>
<font color="990000"> standard library, which is copyright 1996 INRIA.) *)</font>
<font color="green">type</font> 'a hash_consed = {
hkey : int;
tag : int;
node : 'a }
<font color="green">let</font> gentag =
<font color="green">let</font> r = ref 0 <font color="green">in</font>
<font color="green">fun</font> () -> incr r; !r
<font color="green">type</font> 'a t = {
<font color="green">mutable</font> table : 'a hash_consed <font color="0033cc">Weak</font>.t array;
<font color="green">mutable</font> totsize : int; <font color="990000">(* sum of the bucket sizes *)</font>
<font color="green">mutable</font> limit : int; <font color="990000">(* max ratio totsize/table length *)</font>
}
<font color="green">let</font> create sz =
<font color="green">let</font> sz = <font color="77aaaa">if</font> sz < 7 <font color="77aaaa">then</font> 7 <font color="77aaaa">else</font> sz <font color="green">in</font>
<font color="green">let</font> sz = <font color="77aaaa">if</font> sz > <font color="0033cc">Sys</font>.max_array_length <font color="77aaaa">then</font> <font color="0033cc">Sys</font>.max_array_length <font color="77aaaa">else</font> sz <font color="green">in</font>
<font color="green">let</font> emptybucket = <font color="0033cc">Weak</font>.create 0 <font color="green">in</font>
{ table = <font color="0033cc">Array</font>.create sz emptybucket;
totsize = 0;
limit = 3; }
<font color="green">let</font> clear t =
<font color="green">let</font> emptybucket = <font color="0033cc">Weak</font>.create 0 <font color="green">in</font>
<font color="77aaaa">for</font> i = 0 <font color="77aaaa">to</font> <font color="0033cc">Array</font>.length t.table - 1 <font color="77aaaa">do</font> t.table.(i) <- emptybucket <font color="77aaaa">done</font>;
t.totsize <- 0;
t.limit <- 3
<font color="green">let</font> fold f t init =
<font color="green">let</font> <font color="green">rec</font> fold_bucket i b accu =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> accu <font color="77aaaa">else</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get b i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> fold_bucket (i+1) b (f v accu)
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> fold_bucket (i+1) b accu
<font color="green">in</font>
<font color="0033cc">Array</font>.fold_right (fold_bucket 0) t.table init
<font color="green">let</font> iter f t =
<font color="green">let</font> <font color="green">rec</font> iter_bucket i b =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> () <font color="77aaaa">else</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get b i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> f v; iter_bucket (i+1) b
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> iter_bucket (i+1) b
<font color="green">in</font>
<font color="0033cc">Array</font>.iter (iter_bucket 0) t.table
<font color="green">let</font> count t =
<font color="green">let</font> <font color="green">rec</font> count_bucket i b accu =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> accu <font color="77aaaa">else</font>
count_bucket (i+1) b (accu + (<font color="77aaaa">if</font> <font color="0033cc">Weak</font>.check b i <font color="77aaaa">then</font> 1 <font color="77aaaa">else</font> 0))
<font color="green">in</font>
<font color="0033cc">Array</font>.fold_right (count_bucket 0) t.table 0
<font color="green">let</font> next_sz n = min (3*n/2 + 3) (<font color="0033cc">Sys</font>.max_array_length - 1)
<font color="green">let</font> <font color="green">rec</font> resize t =
<font color="green">let</font> oldlen = <font color="0033cc">Array</font>.length t.table <font color="green">in</font>
<font color="green">let</font> newlen = next_sz oldlen <font color="green">in</font>
<font color="77aaaa">if</font> newlen > oldlen <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> newt = create newlen <font color="green">in</font>
newt.limit <- t.limit + 100; <font color="990000">(* prevent resizing of newt *)</font>
fold (<font color="green">fun</font> d () -> add newt d) t ();
t.table <- newt.table;
t.limit <- t.limit + 2;
<font color="990099">end</font>
<font color="green">and</font> add t d =
<font color="green">let</font> index = d.hkey mod (<font color="0033cc">Array</font>.length t.table) <font color="green">in</font>
<font color="green">let</font> bucket = t.table.(index) <font color="green">in</font>
<font color="green">let</font> sz = <font color="0033cc">Weak</font>.length bucket <font color="green">in</font>
<font color="green">let</font> <font color="green">rec</font> loop i =
<font color="77aaaa">if</font> i >= sz <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> newsz = min (sz + 3) (<font color="0033cc">Sys</font>.max_array_length - 1) <font color="green">in</font>
<font color="77aaaa">if</font> newsz <= sz <font color="77aaaa">then</font>
failwith <font color="aa4444">"Hashcons.Make: hash bucket cannot grow more"</font>;
<font color="green">let</font> newbucket = <font color="0033cc">Weak</font>.create newsz <font color="green">in</font>
<font color="0033cc">Weak</font>.blit bucket 0 newbucket 0 sz;
<font color="0033cc">Weak</font>.set newbucket i (<font color="0033cc">Some</font> d);
t.table.(index) <- newbucket;
t.totsize <- t.totsize + (newsz - sz);
<font color="77aaaa">if</font> t.totsize > t.limit * <font color="0033cc">Array</font>.length t.table <font color="77aaaa">then</font> resize t;
<font color="990099">end</font> <font color="77aaaa">else</font> <font color="990099">begin</font>
<font color="77aaaa">if</font> <font color="0033cc">Weak</font>.check bucket i
<font color="77aaaa">then</font> loop (i+1)
<font color="77aaaa">else</font> <font color="0033cc">Weak</font>.set bucket i (<font color="0033cc">Some</font> d)
<font color="990099">end</font>
<font color="green">in</font>
loop 0
<font color="green">let</font> hashcons t d =
<font color="green">let</font> hkey = <font color="0033cc">Hashtbl</font>.hash d <font color="green">in</font>
<font color="green">let</font> index = hkey mod (<font color="0033cc">Array</font>.length t.table) <font color="green">in</font>
<font color="green">let</font> bucket = t.table.(index) <font color="green">in</font>
<font color="green">let</font> sz = <font color="0033cc">Weak</font>.length bucket <font color="green">in</font>
<font color="green">let</font> <font color="green">rec</font> loop i =
<font color="77aaaa">if</font> i >= sz <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> hnode = { hkey = hkey; tag = gentag (); node = d } <font color="green">in</font>
add t hnode;
hnode
<font color="990099">end</font> <font color="77aaaa">else</font> <font color="990099">begin</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get_copy bucket i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v <font color="77aaaa">when</font> v.node = d ->
<font color="990099">begin</font> <font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get bucket i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> v
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> loop (i+1)
<font color="990099">end</font>
<font color="77aaaa">|</font> _ -> loop (i+1)
<font color="990099">end</font>
<font color="green">in</font>
loop 0
<font color="green">let</font> stats t =
<font color="green">let</font> len = <font color="0033cc">Array</font>.length t.table <font color="green">in</font>
<font color="green">let</font> lens = <font color="0033cc">Array</font>.map <font color="0033cc">Weak</font>.length t.table <font color="green">in</font>
<font color="0033cc">Array</font>.sort compare lens;
<font color="green">let</font> totlen = <font color="0033cc">Array</font>.fold_left ( + ) 0 lens <font color="green">in</font>
(len, count t, totlen, lens.(0), lens.(len/2), lens.(len-1))
<font color="990000">(* Functorial interface *)</font>
<font color="green">module</font> <font color="green">type</font> <font color="0033cc">HashedType</font> =
<font color="990099">sig</font>
<font color="green">type</font> t
<font color="green">val</font> equal : t -> t -> bool
<font color="green">val</font> hash : t -> int
<font color="990099">end</font>
<font color="green">module</font> <font color="green">type</font> <font color="0033cc">S</font> =
<font color="990099">sig</font>
<font color="green">type</font> key
<font color="green">type</font> t
<font color="green">val</font> create : int -> t
<font color="green">val</font> clear : t -> unit
<font color="green">val</font> hashcons : t -> key -> key hash_consed
<font color="green">val</font> iter : (key hash_consed -> unit) -> t -> unit
<font color="green">val</font> stats : t -> int * int * int * int * int * int
<font color="990099">end</font>
<font color="green">module</font> <font color="0033cc">Make</font>(<font color="0033cc">H</font> : <font color="0033cc">HashedType</font>) : (<font color="0033cc">S</font> <font color="77aaaa">with</font> <font color="green">type</font> key = <font color="0033cc">H</font>.t) = <font color="990099">struct</font>
<font color="green">type</font> key = <font color="0033cc">H</font>.t
<font color="green">type</font> data = <font color="0033cc">H</font>.t hash_consed
<font color="green">type</font> t = {
<font color="green">mutable</font> table : data <font color="0033cc">Weak</font>.t array;
<font color="green">mutable</font> totsize : int; <font color="990000">(* sum of the bucket sizes *)</font>
<font color="green">mutable</font> limit : int; <font color="990000">(* max ratio totsize/table length *)</font>
}
<font color="green">let</font> emptybucket = <font color="0033cc">Weak</font>.create 0
<font color="green">let</font> create sz =
<font color="green">let</font> sz = <font color="77aaaa">if</font> sz < 7 <font color="77aaaa">then</font> 7 <font color="77aaaa">else</font> sz <font color="green">in</font>
<font color="green">let</font> sz = <font color="77aaaa">if</font> sz > <font color="0033cc">Sys</font>.max_array_length <font color="77aaaa">then</font> <font color="0033cc">Sys</font>.max_array_length <font color="77aaaa">else</font> sz <font color="green">in</font>
{
table = <font color="0033cc">Array</font>.create sz emptybucket;
totsize = 0;
limit = 3;
}
<font color="green">let</font> clear t =
<font color="77aaaa">for</font> i = 0 <font color="77aaaa">to</font> <font color="0033cc">Array</font>.length t.table - 1 <font color="77aaaa">do</font>
t.table.(i) <- emptybucket
<font color="77aaaa">done</font>;
t.totsize <- 0;
t.limit <- 3
<font color="green">let</font> fold f t init =
<font color="green">let</font> <font color="green">rec</font> fold_bucket i b accu =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> accu <font color="77aaaa">else</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get b i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> fold_bucket (i+1) b (f v accu)
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> fold_bucket (i+1) b accu
<font color="green">in</font>
<font color="0033cc">Array</font>.fold_right (fold_bucket 0) t.table init
<font color="green">let</font> iter f t =
<font color="green">let</font> <font color="green">rec</font> iter_bucket i b =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> () <font color="77aaaa">else</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get b i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> f v; iter_bucket (i+1) b
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> iter_bucket (i+1) b
<font color="green">in</font>
<font color="0033cc">Array</font>.iter (iter_bucket 0) t.table
<font color="green">let</font> count t =
<font color="green">let</font> <font color="green">rec</font> count_bucket i b accu =
<font color="77aaaa">if</font> i >= <font color="0033cc">Weak</font>.length b <font color="77aaaa">then</font> accu <font color="77aaaa">else</font>
count_bucket (i+1) b (accu + (<font color="77aaaa">if</font> <font color="0033cc">Weak</font>.check b i <font color="77aaaa">then</font> 1 <font color="77aaaa">else</font> 0))
<font color="green">in</font>
<font color="0033cc">Array</font>.fold_right (count_bucket 0) t.table 0
<font color="green">let</font> next_sz n = min (3*n/2 + 3) (<font color="0033cc">Sys</font>.max_array_length - 1)
<font color="green">let</font> <font color="green">rec</font> resize t =
<font color="green">let</font> oldlen = <font color="0033cc">Array</font>.length t.table <font color="green">in</font>
<font color="green">let</font> newlen = next_sz oldlen <font color="green">in</font>
<font color="77aaaa">if</font> newlen > oldlen <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> newt = create newlen <font color="green">in</font>
newt.limit <- t.limit + 100; <font color="990000">(* prevent resizing of newt *)</font>
fold (<font color="green">fun</font> d () -> add newt d) t ();
t.table <- newt.table;
t.limit <- t.limit + 2;
<font color="990099">end</font>
<font color="green">and</font> add t d =
<font color="green">let</font> index = d.hkey mod (<font color="0033cc">Array</font>.length t.table) <font color="green">in</font>
<font color="green">let</font> bucket = t.table.(index) <font color="green">in</font>
<font color="green">let</font> sz = <font color="0033cc">Weak</font>.length bucket <font color="green">in</font>
<font color="green">let</font> <font color="green">rec</font> loop i =
<font color="77aaaa">if</font> i >= sz <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> newsz = min (sz + 3) (<font color="0033cc">Sys</font>.max_array_length - 1) <font color="green">in</font>
<font color="77aaaa">if</font> newsz <= sz <font color="77aaaa">then</font>
failwith <font color="aa4444">"Hashcons.Make: hash bucket cannot grow more"</font>;
<font color="green">let</font> newbucket = <font color="0033cc">Weak</font>.create newsz <font color="green">in</font>
<font color="0033cc">Weak</font>.blit bucket 0 newbucket 0 sz;
<font color="0033cc">Weak</font>.set newbucket i (<font color="0033cc">Some</font> d);
t.table.(index) <- newbucket;
t.totsize <- t.totsize + (newsz - sz);
<font color="77aaaa">if</font> t.totsize > t.limit * <font color="0033cc">Array</font>.length t.table <font color="77aaaa">then</font> resize t;
<font color="990099">end</font> <font color="77aaaa">else</font> <font color="990099">begin</font>
<font color="77aaaa">if</font> <font color="0033cc">Weak</font>.check bucket i
<font color="77aaaa">then</font> loop (i+1)
<font color="77aaaa">else</font> <font color="0033cc">Weak</font>.set bucket i (<font color="0033cc">Some</font> d)
<font color="990099">end</font>
<font color="green">in</font>
loop 0
<font color="green">let</font> hashcons t d =
<font color="green">let</font> hkey = <font color="0033cc">H</font>.hash d <font color="green">in</font>
<font color="green">let</font> index = hkey mod (<font color="0033cc">Array</font>.length t.table) <font color="green">in</font>
<font color="green">let</font> bucket = t.table.(index) <font color="green">in</font>
<font color="green">let</font> sz = <font color="0033cc">Weak</font>.length bucket <font color="green">in</font>
<font color="green">let</font> <font color="green">rec</font> loop i =
<font color="77aaaa">if</font> i >= sz <font color="77aaaa">then</font> <font color="990099">begin</font>
<font color="green">let</font> hnode = { hkey = hkey; tag = gentag (); node = d } <font color="green">in</font>
add t hnode;
hnode
<font color="990099">end</font> <font color="77aaaa">else</font> <font color="990099">begin</font>
<font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get_copy bucket i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v <font color="77aaaa">when</font> <font color="0033cc">H</font>.equal v.node d ->
<font color="990099">begin</font> <font color="77aaaa">match</font> <font color="0033cc">Weak</font>.get bucket i <font color="77aaaa">with</font>
<font color="77aaaa">|</font> <font color="0033cc">Some</font> v -> v
<font color="77aaaa">|</font> <font color="0033cc">None</font> -> loop (i+1)
<font color="990099">end</font>
<font color="77aaaa">|</font> _ -> loop (i+1)
<font color="990099">end</font>
<font color="green">in</font>
loop 0
<font color="green">let</font> stats t =
<font color="green">let</font> len = <font color="0033cc">Array</font>.length t.table <font color="green">in</font>
<font color="green">let</font> lens = <font color="0033cc">Array</font>.map <font color="0033cc">Weak</font>.length t.table <font color="green">in</font>
<font color="0033cc">Array</font>.sort compare lens;
<font color="green">let</font> totlen = <font color="0033cc">Array</font>.fold_left ( + ) 0 lens <font color="green">in</font>
(len, count t, totlen, lens.(0), lens.(len/2), lens.(len-1))
<font color="990099">end</font>
</pre></body></html>