package camllib

  1. Overview
  2. Docs
type 'a t
val of_set : 'a SetList.t -> 'a t
val to_set : 'a t -> 'a SetList.t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : 'a -> 'a t -> bool
val mult : 'a -> 'a t -> int
val singleton : ('a * int) -> 'a t
val add : ('a * int) -> 'a t -> 'a t
val remove : ('a * int) -> '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 union_set : 'a t -> 'a SetList.t -> 'a t
val inter_set : 'a t -> 'a SetList.t -> 'a t
val diff_set : 'a t -> 'a SetList.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 * int) -> unit) -> 'a t -> unit
val fold : (('a * int) -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_right : (('a * int) -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_left : ('b -> ('a * int) -> 'b) -> 'b -> 'a t -> 'b
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 SetList.t
val min_elt : 'a t -> 'a
val max_elt : 'a t -> 'a
val min : 'a t -> 'a * int
val max : 'a t -> 'a * int
val mins : 'a t -> 'a SetList.t * int
val maxs : 'a t -> 'a SetList.t * int
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
module type S = sig ... end
module Make (Ord : Set.OrderedType) : sig ... end
OCaml

Innovation. Community. Security.