sig
type t = Caml.Unix.file_descr
type hashable = t
val equal : hashable -> hashable -> bool
val hash : hashable -> int
module Table :
sig
type key = hashable
type 'a t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
val create : int -> 'a t
val clear : 'a t -> unit
val copy : 'a t -> 'a t
val shadow_add : 'a t -> key:key -> data:'a -> unit
val remove : 'a t -> key -> unit
val shadow_find : 'a t -> key -> 'a list
val replace : 'a t -> key:key -> data:'a -> unit
val mem : 'a t -> key -> bool
val iter : 'a t -> f:(key:key -> data:'a -> unit) -> unit
val fold : 'a t -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val length : 'a t -> int
val map : 'a t -> f:('a -> 'b) -> 'b t
val mapi : 'a t -> f:(key:key -> data:'a -> 'b) -> 'b t
val filter_map : 'a t -> f:('a -> 'b option) -> 'b t
val filter_mapi : 'a t -> f:(key:key -> data:'a -> 'b option) -> 'b t
val remove_all : 'a t -> key -> unit
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 : 'a t -> f:('a -> unit) -> unit
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_shadow : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val to_alist_shadow : 'a t -> (key * 'a list) list
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val keys : 'a t -> key list
val data : 'a t -> 'a list
val filter_inplace : 'a t -> f:('a -> bool) -> unit
val filteri_inplace : 'a t -> f:(key -> 'a -> bool) -> unit
val equal : 'a t -> 'a t -> ('a -> 'a -> bool) -> bool
val add_to_groups :
'a t ->
get_key:('b -> key) ->
get_data:('b -> 'a) ->
combine:('a -> 'a -> 'a) -> rows:'b list -> unit
val group :
?size:int ->
get_key:('a -> key) ->
get_data:('a -> 'b) -> combine:('b -> 'b -> 'b) -> 'a list -> 'b t
val create_with_key : get_key:('a -> key) -> 'a list -> 'a t
val create_mapped :
get_key:('a -> key) -> get_data:('a -> 'b) -> 'a list -> 'b t
type 'a sexpable = 'a t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
end
module Hash_set :
sig
type elt = hashable
type t
module T : sig type 'a elt = elt type 'a t = t end
val create : int -> t
val add : t -> elt -> unit
val strict_add : t -> elt -> unit
val remove : t -> elt -> unit
val strict_remove : t -> elt -> unit
val clear : t -> unit
val fold : f:('a -> elt -> 'a) -> init:'a -> t -> 'a
val iter : f:(elt -> unit) -> t -> unit
val length : t -> int
val mem : t -> elt -> bool
val is_empty : t -> bool
val of_list : elt list -> t
val to_list : t -> elt list
val equal : t -> t -> bool
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
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
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 container : ('a, 'a container) Container.type_class
val invariant : 'a t -> unit
val create : unit -> 'a t
val clear : 'a t -> unit
val mem : 'a t -> Key.t -> bool
val lookup : 'a t -> Key.t -> 'a option
val lookup_exn : 'a t -> Key.t -> 'a
val enqueue : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_exn : 'a t -> Key.t -> 'a -> unit
val dequeue : 'a t -> 'a option
val dequeue_exn : 'a t -> 'a
val dequeue_with_key : 'a t -> (Key.t * 'a) option
val dequeue_with_key_exn : 'a t -> Key.t * 'a
val dequeue_all : 'a t -> f:('a -> unit) -> unit
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val remove_exn : 'a t -> Key.t -> unit
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val replace_exn : 'a t -> Key.t -> 'a -> unit
val iteri : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val foldi :
'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b
end
module Hash_heap :
sig
module Key :
sig
type t = hashable
val equal : t -> t -> bool
val hash : t -> int
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
end
type 'a t
val create : ?min_size:int -> ('a -> 'a -> int) -> 'a t
val copy : 'a t -> 'a t
val push :
'a t -> key:Key.t -> data:'a -> [ `Key_already_present | `Ok ]
val push_exn : 'a t -> key:Key.t -> data:'a -> unit
val replace : 'a t -> key:Key.t -> data:'a -> unit
val remove : 'a t -> Key.t -> unit
val mem : 'a t -> Key.t -> bool
val top : 'a t -> 'a option
val top_exn : 'a t -> 'a
val top_with_key : 'a t -> (Key.t * 'a) option
val top_with_key_exn : 'a t -> Key.t * 'a
val pop_with_key : 'a t -> (Key.t * 'a) option
val pop_with_key_exn : 'a t -> Key.t * 'a
val pop : 'a t -> 'a option
val pop_exn : 'a t -> 'a
val cond_pop_with_key :
'a t -> (key:Key.t -> data:'a -> bool) -> (Key.t * 'a) option
val cond_pop : 'a t -> ('a -> bool) -> 'a option
val find : 'a t -> Key.t -> 'a option
val find_pop : 'a t -> Key.t -> 'a option
val find_exn : 'a t -> Key.t -> 'a
val find_pop_exn : 'a t -> Key.t -> 'a
val iter : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val iter_vals : 'a t -> f:('a -> unit) -> unit
end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val to_int : Unix.File_descr.t -> int
val to_string : Unix.File_descr.t -> string
val sexp_of_t : Unix.File_descr.t -> Sexplib.Sexp.t
end