.TH "MoreLabels.Hashtbl.MakeSeeded" 3o 2023-09-20 OCamldoc "OCaml library"
.SH NAME
MoreLabels.Hashtbl.MakeSeeded \- Functor building an implementation of the hashtable structure.
.SH Module
Module   MoreLabels.Hashtbl.MakeSeeded
.SH Documentation
.sp
Module
.BI "MakeSeeded"
 : 
.B functor (H : SeededHashedType) -> sig end

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

.sp
.B "Since"
4.00.0

.sp
.B "Parameters:"
.sp
"H"

.B MoreLabels.Hashtbl.SeededHashedType





.sp
.sp
.I type key 

.sp

.sp
.I type 
.B 'a
.I t 

.sp

.sp

.I val create 
: 
.B ?random:bool -> int -> 'a t
.sp

.sp

.I val clear 
: 
.B 'a t -> unit
.sp

.sp

.I val reset 
: 
.B 'a t -> unit
.sp

.sp

.I val copy 
: 
.B 'a t -> 'a t
.sp

.sp

.I val add 
: 
.B 'a t ->
.B   key:key -> data:'a -> unit
.sp

.sp

.I val remove 
: 
.B 'a t -> key -> unit
.sp

.sp

.I val find 
: 
.B 'a t -> key -> 'a
.sp

.sp

.I val find_opt 
: 
.B 'a t ->
.B   key -> 'a option
.sp
.B "Since"
4.05.0

.sp

.I val find_all 
: 
.B 'a t -> key -> 'a list
.sp

.sp

.I val replace 
: 
.B 'a t ->
.B   key:key -> data:'a -> unit
.sp

.sp

.I val mem 
: 
.B 'a t -> key -> bool
.sp

.sp

.I val iter 
: 
.B f:(key:key -> data:'a -> unit) ->
.B   'a t -> unit
.sp

.sp

.I val filter_map_inplace 
: 
.B f:(key:key -> data:'a -> 'a option) ->
.B   'a t -> unit
.sp
.B "Since"
4.03.0

.sp

.I val fold 
: 
.B f:(key:key -> data:'a -> 'b -> 'b) ->
.B   'a t -> init:'b -> 'b
.sp

.sp

.I val length 
: 
.B 'a t -> int
.sp

.sp

.I val stats 
: 
.B 'a t -> MoreLabels.Hashtbl.statistics
.sp

.sp

.I val to_seq 
: 
.B 'a t ->
.B   (key * 'a) Seq.t
.sp
.B "Since"
4.07

.sp

.I val to_seq_keys 
: 
.B 'a t ->
.B   key Seq.t
.sp
.B "Since"
4.07

.sp

.I val to_seq_values 
: 
.B 'a t -> 'a Seq.t
.sp
.B "Since"
4.07

.sp

.I val add_seq 
: 
.B 'a t ->
.B   (key * 'a) Seq.t -> unit
.sp
.B "Since"
4.07

.sp

.I val replace_seq 
: 
.B 'a t ->
.B   (key * 'a) Seq.t -> unit
.sp
.B "Since"
4.07

.sp

.I val of_seq 
: 
.B (key * 'a) Seq.t ->
.B   'a t
.sp
.B "Since"
4.07

.sp