package safa

  1. Overview
  2. Docs
type 'a t
type !'a elt = 'a Hashcons.hash_consed
val empty : 'a t
val is_empty : 'a t -> bool
val mem : 'a elt -> 'a t -> bool
val add : 'a elt -> 'a t -> 'a t
val singleton : 'a elt -> 'a t
val remove : 'a elt -> 'a t -> 'a t
val union : 'a t -> 'a t -> 'a t
val subset : 'a t -> 'a t -> bool
val inter : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val equal : 'a t -> 'a t -> bool
val hash : 'a t -> int
val elements : 'a t -> 'a elt list
val choose : 'a t -> 'a elt
val cardinal : 'a t -> int
val iter : ('a elt -> unit) -> 'a t -> unit
val map : ('a elt -> 'b elt) -> 'a t -> 'b t
val fold : ('a elt -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : ('a elt -> bool) -> 'a t -> bool
val exists : ('a elt -> bool) -> 'a t -> bool
val filter : ('a elt -> bool) -> 'a t -> 'a t
val partition : ('a elt -> bool) -> 'a t -> 'a t * 'a t
val print : (Format.formatter -> 'a elt -> unit) -> Format.formatter -> 'a t -> unit
val min_elt : 'a t -> 'a elt
val max_elt : 'a t -> 'a elt
val intersect : 'a t -> 'a t -> bool
OCaml

Innovation. Community. Security.