package core-and-more

  1. Overview
  2. Docs
package core-and-more
Legend:
Library
Module
Module type
Parameter
Class
Class type
type key = F.Arg.t
val compare_key : key -> key -> Ppx_deriving_runtime.int
val pp_key : Ppx_deriving_runtime.Format.formatter -> key -> Ppx_deriving_runtime.unit
val show_key : key -> Ppx_deriving_runtime.string
val equal_key : key -> key -> Ppx_deriving_runtime.bool
val hash_fold_key : Ppx_hash_lib.Std.Hash.state -> key -> Ppx_hash_lib.Std.Hash.state
val hash_key : key -> Ppx_hash_lib.Std.Hash.hash_value
type value = F.Result.t
val compare_value : value -> value -> Ppx_deriving_runtime.int
val pp_value : Ppx_deriving_runtime.Format.formatter -> value -> Ppx_deriving_runtime.unit
val show_value : value -> Ppx_deriving_runtime.string
val equal_value : value -> value -> Ppx_deriving_runtime.bool
val hash_fold_value : Ppx_hash_lib.Std.Hash.state -> value -> Ppx_hash_lib.Std.Hash.state
val hash_value : value -> Ppx_hash_lib.Std.Hash.hash_value
module CompareDict : sig ... end
type t =
  1. | Empty
  2. | Leaf of key * value
  3. | Branch of int * int * t * t
val compare : t -> t -> Ppx_deriving_runtime.int
val pp : Ppx_deriving_runtime.Format.formatter -> t -> Ppx_deriving_runtime.unit
val show : t -> Ppx_deriving_runtime.string
val hash_fold_t : Ppx_hash_lib.Std.Hash.state -> t -> Ppx_hash_lib.Std.Hash.state
val hash : t -> Ppx_hash_lib.Std.Hash.hash_value
val empty : t
val mk_leaf : key -> value -> t
val mk_branch : int -> int -> t -> t -> t
val zero_bit : int -> int -> bool
val contains_key : t -> F.Arg.t -> bool
val lookup : t -> F.Arg.t -> value option
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 insert_or_combine : combiner:(value -> value -> value) -> t -> key -> value -> t
val insert : t -> key -> value -> t
val remove : F.Arg.t -> t -> t
val as_kvp_list : t -> (key * value) list
val merge_to_dict : combiner:(value -> value -> value) -> t -> t -> t
val merge : combiner:(value -> value -> 'a) -> only_d1_fn:(value -> 'a) -> only_d2_fn:(value -> 'a) -> t -> t -> (key * 'a) list
val iter : f:(key -> value -> unit) -> t -> unit
val map : f:(value -> value) -> t -> t
val mapi : f:(key -> value -> value) -> t -> t
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
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