Source file set.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
open! Import
module List = List0
open Set_intf
module Merge_to_sequence_element = Merge_to_sequence_element
module Named = Named
module type Elt_plain = Elt_plain
module type Elt = Elt
module type Elt_binable = Elt_binable
let to_comparator (type k cmp) ((module M) : (k, cmp) Comparator.Module.t) = M.comparator
let of_comparator (type k cmp) comparator : (k, cmp) Comparator.Module.t =
(module struct
type t = k
type comparator_witness = cmp
let comparator = comparator
end)
;;
module For_quickcheck = struct
let quickcheck_generator ~comparator elt_gen =
Base_quickcheck.Generator.set_t_m (of_comparator comparator) elt_gen
;;
let gen_tree ~comparator elt_gen =
Base_quickcheck.Generator.set_tree_using_comparator ~comparator elt_gen
;;
let quickcheck_observer elt_obs = Base_quickcheck.Observer.set_t elt_obs
let obs_tree elt_obs = Base_quickcheck.Observer.set_tree elt_obs
let quickcheck_shrinker elt_shr = Base_quickcheck.Shrinker.set_t elt_shr
let shr_tree ~comparator elt_shr =
Base_quickcheck.Shrinker.set_tree_using_comparator ~comparator elt_shr
;;
end
let quickcheck_generator m elt_gen =
For_quickcheck.quickcheck_generator ~comparator:(to_comparator m) elt_gen
;;
let quickcheck_observer = For_quickcheck.quickcheck_observer
let quickcheck_shrinker = For_quickcheck.quickcheck_shrinker
module Tree = struct
include Tree
let to_map ~comparator t = Map.of_key_set (Set.Using_comparator.of_tree t ~comparator)
let of_map_keys m = Set.Using_comparator.to_tree (Map.key_set m)
let of_hash_set ~comparator hset =
Hash_set.fold hset ~init:(empty ~comparator) ~f:(fun t x -> add t x ~comparator)
;;
let of_hashtbl_keys ~comparator hashtbl =
Hashtbl.fold hashtbl ~init:(empty ~comparator) ~f:(fun ~key:x ~data:_ t ->
add t x ~comparator)
;;
let quickcheck_generator = For_quickcheck.gen_tree
let quickcheck_observer = For_quickcheck.obs_tree
let quickcheck_shrinker = For_quickcheck.shr_tree
end
module Accessors = struct
include (
Set.Using_comparator :
Set.Accessors2
with type ('a, 'b) t := ('a, 'b) Set.t
with type ('a, 'b) tree := ('a, 'b) Tree.t
with type ('a, 'b) named := ('a, 'b) Set.Named.t)
let to_map = Map.of_key_set
let quickcheck_observer = quickcheck_observer
let quickcheck_shrinker = quickcheck_shrinker
end
type 'a cmp = 'a
type 'a elt = 'a
include (
struct
include Set
let of_tree m = Set.Using_comparator.of_tree ~comparator:(to_comparator m)
let to_tree = Set.Using_comparator.to_tree
let sexp_of_t = Set.Using_comparator.sexp_of_t
end :
sig
type ('a, 'b) t = ('a, 'b) Set.t [@@deriving sexp_of]
include
Set.Creators_generic
with type ('a, 'b, 'c) options := ('a, 'b, 'c) Set.With_first_class_module.t
with type ('a, 'b) t := ('a, 'b) t
with type ('a, 'b) set := ('a, 'b) t
with type ('a, 'b) tree := ('a, 'b) Tree.t
with type 'a cmp := 'a cmp
with type 'a elt := 'a elt
include
Set.Accessors2
with type ('a, 'b) t := ('a, 'b) t
with type ('a, 'b) tree := ('a, 'b) Tree.t
with type ('a, 'b) named := ('a, 'b) Set.Named.t
with module Named := Named
end)
type ('k, 'cmp) comparator =
(module Comparator.S with type t = 'k and type comparator_witness = 'cmp)
let compare _ _ t1 t2 = compare_direct t1 t2
module Using_comparator = struct
include (
Set.Using_comparator :
module type of struct
include Set.Using_comparator
end
with module Tree := Set.Using_comparator.Tree)
include For_quickcheck
let of_map_keys = Map.key_set
let of_hash_set ~comparator hset =
of_tree ~comparator (Tree.of_hash_set hset ~comparator)
;;
let of_hashtbl_keys ~comparator hashtbl =
of_tree ~comparator (Tree.of_hashtbl_keys hashtbl ~comparator)
;;
end
let to_map = Map.of_key_set
let of_map_keys = Map.key_set
let hash_fold_direct = Using_comparator.hash_fold_direct
let comparator = Using_comparator.comparator
let of_hash_set m hset = Using_comparator.of_hash_set ~comparator:(to_comparator m) hset
let of_hashtbl_keys m hashtbl =
Using_comparator.of_hashtbl_keys ~comparator:(to_comparator m) hashtbl
;;
module Creators (Elt : Comparator.S1) : sig
type nonrec ('a, 'comparator) t_ = ('a Elt.t, Elt.comparator_witness) t
type ('a, 'b) tree = ('a, Elt.comparator_witness) Tree.t
type 'a elt_ = 'a Elt.t
type 'a cmp_ = Elt.comparator_witness
val t_of_sexp : (Base.Sexp.t -> 'a Elt.t) -> Base.Sexp.t -> ('a, 'comparator) t_
include
Creators_generic
with type ('a, 'b) t := ('a, 'b) t_
with type ('a, 'b) set := ('a, 'b) t
with type ('a, 'b) tree := ('a, 'b) tree
with type 'a elt := 'a elt_
with type ('a, 'b, 'c) options := ('a, 'b, 'c) Without_comparator.t
with type 'a cmp := 'a cmp_
end = struct
open Using_comparator
type nonrec ('a, 'comparator) t_ = ('a Elt.t, Elt.comparator_witness) t
type ('a, 'b) tree = ('a, Elt.comparator_witness) Tree.t
type 'a elt_ = 'a Elt.t
type 'cmp cmp_ = Elt.comparator_witness
let comparator = Elt.comparator
let of_tree tree = of_tree ~comparator tree
let of_sorted_array_unchecked array = of_sorted_array_unchecked ~comparator array
let of_increasing_iterator_unchecked ~len ~f =
of_increasing_iterator_unchecked ~comparator ~len ~f
;;
let of_sorted_array array = of_sorted_array ~comparator array
module M_empty = Empty_without_value_restriction (Elt)
let empty = M_empty.empty
let singleton e = singleton ~comparator e
let union_list l = union_list ~comparator l
let of_list l = of_list ~comparator l
let of_sequence s = of_sequence ~comparator s
let of_hash_set h = of_hash_set ~comparator h
let of_hashtbl_keys h = of_hashtbl_keys ~comparator h
let of_array a = of_array ~comparator a
let stable_dedup_list xs = stable_dedup_list ~comparator xs
let map t ~f = map ~comparator t ~f
let filter_map t ~f = filter_map ~comparator t ~f
let t_of_sexp a_of_sexp sexp =
of_tree (Tree.t_of_sexp_direct a_of_sexp sexp ~comparator)
;;
let of_map_keys = Map.key_set
let quickcheck_generator elt = quickcheck_generator ~comparator elt
end
module Make_tree_S1 (Elt : Comparator.S1) = struct
let comparator = Elt.comparator
let empty = Tree.empty_without_value_restriction
let singleton e = Tree.singleton ~comparator e
let invariants t = Tree.invariants t ~comparator
let length t = Tree.length t
let is_empty t = Tree.is_empty t
let elements t = Tree.elements t
let min_elt t = Tree.min_elt t
let min_elt_exn t = Tree.min_elt_exn t
let max_elt t = Tree.max_elt t
let max_elt_exn t = Tree.max_elt_exn t
let choose t = Tree.choose t
let choose_exn t = Tree.choose_exn t
let to_list t = Tree.to_list t
let to_array t = Tree.to_array t
let iter t ~f = Tree.iter t ~f
let iter2 a b ~f = Tree.iter2 a b ~f ~comparator
let exists t ~f = Tree.exists t ~f
let for_all t ~f = Tree.for_all t ~f
let count t ~f = Tree.count t ~f
let sum m t ~f = Tree.sum m t ~f
let find t ~f = Tree.find t ~f
let find_exn t ~f = Tree.find_exn t ~f
let find_map t ~f = Tree.find_map t ~f
let fold t ~init ~f = Tree.fold t ~init ~f
let fold_until t ~init ~f = Tree.fold_until t ~init ~f
let fold_right t ~init ~f = Tree.fold_right t ~init ~f
let fold_result t ~init ~f = Container.fold_result ~fold ~init ~f t
let map t ~f = Tree.map t ~f ~comparator
let filter t ~f = Tree.filter t ~f ~comparator
let filter_map t ~f = Tree.filter_map t ~f ~comparator
let partition_tf t ~f = Tree.partition_tf t ~f ~comparator
let mem t a = Tree.mem t a ~comparator
let add t a = Tree.add t a ~comparator
let remove t a = Tree.remove t a ~comparator
let union t1 t2 = Tree.union t1 t2 ~comparator
let inter t1 t2 = Tree.inter t1 t2 ~comparator
let diff t1 t2 = Tree.diff t1 t2 ~comparator
let symmetric_diff t1 t2 = Tree.symmetric_diff t1 t2 ~comparator
let compare_direct t1 t2 = Tree.compare_direct ~comparator t1 t2
let equal t1 t2 = Tree.equal t1 t2 ~comparator
let is_subset t ~of_ = Tree.is_subset t ~of_ ~comparator
let are_disjoint t1 t2 = Tree.are_disjoint t1 t2 ~comparator
let of_list l = Tree.of_list l ~comparator
let of_sequence s = Tree.of_sequence s ~comparator
let of_hash_set h = Tree.of_hash_set h ~comparator
let of_hashtbl_keys h = Tree.of_hashtbl_keys h ~comparator
let of_array a = Tree.of_array a ~comparator
let of_sorted_array_unchecked a = Tree.of_sorted_array_unchecked a ~comparator
let of_increasing_iterator_unchecked ~len ~f =
Tree.of_increasing_iterator_unchecked ~len ~f ~comparator
;;
let of_sorted_array a = Tree.of_sorted_array a ~comparator
let union_list l = Tree.union_list l ~comparator
let stable_dedup_list xs = Tree.stable_dedup_list xs ~comparator
let group_by t ~equiv = Tree.group_by t ~equiv ~comparator
let split t a = Tree.split t a ~comparator
let nth t i = Tree.nth t i
let remove_index t i = Tree.remove_index t i ~comparator
let to_tree t = t
let of_tree t = t
let to_sequence ?order ?greater_or_equal_to ?less_or_equal_to t =
Tree.to_sequence ~comparator ?order ?greater_or_equal_to ?less_or_equal_to t
;;
let binary_search t ~compare how v = Tree.binary_search ~comparator t ~compare how v
let binary_search_segmented t ~segment_of how =
Tree.binary_search_segmented ~comparator t ~segment_of how
;;
let merge_to_sequence ?order ?greater_or_equal_to ?less_or_equal_to t t' =
Tree.merge_to_sequence ~comparator ?order ?greater_or_equal_to ?less_or_equal_to t t'
;;
let of_map_keys = Tree.of_map_keys
let to_map t ~f = Tree.to_map ~comparator t ~f
module Named = struct
let is_subset t ~of_ = Tree.Named.is_subset t ~of_ ~comparator
let equal t1 t2 = Tree.Named.equal t1 t2 ~comparator
end
let quickcheck_generator elt = For_quickcheck.gen_tree elt ~comparator
let quickcheck_observer elt = For_quickcheck.obs_tree elt
let quickcheck_shrinker elt = For_quickcheck.shr_tree elt ~comparator
end
module Make_tree_plain (Elt : sig
type t [@@deriving sexp_of]
include Comparator.S with type t := t
end) =
struct
module Elt_S1 = Comparator.S_to_S1 (Elt)
include Make_tree_S1 (Elt_S1)
type t = (Elt.t, Elt.comparator_witness) Tree.t
type named = (Elt.t, Elt.comparator_witness) Tree.Named.t
let compare t1 t2 = compare_direct t1 t2
let sexp_of_t t = Tree.sexp_of_t Elt.sexp_of_t [%sexp_of: _] t
module Provide_of_sexp
(X : sig
type t [@@deriving of_sexp]
end
with type t := Elt.t) =
struct
let t_of_sexp sexp =
Tree.t_of_sexp_direct X.t_of_sexp sexp ~comparator:Elt_S1.comparator
;;
end
end
module Make_tree (Elt : sig
type t [@@deriving sexp]
include Comparator.S with type t := t
end) =
struct
include Make_tree_plain (Elt)
include Provide_of_sexp (Elt)
end
let init_for_bin_prot ~len ~f ~comparator =
let set = Using_comparator.of_increasing_iterator_unchecked ~comparator ~len ~f in
if invariants set
then set
else
Using_comparator.of_tree
~comparator
(fold set ~init:(Tree.empty ~comparator) ~f:(fun acc elt ->
if Tree.mem acc elt ~comparator
then failwith "Set.bin_read_t: duplicate element in map"
else Tree.add acc elt ~comparator))
;;
module Poly = struct
module Elt = Comparator.Poly
include Creators (Elt)
type nonrec 'a t = ('a, Elt.comparator_witness) t
type 'a named = ('a, Elt.comparator_witness) Named.t
include Accessors
let compare _ t1 t2 = compare_direct t1 t2
let sexp_of_t sexp_of_k t = sexp_of_t sexp_of_k [%sexp_of: _] t
let t_sexp_grammar elt_grammar =
Sexplib.Sexp_grammar.coerce (List.t_sexp_grammar elt_grammar)
;;
include Bin_prot.Utils.Make_iterable_binable1 (struct
type nonrec 'a t = 'a t
type 'a el = 'a [@@deriving bin_io]
let _ = bin_el
let caller_identity =
Bin_prot.Shape.Uuid.of_string "88bcc478-4992-11e6-a95d-ff4831acf410"
;;
let module_name = Some "Core.Set"
let length = length
let iter t ~f = iter ~f:(fun key -> f key) t
let init ~len ~next =
init_for_bin_prot ~len ~f:(fun _ -> next ()) ~comparator:Comparator.Poly.comparator
;;
end)
module Tree = struct
include Make_tree_S1 (Comparator.Poly)
type 'elt t = ('elt, Comparator.Poly.comparator_witness) tree
type 'a named = ('a, Elt.comparator_witness) Tree.Named.t
let sexp_of_t sexp_of_elt t = Tree.sexp_of_t sexp_of_elt [%sexp_of: _] t
let t_of_sexp elt_of_sexp sexp =
Tree.t_of_sexp_direct elt_of_sexp sexp ~comparator:Comparator.Poly.comparator
;;
let t_sexp_grammar grammar = Sexplib.Sexp_grammar.coerce (List.t_sexp_grammar grammar)
end
end
module type S_plain = S_plain
module type S = S
module type S_binable = S_binable
module Elt_bin_io = Elt_bin_io
module Provide_bin_io (Elt : Elt_bin_io.S) = Bin_prot.Utils.Make_iterable_binable (struct
type nonrec t = (Elt.t, Elt.comparator_witness) t
type el = Elt.t [@@deriving bin_io]
let _ = bin_el
let caller_identity =
Bin_prot.Shape.Uuid.of_string "8989278e-4992-11e6-8f4a-6b89776b1e53"
;;
let module_name = Some "Core.Set"
let length = length
let iter t ~f = iter ~f:(fun key -> f key) t
let init ~len ~next =
init_for_bin_prot ~len ~f:(fun _ -> next ()) ~comparator:Elt.comparator
;;
end)
module Make_plain_using_comparator (Elt : sig
type t [@@deriving sexp_of]
include Comparator.S with type t := t
end) =
struct
module Elt = Elt
module Elt_S1 = Comparator.S_to_S1 (Elt)
include Creators (Elt_S1)
type ('a, 'b) set = ('a, 'b) t
type t = (Elt.t, Elt.comparator_witness) set
type named = (Elt.t, Elt.comparator_witness) Named.t
include Accessors
let compare t1 t2 = compare_direct t1 t2
let sexp_of_t t = sexp_of_t Elt.sexp_of_t [%sexp_of: _] t
module Provide_of_sexp
(Elt : sig
type t [@@deriving of_sexp]
end
with type t := Elt.t) =
struct
let t_of_sexp sexp = t_of_sexp Elt.t_of_sexp sexp
end
module Provide_hash (Elt : Hasher.S with type t := Elt.t) = struct
let hash_fold_t state t = Using_comparator.hash_fold_direct Elt.hash_fold_t state t
let hash t =
Ppx_hash_lib.Std.Hash.get_hash_value
(hash_fold_t (Ppx_hash_lib.Std.Hash.create ()) t)
;;
end
module Provide_bin_io
(Elt' : sig
type t [@@deriving bin_io]
end
with type t := Elt.t) =
Provide_bin_io (struct
include Elt
include Elt'
end)
end
module Make_plain (Elt : Elt_plain) = Make_plain_using_comparator (struct
include Elt
include Comparator.Make (Elt)
end)
module Make_using_comparator (Elt_sexp : sig
type t [@@deriving sexp]
include Comparator.S with type t := t
end) =
struct
include Make_plain_using_comparator (Elt_sexp)
module Elt = Elt_sexp
include Provide_of_sexp (Elt)
end
module Make (Elt : Elt) = Make_using_comparator (struct
include Elt
include Comparator.Make (Elt)
end)
module Make_binable_using_comparator (Elt_bin_sexp : sig
type t [@@deriving bin_io, sexp]
include Comparator.S with type t := t
end) =
struct
include Make_using_comparator (Elt_bin_sexp)
module Elt = Elt_bin_sexp
include Provide_bin_io (Elt)
end
module Make_binable (Elt : Elt_binable) = Make_binable_using_comparator (struct
include Elt
include Comparator.Make (Elt)
end)
module For_deriving = struct
module M = Set.M
let bin_shape_m__t (type t c) (m : (t, c) Elt_bin_io.t) =
let module M = Provide_bin_io ((val m)) in
M.bin_shape_t
;;
let bin_size_m__t (type t c) (m : (t, c) Elt_bin_io.t) =
let module M = Provide_bin_io ((val m)) in
M.bin_size_t
;;
let bin_write_m__t (type t c) (m : (t, c) Elt_bin_io.t) =
let module M = Provide_bin_io ((val m)) in
M.bin_write_t
;;
let bin_read_m__t (type t c) (m : (t, c) Elt_bin_io.t) =
let module M = Provide_bin_io ((val m)) in
M.bin_read_t
;;
let __bin_read_m__t__ (type t c) (m : (t, c) Elt_bin_io.t) =
let module M = Provide_bin_io ((val m)) in
M.__bin_read_t__
;;
module type Quickcheck_generator_m = sig
include Comparator.S
val quickcheck_generator : t Quickcheck.Generator.t
end
module type Quickcheck_observer_m = sig
include Comparator.S
val quickcheck_observer : t Quickcheck.Observer.t
end
module type Quickcheck_shrinker_m = sig
include Comparator.S
val quickcheck_shrinker : t Quickcheck.Shrinker.t
end
let quickcheck_generator_m__t
(type t cmp)
(module Elt : Quickcheck_generator_m
with type t = t
and type comparator_witness = cmp)
=
quickcheck_generator (module Elt) Elt.quickcheck_generator
;;
let quickcheck_observer_m__t
(type t cmp)
(module Elt : Quickcheck_observer_m
with type t = t
and type comparator_witness = cmp)
=
quickcheck_observer Elt.quickcheck_observer
;;
let quickcheck_shrinker_m__t
(type t cmp)
(module Elt : Quickcheck_shrinker_m
with type t = t
and type comparator_witness = cmp)
=
quickcheck_shrinker Elt.quickcheck_shrinker
;;
module type For_deriving = Set.For_deriving
include (Set : For_deriving with type ('a, 'b) t := ('a, 'b) t)
end
include For_deriving
module Stable = struct
module V1 = struct
type nonrec ('a, 'cmp) t = ('a, 'cmp) t
module type S = sig
type elt
type elt_comparator_witness
type nonrec t = (elt, elt_comparator_witness) t
include Stable_module_types.S0_without_comparator with type t := t
end
include For_deriving
module Make (Elt : Stable_module_types.S0) = Make_binable_using_comparator (Elt)
end
end