module X : Hashtbl.HashedTypeinclude Hashtbl.S with type key = X.t with type 'a t = 'a Hashtbl.Make(X).ttype key = X.ttype 'a t = 'a Hashtbl.Make(X).tval create : int -> 'a tval clear : 'a t -> unitval reset : 'a t -> unitval length : 'a t -> intval stats : 'a t -> Hashtbl.statisticsSafe version of Hashtbl.find
get_or tbl k ~or_ returns the value associated to k if present, and returns or_ otherwise (if k doesn't belong in tbl)
add_list tbl x y adds y to the list x is bound to. If x is not bound, it becomes bound to [y].
incr ?by tbl x increments or initializes the counter associated with x. If get tbl x = None, then after update, get tbl x = Some 1; otherwise, if get tbl x = Some n, now get tbl x = Some (n+1).
if specified, the int value is incremented by by rather than 1
Same as incr but substract 1 (or the value of by). If the value reaches 0, the key is removed from the table. This does nothing if the key is not already present in the table.
Iterate on keys (similar order as Hashtbl.iter)
val values_list : 'a t -> 'a listvalues t is the list of values in t.
Add the corresponding pairs to the table, using Hashtbl.add.
add_seq_count tbl seq increments the count of each element of seq by calling incr. This is useful for counting how many times each element of seq occurs.
Similar to add_seq_count, but allocates a new table and returns it
update tbl ~f ~k updates key k by calling f k (Some v) if k was mapped to v, or f k None otherwise; if the call returns None then k is removed/stays removed, if the call returns Some v' then the binding k -> v' is inserted using Hashtbl.replace