package stdcompat

  1. Overview
  2. Docs
type ('a, 'b) t = ('a, 'b) Hashtbl.t
val clear : ('a, 'b) t -> unit
val copy : ('a, 'b) t -> ('a, 'b) t
val add : ('a, 'b) t -> 'a -> 'b -> unit
val find : ('a, 'b) t -> 'a -> 'b
val find_all : ('a, 'b) t -> 'a -> 'b list
val mem : ('a, 'b) t -> 'a -> bool
val remove : ('a, 'b) t -> 'a -> unit
val replace : ('a, 'b) t -> 'a -> 'b -> unit
val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit
val fold : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val length : ('a, 'b) t -> int
module type HashedType = Hashtbl.HashedType
val hash : 'a -> int
val hash_param : int -> int -> 'a -> int
val create : ?random:bool -> int -> ('a, 'b) t
val reset : ('a, 'b) t -> unit
val randomize : unit -> unit
type statistics = Hashtbl.statistics = {
  1. num_bindings : int;
  2. num_buckets : int;
  3. max_bucket_length : int;
  4. bucket_histogram : int array;
}
val stats : ('a, 'b) t -> statistics
val is_randomized : unit -> bool
val filter_map_inplace : ('a -> 'b -> 'b option) -> ('a, 'b) t -> unit
val find_opt : ('a, 'b) t -> 'a -> 'b option
val seeded_hash : int -> 'a -> int
val seeded_hash_param : int -> int -> int -> 'a -> int
val of_seq : ('a * 'b) Seq.t -> ('a, 'b) t
val add_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit
val replace_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit
val to_seq : ('a, 'b) t -> ('a * 'b) Seq.t
val to_seq_keys : ('a, 'b) t -> 'a Seq.t
val to_seq_values : ('a, 'b) t -> 'b Seq.t
module type S = sig ... end
module Make (H : HashedType) : sig ... end
module type SeededHashedType = sig ... end
module type SeededS = sig ... end
module MakeSeeded (H : SeededHashedType) : sig ... end
OCaml

Innovation. Community. Security.