sig
type elt = Definitions.PaireOrd.t
type t = Set.Make(PaireOrd).t
val empty : Definitions.Ensemble.t
val is_empty : Definitions.Ensemble.t -> bool
val mem : Definitions.Ensemble.elt -> Definitions.Ensemble.t -> bool
val add :
Definitions.Ensemble.elt ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val singleton : Definitions.Ensemble.elt -> Definitions.Ensemble.t
val remove :
Definitions.Ensemble.elt ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val union :
Definitions.Ensemble.t ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val inter :
Definitions.Ensemble.t ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val diff :
Definitions.Ensemble.t ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val compare : Definitions.Ensemble.t -> Definitions.Ensemble.t -> int
val equal : Definitions.Ensemble.t -> Definitions.Ensemble.t -> bool
val subset : Definitions.Ensemble.t -> Definitions.Ensemble.t -> bool
val iter :
(Definitions.Ensemble.elt -> unit) -> Definitions.Ensemble.t -> unit
val fold :
(Definitions.Ensemble.elt -> 'a -> 'a) ->
Definitions.Ensemble.t -> 'a -> 'a
val for_all :
(Definitions.Ensemble.elt -> bool) -> Definitions.Ensemble.t -> bool
val exists :
(Definitions.Ensemble.elt -> bool) -> Definitions.Ensemble.t -> bool
val filter :
(Definitions.Ensemble.elt -> bool) ->
Definitions.Ensemble.t -> Definitions.Ensemble.t
val partition :
(Definitions.Ensemble.elt -> bool) ->
Definitions.Ensemble.t -> Definitions.Ensemble.t * Definitions.Ensemble.t
val cardinal : Definitions.Ensemble.t -> int
val elements : Definitions.Ensemble.t -> Definitions.Ensemble.elt list
val min_elt : Definitions.Ensemble.t -> Definitions.Ensemble.elt
val max_elt : Definitions.Ensemble.t -> Definitions.Ensemble.elt
val choose : Definitions.Ensemble.t -> Definitions.Ensemble.elt
val split :
Definitions.Ensemble.elt ->
Definitions.Ensemble.t ->
Definitions.Ensemble.t * bool * Definitions.Ensemble.t
end