module Binable : Binable0
module type Key = sig .. end
type t
val hash : t -> int
Values returned by hash must be non-negative. An exception will be raised in the case that hash returns a negative value.
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
module type Key_binable = sig .. end
type t
include Key with type t := t
val bin_t : t Bin_prot.Type_class.t
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_writer_t : t Bin_prot.Type_class.writer
module Hashable : sig .. end
type 'a t = {
hash : 'a -> int;
compare : 'a -> 'a -> int;
sexp_of_t : 'a -> Sexplib.Sexp.t;
}
val hash_param : int -> int -> 'a -> int
val hash : 'a -> int
val poly : 'a t
val of_key : (module Key with type t = 'a) -> 'a t
module type Hashable = sig .. end
type 'a t = 'a Hashable.t = {
hash : 'a -> int;
compare : 'a -> 'a -> int;
sexp_of_t : 'a -> Sexplib.Sexp.t;
}
val poly : 'a t
val of_key : (module Key with type t = 'a) -> 'a t
val hash_param : int -> int -> 'a -> int
val hash : 'a -> int
module type Accessors = sig .. end
type ('a, 'b) t
type 'a key
val sexp_of_key : ('a, 'b) t -> 'a key -> Sexplib.Sexp.t
val clear : ('a, 'b) t -> unit
val copy : ('a, 'b) t -> ('a, 'b) t
val invariant : ('a, 'b) t -> unit
val fold : ('a, 'b) t -> init:'c -> f:(key:'a key -> data:'b -> 'c -> 'c) -> 'c
val iter : ('a, 'b) t -> f:(key:'a key -> data:'b -> unit) -> unit
val existsi : ('a, 'b) t -> f:(key:'a key -> data:'b -> bool) -> bool
val exists : ('a, 'b) t -> f:('b -> bool) -> bool
val length : ('a, 'b) t -> int
val is_empty : ('a, 'b) t -> bool
val mem : ('a, 'b) t -> 'a key -> bool
val remove : ('a, 'b) t -> 'a key -> unit
val remove_one : ('a, 'b list) t -> 'a key -> unit
val replace : ('a, 'b) t -> key:'a key -> data:'b -> unit
val set : ('a, 'b) t -> key:'a key -> data:'b -> unit
val add : ('a, 'b) t -> key:'a key -> data:'b -> [ `Duplicate | `Ok ]
val add_exn : ('a, 'b) t -> key:'a key -> data:'b -> unit
val change : ('a, 'b) t -> 'a key -> ('b option -> 'b option) -> unit
change t key f updates the given table by changing the value stored under key according to f, just like Map.change (see that for example).
val add_multi : ('a, 'b list) t -> key:'a key -> data:'b -> unit
add_multi t ~key ~data if key is present in the table then cons data on the list, otherwise add key with a single element list.
val remove_multi : ('a, 'b list) t -> 'a key -> unit
remove_multi t key updates the table, removing the head of the list bound to key. If the list has only one element (or is empty) then the binding is removed.
val map : ('a, 'b) t -> f:('b -> 'c) -> ('a, 'c) t
map t f returns new table with bound values replaced by f applied to the bound values
val mapi : ('a, 'b) t -> f:(key:'a key -> data:'b -> 'c) -> ('a, 'c) t
like map, but function takes both key and data as arguments
val filter_map : ('a, 'b) t -> f:('b -> 'c option) -> ('a, 'c) t
returns new map with bound values filtered by f applied to the bound values
val filter_mapi : ('a, 'b) t -> f:(key:'a key -> data:'b -> 'c option) -> ('a, 'c) t
like filter_map, but function takes both key and data as arguments
val filter : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) t
val filteri : ('a, 'b) t -> f:(key:'a key -> data:'b -> bool) -> ('a, 'b) t
val partition_map : ('a, 'b) t ->
f:('b -> [ `Fst of 'c | `Snd of 'd ]) -> ('a, 'c) t * ('a, 'd) t
returns new maps with bound values partitioned by f applied to the bound values
val partition_mapi : ('a, 'b) t ->
f:(key:'a key -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t * ('a, 'd) t
like partition_map, but function takes both key and data as arguments
val partition_tf : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) t * ('a, 'b) t
val partitioni_tf : ('a, 'b) t -> f:(key:'a key -> data:'b -> bool) -> ('a, 'b) t * ('a, 'b) t
val find_or_add : ('a, 'b) t -> 'a key -> default:(unit -> 'b) -> 'b
find_or_add t k ~default returns the data associated with key k if it is in the table t, otherwise it lets d = default() and adds it to the table.
val find : ('a, 'b) t -> 'a key -> 'b option
find t k returns Some (the current binding) of k in t, or None if no such binding exists
val find_exn : ('a, 'b) t -> 'a key -> 'b
find_exn t k returns the current binding of k in t, or raises Not_found if no such binding exists.
val find_and_remove : ('a, 'b) t -> 'a key -> 'b option
find_and_remove t k returns Some (the current binding) of k in t and removes it, or None is no such binding exists
val iter_vals : ('a, 'b) t -> f:('b -> unit) -> unit
iter_vals t ~f is like iter, except it only supplies the value to f, not the key.
val merge : ('k, 'a) t ->
('k, 'b) t ->
f:(key:'k key ->
   [ `Both of 'a * 'b | `Left of 'a | `Right of 'b ] -> 'c option) ->
('k, 'c) t
Merge two hashtables.

The result of merge f h1 h2 has as keys the set of all k in the union of the sets of keys of h1 and h2 for which d(k) is not None, where:

d(k) =

  • f ~key:k (Some d1) None if k in h1 is to d1, and h2 does not map k;
  • f ~key:k None (Some d2) if k in h2 is to d2, and h1 does not map k;
  • f ~key:k (Some d1) (Some d2) otherwise, where k in h1 is to d1 and k in h2 is to d2.
Each key k is mapped to a single piece of data x, where d(k) = Some x.
val merge_into : f:(key:'a key -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t -> dst:('a, 'b) t -> unit
Merge one hashtable into another.

After merge_into f src dst, for every key in src, key will be re-mapped in dst to v if f ~key d1 (find dst key) = Some v.

val keys : ('a, 'b) t -> 'a key list
Returns the list of all keys for given hashtable.
Returns the list of all data for given hashtable.
val data : ('a, 'b) t -> 'b list
filter_inplace t ~f removes all the elements from t that don't satisfy f.
val filter_inplace : ('a, 'b) t -> f:('b -> bool) -> unit
val filteri_inplace : ('a, 'b) t -> f:('a key -> 'b -> bool) -> unit
val equal : ('a, 'b) t -> ('a, 'b) t -> ('b -> 'b -> bool) -> bool
equal t1 t2 f and similar t1 t2 f both return true iff t1 and t2 have the same keys and for all keys k, f (find_exn t1 k) (find_exn t2 k). equal and similar only differ in their types.
val similar : ('a, 'b1) t -> ('a, 'b2) t -> ('b1 -> 'b2 -> bool) -> bool
val to_alist : ('a, 'b) t -> ('a key * 'b) list
Returns the list of all (key,data) pairs for given hashtable.
val validate : name:('a key -> string) -> 'b Validate.check -> ('a, 'b) t Validate.check
val incr : ?by:int -> ('a, int) t -> 'a key -> unit
type ('key, 'z) create_options_without_hashable = ?growth_allowed:bool -> ?size:int -> 'z
type ('key, 'z) create_options_with_hashable = ?growth_allowed:bool -> ?size:int -> hashable:'key Hashable.t -> 'z
module type Creators = sig .. end
type ('a, 'b) t
type 'a key
type ('key, 'z) create_options
val create : ('a key, unit -> ('a, 'b) t) create_options
val of_alist : ('a key,
 ('a key * 'b) list -> [ `Duplicate_key of 'a key | `Ok of ('a, 'b) t ])
create_options
val of_alist_report_all_dups : ('a key,
 ('a key * 'b) list -> [ `Duplicate_keys of 'a key list | `Ok of ('a, 'b) t ])
create_options
val of_alist_or_error : ('a key, ('a key * 'b) list -> ('a, 'b) t Or_error.t) create_options
val of_alist_exn : ('a key, ('a key * 'b) list -> ('a, 'b) t) create_options
val of_alist_multi : ('a key, ('a key * 'b) list -> ('a, 'b list) t) create_options
val create_mapped : ('a key,
 get_key:('r -> 'a key) ->
 get_data:('r -> 'b) ->
 'r list -> [ `Duplicate_keys of 'a key list | `Ok of ('a, 'b) t ])
create_options
val create_with_key : ('a key,
 get_key:('r -> 'a key) ->
 'r list -> [ `Duplicate_keys of 'a key list | `Ok of ('a, 'r) t ])
create_options
val create_with_key_exn : ('a key, get_key:('r -> 'a key) -> 'r list -> ('a, 'r) t) create_options
val group : ('a key,
 get_key:('r -> 'a key) ->
 get_data:('r -> 'b) -> combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t)
create_options
module type S = sig .. end
type key
type ('a, 'b) hashtbl
type 'b t = (key, 'b) hashtbl
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Hashable.t
include Creators with type t := ('a, 'b) t_ with type key := 'a key_ with type create_options := ('key, 'z) create_options_without_hashable
include Accessors with type t := ('a, 'b) t_ with type key := 'a key_
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
module type S_binable = sig .. end
include S
include Binable.S1 with type t := 'v t
module type Hashtbl = sig .. end
module Hashable : Hashable
val hash : 'a -> int
val hash_param : int -> int -> 'a -> int
type ('a, 'b) t
include Creators with type t := ('a, 'b) t with type key = 'a with type create_options := ('a, 'z) create_options_with_hashable
include Accessors with type t := ('a, 'b) t with type key := 'a key
module Poly : sig .. end with type t = ('a, 'b) t
type ('a, 'b) t
val hashable : 'a Hashable.t
include Creators with type t := ('a, 'b) t with type key = 'a with type create_options := ('key, 'z) create_options_without_hashable
include Accessors with type t := ('a, 'b) t with type key := 'a key
val t_of_sexp : (Sexplib.Sexp.t -> 'a) ->
(Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> ('a, 'b) t
val sexp_of_t : ('a -> Sexplib.Sexp.t) ->
('b -> Sexplib.Sexp.t) -> ('a, 'b) t -> Sexplib.Sexp.t
val bin_t : 'a Bin_prot.Type_class.t ->
'b Bin_prot.Type_class.t -> ('a, 'b) t Bin_prot.Type_class.t
val bin_read_t : 'a Bin_prot.Read.reader ->
'b Bin_prot.Read.reader -> ('a, 'b) t Bin_prot.Read.reader
val __bin_read_t__ : 'a Bin_prot.Read.reader ->
'b Bin_prot.Read.reader -> (int -> ('a, 'b) t) Bin_prot.Read.reader
val bin_reader_t : 'a Bin_prot.Type_class.reader ->
'b Bin_prot.Type_class.reader -> ('a, 'b) t Bin_prot.Type_class.reader
val bin_size_t : 'a Bin_prot.Size.sizer ->
'b Bin_prot.Size.sizer -> ('a, 'b) t Bin_prot.Size.sizer
val bin_write_t : 'a Bin_prot.Write.writer ->
'b Bin_prot.Write.writer -> ('a, 'b) t Bin_prot.Write.writer
val bin_writer_t : 'a Bin_prot.Type_class.writer ->
'b Bin_prot.Type_class.writer -> ('a, 'b) t Bin_prot.Type_class.writer
module type Key = Key
module type Key_binable = Key_binable
module type S = S with type hashtbl = ('a, 'b) t
module type S_binable = S_binable with type hashtbl = ('a, 'b) t
module Make : 
functor (Key : Key) -> S with type key = Key.t
module Make_binable : 
functor (Key : Key_binable) -> S_binable with type key = Key.t
val sexp_of_t : ('a -> Sexplib.Sexp.t) ->
('b -> Sexplib.Sexp.t) -> ('a, 'b) t -> Sexplib.Sexp.t