sig
module type S_Basic_Compare =
sig
type elt
type t
val empty : FCSet.S_Basic_Compare.t
val is_empty : FCSet.S_Basic_Compare.t -> bool
val mem : FCSet.S_Basic_Compare.elt -> FCSet.S_Basic_Compare.t -> bool
val add :
FCSet.S_Basic_Compare.elt ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val singleton : FCSet.S_Basic_Compare.elt -> FCSet.S_Basic_Compare.t
val remove :
FCSet.S_Basic_Compare.elt ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val union :
FCSet.S_Basic_Compare.t ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val inter :
FCSet.S_Basic_Compare.t ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val diff :
FCSet.S_Basic_Compare.t ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val compare : FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t -> int
val equal : FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t -> bool
val subset : FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t -> bool
val iter :
(FCSet.S_Basic_Compare.elt -> unit) ->
FCSet.S_Basic_Compare.t -> unit
val fold :
(FCSet.S_Basic_Compare.elt -> 'a -> 'a) ->
FCSet.S_Basic_Compare.t -> 'a -> 'a
val for_all :
(FCSet.S_Basic_Compare.elt -> bool) ->
FCSet.S_Basic_Compare.t -> bool
val exists :
(FCSet.S_Basic_Compare.elt -> bool) ->
FCSet.S_Basic_Compare.t -> bool
val filter :
(FCSet.S_Basic_Compare.elt -> bool) ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.t
val partition :
(FCSet.S_Basic_Compare.elt -> bool) ->
FCSet.S_Basic_Compare.t ->
FCSet.S_Basic_Compare.t * FCSet.S_Basic_Compare.t
val cardinal : FCSet.S_Basic_Compare.t -> int
val elements :
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.elt list
val choose : FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.elt
val find :
FCSet.S_Basic_Compare.elt ->
FCSet.S_Basic_Compare.t -> FCSet.S_Basic_Compare.elt
val of_list : FCSet.S_Basic_Compare.elt list -> FCSet.S_Basic_Compare.t
end
module type S =
sig
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
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 diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val choose : t -> elt
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val split : elt -> t -> t * bool * t
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
end
module Make :
functor (Ord : Set.OrderedType) ->
sig
type elt = Ord.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
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 diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val choose : t -> elt
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val split : elt -> t -> t * bool * t
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
end
end