Source file mapExt.ml
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
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
open MapExtSig
module Make(Ord: OrderedType) =
struct
type key = Ord.t
type 'a t =
Empty
| Node of 'a t * key * 'a * 'a t * int
let height = function
Empty -> 0
| Node(_,_,_,_,h) -> h
let create l x d r =
let hl = height l and hr = height r in
Node(l, x, d, r, (if hl >= hr then hl + 1 else hr + 1))
let singleton x d = Node(Empty, x, d, Empty, 1)
let bal l x d r =
let hl = match l with Empty -> 0 | Node(_,_,_,_,h) -> h in
let hr = match r with Empty -> 0 | Node(_,_,_,_,h) -> h in
if hl > hr + 2 then begin
match l with
Empty -> invalid_arg "Mapext.bal"
| Node(ll, lv, ld, lr, _) ->
if height ll >= height lr then
create ll lv ld (create lr x d r)
else begin
match lr with
Empty -> invalid_arg "Mapext.bal"
| Node(lrl, lrv, lrd, lrr, _)->
create (create ll lv ld lrl) lrv lrd (create lrr x d r)
end
end else if hr > hl + 2 then begin
match r with
Empty -> invalid_arg "Mapext.bal"
| Node(rl, rv, rd, rr, _) ->
if height rr >= height rl then
create (create l x d rl) rv rd rr
else begin
match rl with
Empty -> invalid_arg "Mapext.bal"
| Node(rll, rlv, rld, rlr, _) ->
create (create l x d rll) rlv rld (create rlr rv rd rr)
end
end else
Node(l, x, d, r, (if hl >= hr then hl + 1 else hr + 1))
let empty = Empty
let is_empty = function Empty -> true | _ -> false
let rec add x data m = match m with
Empty ->
Node(Empty, x, data, Empty, 1)
| Node(l, v, d, r, h) ->
let c = Ord.compare x v in
if c = 0 then
if d == data then m else Node(l, x, data, r, h)
else if c < 0 then
let ll = add x data l in
if l == ll then m else bal ll v d r
else
let rr = add x data r in
if r == rr then m else bal l v d rr
let rec find x = function
Empty ->
raise Not_found
| Node(l, v, d, r, _) ->
let c = Ord.compare x v in
if c = 0 then d
else find x (if c < 0 then l else r)
let rec find_opt x = function
Empty ->
None
| Node(l, v, d, r, _) ->
let c = Ord.compare x v in
if c = 0 then Some d
else find_opt x (if c < 0 then l else r)
let rec mem x = function
Empty ->
false
| Node(l, v, d, r, _) ->
let c = Ord.compare x v in
c = 0 || mem x (if c < 0 then l else r)
let rec min_binding = function
Empty -> raise Not_found
| Node(Empty, x, d, r, _) -> (x, d)
| Node(l, x, d, r, _) -> min_binding l
let rec max_binding = function
Empty -> raise Not_found
| Node(l, x, d, Empty, _) -> (x, d)
| Node(l, x, d, r, _) -> max_binding r
let rec remove_min_binding = function
Empty -> invalid_arg "Mapext.remove_min_elt"
| Node(Empty, x, d, r, _) -> r
| Node(l, x, d, r, _) -> bal (remove_min_binding l) x d r
let merge t1 t2 =
match (t1, t2) with
(Empty, t) -> t
| (t, Empty) -> t
| (_, _) ->
let (x, d) = min_binding t2 in
bal t1 x d (remove_min_binding t2)
let rec remove x m = match m with
Empty ->
Empty
| Node(l, v, d, r, h) ->
let c = Ord.compare x v in
if c = 0 then
merge l r
else if c < 0 then
let ll = remove x l in if l == ll then m else bal ll v d r
else
let rr = remove x r in if r == rr then m else bal l v d rr
let rec iter f = function
Empty -> ()
| Node(l, v, d, r, _) ->
iter f l; f v d; iter f r
let rec map f = function
Empty ->
Empty
| Node(l, v, d, r, h) ->
let l' = map f l in
let d' = f d in
let r' = map f r in
Node(l', v, d', r', h)
let rec mapi f = function
Empty ->
Empty
| Node(l, v, d, r, h) ->
let l' = mapi f l in
let d' = f v d in
let r' = mapi f r in
Node(l', v, d', r', h)
let rec fold f m accu =
match m with
Empty -> accu
| Node(l, v, d, r, _) ->
fold f r (f v d (fold f l accu))
let rec for_all p = function
Empty -> true
| Node(l, v, d, r, _) -> for_all p l && p v d && for_all p r
let rec exists p = function
Empty -> false
| Node(l, v, d, r, _) -> exists p l || p v d || exists p r
let filter p s =
fold (fun k d a -> if p k d then add k d a else a) s Empty
let partition p s =
let rec part (t, f as accu) = function
| Empty -> accu
| Node(l, v, d, r, _) ->
part (part (if p v d then (add v d t, f) else (t, add v d f)) l) r in
part (Empty, Empty) s
let rec join l v d r =
match (l, r) with
(Empty, _) -> add v d r
| (_, Empty) -> add v d l
| (Node(ll, lv, ld, lr, lh), Node(rl, rv, rd, rr, rh)) ->
if lh > rh + 2 then bal ll lv ld (join lr v d r) else
if rh > lh + 2 then bal (join l v d rl) rv rd rr else
create l v d r
let concat t1 t2 =
match (t1, t2) with
(Empty, t) -> t
| (t, Empty) -> t
| (_, _) ->
let (x, d) = min_binding t2 in
join t1 x d (remove_min_binding t2)
let concat_or_join t1 v d t2 =
match d with
| Some d -> join t1 v d t2
| None -> concat t1 t2
let rec split x = function
Empty ->
(Empty, None, Empty)
| Node(l, v, d, r, _) ->
let c = Ord.compare x v in
if c = 0 then (l, Some d, r)
else if c < 0 then
let (ll, pres, rl) = split x l in (ll, pres, join rl v d r)
else
let (lr, pres, rr) = split x r in (join l v d lr, pres, rr)
let rec merge f s1 s2 =
match (s1, s2) with
(Empty, Empty) -> Empty
| (Node (l1, v1, d1, r1, h1), _) when h1 >= height s2 ->
let (l2, d2, r2) = split v1 s2 in
concat_or_join (merge f l1 l2) v1 (f v1 (Some d1) d2) (merge f r1 r2)
| (_, Node (l2, v2, d2, r2, h2)) ->
let (l1, d1, r1) = split v2 s1 in
concat_or_join (merge f l1 l2) v2 (f v2 d1 (Some d2)) (merge f r1 r2)
| _ ->
assert false
type 'a enumeration = End | More of key * 'a * 'a t * 'a enumeration
let rec cons_enum m e =
match m with
Empty -> e
| Node(l, v, d, r, _) -> cons_enum l (More(v, d, r, e))
let rec cardinal = function
Empty -> 0
| Node(l, _, _, r, _) -> cardinal l + 1 + cardinal r
let rec bindings_aux accu = function
Empty -> accu
| Node(l, v, d, r, _) -> bindings_aux ((v, d) :: bindings_aux accu r) l
let bindings s =
bindings_aux [] s
let choose = min_binding
let is_singleton = function
| Node (Empty, _, _, Empty, _) -> true
| _ -> false
let of_list l =
List.fold_left (fun acc (k,x) -> add k x acc) empty l
let rec cut k = function
Empty -> Empty,None,Empty
| Node (l1,k1,d1,r1,h1) ->
let c = Ord.compare k k1 in
if c < 0 then
let l2,d2,r2 = cut k l1 in (l2,d2,Node (r2,k1,d1,r1,h1))
else if c > 0 then
let l2,d2,r2 = cut k r1 in (Node (l1,k1,d1,l2,h1),d2,r2)
else (l1,Some d1,r1)
let rec map2 f m1 m2 =
match m1 with
| Empty -> if m2 = Empty then Empty else invalid_arg "Mapext.map2"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
Node (map2 f l1 l2, k, f k d1 d2, map2 f r1 r2, h1)
| _, None, _ -> invalid_arg "Mapext.map2"
let rec iter2 f m1 m2 =
match m1 with
| Empty -> if m2 = Empty then () else invalid_arg "Mapext.iter2"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 -> iter2 f l1 l2; f k d1 d2; iter2 f r1 r2
| _, None, _ -> invalid_arg "Mapext.iter2"
let rec fold2 f m1 m2 acc =
match m1 with
| Empty -> if m2 = Empty then acc else invalid_arg "Mapext.fold2"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
fold2 f r1 r2 (f k d1 d2 (fold2 f l1 l2 acc))
| _, None, _ -> invalid_arg "Mapext.fold2"
let rec for_all2 f m1 m2 =
match m1 with
| Empty -> if m2 = Empty then true else invalid_arg "Mapext.for_all2"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
for_all2 f l1 l2 && f k d1 d2 && for_all2 f r1 r2
| _, None, _ -> invalid_arg "Mapext.for_all2"
let rec exists2 f m1 m2 =
match m1 with
| Empty -> if m2 = Empty then false else invalid_arg "Mapext.exists2"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
exists2 f l1 l2 || f k d1 d2 || exists2 f r1 r2
| _, None, _ -> invalid_arg "Mapext.exists2"
let rec map2z f m1 m2 =
if m1 == m2 then m1 else
match m1 with
| Empty -> if m2 = Empty then Empty else invalid_arg "Mapext.map2z"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
let d = if d1 == d2 then d1 else f k d1 d2 in
Node (map2z f l1 l2, k, d, map2z f r1 r2, h1)
| _, None, _ -> invalid_arg "Mapext.map2z"
let rec iter2z f m1 m2 =
if m1 == m2 then () else
match m1 with
| Empty -> if m2 = Empty then () else invalid_arg "Mapext.iter2z"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
iter2z f l1 l2; (if d1 != d2 then f k d1 d2); iter2z f r1 r2
| _, None, _ -> invalid_arg "Mapext.iter2z"
let rec fold2z f m1 m2 acc =
if m1 == m2 then acc else
match m1 with
| Empty -> if m2 = Empty then acc else invalid_arg "Mapext.fold2z"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
let acc = fold2z f l1 l2 acc in
let acc = if d1 == d2 then acc else f k d1 d2 acc in
fold2z f r1 r2 acc
| _, None, _ -> invalid_arg "Mapext.fold2z"
let rec for_all2z f m1 m2 =
(m1 == m2) ||
(match m1 with
| Empty -> if m2 = Empty then true else invalid_arg "Mapext.for_all2z"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
(for_all2z f l1 l2) &&
(d1 == d2 || f k d1 d2) &&
(for_all2z f r1 r2)
| _, None, _ -> invalid_arg "Mapext.for_all2z"
)
let rec exists2z f m1 m2 =
(m1 != m2) &&
(match m1 with
| Empty -> if m2 = Empty then false else invalid_arg "Mapext.exists2z"
| Node (l1,k,d1,r1,h1) ->
match cut k m2 with
| l2, Some d2, r2 ->
(exists2z f l1 l2) ||
(d1 != d2 && f k d1 d2) ||
(exists2z f r1 r2)
| _, None, _ -> invalid_arg "Mapext.exists2z"
)
let rec map2o f1 f2 f m1 m2 =
match m1 with
| Empty -> mapi f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
let l = map2o f1 f2 f l1 l2 in
let d = match d2 with None -> f1 k d1 | Some d2 -> f k d1 d2 in
let r = map2o f1 f2 f r1 r2 in
join l k d r
let rec iter2o f1 f2 f m1 m2 =
match m1 with
| Empty -> iter f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
iter2o f1 f2 f l1 l2;
(match d2 with None -> f1 k d1 | Some d2 -> f k d1 d2);
iter2o f1 f2 f r1 r2
let rec fold2o f1 f2 f m1 m2 acc =
match m1 with
| Empty -> fold f2 m2 acc
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
let acc = fold2o f1 f2 f l1 l2 acc in
let acc = match d2 with
| None -> f1 k d1 acc | Some d2 -> f k d1 d2 acc
in
fold2o f1 f2 f r1 r2 acc
let rec for_all2o f1 f2 f m1 m2 =
match m1 with
| Empty -> for_all f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
(for_all2o f1 f2 f l1 l2) &&
(match d2 with None -> f1 k d1 | Some d2 -> f k d1 d2) &&
(for_all2o f1 f2 f r1 r2)
let rec exists2o f1 f2 f m1 m2 =
match m1 with
| Empty -> exists f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
(exists2o f1 f2 f l1 l2) ||
(match d2 with None -> f1 k d1 | Some d2 -> f k d1 d2) ||
(exists2o f1 f2 f r1 r2)
let rec map2zo f1 f2 f m1 m2 =
if m1 == m2 then m1 else
match m1 with
| Empty -> mapi f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
let l = map2zo f1 f2 f l1 l2 in
let d = match d2 with
| None -> f1 k d1
| Some d2 -> if d1 == d2 then d1 else f k d1 d2
in
let r = map2zo f1 f2 f r1 r2 in
join l k d r
let rec iter2zo f1 f2 f m1 m2 =
if m1 == m2 then () else
match m1 with
| Empty -> iter f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
iter2zo f1 f2 f l1 l2;
(match d2 with
| None -> f1 k d1
| Some d2 -> if d1 != d2 then f k d1 d2);
iter2zo f1 f2 f r1 r2
let rec fold2zo f1 f2 f m1 m2 acc =
if m1 == m2 then acc else
match m1 with
| Empty -> fold f2 m2 acc
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
let acc = fold2zo f1 f2 f l1 l2 acc in
let acc = match d2 with
| None -> f1 k d1 acc
| Some d2 -> if d1 == d2 then acc else f k d1 d2 acc
in
fold2zo f1 f2 f r1 r2 acc
let rec for_all2zo f1 f2 f m1 m2 =
(m1 == m2) ||
(match m1 with
| Empty -> for_all f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
(for_all2zo f1 f2 f l1 l2) &&
(match d2 with None -> f1 k d1 | Some d2 -> d1 == d2 || f k d1 d2) &&
(for_all2zo f1 f2 f r1 r2)
)
let rec exists2zo f1 f2 f m1 m2 =
(m1 != m2) &&
(match m1 with
| Empty -> exists f2 m2
| Node (l1,k,d1,r1,h1) ->
let l2, d2, r2 = cut k m2 in
(exists2zo f1 f2 f l1 l2) ||
(match d2 with None -> f1 k d1 | Some d2 -> d1 != d2 && f k d1 d2) ||
(exists2zo f1 f2 f r1 r2)
)
let equal cmp m1 m2 =
try
iter2zo
(fun _ _ -> raise Exit)
(fun _ _ -> raise Exit)
(fun _ x y -> if not (cmp x y) then raise Exit)
m1 m2;
true
with Exit -> false
let compare cmp m1 m2 =
let r = ref 0 in
try
iter2zo
(fun _ _ -> r := 1; raise Exit)
(fun _ _ -> r := -1; raise Exit)
(fun _ x y -> r := cmp x y; if !r <> 0 then raise Exit)
m1 m2;
!r
with Exit -> !r
let rec map_slice f m lo hi =
match m with
| Empty -> Empty
| Node (l,k,d,r,h) ->
let c1, c2 = Ord.compare k lo, Ord.compare k hi in
let l = if c1 > 0 then map_slice f l lo hi else l in
let d = if c1 >= 0 && c2 <= 0 then f k d else d in
let r = if c2 < 0 then map_slice f r lo hi else r in
Node (l,k,d,r,h)
let rec iter_slice f m lo hi =
match m with
| Empty -> ()
| Node (l,k,d,r,_) ->
let c1, c2 = Ord.compare k lo, Ord.compare k hi in
if c1 > 0 then iter_slice f l lo hi;
if c1 >= 0 && c2 <= 0 then f k d;
if c2 < 0 then iter_slice f r lo hi
let rec fold_slice f m lo hi acc =
match m with
| Empty -> acc
| Node (l,k,d,r,_) ->
let c1, c2 = Ord.compare k lo, Ord.compare k hi in
let acc = if c1 > 0 then fold_slice f l lo hi acc else acc in
let acc = if c1 >= 0 && c2 <= 0 then f k d acc else acc in
if c2 < 0 then fold_slice f r lo hi acc else acc
let rec for_all_slice f m lo hi =
match m with
| Empty -> true
| Node (l,k,d,r,_) ->
let c1, c2 = Ord.compare k lo, Ord.compare k hi in
(c1 <= 0 || for_all_slice f l lo hi) &&
(c1 < 0 || c2 > 0 || f k d) &&
(c2 >= 0 || for_all_slice f r lo hi)
let rec exists_slice f m lo hi =
match m with
| Empty -> false
| Node (l,k,d,r,_) ->
let c1, c2 = Ord.compare k lo, Ord.compare k hi in
(c1 > 0 && exists_slice f l lo hi) ||
(c1 >= 0 && c2 <= 0 && f k d) ||
(c2 < 0 && exists_slice f r lo hi)
let rec key_equal m1 m2 =
(m1 == m2) ||
(match m1 with
| Empty -> m2 = Empty
| Node (l1, k, _, r1, _) ->
match cut k m2 with
| _, None, _ -> false
| l2, Some _, r2 -> key_equal l1 l2 && key_equal r1 r2
)
let rec key_subset m1 m2 =
(m1 == m2) ||
(match m1 with
| Empty -> true
| Node (l1, k, _, r1, _) ->
match cut k m2 with
| _, None, _ -> false
| l2, Some _, r2 -> key_subset l1 l2 && key_subset r1 r2
)
let find_greater_equal k m =
let rec aux m found = match m with
| Empty -> (match found with None -> raise Not_found | Some x -> x)
| Node (l, kk, d, r, _) ->
let c = Ord.compare k kk in
if c = 0 then kk, d else
if c > 0 then aux r found else
aux l (Some (kk, d))
in
aux m None
let find_greater k m =
let rec aux m found = match m with
| Empty -> (match found with None -> raise Not_found | Some x -> x)
| Node (l, kk, d, r, _) ->
let c = Ord.compare k kk in
if c >= 0 then aux r found else
aux l (Some (kk, d))
in
aux m None
let find_less_equal k m =
let rec aux m found = match m with
| Empty -> (match found with None -> raise Not_found | Some x -> x)
| Node (l, kk, d, r, _) ->
let c = Ord.compare k kk in
if c = 0 then kk, d else
if c < 0 then aux l found else
aux r (Some (kk, d))
in
aux m None
let find_less k m =
let rec aux m found = match m with
| Empty -> (match found with None -> raise Not_found | Some x -> x)
| Node (l, kk, d, r, _) ->
let c = Ord.compare k kk in
if c <= 0 then aux l found else
aux r (Some (kk, d))
in
aux m None
let print_gen o printer key elem ch s =
if s = Empty then o ch printer.print_empty else (
let first = ref true in
o ch printer.print_begin;
iter
(fun k e ->
if !first then first := false else o ch printer.print_sep;
key ch k;
o ch printer.print_arrow;
elem ch e
) s;
o ch printer.print_end
)
let print printer key elem ch l =
print_gen output_string printer key elem ch l
let bprint printer key elem ch l =
print_gen Buffer.add_string printer key elem ch l
let fprint printer key elem ch l =
print_gen
(fun fmt s -> Format.fprintf fmt "%s" s)
printer key elem ch l
let to_string printer key elem l =
let b = Buffer.create 10 in
print_gen
(fun () s -> Buffer.add_string b s) printer
(fun () k -> Buffer.add_string b (key k))
(fun () e -> Buffer.add_string b (elem e)) () l;
Buffer.contents b
let to_poly_map m =
MapExtPoly.of_list Ord.compare (bindings m)
end
let printer_default = {
print_empty="{}";
print_begin="{";
print_arrow=":";
print_sep=";";
print_end="}";
}
(** [MOPSA] Print as {key1:val1;key2:val2;...} *)
module StringMap = Make(String)
module IntMap = Make(struct type t = int let compare : int -> int -> int = compare end)
module Int32Map = Make(Int32)
module Int64Map = Make(Int64)
module ZMap = Make(Z)