OCaml library : Hashtbl.MakeSeeded

# Functor Hashtbl.MakeSeeded

    module MakeSeeded: functor (H : SeededHashedType) -> SeededS  with type key = H.t

Functor building an implementation of the hashtable structure. The functor `Hashtbl.MakeSeeded` returns a structure containing a type `key` of keys and a type `'a t` of hash tables associating data of type `'a` to keys of type `key`. The operations perform similarly to those of the generic interface, but use the seeded hashing and equality functions specified in the functor argument `H` instead of generic equality and hashing. The `create` operation of the result structure supports the `~random` optional parameter and returns randomized hash tables if `~random:true` is passed or if randomization is globally on (see `Hashtbl.randomize`).

- Since 4.00

Parameters: |
`H` | : | `SeededHashedType`

    type key

    type !'a t

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

    val clear : 'a t -> unit

    val reset : 'a t -> unit

    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

    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

    val fold : (key -> 'a -> 'acc -> 'acc) ->
           'a t -> 'acc -> 'acc

    val length : 'a t -> int

    val stats : 'a t -> Hashtbl.statistics

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

- Since 4.07

    val to_seq_keys : 'a t -> key Seq.t

- Since 4.07

    val to_seq_values : 'a t -> 'a Seq.t

- Since 4.07

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

- Since 4.07

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

- Since 4.07

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

- Since 4.07