sig
module type S =
sig
type hashable
val equal : hashable -> hashable -> bool
val hash : hashable -> int
module Table :
sig
type key = hashable
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key:key -> data:'a -> unit
val remove : 'a t -> key -> unit
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key:key -> data:'a -> unit
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val length : 'a t -> int
val find_default : 'a t -> key -> default:(unit -> 'a) -> 'a
val find : 'a t -> key -> 'a option
val find_exn : 'a t -> key -> 'a
val iter_vals : f:('a -> unit) -> 'a t -> unit
val of_alist : (key * 'a) list -> 'a t
val to_alist : 'a t -> (key * 'a) list
val keys : 'a t -> key list
val data : 'a t -> 'a list
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t
module Infix :
sig
val ( |> ) : 'a t -> key -> 'a
val ( |?> ) : 'a t -> key -> 'a option
val ( <| ) : 'a t -> key * 'a -> unit
end
end
module Hash_set :
sig
type elt = hashable
type 'a elt_ = elt
type 'a set
val create : int -> 'a set
val add : 'a set -> 'a elt_ -> unit
val strict_add : 'a set -> 'a elt_ -> unit
val remove : 'a set -> 'a elt_ -> unit
val strict_remove : 'a set -> 'a elt_ -> unit
val clear : 'a set -> unit
val fold : f:('a -> 'b elt_ -> 'a) -> init:'a -> 'b set -> 'a
val iter : f:('a elt_ -> unit) -> 'a set -> unit
val length : 'a set -> int
val mem : 'a set -> 'a elt_ -> bool
val of_list : 'a elt_ list -> 'a set
val to_list : 'a set -> 'a elt_ list
type t = unit set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
end
module Hash_queue :
sig
module Key :
sig
type t = hashable
val equal : t -> t -> bool
val hash : t -> int
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
end
type 'a t
type 'a container = 'a t
val length : 'a container -> int
val is_empty : 'a container -> bool
val iter : 'a container -> f:('a -> unit) -> unit
val fold : 'a container -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val exists : 'a container -> f:('a -> bool) -> bool
val for_all : 'a container -> f:('a -> bool) -> bool
val find : 'a container -> f:('a -> bool) -> 'a option
val to_list : 'a container -> 'a list
val to_array : 'a container -> 'a array
val invariant : 'a t -> unit
val create : unit -> 'a t
val clear : 'a t -> unit
val mem : 'a t -> Key.t -> bool
val find_opt : 'a t -> Key.t -> 'a option
val enqueue : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val dequeue : 'a t -> 'a option
val dequeue_with_key : 'a t -> (Key.t * 'a) option
val dequeue_all : 'a t -> f:('a -> unit) -> unit
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val iter_keys : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val fold_keys :
'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b
end
end
module Make :
functor (T : Core_hashtbl.HashedType) ->
sig
type hashable = T.t
val equal : hashable -> hashable -> bool
val hash : hashable -> int
module Table :
sig
type key = hashable
type 'a t = 'a Hashable.Make(T).Table.t
val create : int -> 'a t
val clear : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key:key -> data:'a -> unit
val remove : 'a t -> key -> unit
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key:key -> data:'a -> unit
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val length : 'a t -> int
val find_default : 'a t -> key -> default:(unit -> 'a) -> 'a
val find : 'a t -> key -> 'a option
val find_exn : 'a t -> key -> 'a
val iter_vals : f:('a -> unit) -> 'a t -> unit
val of_alist : (key * 'a) list -> 'a t
val to_alist : 'a t -> (key * 'a) list
val keys : 'a t -> key list
val data : 'a t -> 'a list
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t
module Infix :
sig
val ( |> ) : 'a t -> key -> 'a
val ( |?> ) : 'a t -> key -> 'a option
val ( <| ) : 'a t -> key * 'a -> unit
end
end
module Hash_set :
sig
type elt = hashable
type 'a elt_ = elt
type 'a set = 'a Hashable.Make(T).Hash_set.set
val create : int -> 'a set
val add : 'a set -> 'a elt_ -> unit
val strict_add : 'a set -> 'a elt_ -> unit
val remove : 'a set -> 'a elt_ -> unit
val strict_remove : 'a set -> 'a elt_ -> unit
val clear : 'a set -> unit
val fold : f:('a -> 'b elt_ -> 'a) -> init:'a -> 'b set -> 'a
val iter : f:('a elt_ -> unit) -> 'a set -> unit
val length : 'a set -> int
val mem : 'a set -> 'a elt_ -> bool
val of_list : 'a elt_ list -> 'a set
val to_list : 'a set -> 'a elt_ list
type t = unit set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
end
module Hash_queue :
sig
module Key :
sig
type t = hashable
val equal : t -> t -> bool
val hash : t -> int
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
end
type 'a t = 'a Hashable.Make(T).Hash_queue.t
type 'a container = 'a t
val length : 'a container -> int
val is_empty : 'a container -> bool
val iter : 'a container -> f:('a -> unit) -> unit
val fold : 'a container -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val exists : 'a container -> f:('a -> bool) -> bool
val for_all : 'a container -> f:('a -> bool) -> bool
val find : 'a container -> f:('a -> bool) -> 'a option
val to_list : 'a container -> 'a list
val to_array : 'a container -> 'a array
val invariant : 'a t -> unit
val create : unit -> 'a t
val clear : 'a t -> unit
val mem : 'a t -> Key.t -> bool
val find_opt : 'a t -> Key.t -> 'a option
val enqueue :
'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val dequeue : 'a t -> 'a option
val dequeue_with_key : 'a t -> (Key.t * 'a) option
val dequeue_all : 'a t -> f:('a -> unit) -> unit
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val iter_keys : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val fold_keys :
'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b
end
end
end