6118
|
1 |
(* Title: Pure/General/table.ML
|
5015
|
2 |
ID: $Id$
|
|
3 |
Author: Markus Wenzel, TU Muenchen
|
8806
|
4 |
License: GPL (GNU GENERAL PUBLIC LICENSE)
|
5015
|
5 |
|
8806
|
6 |
Generic tables and tables indexed by strings. Efficient purely
|
|
7 |
functional implementation using balanced 2-3 trees. No delete
|
|
8 |
operation (may store options instead).
|
5015
|
9 |
*)
|
|
10 |
|
|
11 |
signature KEY =
|
|
12 |
sig
|
|
13 |
type key
|
|
14 |
val ord: key * key -> order
|
|
15 |
end;
|
|
16 |
|
|
17 |
signature TABLE =
|
|
18 |
sig
|
|
19 |
type key
|
|
20 |
type 'a table
|
|
21 |
exception DUP of key
|
|
22 |
exception DUPS of key list
|
|
23 |
val empty: 'a table
|
|
24 |
val is_empty: 'a table -> bool
|
5681
|
25 |
val map: ('a -> 'b) -> 'a table -> 'b table
|
|
26 |
val foldl: ('a * (key * 'b) -> 'a) -> 'a * 'b table -> 'a
|
5015
|
27 |
val dest: 'a table -> (key * 'a) list
|
5681
|
28 |
val keys: 'a table -> key list
|
8409
|
29 |
val min_key: 'a table -> key option
|
7061
|
30 |
val exists: (key * 'a -> bool) -> 'a table -> bool
|
5015
|
31 |
val lookup: 'a table * key -> 'a option
|
|
32 |
val update: (key * 'a) * 'a table -> 'a table
|
12287
|
33 |
val update_new: (key * 'a) * 'a table -> 'a table (*exception DUP*)
|
|
34 |
val make: (key * 'a) list -> 'a table (*exception DUPS*)
|
|
35 |
val extend: 'a table * (key * 'a) list -> 'a table (*exception DUPS*)
|
|
36 |
val join: ('a * 'a -> 'a option) -> 'a table * 'a table -> 'a table (*exception DUPS*)
|
|
37 |
val merge: ('a * 'a -> bool) -> 'a table * 'a table -> 'a table (*exception DUPS*)
|
5015
|
38 |
val lookup_multi: 'a list table * key -> 'a list
|
8606
|
39 |
val update_multi: (key * 'a) * 'a list table -> 'a list table
|
5015
|
40 |
val make_multi: (key * 'a) list -> 'a list table
|
|
41 |
val dest_multi: 'a list table -> (key * 'a) list
|
12287
|
42 |
val merge_multi: ('a * 'a -> bool) ->
|
|
43 |
'a list table * 'a list table -> 'a list table (*exception DUPS*)
|
|
44 |
val merge_multi': ('a * 'a -> bool) ->
|
|
45 |
'a list table * 'a list table -> 'a list table (*exception DUPS*)
|
5015
|
46 |
end;
|
|
47 |
|
|
48 |
functor TableFun(Key: KEY): TABLE =
|
|
49 |
struct
|
|
50 |
|
|
51 |
|
|
52 |
(* datatype table *)
|
|
53 |
|
|
54 |
type key = Key.key;
|
|
55 |
|
|
56 |
datatype 'a table =
|
|
57 |
Empty |
|
|
58 |
Branch2 of 'a table * (key * 'a) * 'a table |
|
|
59 |
Branch3 of 'a table * (key * 'a) * 'a table * (key * 'a) * 'a table;
|
|
60 |
|
|
61 |
exception DUP of key;
|
|
62 |
exception DUPS of key list;
|
|
63 |
|
|
64 |
|
5681
|
65 |
(* empty *)
|
|
66 |
|
5015
|
67 |
val empty = Empty;
|
|
68 |
|
|
69 |
fun is_empty Empty = true
|
|
70 |
| is_empty _ = false;
|
|
71 |
|
5681
|
72 |
|
|
73 |
(* map and fold combinators *)
|
|
74 |
|
|
75 |
fun map_table _ Empty = Empty
|
|
76 |
| map_table f (Branch2 (left, (k, x), right)) =
|
|
77 |
Branch2 (map_table f left, (k, f x), map_table f right)
|
|
78 |
| map_table f (Branch3 (left, (k1, x1), mid, (k2, x2), right)) =
|
|
79 |
Branch3 (map_table f left, (k1, f x1), map_table f mid, (k2, f x2), map_table f right);
|
|
80 |
|
|
81 |
fun foldl_table _ (x, Empty) = x
|
|
82 |
| foldl_table f (x, Branch2 (left, p, right)) =
|
|
83 |
foldl_table f (f (foldl_table f (x, left), p), right)
|
|
84 |
| foldl_table f (x, Branch3 (left, p1, mid, p2, right)) =
|
|
85 |
foldl_table f (f (foldl_table f (f (foldl_table f (x, left), p1), mid), p2), right);
|
|
86 |
|
|
87 |
fun dest tab = rev (foldl_table (fn (rev_ps, p) => p :: rev_ps) ([], tab));
|
|
88 |
fun keys tab = rev (foldl_table (fn (rev_ks, (k, _)) => k :: rev_ks) ([], tab));
|
7061
|
89 |
fun exists P tab = foldl_table (fn (false, e) => P e | (b, _) => b) (false, tab);
|
5015
|
90 |
|
8409
|
91 |
fun min_key Empty = None
|
|
92 |
| min_key (Branch2 (left, (k, _), _)) = Some (if_none (min_key left) k)
|
|
93 |
| min_key (Branch3 (left, (k, _), _, _, _)) = Some (if_none (min_key left) k);
|
|
94 |
|
5015
|
95 |
|
|
96 |
(* lookup *)
|
|
97 |
|
|
98 |
fun lookup (Empty, _) = None
|
|
99 |
| lookup (Branch2 (left, (k, x), right), key) =
|
|
100 |
(case Key.ord (key, k) of
|
|
101 |
LESS => lookup (left, key)
|
|
102 |
| EQUAL => Some x
|
|
103 |
| GREATER => lookup (right, key))
|
|
104 |
| lookup (Branch3 (left, (k1, x1), mid, (k2, x2), right), key) =
|
|
105 |
(case Key.ord (key, k1) of
|
|
106 |
LESS => lookup (left, key)
|
|
107 |
| EQUAL => Some x1
|
|
108 |
| GREATER =>
|
|
109 |
(case Key.ord (key, k2) of
|
|
110 |
LESS => lookup (mid, key)
|
|
111 |
| EQUAL => Some x2
|
|
112 |
| GREATER => lookup (right, key)));
|
|
113 |
|
|
114 |
|
|
115 |
(* update *)
|
|
116 |
|
|
117 |
fun compare (k1, _) (k2, _) = Key.ord (k1, k2);
|
|
118 |
|
|
119 |
datatype 'a growth =
|
|
120 |
Stay of 'a table |
|
|
121 |
Sprout of 'a table * (key * 'a) * 'a table;
|
|
122 |
|
|
123 |
fun insert pair Empty = Sprout (Empty, pair, Empty)
|
|
124 |
| insert pair (Branch2 (left, p, right)) =
|
|
125 |
(case compare pair p of
|
|
126 |
LESS =>
|
|
127 |
(case insert pair left of
|
|
128 |
Stay left' => Stay (Branch2 (left', p, right))
|
|
129 |
| Sprout (left1, q, left2) => Stay (Branch3 (left1, q, left2, p, right)))
|
|
130 |
| EQUAL => Stay (Branch2 (left, pair, right))
|
|
131 |
| GREATER =>
|
|
132 |
(case insert pair right of
|
|
133 |
Stay right' => Stay (Branch2 (left, p, right'))
|
|
134 |
| Sprout (right1, q, right2) =>
|
|
135 |
Stay (Branch3 (left, p, right1, q, right2))))
|
|
136 |
| insert pair (Branch3 (left, p1, mid, p2, right)) =
|
|
137 |
(case compare pair p1 of
|
|
138 |
LESS =>
|
|
139 |
(case insert pair left of
|
|
140 |
Stay left' => Stay (Branch3 (left', p1, mid, p2, right))
|
|
141 |
| Sprout (left1, q, left2) =>
|
|
142 |
Sprout (Branch2 (left1, q, left2), p1, Branch2 (mid, p2, right)))
|
|
143 |
| EQUAL => Stay (Branch3 (left, pair, mid, p2, right))
|
|
144 |
| GREATER =>
|
|
145 |
(case compare pair p2 of
|
|
146 |
LESS =>
|
|
147 |
(case insert pair mid of
|
|
148 |
Stay mid' => Stay (Branch3 (left, p1, mid', p2, right))
|
|
149 |
| Sprout (mid1, q, mid2) =>
|
|
150 |
Sprout (Branch2 (left, p1, mid1), q, Branch2 (mid2, p2, right)))
|
|
151 |
| EQUAL => Stay (Branch3 (left, p1, mid, pair, right))
|
|
152 |
| GREATER =>
|
|
153 |
(case insert pair right of
|
|
154 |
Stay right' => Stay (Branch3 (left, p1, mid, p2, right'))
|
|
155 |
| Sprout (right1, q, right2) =>
|
|
156 |
Sprout (Branch2 (left, p1, mid), p2, Branch2 (right1, q, right2)))));
|
|
157 |
|
|
158 |
fun update (pair, tab) =
|
|
159 |
(case insert pair tab of
|
|
160 |
Stay tab => tab
|
|
161 |
| Sprout br => Branch2 br);
|
|
162 |
|
|
163 |
fun update_new (pair as (key, _), tab) =
|
|
164 |
if is_none (lookup (tab, key)) then update (pair, tab)
|
|
165 |
else raise DUP key;
|
|
166 |
|
|
167 |
|
12287
|
168 |
(* extend and make *)
|
5015
|
169 |
|
12287
|
170 |
fun extend (table, pairs) =
|
|
171 |
let
|
|
172 |
fun add ((tab, dups), (key, x)) =
|
|
173 |
(case lookup (tab, key) of
|
|
174 |
None => (update ((key, x), tab), dups)
|
|
175 |
| _ => (tab, key :: dups));
|
|
176 |
in
|
|
177 |
(case foldl add ((table, []), pairs) of
|
|
178 |
(table', []) => table'
|
|
179 |
| (_, dups) => raise DUPS (rev dups))
|
|
180 |
end;
|
|
181 |
|
|
182 |
fun make pairs = extend (empty, pairs);
|
|
183 |
|
5015
|
184 |
|
12287
|
185 |
(* join and merge *)
|
5015
|
186 |
|
12287
|
187 |
fun join f (table1, table2) =
|
|
188 |
let
|
|
189 |
fun add ((tab, dups), (key, x)) =
|
|
190 |
(case lookup (tab, key) of
|
|
191 |
None => (update ((key, x), tab), dups)
|
|
192 |
| Some y =>
|
|
193 |
(case f (y, x) of
|
|
194 |
Some z => (update ((key, z), tab), dups)
|
|
195 |
| None => (tab, key :: dups)));
|
|
196 |
in
|
|
197 |
(case foldl_table add ((table1, []), table2) of
|
|
198 |
(table', []) => table'
|
|
199 |
| (_, dups) => raise DUPS (rev dups))
|
|
200 |
end;
|
|
201 |
|
|
202 |
fun merge eq tabs = join (fn (y, x) => if eq (y, x) then Some y else None) tabs;
|
5015
|
203 |
|
|
204 |
|
|
205 |
(* tables with multiple entries per key (preserving order) *)
|
|
206 |
|
|
207 |
fun lookup_multi tab_key = if_none (lookup tab_key) [];
|
12287
|
208 |
fun update_multi ((key, x), tab) = update ((key, x :: lookup_multi (tab, key)), tab);
|
5015
|
209 |
|
8606
|
210 |
fun make_multi pairs = foldr update_multi (pairs, empty);
|
12287
|
211 |
fun dest_multi tab = flat (map (fn (key, xs) => map (Library.pair key) xs) (dest tab));
|
|
212 |
fun merge_multi eq tabs = join (fn (xs, xs') => Some (gen_merge_lists eq xs xs')) tabs;
|
|
213 |
fun merge_multi' eq tabs = join (fn (xs, xs') => Some (gen_merge_lists' eq xs xs')) tabs;
|
5015
|
214 |
|
|
215 |
|
5681
|
216 |
(*final declarations of this structure!*)
|
|
217 |
val map = map_table;
|
|
218 |
val foldl = foldl_table;
|
5015
|
219 |
|
|
220 |
end;
|
|
221 |
|
|
222 |
|
|
223 |
(*tables indexed by strings*)
|
|
224 |
structure Symtab = TableFun(type key = string val ord = string_ord);
|