author | blanchet |
Fri, 17 Sep 2010 01:56:19 +0200 | |
changeset 39501 | aaa7078fff55 |
parent 39444 | beabb8443ee4 |
child 39502 | cffceed8e7fa |
permissions | -rw-r--r-- |
39348 | 1 |
(* ========================================================================= *) |
2 |
(* FINITE SETS WITH A FIXED ELEMENT TYPE *) |
|
39501
aaa7078fff55
updated source files with Metis 2.3 (timestamp: 16 Sept. 2010)
blanchet
parents:
39444
diff
changeset
|
3 |
(* Copyright (c) 2004 Joe Hurd, distributed under the MIT license *) |
39348 | 4 |
(* ========================================================================= *) |
5 |
||
6 |
functor ElementSet (KM : KeyMap) :> ElementSet |
|
7 |
where type element = KM.key and type 'a map = 'a KM.map = |
|
8 |
struct |
|
9 |
||
10 |
(* ------------------------------------------------------------------------- *) |
|
11 |
(* A type of set elements. *) |
|
12 |
(* ------------------------------------------------------------------------- *) |
|
13 |
||
14 |
type element = KM.key; |
|
15 |
||
16 |
(* ------------------------------------------------------------------------- *) |
|
17 |
(* A type of finite sets. *) |
|
18 |
(* ------------------------------------------------------------------------- *) |
|
19 |
||
20 |
type 'a map = 'a KM.map; |
|
21 |
||
22 |
datatype set = Set of unit map; |
|
23 |
||
24 |
(* ------------------------------------------------------------------------- *) |
|
25 |
(* Converting to and from maps. *) |
|
26 |
(* ------------------------------------------------------------------------- *) |
|
27 |
||
28 |
fun dest (Set m) = m; |
|
29 |
||
30 |
fun mapPartial f = |
|
31 |
let |
|
32 |
fun mf (elt,()) = f elt |
|
33 |
in |
|
34 |
fn Set m => KM.mapPartial mf m |
|
35 |
end; |
|
36 |
||
37 |
fun map f = |
|
38 |
let |
|
39 |
fun mf (elt,()) = f elt |
|
40 |
in |
|
41 |
fn Set m => KM.map mf m |
|
42 |
end; |
|
43 |
||
44 |
fun domain m = Set (KM.transform (fn _ => ()) m); |
|
45 |
||
46 |
(* ------------------------------------------------------------------------- *) |
|
47 |
(* Constructors. *) |
|
48 |
(* ------------------------------------------------------------------------- *) |
|
49 |
||
50 |
val empty = Set (KM.new ()); |
|
51 |
||
52 |
fun singleton elt = Set (KM.singleton (elt,())); |
|
53 |
||
54 |
(* ------------------------------------------------------------------------- *) |
|
55 |
(* Set size. *) |
|
56 |
(* ------------------------------------------------------------------------- *) |
|
57 |
||
58 |
fun null (Set m) = KM.null m; |
|
59 |
||
60 |
fun size (Set m) = KM.size m; |
|
61 |
||
62 |
(* ------------------------------------------------------------------------- *) |
|
63 |
(* Querying. *) |
|
64 |
(* ------------------------------------------------------------------------- *) |
|
65 |
||
66 |
fun peek (Set m) elt = |
|
67 |
case KM.peekKey m elt of |
|
68 |
SOME (elt,()) => SOME elt |
|
69 |
| NONE => NONE; |
|
70 |
||
71 |
fun member elt (Set m) = KM.inDomain elt m; |
|
72 |
||
73 |
fun pick (Set m) = |
|
74 |
let |
|
75 |
val (elt,_) = KM.pick m |
|
76 |
in |
|
77 |
elt |
|
78 |
end; |
|
79 |
||
80 |
fun nth (Set m) n = |
|
81 |
let |
|
82 |
val (elt,_) = KM.nth m n |
|
83 |
in |
|
84 |
elt |
|
85 |
end; |
|
86 |
||
87 |
fun random (Set m) = |
|
88 |
let |
|
89 |
val (elt,_) = KM.random m |
|
90 |
in |
|
91 |
elt |
|
92 |
end; |
|
93 |
||
94 |
(* ------------------------------------------------------------------------- *) |
|
95 |
(* Adding. *) |
|
96 |
(* ------------------------------------------------------------------------- *) |
|
97 |
||
98 |
fun add (Set m) elt = |
|
99 |
let |
|
100 |
val m = KM.insert m (elt,()) |
|
101 |
in |
|
102 |
Set m |
|
103 |
end; |
|
104 |
||
105 |
local |
|
106 |
fun uncurriedAdd (elt,set) = add set elt; |
|
107 |
in |
|
108 |
fun addList set = List.foldl uncurriedAdd set; |
|
109 |
end; |
|
110 |
||
111 |
(* ------------------------------------------------------------------------- *) |
|
112 |
(* Removing. *) |
|
113 |
(* ------------------------------------------------------------------------- *) |
|
114 |
||
115 |
fun delete (Set m) elt = |
|
116 |
let |
|
117 |
val m = KM.delete m elt |
|
118 |
in |
|
119 |
Set m |
|
120 |
end; |
|
121 |
||
122 |
fun remove (Set m) elt = |
|
123 |
let |
|
124 |
val m = KM.remove m elt |
|
125 |
in |
|
126 |
Set m |
|
127 |
end; |
|
128 |
||
129 |
fun deletePick (Set m) = |
|
130 |
let |
|
131 |
val ((elt,()),m) = KM.deletePick m |
|
132 |
in |
|
133 |
(elt, Set m) |
|
134 |
end; |
|
135 |
||
136 |
fun deleteNth (Set m) n = |
|
137 |
let |
|
138 |
val ((elt,()),m) = KM.deleteNth m n |
|
139 |
in |
|
140 |
(elt, Set m) |
|
141 |
end; |
|
142 |
||
143 |
fun deleteRandom (Set m) = |
|
144 |
let |
|
145 |
val ((elt,()),m) = KM.deleteRandom m |
|
146 |
in |
|
147 |
(elt, Set m) |
|
148 |
end; |
|
149 |
||
150 |
(* ------------------------------------------------------------------------- *) |
|
151 |
(* Joining. *) |
|
152 |
(* ------------------------------------------------------------------------- *) |
|
153 |
||
154 |
fun union (Set m1) (Set m2) = Set (KM.unionDomain m1 m2); |
|
155 |
||
156 |
fun unionList sets = |
|
157 |
let |
|
158 |
val ms = List.map dest sets |
|
159 |
in |
|
160 |
Set (KM.unionListDomain ms) |
|
161 |
end; |
|
162 |
||
163 |
fun intersect (Set m1) (Set m2) = Set (KM.intersectDomain m1 m2); |
|
164 |
||
165 |
fun intersectList sets = |
|
166 |
let |
|
167 |
val ms = List.map dest sets |
|
168 |
in |
|
169 |
Set (KM.intersectListDomain ms) |
|
170 |
end; |
|
171 |
||
172 |
fun difference (Set m1) (Set m2) = |
|
173 |
Set (KM.differenceDomain m1 m2); |
|
174 |
||
175 |
fun symmetricDifference (Set m1) (Set m2) = |
|
176 |
Set (KM.symmetricDifferenceDomain m1 m2); |
|
177 |
||
178 |
(* ------------------------------------------------------------------------- *) |
|
179 |
(* Mapping and folding. *) |
|
180 |
(* ------------------------------------------------------------------------- *) |
|
181 |
||
182 |
fun filter pred = |
|
183 |
let |
|
184 |
fun mpred (elt,()) = pred elt |
|
185 |
in |
|
186 |
fn Set m => Set (KM.filter mpred m) |
|
187 |
end; |
|
188 |
||
189 |
fun partition pred = |
|
190 |
let |
|
191 |
fun mpred (elt,()) = pred elt |
|
192 |
in |
|
193 |
fn Set m => |
|
194 |
let |
|
195 |
val (m1,m2) = KM.partition mpred m |
|
196 |
in |
|
197 |
(Set m1, Set m2) |
|
198 |
end |
|
199 |
end; |
|
200 |
||
201 |
fun app f = |
|
202 |
let |
|
203 |
fun mf (elt,()) = f elt |
|
204 |
in |
|
205 |
fn Set m => KM.app mf m |
|
206 |
end; |
|
207 |
||
208 |
fun foldl f = |
|
209 |
let |
|
210 |
fun mf (elt,(),acc) = f (elt,acc) |
|
211 |
in |
|
212 |
fn acc => fn Set m => KM.foldl mf acc m |
|
213 |
end; |
|
214 |
||
215 |
fun foldr f = |
|
216 |
let |
|
217 |
fun mf (elt,(),acc) = f (elt,acc) |
|
218 |
in |
|
219 |
fn acc => fn Set m => KM.foldr mf acc m |
|
220 |
end; |
|
221 |
||
222 |
(* ------------------------------------------------------------------------- *) |
|
223 |
(* Searching. *) |
|
224 |
(* ------------------------------------------------------------------------- *) |
|
225 |
||
226 |
fun findl p = |
|
227 |
let |
|
228 |
fun mp (elt,()) = p elt |
|
229 |
in |
|
230 |
fn Set m => |
|
231 |
case KM.findl mp m of |
|
232 |
SOME (elt,()) => SOME elt |
|
233 |
| NONE => NONE |
|
234 |
end; |
|
235 |
||
236 |
fun findr p = |
|
237 |
let |
|
238 |
fun mp (elt,()) = p elt |
|
239 |
in |
|
240 |
fn Set m => |
|
241 |
case KM.findr mp m of |
|
242 |
SOME (elt,()) => SOME elt |
|
243 |
| NONE => NONE |
|
244 |
end; |
|
245 |
||
246 |
fun firstl f = |
|
247 |
let |
|
248 |
fun mf (elt,()) = f elt |
|
249 |
in |
|
250 |
fn Set m => KM.firstl mf m |
|
251 |
end; |
|
252 |
||
253 |
fun firstr f = |
|
254 |
let |
|
255 |
fun mf (elt,()) = f elt |
|
256 |
in |
|
257 |
fn Set m => KM.firstr mf m |
|
258 |
end; |
|
259 |
||
260 |
fun exists p = |
|
261 |
let |
|
262 |
fun mp (elt,()) = p elt |
|
263 |
in |
|
264 |
fn Set m => KM.exists mp m |
|
265 |
end; |
|
266 |
||
267 |
fun all p = |
|
268 |
let |
|
269 |
fun mp (elt,()) = p elt |
|
270 |
in |
|
271 |
fn Set m => KM.all mp m |
|
272 |
end; |
|
273 |
||
274 |
fun count p = |
|
275 |
let |
|
276 |
fun mp (elt,()) = p elt |
|
277 |
in |
|
278 |
fn Set m => KM.count mp m |
|
279 |
end; |
|
280 |
||
281 |
(* ------------------------------------------------------------------------- *) |
|
282 |
(* Comparing. *) |
|
283 |
(* ------------------------------------------------------------------------- *) |
|
284 |
||
285 |
fun compareValue ((),()) = EQUAL; |
|
286 |
||
287 |
fun equalValue () () = true; |
|
288 |
||
289 |
fun compare (Set m1, Set m2) = KM.compare compareValue (m1,m2); |
|
290 |
||
291 |
fun equal (Set m1) (Set m2) = KM.equal equalValue m1 m2; |
|
292 |
||
293 |
fun subset (Set m1) (Set m2) = KM.subsetDomain m1 m2; |
|
294 |
||
295 |
fun disjoint (Set m1) (Set m2) = KM.disjointDomain m1 m2; |
|
296 |
||
297 |
(* ------------------------------------------------------------------------- *) |
|
298 |
(* Converting to and from lists. *) |
|
299 |
(* ------------------------------------------------------------------------- *) |
|
300 |
||
301 |
fun transform f = |
|
302 |
let |
|
303 |
fun inc (x,l) = f x :: l |
|
304 |
in |
|
305 |
foldr inc [] |
|
306 |
end; |
|
307 |
||
308 |
fun toList (Set m) = KM.keys m; |
|
309 |
||
310 |
fun fromList elts = addList empty elts; |
|
311 |
||
312 |
(* ------------------------------------------------------------------------- *) |
|
313 |
(* Pretty-printing. *) |
|
314 |
(* ------------------------------------------------------------------------- *) |
|
315 |
||
316 |
fun toString set = |
|
317 |
"{" ^ (if null set then "" else Int.toString (size set)) ^ "}"; |
|
318 |
||
319 |
(* ------------------------------------------------------------------------- *) |
|
320 |
(* Iterators over sets *) |
|
321 |
(* ------------------------------------------------------------------------- *) |
|
322 |
||
323 |
type iterator = unit KM.iterator; |
|
324 |
||
325 |
fun mkIterator (Set m) = KM.mkIterator m; |
|
326 |
||
327 |
fun mkRevIterator (Set m) = KM.mkRevIterator m; |
|
328 |
||
329 |
fun readIterator iter = |
|
330 |
let |
|
331 |
val (elt,()) = KM.readIterator iter |
|
332 |
in |
|
333 |
elt |
|
334 |
end; |
|
335 |
||
336 |
fun advanceIterator iter = KM.advanceIterator iter; |
|
337 |
||
338 |
end |
|
339 |
||
340 |
structure IntSet = |
|
341 |
ElementSet (IntMap); |
|
342 |
||
343 |
structure IntPairSet = |
|
344 |
ElementSet (IntPairMap); |
|
345 |
||
346 |
structure StringSet = |
|
347 |
ElementSet (StringMap); |