ExtHashtbl.Hashtbltype ('a, 'b) t = ('a, 'b) Hashtbl.tThe type of a hashtable.
val exists : ('a, 'b) t -> 'a -> boolexists h k returns true is at least one item with key k is found in the hashtable.
Return an enumeration of all the keys of a hashtable. If the key is in the Hashtable multiple times, all occurrences will be returned.
val find_default : ('a, 'b) t -> 'a -> 'b -> 'bFind a binding for the key, and return a default value if not found
val find_opt : ('a, 'b) Hashtbl.t -> 'a -> 'b optionFind a binding for the key, or return None if no value is found
val find_option : ('a, 'b) Hashtbl.t -> 'a -> 'b optioncompatibility, use find_opt
val remove_all : ('a, 'b) t -> 'a -> unitRemove all bindings for the given key
map f x creates a new hashtable with the same keys as x, but with the function f applied to all the values
val length : ('a, 'b) t -> intReturn the number of elements inserted into the Hashtbl (including duplicates)
val reset : ('a, 'b) t -> unitval stats : ('a, 'b) t -> statisticsval filter_map_inplace : ('a -> 'b -> 'b option) -> ('a, 'b) t -> unitPlease refer to the Ocaml Manual for documentation of these functions.
val create : ?random:bool -> int -> ('a, 'b) tval clear : ('a, 'b) t -> unitval add : ('a, 'b) t -> 'a -> 'b -> unitval find : ('a, 'b) t -> 'a -> 'bval find_all : ('a, 'b) t -> 'a -> 'b listval mem : ('a, 'b) t -> 'a -> boolval remove : ('a, 'b) t -> 'a -> unitval replace : ('a, 'b) t -> 'a -> 'b -> unitval iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unitval fold : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c*_seq functions were introduced in OCaml 4.07.0, and are _not_ implemented in extlib for older OCaml versions
Functor interface forwards directly to stdlib implementation (i.e. no enum functions)
module type HashedType = Hashtbl.HashedTypemodule type S = Hashtbl.Smodule Make = Hashtbl.Makemodule type SeededHashedType = Hashtbl.SeededHashedTypemodule type SeededS = Hashtbl.SeededSmodule MakeSeeded = Hashtbl.MakeSeeded