OCaml library : MoreLabels.Hashtbl

`sig
type ('a, 'b) t = ('a, 'b) Stdlib.Hashtbl.t
val create : ?random:bool -> int -> ('a, 'b) MoreLabels.Hashtbl.t
val clear : ('a, 'b) MoreLabels.Hashtbl.t -> unit
val reset : ('a, 'b) MoreLabels.Hashtbl.t -> unit
val copy : ('a, 'b) MoreLabels.Hashtbl.t -> ('a, 'b) MoreLabels.Hashtbl.t
val add : ('a, 'b) MoreLabels.Hashtbl.t -> key:'a -> data:'b -> unit
val find : ('a, 'b) MoreLabels.Hashtbl.t -> 'a -> 'b
val find_opt : ('a, 'b) MoreLabels.Hashtbl.t -> 'a -> 'b option
val find_all : ('a, 'b) MoreLabels.Hashtbl.t -> 'a -> 'b list
val mem : ('a, 'b) MoreLabels.Hashtbl.t -> 'a -> bool
val remove : ('a, 'b) MoreLabels.Hashtbl.t -> 'a -> unit
val replace : ('a, 'b) MoreLabels.Hashtbl.t -> key:'a -> data:'b -> unit
val iter :
f:(key:'a -> data:'b -> unit) -> ('a, 'b) MoreLabels.Hashtbl.t -> unit
val filter_map_inplace :
f:(key:'a -> data:'b -> 'b option) ->
('a, 'b) MoreLabels.Hashtbl.t -> unit
val fold :
f:(key:'a -> data:'b -> 'c -> 'c) ->
('a, 'b) MoreLabels.Hashtbl.t -> init:'c -> 'c
val length : ('a, 'b) MoreLabels.Hashtbl.t -> int
val randomize : unit -> unit
val is_randomized : unit -> bool
val rebuild :
?random:bool ->
('a, 'b) MoreLabels.Hashtbl.t -> ('a, 'b) MoreLabels.Hashtbl.t
type statistics =
Stdlib.Hashtbl.statistics = {
num_bindings : int;
num_buckets : int;
max_bucket_length : int;
bucket_histogram : int array;
}
val stats : ('a, 'b) MoreLabels.Hashtbl.t -> MoreLabels.Hashtbl.statistics
val to_seq : ('a, 'b) MoreLabels.Hashtbl.t -> ('a * 'b) Stdlib.Seq.t
val to_seq_keys : ('a, 'b) MoreLabels.Hashtbl.t -> 'a Stdlib.Seq.t
val to_seq_values : ('a, 'b) MoreLabels.Hashtbl.t -> 'b Stdlib.Seq.t
val add_seq :
('a, 'b) MoreLabels.Hashtbl.t -> ('a * 'b) Stdlib.Seq.t -> unit
val replace_seq :
('a, 'b) MoreLabels.Hashtbl.t -> ('a * 'b) Stdlib.Seq.t -> unit
val of_seq : ('a * 'b) Stdlib.Seq.t -> ('a, 'b) MoreLabels.Hashtbl.t
module type HashedType =
sig
type t
val equal :
MoreLabels.Hashtbl.HashedType.t ->
MoreLabels.Hashtbl.HashedType.t -> bool
val hash : MoreLabels.Hashtbl.HashedType.t -> int
end
module type S =
sig
type key
type !'a t
val create : int -> 'a MoreLabels.Hashtbl.S.t
val clear : 'a MoreLabels.Hashtbl.S.t -> unit
val reset : 'a MoreLabels.Hashtbl.S.t -> unit
val copy : 'a MoreLabels.Hashtbl.S.t -> 'a MoreLabels.Hashtbl.S.t
val add :
'a MoreLabels.Hashtbl.S.t ->
key:MoreLabels.Hashtbl.S.key -> data:'a -> unit
val remove :
'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key -> unit
val find : 'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key -> 'a
val find_opt :
'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key -> 'a option
val find_all :
'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key -> 'a list
val replace :
'a MoreLabels.Hashtbl.S.t ->
key:MoreLabels.Hashtbl.S.key -> data:'a -> unit
val mem : 'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key -> bool
val iter :
f:(key:MoreLabels.Hashtbl.S.key -> data:'a -> unit) ->
'a MoreLabels.Hashtbl.S.t -> unit
val filter_map_inplace :
f:(key:MoreLabels.Hashtbl.S.key -> data:'a -> 'a option) ->
'a MoreLabels.Hashtbl.S.t -> unit
val fold :
f:(key:MoreLabels.Hashtbl.S.key -> data:'a -> 'b -> 'b) ->
'a MoreLabels.Hashtbl.S.t -> init:'b -> 'b
val length : 'a MoreLabels.Hashtbl.S.t -> int
val stats : 'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.statistics
val to_seq :
'a MoreLabels.Hashtbl.S.t ->
(MoreLabels.Hashtbl.S.key * 'a) Stdlib.Seq.t
val to_seq_keys :
'a MoreLabels.Hashtbl.S.t -> MoreLabels.Hashtbl.S.key Stdlib.Seq.t
val to_seq_values : 'a MoreLabels.Hashtbl.S.t -> 'a Stdlib.Seq.t
val add_seq :
'a MoreLabels.Hashtbl.S.t ->
(MoreLabels.Hashtbl.S.key * 'a) Stdlib.Seq.t -> unit
val replace_seq :
'a MoreLabels.Hashtbl.S.t ->
(MoreLabels.Hashtbl.S.key * 'a) Stdlib.Seq.t -> unit
val of_seq :
(MoreLabels.Hashtbl.S.key * 'a) Stdlib.Seq.t ->
'a MoreLabels.Hashtbl.S.t
end
module Make :
functor (H : HashedType) ->
sig
type key = H.t
type 'a t = 'a Hashtbl.Make(H).t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key:key -> data:'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key:key -> data:'a -> unit
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val filter_map_inplace :
f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val length : 'a t -> int
val stats : 'a t -> statistics
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_keys : 'a t -> key Seq.t
val to_seq_values : 'a t -> 'a Seq.t
val add_seq : 'a t -> (key * 'a) Seq.t -> unit
val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
val of_seq : (key * 'a) Seq.t -> 'a t
end
module type SeededHashedType =
sig
type t
val equal :
MoreLabels.Hashtbl.SeededHashedType.t ->
MoreLabels.Hashtbl.SeededHashedType.t -> bool
val hash : int -> MoreLabels.Hashtbl.SeededHashedType.t -> int
end
module type SeededS =
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 -> 'b -> 'b) ->
'a MoreLabels.Hashtbl.SeededS.t -> init:'b -> 'b
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
module MakeSeeded :
functor (H : SeededHashedType) ->
sig
type key = H.t
type 'a t = 'a Hashtbl.MakeSeeded(H).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:key -> data:'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key:key -> data:'a -> unit
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val filter_map_inplace :
f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val length : 'a t -> int
val stats : 'a t -> statistics
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_keys : 'a t -> key Seq.t
val to_seq_values : 'a t -> 'a Seq.t
val add_seq : 'a t -> (key * 'a) Seq.t -> unit
val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
val of_seq : (key * 'a) Seq.t -> 'a t
end
val hash : 'a -> int
val seeded_hash : int -> 'a -> int
val hash_param : int -> int -> 'a -> int
val seeded_hash_param : int -> int -> int -> 'a -> int
end`