package camllib

  1. Overview
  2. Docs
type !'a t = {
  1. compare : 'a -> 'a -> int;
  2. set : 'a Sette.t;
}
val empty : ('a -> 'a -> int) -> 'a t
val is_empty : 'a t -> bool
val mem : 'a -> 'a t -> bool
val add : 'a -> 'a t -> 'a t
val singleton : ('a -> 'a -> int) -> 'a -> 'a t
val remove : 'a -> 'a t -> '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 compare : 'a t -> 'a t -> int
val equal : 'a t -> 'a t -> bool
val subset : 'a t -> 'a t -> bool
val iter : ('a -> unit) -> 'a t -> unit
val fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val filter : ('a -> bool) -> 'a t -> 'a t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val elements : 'a t -> 'a list
val min_elt : 'a t -> 'a
val max_elt : 'a t -> 'a
val choose : 'a t -> 'a
val print : ?first:(unit, Format.formatter, unit) Pervasives.format -> ?sep:(unit, Format.formatter, unit) Pervasives.format -> ?last:(unit, Format.formatter, unit) Pervasives.format -> (Format.formatter -> 'a -> unit) -> Format.formatter -> 'a t -> unit
val make : ('a -> 'a -> int) -> 'a Sette.t -> 'a t
OCaml

Innovation. Community. Security.