sig
type key
type !'a t
val create : ?random:bool -> int -> 'a MoreLabels.Hashtbl.SeededS.t
val clear : 'a MoreLabels.Hashtbl.SeededS.t -> unit
val reset : 'a MoreLabels.Hashtbl.SeededS.t -> unit
val copy
'a MoreLabels.Hashtbl.SeededS.t -> 'a MoreLabels.Hashtbl.SeededS.t
val add
'a MoreLabels.Hashtbl.SeededS.t ->
key:MoreLabels.Hashtbl.SeededS.key -> data:'a -> unit
val remove
'a MoreLabels.Hashtbl.SeededS.t -> MoreLabels.Hashtbl.SeededS.key -> unit
val find
'a MoreLabels.Hashtbl.SeededS.t -> MoreLabels.Hashtbl.SeededS.key -> 'a
val find_opt
'a MoreLabels.Hashtbl.SeededS.t ->
MoreLabels.Hashtbl.SeededS.key -> 'a option
val find_all
'a MoreLabels.Hashtbl.SeededS.t ->
MoreLabels.Hashtbl.SeededS.key -> 'a list
val replace
'a MoreLabels.Hashtbl.SeededS.t ->
key:MoreLabels.Hashtbl.SeededS.key -> data:'a -> unit
val mem
'a MoreLabels.Hashtbl.SeededS.t -> MoreLabels.Hashtbl.SeededS.key -> bool
val iter
f:(key:MoreLabels.Hashtbl.SeededS.key -> data:'a -> unit) ->
'a MoreLabels.Hashtbl.SeededS.t -> unit
val filter_map_inplace
f:(key:MoreLabels.Hashtbl.SeededS.key -> data:'a -> 'a option) ->
'a MoreLabels.Hashtbl.SeededS.t -> unit
val fold
f:(key:MoreLabels.Hashtbl.SeededS.key -> data:'a -> 'acc -> 'acc) ->
'a MoreLabels.Hashtbl.SeededS.t -> init:'acc -> 'acc
val length : 'a MoreLabels.Hashtbl.SeededS.t -> int
val stats
'a MoreLabels.Hashtbl.SeededS.t -> MoreLabels.Hashtbl.statistics
val to_seq
'a MoreLabels.Hashtbl.SeededS.t ->
(MoreLabels.Hashtbl.SeededS.key * 'a) Stdlib.Seq.t
val to_seq_keys
'a MoreLabels.Hashtbl.SeededS.t ->
MoreLabels.Hashtbl.SeededS.key Stdlib.Seq.t
val to_seq_values : 'a MoreLabels.Hashtbl.SeededS.t -> 'a Stdlib.Seq.t
val add_seq
'a MoreLabels.Hashtbl.SeededS.t ->
(MoreLabels.Hashtbl.SeededS.key * 'a) Stdlib.Seq.t -> unit
val replace_seq
'a MoreLabels.Hashtbl.SeededS.t ->
(MoreLabels.Hashtbl.SeededS.key * 'a) Stdlib.Seq.t -> unit
val of_seq
(MoreLabels.Hashtbl.SeededS.key * 'a) Stdlib.Seq.t ->
'a MoreLabels.Hashtbl.SeededS.t
end