Source file map.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
open! Import
open Map_intf
module List = List0
module Symmetric_diff_element = struct
module Stable = struct
module V1 = struct
type ('k, 'v) t = 'k * [`Left of 'v | `Right of 'v | `Unequal of 'v * 'v]
[@@deriving bin_io, compare, sexp]
let%expect_test _ =
print_endline [%bin_digest: (int, string) t];
[%expect {| 00674be9fe8dfe9e9ad476067d7d8101 |}]
;;
let map (k, diff) ~f1 ~f2 =
let k = f1 k in
let diff =
match diff with
| `Left v -> `Left (f2 v)
| `Right v -> `Right (f2 v)
| `Unequal (v1, v2) -> `Unequal (f2 v1, f2 v2)
in
k, diff
;;
end
end
include Stable.V1
end
type ('k, 'cmp) comparator =
(module
Comparator.S
with type t = 'k
and type comparator_witness = 'cmp)
let to_comparator (type k cmp) ((module M) : (k, cmp) Map.comparator) = M.comparator
let of_comparator (type k cmp) comparator : (k, cmp) Map.comparator =
(module struct
type t = k
type comparator_witness = cmp
let comparator = comparator
end)
;;
module For_quickcheck = struct
let gen_tree ~comparator k_gen v_gen =
Base_quickcheck.Generator.map_tree_using_comparator ~comparator k_gen v_gen
;;
let quickcheck_generator ~comparator k_gen v_gen =
Base_quickcheck.Generator.map_t_m (of_comparator comparator) k_gen v_gen
;;
let obs_tree k_obs v_obs = Base_quickcheck.Observer.map_tree k_obs v_obs
let shr_tree ~comparator k_shr v_shr =
Base_quickcheck.Shrinker.map_tree_using_comparator ~comparator k_shr v_shr
;;
end
let quickcheck_generator = Base_quickcheck.Generator.map_t_m
let quickcheck_observer = Base_quickcheck.Observer.map_t
let quickcheck_shrinker = Base_quickcheck.Shrinker.map_t
module Accessors = struct
include (
Map.Using_comparator :
Map.Accessors3
with type ('a, 'b, 'c) t := ('a, 'b, 'c) Map.t
with type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t)
let quickcheck_observer k v = quickcheck_observer k v
let quickcheck_shrinker k v = quickcheck_shrinker k v
end
module Using_comparator = struct
include (
Map.Using_comparator :
module type of struct
include Map.Using_comparator
end
with module Tree := Tree)
include For_quickcheck
let of_hashtbl_exn ~comparator hashtbl =
match of_iteri ~comparator ~iteri:(Hashtbl.iteri hashtbl) with
| `Ok map -> map
| `Duplicate_key key ->
Error.failwiths "Map.of_hashtbl_exn: duplicate key" key comparator.sexp_of_t
;;
let tree_of_hashtbl_exn ~comparator hashtbl =
to_tree (of_hashtbl_exn ~comparator hashtbl)
;;
end
let hash_fold_direct = Using_comparator.hash_fold_direct
let comparator = Using_comparator.comparator
let comparator_s = Base.Map.comparator_s
type 'k key = 'k
include (
struct
include Map
let of_tree m = Map.Using_comparator.of_tree ~comparator:(to_comparator m)
let to_tree = Map.Using_comparator.to_tree
end :
sig
type ('a, 'b, 'c) t = ('a, 'b, 'c) Map.t
include
Map.Creators_generic
with type ('a, 'b, 'c) options := ('a, 'b, 'c) Map.With_first_class_module.t
with type ('a, 'b, 'c) t := ('a, 'b, 'c) t
with type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t
with type 'k key := 'k key
include
Map.Accessors3
with type ('a, 'b, 'c) t := ('a, 'b, 'c) t
with type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t
end)
module Empty_without_value_restriction = Using_comparator.Empty_without_value_restriction
let find_or_error t key =
let comparator = comparator t in
match find t key with
| Some data -> Ok data
| None ->
let sexp_of_key = comparator.sexp_of_t in
Or_error.error_s [%message "key not found" ~_:(key : key)]
;;
let merge_skewed = Map.merge_skewed
let of_hashtbl_exn m t = Using_comparator.of_hashtbl_exn ~comparator:(to_comparator m) t
module Creators (Key : Comparator.S1) : sig
type ('a, 'b, 'c) t_ = ('a Key.t, 'b, Key.comparator_witness) t
type ('a, 'b, 'c) tree = ('a, 'b, Key.comparator_witness) Tree.t
type ('a, 'b, 'c) options = ('a, 'b, 'c) Without_comparator.t
val t_of_sexp
: (Base.Sexp.t -> 'a Key.t)
-> (Base.Sexp.t -> 'b)
-> Base.Sexp.t
-> ('a, 'b, _) t_
include
Creators_generic
with type ('a, 'b, 'c) t := ('a, 'b, 'c) t_
with type ('a, 'b, 'c) tree := ('a, 'b, 'c) tree
with type 'a key := 'a Key.t
with type ('a, 'b, 'c) options := ('a, 'b, 'c) options
end = struct
type ('a, 'b, 'c) options = ('a, 'b, 'c) Without_comparator.t
let comparator = Key.comparator
type ('a, 'b, 'c) t_ = ('a Key.t, 'b, Key.comparator_witness) t
type ('a, 'b, 'c) tree = ('a, 'b, Key.comparator_witness) Tree.t
module M_empty = Empty_without_value_restriction (Key)
let empty = M_empty.empty
let of_tree tree = Using_comparator.of_tree ~comparator tree
let singleton k v = Using_comparator.singleton ~comparator k v
let of_sorted_array_unchecked array =
Using_comparator.of_sorted_array_unchecked ~comparator array
;;
let of_sorted_array array = Using_comparator.of_sorted_array ~comparator array
let of_increasing_iterator_unchecked ~len ~f =
Using_comparator.of_increasing_iterator_unchecked ~comparator ~len ~f
;;
let of_increasing_sequence seq =
Using_comparator.of_increasing_sequence ~comparator seq
;;
let of_alist alist = Using_comparator.of_alist ~comparator alist
let of_alist_or_error alist = Using_comparator.of_alist_or_error ~comparator alist
let of_alist_exn alist = Using_comparator.of_alist_exn ~comparator alist
let of_hashtbl_exn hashtbl = Using_comparator.of_hashtbl_exn ~comparator hashtbl
let of_alist_multi alist = Using_comparator.of_alist_multi ~comparator alist
let of_alist_fold alist ~init ~f =
Using_comparator.of_alist_fold ~comparator alist ~init ~f
;;
let of_alist_reduce alist ~f = Using_comparator.of_alist_reduce ~comparator alist ~f
let of_iteri ~iteri = Using_comparator.of_iteri ~comparator ~iteri
let t_of_sexp k_of_sexp v_of_sexp sexp =
Using_comparator.t_of_sexp_direct ~comparator k_of_sexp v_of_sexp sexp
;;
let quickcheck_generator gen_k gen_v =
Using_comparator.quickcheck_generator ~comparator gen_k gen_v
;;
end
module Make_tree (Key : Comparator.S1) = struct
open Tree
let comparator = Key.comparator
let sexp_of_t = sexp_of_t
let t_of_sexp a b c = t_of_sexp_direct a b c ~comparator
let empty = empty_without_value_restriction
let of_tree tree = tree
let singleton a = singleton a ~comparator
let of_sorted_array_unchecked a = of_sorted_array_unchecked a ~comparator
let of_sorted_array a = of_sorted_array a ~comparator
let of_increasing_iterator_unchecked ~len ~f =
of_increasing_iterator_unchecked ~len ~f ~comparator
;;
let of_increasing_sequence seq = of_increasing_sequence ~comparator seq
let of_alist a = of_alist a ~comparator
let of_alist_or_error a = of_alist_or_error a ~comparator
let of_alist_exn a = of_alist_exn a ~comparator
let of_hashtbl_exn a = Using_comparator.tree_of_hashtbl_exn a ~comparator
let of_alist_multi a = of_alist_multi a ~comparator
let of_alist_fold a ~init ~f = of_alist_fold a ~init ~f ~comparator
let of_alist_reduce a ~f = of_alist_reduce a ~f ~comparator
let of_iteri ~iteri = of_iteri ~iteri ~comparator
let to_tree t = t
let invariants a = invariants a ~comparator
let is_empty a = is_empty a
let length a = length a
let set a ~key ~data = set a ~key ~data ~comparator
let add a ~key ~data = add a ~key ~data ~comparator
let add_exn a ~key ~data = add_exn a ~key ~data ~comparator
let add_multi a ~key ~data = add_multi a ~key ~data ~comparator
let remove_multi a b = remove_multi a b ~comparator
let find_multi a b = find_multi a b ~comparator
let change a b ~f = change a b ~f ~comparator
let update a b ~f = update a b ~f ~comparator
let find_exn a b = find_exn a b ~comparator
let find a b = find a b ~comparator
let remove a b = remove a b ~comparator
let mem a b = mem a b ~comparator
let iter_keys = iter_keys
let iter = iter
let iteri = iteri
let iter2 a b ~f = iter2 a b ~f ~comparator
let map = map
let mapi = mapi
let fold = fold
let fold_right = fold_right
let fold2 a b ~init ~f = fold2 a b ~init ~f ~comparator
let filter_keys a ~f = filter_keys a ~f ~comparator
let filter a ~f = filter a ~f ~comparator
let filteri a ~f = filteri a ~f ~comparator
let filter_map a ~f = filter_map a ~f ~comparator
let filter_mapi a ~f = filter_mapi a ~f ~comparator
let partition_mapi t ~f = partition_mapi t ~f ~comparator
let partition_map t ~f = partition_map t ~f ~comparator
let partitioni_tf t ~f = partitioni_tf t ~f ~comparator
let partition_tf t ~f = partition_tf t ~f ~comparator
let compare_direct a b c = compare_direct a b c ~comparator
let equal a b c = equal a b c ~comparator
let keys = keys
let data = data
let to_alist = to_alist
let validate = validate
let symmetric_diff a b ~data_equal = symmetric_diff a b ~data_equal ~comparator
let merge a b ~f = merge a b ~f ~comparator
let min_elt = min_elt
let min_elt_exn = min_elt_exn
let max_elt = max_elt
let max_elt_exn = max_elt_exn
let for_all = for_all
let for_alli = for_alli
let exists = exists
let existsi = existsi
let count = count
let counti = counti
let split a b = split a b ~comparator
let append ~lower_part ~upper_part = append ~lower_part ~upper_part ~comparator
let subrange t ~lower_bound ~upper_bound =
subrange t ~lower_bound ~upper_bound ~comparator
;;
let fold_range_inclusive t ~min ~max ~init ~f =
fold_range_inclusive t ~min ~max ~init ~f ~comparator
;;
let range_to_alist t ~min ~max = range_to_alist t ~min ~max ~comparator
let closest_key a b c = closest_key a b c ~comparator
let nth a = nth a ~comparator
let nth_exn a = nth_exn a ~comparator
let rank a b = rank a b ~comparator
let to_sequence ?order ?keys_greater_or_equal_to ?keys_less_or_equal_to t =
to_sequence ~comparator ?order ?keys_greater_or_equal_to ?keys_less_or_equal_to t
;;
let quickcheck_generator k v = For_quickcheck.gen_tree ~comparator k v
let quickcheck_observer k v = For_quickcheck.obs_tree k v
let quickcheck_shrinker k v = For_quickcheck.shr_tree ~comparator k v
end
let init_for_bin_prot ~len ~f ~comparator =
let map = Using_comparator.of_increasing_iterator_unchecked ~len ~f ~comparator in
if invariants map
then map
else (
match
Using_comparator.of_iteri ~iteri:(iteri map) ~comparator
with
| `Ok map -> map
| `Duplicate_key _key -> failwith "Map.bin_read_t: duplicate element in map")
;;
module Poly = struct
include Creators (Comparator.Poly)
type ('a, 'b, 'c) map = ('a, 'b, 'c) t
type ('k, 'v) t = ('k, 'v, Comparator.Poly.comparator_witness) map
include Accessors
let compare _ cmpv t1 t2 = compare_direct cmpv t1 t2
let sexp_of_t sexp_of_k sexp_of_v t =
Using_comparator.sexp_of_t sexp_of_k sexp_of_v [%sexp_of: _] t
;;
include Bin_prot.Utils.Make_iterable_binable2 (struct
type nonrec ('a, 'b) t = ('a, 'b) t
type ('a, 'b) el = 'a * 'b [@@deriving bin_io]
let _ = bin_el
let caller_identity =
Bin_prot.Shape.Uuid.of_string "b7d7b1a0-4992-11e6-8a32-bbb221fa025c"
;;
let module_name = Some "Core_kernel.Map"
let length = length
let iter t ~f = iteri t ~f:(fun ~key ~data -> f (key, data))
let init ~len ~next =
init_for_bin_prot ~len ~f:(fun _ -> next ()) ~comparator:Comparator.Poly.comparator
;;
end)
module Tree = struct
include Make_tree (Comparator.Poly)
type ('k, +'v) t = ('k, 'v, Comparator.Poly.comparator_witness) tree
let sexp_of_t sexp_of_k sexp_of_v t = sexp_of_t sexp_of_k sexp_of_v [%sexp_of: _] t
end
end
module type Key_plain = Key_plain
module type Key = Key
module type Key_binable = Key_binable
module type Key_hashable = Key_hashable
module type Key_binable_hashable = Key_binable_hashable
module type S_plain = S_plain
module type S = S
module type S_binable = S_binable
module Make_plain_using_comparator (Key : sig
type t [@@deriving sexp_of]
include Comparator.S with type t := t
end) =
struct
module Key = Key
module Key_S1 = Comparator.S_to_S1 (Key)
include Creators (Key_S1)
type key = Key.t
type ('a, 'b, 'c) map = ('a, 'b, 'c) t
type 'v t = (key, 'v, Key.comparator_witness) map
include Accessors
let compare cmpv t1 t2 = compare_direct cmpv t1 t2
let sexp_of_t sexp_of_v t =
Using_comparator.sexp_of_t Key.sexp_of_t sexp_of_v [%sexp_of: _] t
;;
module Provide_of_sexp
(Key : sig
type t [@@deriving of_sexp]
end
with type t := Key.t) =
struct
let t_of_sexp v_of_sexp sexp = t_of_sexp Key.t_of_sexp v_of_sexp sexp
end
module Provide_hash (Key' : Hasher.S with type t := Key.t) = struct
let hash_fold_t (type a) hash_fold_data state (t : a t) =
Using_comparator.hash_fold_direct Key'.hash_fold_t hash_fold_data state t
;;
end
module Provide_bin_io
(Key' : sig
type t [@@deriving bin_io]
end
with type t := Key.t) =
Bin_prot.Utils.Make_iterable_binable1 (struct
module Key = struct
include Key
include Key'
end
type nonrec 'v t = 'v t
type 'v el = Key.t * 'v [@@deriving bin_io]
let _ = bin_el
let caller_identity =
Bin_prot.Shape.Uuid.of_string "dfb300f8-4992-11e6-9c15-73a2ac6b815c"
;;
let module_name = Some "Core_kernel.Map"
let length = length
let iter t ~f = iteri t ~f:(fun ~key ~data -> f (key, data))
let init ~len ~next =
init_for_bin_prot ~len ~f:(fun _ -> next ()) ~comparator:Key.comparator
;;
end)
module Tree = struct
include Make_tree (Key_S1)
type +'v t = (Key.t, 'v, Key.comparator_witness) tree
let sexp_of_t sexp_of_v t = sexp_of_t Key.sexp_of_t sexp_of_v [%sexp_of: _] t
module Provide_of_sexp
(X : sig
type t [@@deriving of_sexp]
end
with type t := Key.t) =
struct
let t_of_sexp v_of_sexp sexp = t_of_sexp X.t_of_sexp v_of_sexp sexp
end
end
end
module Make_plain (Key : Key_plain) = Make_plain_using_comparator (struct
include Key
include Comparator.Make (Key)
end)
module Make_using_comparator (Key : sig
type t [@@deriving sexp]
include Comparator.S with type t := t
end) =
struct
module Key = Key
module M1 = Make_plain_using_comparator (Key)
include (M1 : module type of M1 with module Tree := M1.Tree with module Key := Key)
include Provide_of_sexp (Key)
module Tree = struct
include M1.Tree
include Provide_of_sexp (Key)
end
end
module Make (Key : Key) = Make_using_comparator (struct
include Key
include Comparator.Make (Key)
end)
module Make_binable_using_comparator (Key : sig
type t [@@deriving bin_io, sexp]
include Comparator.S with type t := t
end) =
struct
module Key = Key
module M2 = Make_using_comparator (Key)
include (M2 : module type of M2 with module Key := Key)
include Provide_bin_io (Key)
end
module Make_binable (Key : Key_binable) = Make_binable_using_comparator (struct
include Key
include Comparator.Make (Key)
end)
module M = Map.M
module type For_deriving = For_deriving
include (Map : For_deriving with type ('a, 'b, 'c) t := ('a, 'b, 'c) t)
module Tree = struct
include Tree
let of_hashtbl_exn = Using_comparator.tree_of_hashtbl_exn
let quickcheck_generator ~comparator k v = For_quickcheck.gen_tree ~comparator k v
let quickcheck_observer k v = For_quickcheck.obs_tree k v
let quickcheck_shrinker ~comparator k v = For_quickcheck.shr_tree ~comparator k v
end
module Stable = struct
module V1 = struct
type nonrec ('k, 'v, 'cmp) t = ('k, 'v, 'cmp) t
module type S = sig
type key
type comparator_witness
type nonrec 'a t = (key, 'a, comparator_witness) t
include Stable_module_types.S1 with type 'a t := 'a t
end
module Make (Key : Stable_module_types.S0) = Make_binable_using_comparator (Key)
end
module Symmetric_diff_element = Symmetric_diff_element.Stable
end