package containers

  1. Overview
  2. Docs
include Hashtbl.S
type key
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
  • since 4.00.0
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
  • since 4.05.0
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
  • since 4.03.0
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
  • since 4.00.0
val get : 'a t -> key -> 'a option

Safe version of Hashtbl.find

val keys : 'a t -> key sequence

Iterate on keys (similar order as Hashtbl.iter)

val values : 'a t -> 'a sequence

Iterate on values in the table

val to_seq : 'a t -> (key * 'a) sequence

Iterate on values in the table

val of_seq : (key * 'a) sequence -> 'a t

From the given bindings, added in order

val to_list : 'a t -> (key * 'a) list

List of bindings (order unspecified)

val of_list : (key * 'a) list -> 'a t

From the given list of bindings, added in order

OCaml

Innovation. Community. Security.