package core-and-more

  1. Overview
  2. Docs
package core-and-more
Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module D : sig ... end

Signature

module Element = D
type elt = D.t
type t =
  1. | Empty
  2. | Leaf of D.t
  3. | Branch of int * int * t * t
val compare : t -> t -> Ppx_deriving_runtime.int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val empty : t
val leaf : D.t -> t
val is_empty : t CoreAndMore__.My_hash_cons.HashConsContainer.hash_consed -> bool
val singleton : D.t -> t
val zero_bit : int -> int -> bool
val member : t -> D.t -> bool
val lowest_bit : int -> int
val branching_bit : int -> int -> int
val mask : int -> int -> int
val unsigned_lt : int -> int -> bool
val join : (int * t * int * t) -> t
val match_prefix : int -> int -> int -> bool
val add : D.t -> t -> t
val branch : (int * int * t * t) -> t
val remove : D.t -> t -> t
val merge : (t * t) -> t
val union : t -> t -> t
val subset : t -> t -> bool
val inter : t -> t -> t
val diff : t -> t -> t
val cardinal : t -> int
val iter : (D.t -> unit) -> t -> unit
val fold : f:(D.t -> 'a -> 'a) -> init:'a -> t -> 'a
val for_all : (D.t -> bool) -> t -> bool
val exists : (D.t -> bool) -> t -> bool
val filter : f:(D.t -> bool) -> t -> t
val partition : (D.t -> bool) -> t -> t * t
val choose : t -> D.t
val as_list : t -> D.t list
val min_exn : t -> D.t
val max_exn : t -> D.t
val show : t -> string
val make : D.t list -> t
val intersect : t -> t -> bool
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct