Source file set_intf.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
(** This module defines interfaces used in {{!Core.Set}[Set]}. See the
{!Map} docs for a description of the design.
This module defines module types
[{Creators,Accessors}{0,1,2,_generic,_with_comparator}]. It uses check functors to
ensure that each module type is an instance of the corresponding [_generic] one.
We must treat [Creators] and [Accessors] separately, because we sometimes need to
choose different instantiations of their [options]. In particular, [Set] itself
matches [Creators2_with_comparator] but [Accessors2] (without comparator).
*)
open! Import
module Binable = Binable0
module Set = Base.Set
module Tree = Set.Using_comparator.Tree
module Container = Base.Container
module type Elt_plain = Set.Elt_plain
module type Elt = sig
type t [@@deriving compare, sexp]
end
module type Elt_binable = sig
type t [@@deriving bin_io, compare, sexp]
end
module Elt_bin_io = struct
module type S = sig
type t [@@deriving bin_io]
type comparator_witness
val comparator : (t, comparator_witness) Comparator.t
end
type ('t, 'c) t = (module S with type t = 't and type comparator_witness = 'c)
end
module type For_deriving = sig
include Base.Set.For_deriving
module M = Base.Set.M
(** The following [*bin*] functions support bin-io on base-style sets, e.g.:
{[ type t = Set.M(String).t [@@deriving bin_io] ]} *)
val bin_shape_m__t : ('a, 'b) Elt_bin_io.t -> Bin_prot.Shape.t
val bin_size_m__t : ('a, 'b) Elt_bin_io.t -> ('a, 'b) t Bin_prot.Size.sizer
val bin_write_m__t : ('a, 'b) Elt_bin_io.t -> ('a, 'b) t Bin_prot.Write.writer
val bin_read_m__t : ('a, 'b) Elt_bin_io.t -> ('a, 'b) t Bin_prot.Read.reader
val __bin_read_m__t__
: ('a, 'b) Elt_bin_io.t
-> (int -> ('a, 'b) t) Bin_prot.Read.reader
(** The following [quickcheck*] functions support deriving quickcheck on base-style
sets, e.g.:
{[ type t = Set.M(String).t [@@deriving quickcheck] ]} *)
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
val quickcheck_generator_m__t
: (module Quickcheck_generator_m with type t = 'a and type comparator_witness = 'cmp)
-> ('a, 'cmp) t Quickcheck.Generator.t
val quickcheck_observer_m__t
: (module Quickcheck_observer_m with type t = 'a and type comparator_witness = 'cmp)
-> ('a, 'cmp) t Quickcheck.Observer.t
val quickcheck_shrinker_m__t
: (module Quickcheck_shrinker_m with type t = 'a and type comparator_witness = 'cmp)
-> ('a, 'cmp) t Quickcheck.Shrinker.t
end
module type For_deriving_stable = sig
type ('a, 'b) t
module type Stable_witness_m = sig
include Comparator.S
val stable_witness : t Stable_witness.t
end
val stable_witness_m__t
: (module Stable_witness_m with type t = 'a and type comparator_witness = 'cmp)
-> ('a, 'cmp) t Stable_witness.t
end
module Without_comparator = Set.Without_comparator
module With_comparator = Set.With_comparator
module With_first_class_module = Set.With_first_class_module
module Continue_or_stop = Container.Continue_or_stop
module Merge_to_sequence_element = Sequence.Merge_with_duplicates_element
module type Accessors_generic = sig
include Set.Accessors_generic
val to_map
: ( 'a
, 'cmp
, ('a, 'cmp) t -> f:('a elt -> 'b) -> ('a elt, 'b, 'cmp cmp) Base.Map.t )
access_options
val quickcheck_observer
: 'a elt Quickcheck.Observer.t
-> ('a, 'cmp) t Quickcheck.Observer.t
val quickcheck_shrinker
: ( 'a
, 'cmp
, 'a elt Quickcheck.Shrinker.t -> ('a, 'cmp) t Quickcheck.Shrinker.t )
access_options
end
module type Creators_generic = sig
include Set.Creators_generic
val of_hash_set : ('a, 'cmp, 'a elt Hash_set.t -> ('a, 'cmp) t) create_options
val of_hashtbl_keys : ('a, 'cmp, ('a elt, _) Hashtbl.t -> ('a, 'cmp) t) create_options
(** Never requires a comparator because it can get one from the input [Map.t]. *)
val of_map_keys : ('a elt, _, 'cmp cmp) Base.Map.t -> ('a, 'cmp) t
val quickcheck_generator
: ( 'a
, 'cmp
, 'a elt Quickcheck.Generator.t -> ('a, 'cmp) t Quickcheck.Generator.t )
create_options
end
module type Creators_and_accessors_generic = sig
type ('elt, 'cmp) t
type ('elt, 'cmp) tree
type 'elt elt
type 'cmp cmp
include
Accessors_generic
with type ('a, 'b) t := ('a, 'b) t
with type ('a, 'b) tree := ('a, 'b) tree
with type 'a elt := 'a elt
with type 'cmp cmp := 'cmp cmp
include
Creators_generic
with type ('a, 'b) t := ('a, 'b) t
with type ('a, 'b) tree := ('a, 'b) tree
with type 'a elt := 'a elt
with type 'cmp cmp := 'cmp cmp
end
module Make_S_plain_tree (Elt : Comparator.S) = struct
module type S = sig
type t = (Elt.t, Elt.comparator_witness) Tree.t [@@deriving compare, equal, sexp_of]
include
Creators_generic
with type ('a, 'b) set := ('a, 'b) Tree.t
with type ('a, 'b) t := t
with type ('a, 'b) tree := t
with type 'a elt := Elt.t
with type 'c cmp := Elt.comparator_witness
with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Without_comparator.t
module Provide_of_sexp
(Elt : sig
type t [@@deriving of_sexp]
end
with type t := Elt.t) : sig
type t [@@deriving of_sexp]
end
with type t := t
end
end
module type S_plain = sig
module Elt : sig
type t [@@deriving sexp_of]
include Comparator.S with type t := t
end
type t = (Elt.t, Elt.comparator_witness) Base.Set.t [@@deriving compare, equal, sexp_of]
module Diff : sig
type t = Elt.t Diffable.Set_diff.t [@@deriving sexp_of]
include
Diffable.Diff.S_plain
with type t := t
and type derived_on = (Elt.t, Elt.comparator_witness) Base.Set.t
end
include Diffable.S_plain with type t := t and module Diff := Diff
include
Creators_generic
with type ('a, 'b) set := ('a, 'b) Set.t
with type ('a, 'b) t := t
with type ('a, 'b) tree := (Elt.t, Elt.comparator_witness) Tree.t
with type 'a elt := Elt.t
with type 'c cmp := Elt.comparator_witness
with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Without_comparator.t
module Provide_of_sexp
(Elt : sig
type t [@@deriving of_sexp]
end
with type t := Elt.t) : sig
type t [@@deriving of_sexp]
end
with type t := t
module Provide_bin_io
(Elt : sig
type t [@@deriving bin_io]
end
with type t := Elt.t) : Binable.S with type t := t
module Provide_hash (Elt : Hasher.S with type t := Elt.t) : sig
type t [@@deriving hash]
end
with type t := t
val quickcheck_observer : Elt.t Quickcheck.Observer.t -> t Quickcheck.Observer.t
val quickcheck_shrinker : Elt.t Quickcheck.Shrinker.t -> t Quickcheck.Shrinker.t
end
module type S = sig
module Elt : sig
type t [@@deriving sexp]
include Comparator.S with type t := t
end
module Diff : sig
type t = Elt.t Diffable.Set_diff.t [@@deriving sexp]
include
Diffable.Diff.S_plain
with type t := t
and type derived_on = (Elt.t, Elt.comparator_witness) Base.Set.t
end
include S_plain with module Elt := Elt and module Diff := Diff
include Sexpable.S with type t := t
end
module type S_binable = sig
module Elt : sig
type t [@@deriving sexp, bin_io]
include Comparator.S with type t := t
end
module Diff : sig
type t = Elt.t Diffable.Set_diff.t [@@deriving bin_io, sexp]
include
Diffable.Diff.S_plain
with type t := t
and type derived_on = (Elt.t, Elt.comparator_witness) Base.Set.t
end
include S with module Elt := Elt and module Diff := Diff
include Binable.S with type t := t
end