BatPSet

`sig
type 'a t
type 'a enumerable = 'a t
type 'a mappable = 'a t
val empty : 'a BatPSet.t
val create : ('a -> 'a -> int) -> 'a BatPSet.t
val singleton : ?cmp:('a -> 'a -> int) -> 'a -> 'a BatPSet.t
val is_empty : 'a BatPSet.t -> bool
val mem : 'a -> 'a BatPSet.t -> bool
val add : 'a -> 'a BatPSet.t -> 'a BatPSet.t
val remove : 'a -> 'a BatPSet.t -> 'a BatPSet.t
val iter : ('a -> unit) -> 'a BatPSet.t -> unit
val map : ('a -> 'a) -> 'a BatPSet.t -> 'a BatPSet.t
val filter_map : ('a -> 'b option) -> 'a BatPSet.t -> 'b BatPSet.t
val fold : ('a -> 'b -> 'b) -> 'a BatPSet.t -> 'b -> 'b
val exists : ('a -> bool) -> 'a BatPSet.t -> bool
val cardinal : 'a BatPSet.t -> int
val choose : 'a BatPSet.t -> 'a
val min_elt : 'a BatPSet.t -> 'a
val max_elt : 'a BatPSet.t -> 'a
val enum : 'a BatPSet.t -> 'a BatEnum.t
val of_enum : 'a BatEnum.t -> 'a BatPSet.t
val of_enum_cmp : cmp:('a -> 'a -> int) -> 'a BatEnum.t -> 'a BatPSet.t
val of_list : 'a list -> 'a BatPSet.t
val for_all : ('a -> bool) -> 'a BatPSet.t -> bool
val partition : ('a -> bool) -> 'a BatPSet.t -> 'a BatPSet.t * 'a BatPSet.t
val split : 'a -> 'a BatPSet.t -> 'a BatPSet.t * bool * 'a BatPSet.t
val filter : ('a -> bool) -> 'a BatPSet.t -> 'a BatPSet.t
val pop : 'a BatPSet.t -> 'a * 'a BatPSet.t
val union : 'a BatPSet.t -> 'a BatPSet.t -> 'a BatPSet.t
val diff : 'a BatPSet.t -> 'a BatPSet.t -> 'a BatPSet.t
val intersect : 'a BatPSet.t -> 'a BatPSet.t -> 'a BatPSet.t
val subset : 'a BatPSet.t -> 'a BatPSet.t -> bool
val print :
?first:string ->
?last:string ->
?sep:string ->
('a BatInnerIO.output -> 'b -> unit) ->
'a BatInnerIO.output -> 'b BatPSet.t -> unit
end`