package colibri2

  1. Overview
  2. Docs

Parameters

module H : sig ... end

Signature

include S with type t = H.t and type cat := int
include Popop_stdlib.Datatype with type t = H.t
include Popop_stdlib.OrderedHashedType with type t = H.t
type t = H.t
val equal : t -> t -> bool
val pp : t Pp.pp
val hash_fold_t : t Base.Hash.folder
module M : Map_intf.PMap with type key = t
module S : Map_intf.Set with type 'a M.t = 'a M.t and type M.key = M.key
module H : Exthtbl.Hashtbl.S with type key = t
include Base.Hashtbl.Key.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val sexp_of_t : t -> Sexplib0.Sexp.t
val hash : t -> int
val hashcons : t -> t

hashcons n hash-cons the value n i.e. returns any existing value in the table equal to n, if any; otherwise, creates a new value with function tag, stores it in the table and returns it.

val hashcons0 : (int -> t) -> t

Versions where you don't create a value before modifying it

val hashcons1 : (int -> 'a -> t) -> 'a -> t
val hashcons2 : (int -> 'a -> 'b -> t) -> 'a -> 'b -> t
val hashcons3 : (int -> 'a -> 'b -> 'c -> t) -> 'a -> 'b -> 'c -> t
val iter : (t -> unit) -> unit

iter f iterates f over all elements of the table .

val stats : int -> int * int * int * int * int * int

Return statistics on the table. The numbers are, in order: table length, number of entries, sum of bucket lengths, smallest bucket length, median bucket length, biggest bucket length.

val fresh_tag : unit -> int

get a fresh tag

val new_category : int -> unit
val iter_cat : (t -> unit) -> int -> unit
OCaml

Innovation. Community. Security.