Module `K1.MakeSeeded`Source

Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

Parameters

module H : Stdlib.Hashtbl.SeededHashedType

Sourcetype key = H.t

Sourcetype !'a t

Sourceval create : ?random:bool -> int -> 'a t

Sourceval clear : 'a t -> unit

Sourceval reset : 'a t -> unit

Sourceval copy : 'a t -> 'a t

Sourceval add : 'a t -> key -> 'a -> unit

Sourceval remove : 'a t -> key -> unit

Sourceval find : 'a t -> key -> 'a

Sourceval find_opt : 'a t -> key -> 'a option

Sourceval find_all : 'a t -> key -> 'a list

Sourceval replace : 'a t -> key -> 'a -> unit

Sourceval mem : 'a t -> key -> bool

Sourceval length : 'a t -> int

Sourceval stats : 'a t -> Stdlib.Hashtbl.statistics

Sourceval add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit

Sourceval replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit

Sourceval of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

Sourceval clean : 'a t -> unit

remove all dead bindings. Done automatically during automatic resizing.

Sourceval stats_alive : 'a t -> Stdlib.Hashtbl.statistics

same as Hashtbl.SeededS.stats but only count the alive bindings