-
Notifications
You must be signed in to change notification settings - Fork 125
/
set.opa
493 lines (401 loc) · 15.4 KB
/
set.opa
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
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
/*
Copyright © 2011-2013 MLstate
This file is part of Opa.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/*
@authors ?
**/
import stdlib.core.{map}
/**
* Sets and utilities to manipulate them.
*
* @author David Rajchenbach-Teller 2010 (review, clean-up and documentation)
* @author Raja Boujbel
*/
/**
* {1 About this module}
*
* {1 Where should I start?}
*
* {1 What if I need more?}
*/
/**
* {1 Types defined in this module}
*/
/**
* A set of elements
*/
type set('elem) = ordered_set('elem,Order.default)
type ordered_set('elem,'order) = ordered_map('elem,void,'order)
type stringset = ordered_set(string, String.order)
type intset = ordered_set(int, Int.order)
type Set('elem,'order) =
{{
/**
* The empty set.
*/
empty : ordered_set('elem,'order)
/**
* Return true if the given set is empty, false otherwise
*/
is_empty : ordered_set('elem,'order) -> bool
/**
* Return a set containing an single element, the given one
*/
singleton : 'elem -> ordered_set('elem,'order)
/**
* Return the height of given set
*/
height : ordered_set('elem,'order) -> int
/**
* Return the size of given set
*/
size : ordered_set('elem,'order) -> int
/**
* Add an element a set.
*
* @param elem the element to add. If the element exists in the set,
* it is not added
* @param set the set to which to add
* @return A set containing all the element of set plus the element [elem],
* if it doesn't exist on the set
*/
add : 'elem, ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Return true if an element satisfying the given predicate exists in the given set
*/
exists : ('elem -> bool), ordered_set('elem,'order) -> bool
/**
* Return true if given element exists in the given set
*/
contains : 'elem, ordered_set('elem,'order) -> bool
/**
* Synonym to [contains].
*/
mem : 'elem, ordered_set('elem,'order) -> bool
/**
* Return an existing element in the given set
*/
get : 'elem, ordered_set('elem,'order) -> option('elem)
/**
* Find an element in the given set
*/
find : ('elem -> bool), ordered_set('elem,'order) -> option('elem)
/**
* Filter a set of elements
*/
filter : ('elem -> bool), ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Loop through a set, collecting data from the set.
*
* This function guarantees that all elements of the set will be visited.
* The order in which elements are visited, however, is not specified.
*
* @param f A function invoked at each element of the
* set to update the element.
* @param s The set to visit.
* @param acc The initial data. If the set is empty, this
* will also be the result.
*/
fold : ('elem, 'acc -> 'acc), ordered_set('elem,'order), 'acc -> 'acc
/**
* Remove an element from the set.
*
* @param elem a element, possibly in the set
* @param s a set
* @return [s] if the set doesn't contain [elem]. Otherwise, a set obtained
* by removing the element [elem]
*/
remove : 'elem, ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Change all values of the set by applying a change function to all element stored in it
* The resulting set has the same order as initial set and the same kind of element.
* Use [map_to_different_order] or [map_to_different_set] to change order or element type.
*
* @param f a function invoked at each element of the set, returns a new element
* @param s the set to visit
*/
//map : ('elem -> 'new_elem), ordered_set('elem,'order) -> ordered_set('new_elem, 'order)
// in general, the previous type doesn't make sense since we don't know how to compare
// the type 'new_elem
// however, the polymorphic set could actually provide this function
// with the previous type
map : ('elem -> 'elem), ordered_set('elem,'order) -> ordered_set('elem, 'order)
/** Same as map but with no order and element type restrictions.
You can provide the new order.
e.g. [StringSet.map_to_different_order(Int.of_string, Order.default, set)]
*/
map_to_different_order : ('elem -> 'new_elem), order('new_elem,'new_order), ordered_set('elem,'order) -> ordered_set('new_elem,'new_order)
/** Same as map but with no order and element type restrictions.
You can provide the new Set module.
e.g. [StringSet.map_to_different_order(Int.of_string, IntSet set)]
*/
map_to_different_set : ('elem -> 'new_elem), Set('new_elem,'new_order), ordered_set('elem,'order) -> ordered_set('new_elem,'new_order)
/**
* Iterate on all value of the set
*
* @param f a function invoked at each element of the set, returns [void]
* @param s the set to visit
*/
iter : ('elem -> void), ordered_set('elem,'order) -> void
/**
* Return true if given sets are equals, false otherwise.
* Two sets are equal if their arrangement are similar,
* and if their element are equal one by one
*/
equal : ordered_set('elem,'order), ordered_set('elem,'order) -> bool
/**
* Intersection of two sets
*
* @param s1, s2 sets to intersect
* @result [s1] if s2 is empty,
[s2] if s1 is empty,
[s] a set containing all elements contained in s1 and s2
*/
intersection : ordered_set('elem,'order), ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Union of two sets
*
* @param s1, s2 sets to merge, possibly empty
* @return a set containing all element contained either in [s1] or in [s2].
* If an element appears in both sets, it appears once on result set
*/
union : ordered_set('elem,'order), ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Get smallest element from a map
*
* @param s a set, possibly empty
* @return [{none}] if [s] is empty. Otherwise, {some = elem} where [elem] is
* the smallest element in the set
*/
min_binding : ordered_set('elem,'order) -> option('elem)
/**
* Same behavior than [min_binding], instead of returning an option, it returns the element.
* Raise an error message if the given set is empty.
*/
unsafe_min_binding : ordered_set('elem,'order) -> 'elem
/**
* Remove smallest element
*
* @param s a set, possibly empty
* @return [s] if it is empty, otherwise a set minus its smallest element
*/
remove_min_binding : ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Get greatest element from a map
*
* @param s a set, possibly empty
* @return [{none}] if [s] is empty. Otherwise, {some = elem} where [elem] is
* the greatest element in the set
*/
max_binding : ordered_set('elem,'order) -> option('elem)
/**
* Same behavior than [max_binding], instead of returning an option, it returns the element.
* Raise an error message if the given set is empty.
*/
unsafe_max_binding : ordered_set('elem,'order) -> 'elem
/**
* Remove greatest element
*
* @param s a set, possibly empty
* @return [s] if it is empty, otherwise a set minus its greatest element
*/
remove_max_binding : ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Subtract a part of a set
*
* @param l a lower bound
* @param u an upper bound
* @param s a set
* @return a set containing all element appearing in [s] and between [l] and [u]
*/
subset : 'elem, 'elem, ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Subtract a part of a set
*
* @param l a lower bound
* @param s a set
* @return a set containing all element appearing in [s] and greater than [l]
*/
greater : 'elem, ordered_set('elem,'order) -> ordered_set('elem,'order)
/**
* Subtract a part of a set
*
* @param u an upper bound
* @param s a set
* @return a set containing all element appearing in [s] and smaller than [u]
*/
less : 'elem, ordered_set('elem,'order) -> ordered_set('elem,'order)
From :
{{
list : list('elem) -> ordered_set('elem,'order)
}}
To :
{{
list : ordered_set('elem,'order) -> list('elem)
iter : ordered_set('elem,'order) -> iter('elem)
}}
// INTERNAL USE
pop_max_binding : ordered_set('elem, 'order) -> (ordered_set('elem, 'order), option('elem));
pop_min_binding : ordered_set('elem, 'order) -> (ordered_set('elem, 'order), option('elem));
/**
* Get a random element from the set
* Picking distribution is approximately uniform
*/
random_get : ordered_set('elem, 'order) -> option('elem)
}}
/**
* {1 Interface}
*/
@workable
Set_make( order : order('elem,'order) ) =
{{
@private MapSet = Map_make(order)
empty =
MapSet.empty : ordered_set('elem,'order)
is_empty(set : ordered_set('elem,'order)) =
MapSet.is_empty(set)
: bool
singleton(value : 'elem) =
MapSet.singleton(value,void)
: ordered_set('elem,'order)
height(set : ordered_set('elem,'order)) : int =
MapSet.height(set)
size(set : ordered_set('elem,'order)) : int =
MapSet.size(set)
add(elem: 'elem, set: ordered_set('elem,'order)) =
MapSet.add(elem,void,set)
: ordered_set('elem,'order)
exists( (f : 'elem -> bool), set : ordered_set('elem,'order))=
MapSet.exists((key, _ -> f(key)), set)
: bool
contains( elem : 'elem, set : ordered_set('elem, 'order)) = MapSet.contains(elem, set)
mem = contains
get( elem : 'elem, set : ordered_set('elem, 'order)) = Option.map(_.key,MapSet.get_key_val(elem, set))
find( f : 'elem -> bool, set : ordered_set('elem, 'order)) =
match MapSet.find((e,_->f(e)), set)
{none} -> none
{some={~key val=_}} -> some(key) : option('elem)
filter( f : 'elem -> bool, set : ordered_set('elem, 'order)) =
MapSet.fold((k,_v,a -> if f(k) then MapSet.add(k,void,a) else a), set, MapSet.empty)
: ordered_set('elem, 'order)
fold(fun: ('elem, 'acc -> 'acc), set: ordered_set('elem,'order), acc : 'acc) =
MapSet.fold((k,_v,a -> fun(k,a)), set, acc)
: 'acc
remove(elem : 'elem, set : ordered_set('elem, 'order)) =
MapSet.extract(elem, set).f1
: ordered_set('elem, 'order)
map(fun : ('elem -> 'elem), set : ordered_set('elem,'order))=
fold((elem, acc -> add(fun(elem), acc)), set, empty)
map_to_different_order( f:('elem -> 'new_elem), new_order:order('new_elem,'new_order), set:ordered_set('elem,'order) ) =
// // Ideally
// map_to_different_set(f, Set_make(new_order), set)
// // But cannot recurse directly for both valid and invalid reasons (non uniform recursivity and forall problems)
NewSet = Map_make(new_order)
add(elem,acc) = NewSet.add(f(elem),void,acc)
fold( add , set, NewSet.empty) : ordered_set('new_elem,'new_order)
map_to_different_set(f:('elem -> 'new_elem), TargetSet:Set('new_elem,'new_order), set:ordered_set('elem,'order) ) =
add(elem,acc) = TargetSet.add(f(elem),acc)
fold( add , set, TargetSet.empty) : ordered_set('new_elem,'new_order)
iter(fun: ('elem -> void), set: ordered_set('elem,'order)) =
MapSet.iter((k, _v -> fun(k)), set)
: void
From =
{{
list(lst : list('elem)) =
MapSet.From.assoc_list(List.map(((x: 'elem) -> (x,void)), lst))
: ordered_set('elem,'order)
}}
To =
{{
list(set : ordered_set('elem,'order)) =
MapSet.To.key_list(set)
: list('elem)
iter(set : ordered_set('elem,'order)) =
Iter.map(((x: (('elem,void))) -> x.f1: 'elem), MapSet.To.iter(set))
: iter('elem)
}}
equal(s1 : ordered_set('elem,'order), s2 : ordered_set('elem,'order)) = // FIXME: Optimize
match MapSet.compare((_, _ -> {eq}), s1, s2) with
| { eq } -> true
| _ -> false
intersection((set1 : ordered_set('elem, 'order)),
(set2 : ordered_set('elem, 'order))) =
MapSet.intersection(set1, set2)
: ordered_set('elem, 'order)
union(set1: ordered_set('elem,'order), set2: ordered_set('elem,'order)) =
MapSet.union(set1,set2)
: ordered_set('elem,'order)
pop_min_binding(set : ordered_set('elem, 'order))=
(s,e) = MapSet.extract_min_binding(set)
val = (match e with
| { ~some } -> { some = some.f1 }
| { none } -> { none })
(s, val)
: (ordered_set('elem,'order), option('elem))
min_binding(s : ordered_set('elem, 'order)) =
pop_min_binding(s).f2
: option('elem)
unsafe_min_binding(s) =
(min_binding(s) |> Option.get_msg(->"Set.unsafe_min_binding",_))
: 'elem
remove_min_binding(s : ordered_set('elem, 'order)) =
pop_min_binding(s).f1
: ordered_set('elem, 'order)
pop_max_binding(set : ordered_set('elem, 'order)) :
(ordered_set('elem,'order), option('elem))=
(s,e) = MapSet.extract_max_binding(set)
val = (match e with
| { ~some } -> { some = some.f1 }
| { none } -> { none })
(s, val)
max_binding(s : ordered_set('elem, 'order)) =
pop_max_binding(s).f2
: option('elem)
unsafe_max_binding(s : ordered_set('elem, 'order)) : 'elem =
max_binding(s) |> Option.get_msg(->"Set.unsafe_max_binding", _)
remove_max_binding(s : ordered_set('elem, 'order)) =
pop_max_binding(s).f1
: ordered_set('elem, 'order)
subset(lowerbound, upperbound, (set : ordered_set('elem, 'order))) =
lower = key -> Order.is_greatereq(key, lowerbound, order)
upper = key -> Order.is_smallereq(key, upperbound, order)
MapSet.sub_map_gen(lower, upper, set)
: ordered_set('elem, 'order)
greater(lowerbound, (set : ordered_set('elem, 'order))) =
lower = key -> Order.is_greatereq(key, lowerbound, order)
upper = _elem -> true
MapSet.sub_map_gen(lower, upper, set)
: ordered_set('elem, 'order)
less(upperbound, (set : ordered_set('elem, 'order))) =
lower = _elem -> true
upper = key -> Order.is_smallereq(key, upperbound, order)
MapSet.sub_map_gen(lower, upper, set)
: ordered_set('elem, 'order)
random_get(m:ordered_set(_,'order)) = Option.map(_.f1,MapSet.random_get(m))
}} : Set('elem, 'order)
/**
* {1 Functions and modules exported to the global namespace}
*/
/**
* The default [Set] module.
*
* Chances are that you will use this module for most tasks. It uses the default comparison.
*/
Set = @nonexpansive(Set_make(Order.default)) : Set('elem, Order.default)
/**
* A [Set] on strings, using alphabetical comparison on strings.
*
* This instance of [Set] differentiates uppercase from lowercase.
* Otherwise, the order between strings is alphabetical.
*/
@workable
StringSet = Set_make(String.order) : Set(string, String.order)
/**
* A [Set] on numbers, using numeric comparison.
*/
@workable
IntSet = Set_make(Int.order) : Set(int, Int.order)