`functor
(T : T.T2) (Tree : T.T2) (Elt : T.T1) (Cmp : T.T1) (Options : T.T3) (M :
sig
val length : ('a, 'b) T.t -> int
val is_empty : ('a, 'b) T.t -> bool
val iter : ('a, 'b) T.t -> f:('a Elt.t -> unit) -> unit
val fold :
('a, 'b) T.t ->
init:'accum -> f:('accum -> 'a Elt.t -> 'accum) -> 'accum
val exists : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> bool
val for_all : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> bool
val count : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> int
val sum :
(module Commutative_group.S with type t = 'sum) ->
('a, 'b) T.t -> f:('a Elt.t -> 'sum) -> 'sum
val find : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> 'a Elt.t option
val find_map : ('a, 'c) T.t -> f:('a Elt.t -> 'b option) -> 'b option
val to_list : ('a, 'b) T.t -> 'a Elt.t list
val to_array : ('a, 'b) T.t -> 'a Elt.t array
val invariants : ('a, 'cmp, ('a, 'cmp) T.t -> bool) Options.t
val mem : ('a, 'cmp, ('a, 'cmp) T.t -> 'a Elt.t -> bool) Options.t
val add :
('a, 'cmp, ('a, 'cmp) T.t -> 'a Elt.t -> ('a, 'cmp) T.t) Options.t
val remove :
('a, 'cmp, ('a, 'cmp) T.t -> 'a Elt.t -> ('a, 'cmp) T.t) Options.t
val union :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> ('a, 'cmp) T.t)
Options.t
val inter :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> ('a, 'cmp) T.t)
Options.t
val diff :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> ('a, 'cmp) T.t)
Options.t
val symmetric_diff :
('a, 'cmp,
('a, 'cmp) T.t ->
('a, 'cmp) T.t -> ('a Elt.t, 'a Elt.t) Either.t Sequence.t)
Options.t
val compare_direct :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> int) Options.t
val equal :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> bool) Options.t
val subset :
('a, 'cmp, ('a, 'cmp) T.t -> ('a, 'cmp) T.t -> bool) Options.t
val fold_until :
('a, 'c) T.t ->
init:'b ->
f:('b -> 'a Elt.t -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) T.t -> init:'b -> f:('a Elt.t -> 'b -> 'b) -> 'b
val iter2 :
('a, 'cmp,
('a, 'cmp) T.t ->
('a, 'cmp) T.t ->
f:([ `Both of 'a Elt.t * 'a Elt.t
| `Left of 'a Elt.t
| `Right of 'a Elt.t ] -> unit) ->
unit)
Options.t
val filter :
('a, 'cmp, ('a, 'cmp) T.t -> f:('a Elt.t -> bool) -> ('a, 'cmp) T.t)
Options.t
val partition_tf :
('a, 'cmp,
('a, 'cmp) T.t ->
f:('a Elt.t -> bool) -> ('a, 'cmp) T.t * ('a, 'cmp) T.t)
Options.t
val elements : ('a, 'b) T.t -> 'a Elt.t list
val min_elt : ('a, 'b) T.t -> 'a Elt.t option
val min_elt_exn : ('a, 'b) T.t -> 'a Elt.t
val max_elt : ('a, 'b) T.t -> 'a Elt.t option
val max_elt_exn : ('a, 'b) T.t -> 'a Elt.t
val choose : ('a, 'b) T.t -> 'a Elt.t option
val choose_exn : ('a, 'b) T.t -> 'a Elt.t
val split :
('a, 'cmp,
('a, 'cmp) T.t ->
'a Elt.t -> ('a, 'cmp) T.t * 'a Elt.t option * ('a, 'cmp) T.t)
Options.t
val group_by :
('a, 'cmp,
('a, 'cmp) T.t ->
equiv:('a Elt.t -> 'a Elt.t -> bool) -> ('a, 'cmp) T.t list)
Options.t
val find_exn : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> 'a Elt.t
val find_index : ('a, 'b) T.t -> int -> 'a Elt.t option
val remove_index :
('a, 'cmp, ('a, 'cmp) T.t -> int -> ('a, 'cmp) T.t) Options.t
val to_tree : ('a, 'cmp) T.t -> ('a Elt.t, 'cmp) Tree.t
val to_sequence :
('a, 'cmp,
?order:[ `Decreasing | `Increasing ] ->
?greater_or_equal_to:'a Elt.t ->
?less_or_equal_to:'a Elt.t -> ('a, 'cmp) T.t -> 'a Elt.t Sequence.t)
Options.t
val to_map :
('a, 'cmp,
('a, 'cmp) T.t ->
f:('a Elt.t -> 'b) -> ('a Elt.t, 'b, 'cmp Cmp.t) Map.t)
Options.t
end) -> sig end`