`sig
module type OrderedType =
sig
type t
val compare :
MoreLabels.Set.OrderedType.t -> MoreLabels.Set.OrderedType.t -> int
end
module type S =
sig
type elt
type t
val empty : MoreLabels.Set.S.t
val add :
MoreLabels.Set.S.elt -> MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val singleton : MoreLabels.Set.S.elt -> MoreLabels.Set.S.t
val remove :
MoreLabels.Set.S.elt -> MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val union :
MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val inter :
MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val disjoint : MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> bool
val diff :
MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val cardinal : MoreLabels.Set.S.t -> int
val elements : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt list
val min_elt : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val min_elt_opt : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val max_elt : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val max_elt_opt : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val choose : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val choose_opt : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val find :
MoreLabels.Set.S.elt -> MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val find_opt :
MoreLabels.Set.S.elt ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val find_first :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val find_first_opt :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val find_last :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt
val find_last_opt :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt option
val iter :
f:(MoreLabels.Set.S.elt -> unit) -> MoreLabels.Set.S.t -> unit
val fold :
f:(MoreLabels.Set.S.elt -> 'acc -> 'acc) ->
MoreLabels.Set.S.t -> init:'acc -> 'acc
val map :
f:(MoreLabels.Set.S.elt -> MoreLabels.Set.S.elt) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val filter :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val filter_map :
f:(MoreLabels.Set.S.elt -> MoreLabels.Set.S.elt option) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val partition :
f:(MoreLabels.Set.S.elt -> bool) ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t * MoreLabels.Set.S.t
val split :
MoreLabels.Set.S.elt ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t * bool * MoreLabels.Set.S.t
val is_empty : MoreLabels.Set.S.t -> bool
val mem : MoreLabels.Set.S.elt -> MoreLabels.Set.S.t -> bool
val equal : MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> bool
val compare : MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> int
val subset : MoreLabels.Set.S.t -> MoreLabels.Set.S.t -> bool
val for_all :
f:(MoreLabels.Set.S.elt -> bool) -> MoreLabels.Set.S.t -> bool
val exists :
f:(MoreLabels.Set.S.elt -> bool) -> MoreLabels.Set.S.t -> bool
val to_list : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt list
val of_list : MoreLabels.Set.S.elt list -> MoreLabels.Set.S.t
val to_seq_from :
MoreLabels.Set.S.elt ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt Stdlib.Seq.t
val to_seq : MoreLabels.Set.S.t -> MoreLabels.Set.S.elt Stdlib.Seq.t
val to_rev_seq :
MoreLabels.Set.S.t -> MoreLabels.Set.S.elt Stdlib.Seq.t
val add_seq :
MoreLabels.Set.S.elt Stdlib.Seq.t ->
MoreLabels.Set.S.t -> MoreLabels.Set.S.t
val of_seq : MoreLabels.Set.S.elt Stdlib.Seq.t -> MoreLabels.Set.S.t
end
module Make :
functor (Ord : OrderedType) ->
sig
type elt = Ord.t
type t = Set.Make(Ord).t
val empty : t
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : f:(elt -> bool) -> t -> elt
val find_first_opt : f:(elt -> bool) -> t -> elt option
val find_last : f:(elt -> bool) -> t -> elt
val find_last_opt : f:(elt -> bool) -> t -> elt option
val iter : f:(elt -> unit) -> t -> unit
val fold : f:(elt -> 'acc -> 'acc) -> t -> init:'acc -> 'acc
val map : f:(elt -> elt) -> t -> t
val filter : f:(elt -> bool) -> t -> t
val filter_map : f:(elt -> elt option) -> t -> t
val partition : f:(elt -> bool) -> t -> t * t
val split : elt -> t -> t * bool * t
val is_empty : t -> bool
val mem : elt -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val subset : t -> t -> bool
val for_all : f:(elt -> bool) -> t -> bool
val exists : f:(elt -> bool) -> t -> bool
val to_list : t -> elt list
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val to_rev_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> t
end
end`