sig
module Measure :
sig
type t = [ `Bytes | `Gigabytes | `Kilobytes | `Megabytes | `Words ]
end
type t = Byte_units.t
val create : Measure.t -> float -> t
type binable = t
val bin_size_t : binable Bin_prot.Size.sizer
val bin_write_t : binable Bin_prot.Map_to_safe.writer
val bin_write_t_ : binable Bin_prot.Unsafe_write_c.writer
val bin_read_t : binable Bin_prot.Read_ml.reader
val bin_read_t_ : binable Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> binable) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : binable Bin_prot.Type_class.writer
val bin_reader_t : binable Bin_prot.Type_class.reader
val bin_t : binable Bin_prot.Type_class.t
type comparable = t
val ( >= ) : comparable -> comparable -> bool
val ( <= ) : comparable -> comparable -> bool
val ( = ) : comparable -> comparable -> bool
val ( > ) : comparable -> comparable -> bool
val ( < ) : comparable -> comparable -> bool
val ( <> ) : comparable -> comparable -> bool
val equal : comparable -> comparable -> bool
val compare : comparable -> comparable -> int
val ascending : comparable -> comparable -> int
val descending : comparable -> comparable -> int
val min : comparable -> comparable -> comparable
val max : comparable -> comparable -> comparable
module Map :
sig
type key = comparable
type 'a t = 'a Byte_units.Map.t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
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
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold : f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
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_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
end
module Set :
sig
type elt = comparable
type t = Byte_units.Set.t
module T : sig type 'a elt = elt type 'a t = t end
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val empty : t
val is_empty : t -> bool
val mem : t -> elt -> bool
val add : t -> elt -> t
val singleton : elt -> t
val remove : t -> elt -> t
val union : t -> t -> t
val union_list : t list -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : t -> f:(elt -> unit) -> unit
val fold : t -> init:'a -> f:(elt -> 'a -> 'a) -> 'a
val fold_until :
t ->
init:'a -> f:(elt -> 'a -> [ `Continue of 'a | `Stop of 'a ]) -> 'a
val for_all : t -> f:(elt -> bool) -> bool
val exists : t -> f:(elt -> bool) -> bool
val filter : t -> f:(elt -> bool) -> t
val partition : t -> f:(elt -> bool) -> t * t
val cardinal : t -> int
val length : t -> int
val elements : t -> elt list
val min_elt : t -> elt option
val min_elt_exn : t -> elt
val max_elt : t -> elt option
val max_elt_exn : t -> elt
val choose : t -> elt option
val choose_exn : t -> elt
val of_list : elt list -> t
val to_list : t -> elt list
val of_array : elt array -> t
val to_array : t -> elt array
val split : elt -> t -> t * bool * t
val group_by : t -> equiv:(elt -> elt -> bool) -> t list
val find : t -> f:(elt -> bool) -> elt option
val find_exn : t -> f:(elt -> bool) -> elt
val find_index : t -> int -> elt option
val remove_index : t -> int -> t
end
type hashable = t
module Hashable : sig type t = hashable end
val hash : hashable -> int
module Table :
sig
module Key : sig type t = Hashable.t end
val hashable : Key.t Core_hashtbl_intf.hashable
type 'a t = (Key.t, 'a) Hashable.Table_sig(Hashable).T.t
val clear : ('a, 'b) Hashable.Table_sig(Hashable).T.t -> unit
val copy :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
('a, 'b) Hashable.Table_sig(Hashable).T.t
val invariant : ('a, 'b) Hashable.Table_sig(Hashable).T.t -> unit
val fold :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
init:'c ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> 'c -> 'c) ->
'c
val iter :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> unit) ->
unit
val existsi :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> bool) ->
bool
val exists :
('a, 'b) Hashable.Table_sig(Hashable).T.t -> f:('b -> bool) -> bool
val length : ('a, 'b) Hashable.Table_sig(Hashable).T.t -> int
val is_empty : ('a, 'b) Hashable.Table_sig(Hashable).T.t -> bool
val mem :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> bool
val remove :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> unit
val remove_one :
('a, 'b list) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> unit
val replace :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> unit
val change :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t ->
('b option -> 'b option) -> unit
val add_multi :
('a, 'b list) Hashable.Table_sig(Hashable).T.t ->
key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> unit
val map :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:('b -> 'c) -> ('a, 'c) Hashable.Table_sig(Hashable).T.t
val mapi :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> 'c) ->
('a, 'c) Hashable.Table_sig(Hashable).T.t
val filter_map :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:('b -> 'c option) -> ('a, 'c) Hashable.Table_sig(Hashable).T.t
val filter_mapi :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> 'c option) ->
('a, 'c) Hashable.Table_sig(Hashable).T.t
val filter :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:('b -> bool) -> ('a, 'b) Hashable.Table_sig(Hashable).T.t
val filteri :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:(key:'a Hashable.Table_sig(Hashable).Key1.t -> data:'b -> bool) ->
('a, 'b) Hashable.Table_sig(Hashable).T.t
val find_or_add :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> default:(unit -> 'b) -> 'b
val find :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> 'b option
val find_exn :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> 'b
val iter_vals :
('a, 'b) Hashable.Table_sig(Hashable).T.t -> f:('b -> unit) -> unit
val merge :
f:(key:'a Hashable.Table_sig(Hashable).Key1.t ->
'b option -> 'c option -> 'd option) ->
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
('a, 'c) Hashable.Table_sig(Hashable).T.t ->
('a, 'd) Hashable.Table_sig(Hashable).T.t
val merge_into :
f:(key:'a Hashable.Table_sig(Hashable).Key1.t ->
'b -> 'b option -> 'b option) ->
src:('a, 'b) Hashable.Table_sig(Hashable).T.t ->
dst:('a, 'b) Hashable.Table_sig(Hashable).T.t -> unit
val keys :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t list
val data : ('a, 'b) Hashable.Table_sig(Hashable).T.t -> 'b list
val filter_inplace :
('a, 'b) Hashable.Table_sig(Hashable).T.t -> f:('b -> bool) -> unit
val filteri_inplace :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
f:('a Hashable.Table_sig(Hashable).Key1.t -> 'b -> bool) -> unit
val equal :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
('b -> 'b -> bool) -> bool
val to_alist :
('a, 'b) Hashable.Table_sig(Hashable).T.t ->
('a Hashable.Table_sig(Hashable).Key1.t * 'b) list
val incr :
?by:int ->
('a, int) Hashable.Table_sig(Hashable).T.t ->
'a Hashable.Table_sig(Hashable).Key1.t -> unit
val create :
(unit -> ('a, 'b) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
val of_alist :
(('a Hashable.Table_sig(Hashable).Key1.t * 'b) list ->
[ `Duplicate_key of 'a Hashable.Table_sig(Hashable).Key1.t
| `Ok of ('a, 'b) Hashable.Table_sig(Hashable).T.t ])
Core_hashtbl_intf.with_options
val of_alist_exn :
(('a Hashable.Table_sig(Hashable).Key1.t * 'b) list ->
('a, 'b) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
val of_alist_multi :
(('a Hashable.Table_sig(Hashable).Key1.t * 'b) list ->
('a, 'b list) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
val create_mapped :
(get_key:('a -> 'b Hashable.Table_sig(Hashable).Key1.t) ->
get_data:('a -> 'c) ->
'a list -> ('b, 'c) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
val create_with_key :
(get_key:('a -> 'b Hashable.Table_sig(Hashable).Key1.t) ->
'a list -> ('b, 'a) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
val group :
(get_key:('a -> 'b Hashable.Table_sig(Hashable).Key1.t) ->
get_data:('a -> 'c) ->
combine:('c -> 'c -> 'c) ->
'a list -> ('b, 'c) Hashable.Table_sig(Hashable).T.t)
Core_hashtbl_intf.with_options
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 elem = hashable
type t = elem Hash_set.t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val create : ?growth_allowed:bool -> ?size:int -> unit -> t
val of_list : elem list -> t
end
module Hash_queue :
sig
module Key :
sig
type t = hashable
val compare : t -> t -> int
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 = 'a Byte_units.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 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 keys : 'a t -> Key.t list
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 compare : t -> t -> int
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 = 'a Byte_units.Hash_heap.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
type stringable = t
val of_string : string -> stringable
val to_string : stringable -> string
val bytes : t -> float
val kilobytes : t -> float
val megabytes : t -> float
val gigabytes : t -> float
val words : t -> float
end