package electrod

  1. Overview
  2. Docs
include Stdlib.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val min_elt_opt : t -> elt option

Safe version of min_elt.

  • since 1.5
val max_elt_opt : t -> elt option

Safe version of max_elt.

  • since 1.5
val choose_opt : t -> elt option

Safe version of choose.

  • since 1.5
val find_opt : elt -> t -> elt option

Safe version of find.

  • since 1.5
val find_first : (elt -> bool) -> t -> elt

Find minimum element satisfying predicate.

  • since 1.5
val find_first_opt : (elt -> bool) -> t -> elt option

Safe version of find_first.

  • since 1.5
val find_last : (elt -> bool) -> t -> elt

Find maximum element satisfying predicate.

  • since 1.5
val find_last_opt : (elt -> bool) -> t -> elt option

Safe version of find_last.

  • since 1.5
val of_iter : elt CCSet.iter -> t

Build a set from the given iter of elements.

  • since 2.8
val add_iter : t -> elt CCSet.iter -> t
  • since 2.8
val to_iter : t -> elt CCSet.iter

to_iter t converts the set t to a iter of the elements.

  • since 2.8
val of_seq : elt CCSet.sequence -> t
  • deprecated use of_iter instead
val add_seq : t -> elt CCSet.sequence -> t
  • deprecated use add_iter instead
val to_seq : t -> elt CCSet.sequence
  • deprecated use to_iter instead
val of_list : elt list -> t

Build a set from the given list of elements, added in order using add.

val add_list : t -> elt list -> t
  • since 0.14
val to_list : t -> elt list

to_list t converts the set t to a list of the elements.

val to_string : ?start:string -> ?stop:string -> ?sep:string -> (elt -> string) -> t -> string

Print the set in a string

  • since 2.7
val pp : ?start:string -> ?stop:string -> ?sep:string -> elt CCSet.printer -> t CCSet.printer

Print the set.

OCaml

Innovation. Community. Security.