Module Bounded_int_table

module Bounded_int_table: Bounded_int_table

type ('key, 'data) t

val sexp_of_t : ('key -> Sexplib.Sexp.t) ->
       ('data -> Sexplib.Sexp.t) ->
       ('key, 'data) t -> Sexplib.Sexp.t

val invariant : ('a, 'b) t -> unit

val create : ?sexp_of_key:('key -> Sexp.t) ->
       num_keys:int ->
       key_to_int:('key -> int) -> unit -> ('key, 'data) t

create ~num_keys ~key_to_int returns a table where the keys can map to 0 .. num_keys-1, according to key_to_int. It is an error if num_keys < 0.

sexp_of_key, if supplied, will be used to display keys in error messages.

val data : ('a, 'data) t -> 'data list

Standard hashtbl functions.

val find : ('key, 'data) t -> 'key -> 'data option

val fold : ('key, 'data) t ->
       init:'accum -> f:(key:'key -> data:'data -> 'accum -> 'accum) -> 'accum

val iter : ('key, 'data) t ->
       f:(key:'key -> data:'data -> unit) -> unit

val iter_vals : ('a, 'data) t -> f:('data -> unit) -> unit

val keys : ('key, 'a) t -> 'key list

val length : ('a, 'b) t -> int

val mem : ('key, 'a) t -> 'key -> bool

val remove : ('key, 'a) t -> 'key -> unit

val set : ('a, 'b) t -> key:'a -> data:'b -> unit

val add : ('a, 'b) t -> key:'a -> data:'b -> [ `Duplicate | `Ok ]

val add_exn : ('a, 'b) t -> key:'a -> data:'b -> unit

val to_alist : ('key, 'data) t -> ('key * 'data) list

val debug : bool Pervasives.ref

set debug := true to turn on debugging, including potentially slow invariant checking.