val is_empty : 'a t -> boolval add : 'a t -> key -> 'a -> unitval remove : 'a t -> key -> unitval remove_all : 'a t -> key -> unitval find : 'a t -> key -> 'aval find_all : 'a t -> key -> 'a listval find_default : 'a t -> key -> 'a -> 'aval find_option : 'a t -> key -> 'a optionval find_opt : 'a t -> key -> 'a optionval replace : 'a t -> key -> 'a -> unitval mem : 'a t -> key -> boolval iter : (key -> 'a -> unit) -> 'a t -> unitval for_all : (key -> 'a -> bool) -> 'a t -> boolval fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'bval exists : (key -> 'a -> bool) -> 'a t -> boolval map : (key -> 'b -> 'c) -> 'b t -> 'c tval map_inplace : (key -> 'a -> 'a) -> 'a t -> unitval filter : ('a -> bool) -> 'a t -> 'a tval filter_inplace : ('a -> bool) -> 'a t -> unitval filteri : (key -> 'a -> bool) -> 'a t -> 'a tval filteri_inplace : (key -> 'a -> bool) -> 'a t -> unitval filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b tval filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unitval modify : key -> ('a -> 'a) -> 'a t -> unitval modify_def : 'a -> key -> ('a -> 'a) -> 'a t -> unitval modify_opt : key -> ('a option -> 'a option) -> 'a t -> unitval merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t ->
'b t ->
'c tval merge_all : (key -> 'a list -> 'b list -> 'c list) -> 'a t -> 'b t -> 'c tval to_seq : 'a t -> (key * 'a) Stdlib.Seq.tval to_seq_keys : _ t -> key Stdlib.Seq.tval to_seq_values : 'a t -> 'a Stdlib.Seq.tval add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unitval replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unitval of_seq : (key * 'a) Stdlib.Seq.t -> 'a tval to_list : 'a t -> (key * 'a) listval of_list : (key * 'a) list -> 'a tOverride modules
The following modules replace functions defined in Hashtbl with functions behaving slightly differently but having the same name. This is by design: the functions meant to override the corresponding functions of Hashtbl.
Operations on Hashtbl without exceptions.
module Infix : sig ... endOperations on Hashtbl with labels.