module Hashtbl: sig .. end
type ('a, 'b) t = ('a, 'b) Hashtbl.t
The type of a hashtable.
New Functions
val exists : ('a, 'b) t -> 'a -> bool
exists h k returns true is at least one item with key k is
found in the hashtable.
val keys : ('a, 'b) t -> 'a Enum.t
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 values : ('a, 'b) t -> 'b Enum.t
Return an enumeration of all the values of a hashtable.
val enum : ('a, 'b) t -> ('a * 'b) Enum.t
Return an enumeration of (key,value) pairs of a hashtable.
val of_enum : ('a * 'b) Enum.t -> ('a, 'b) t
Create a hashtable from a (key,value) enumeration.
val find_default : ('a, 'b) t -> 'a -> 'b -> 'b
Find a binding for the key, and return a default
value if not found
val find_option : ('a, 'b) Hashtbl.t -> 'a -> 'b option
Find a binding for the key, or return None if no
value is found
val remove_all : ('a, 'b) t -> 'a -> unit
Remove all bindings for the given key
val map : ('b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
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 -> int
Return the number of elements inserted into the Hashtbl
(including duplicates)
Older Functions
Please refer to the Ocaml Manual for documentation of these
functions. (note : functor support removed to avoid code
duplication).
val create : int -> ('a, 'b) t
val clear : ('a, 'b) t -> unit
val add : ('a, 'b) t -> 'a -> 'b -> unit
val copy : ('a, 'b) t -> ('a, 'b) t
val find : ('a, 'b) t -> 'a -> 'b
val find_all : ('a, 'b) t -> 'a -> 'b list
val mem : ('a, 'b) t -> 'a -> bool
val remove : ('a, 'b) t -> 'a -> unit
val replace : ('a, 'b) t -> 'a -> 'b -> unit
val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit
val fold : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val hash : 'a -> int