Sets of integers implemented as Patricia trees. The following
signature is exactly Set.S with type elt = int, with the same
specifications. This is a purely functional data-structure. The
performances are always better than the standard library's module
Set, except for linear insertion (building a set by insertion of
consecutive integers).
type t
type elt = int
val empty : t
val is_empty : t -> bool
val mem : int -> t -> bool
val add : int -> t -> t
val singleton : int -> t
val remove : int -> t -> t
val union : t -> t -> t
val subset : t -> t -> bool
val inter : t -> t -> t
val diff : t -> t -> t
val equal : t -> t -> bool
val compare : t -> t -> int
val elements : t -> int list
val choose : t -> int
val cardinal : t -> int
val iter : (int -> unit) -> t -> unit
val fold : (int -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (int -> bool) -> t -> bool
val exists : (int -> bool) -> t -> bool
val filter : (int -> bool) -> t -> t
val partition : (int -> bool) -> t -> t * t
Warning: min_elt and max_elt are linear w.r.t. the size of the
set. In other words, min_elt t is barely more efficient than fold
min t (choose t).
val min_elt : t -> int
val max_elt : t -> int
Go to the first, previous, next, last section, table of contents.