module Set: sig .. end
(not so efficient) implementation of polymorphic sets
type 'a t
val empty : 'a t
val singleton : 'a -> 'a t
val union : 'a t -> 'a t -> 'a t
val inter : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val mem : 'a -> 'a t -> bool
val is_empty : 'a t -> bool
val subset : 'a t -> 'a t -> bool
val rem : 'a -> 'a t -> 'a t
val add : 'a -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val iter : ('a -> unit) -> 'a t -> unit
val fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filter : ('a -> bool) -> 'a t -> 'a t
val exists : ('a -> bool) -> 'a t -> bool
val for_all : ('a -> bool) -> 'a t -> bool
val cardinal : 'a t -> int
val print : ?sep:string -> 'a Common.formatter -> 'a t Common.formatter