sig
type t = Core.Core_int63.t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Core.Core_int63.comparator
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write_ml.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
val compare : t -> t -> int
val comparator : (t, comparator) Core.Comparator.t_
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c) Core.Core_map_intf.create_options_without_comparator
val empty : ('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator, ('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ -> min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Core.Core_int63.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator, ('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ -> f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index : ('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list -> [ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default : ('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Core.Core_int63.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Core.Core_int63.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val of_int_exn : int -> t
val to_int_exn : t -> int
val to_string_hum : t -> string
val num_bits : int
val zero : t
val one : t
val minus_one : t
val ( + ) : t -> t -> t
val ( - ) : t -> t -> t
val ( * ) : t -> t -> t
val ( / ) : t -> t -> t
val neg : t -> t
val succ : t -> t
val pred : t -> t
val abs : t -> t
val rem : t -> t -> t
val max_value : t
val min_value : t
val bit_and : t -> t -> t
val bit_or : t -> t -> t
val bit_xor : t -> t -> t
val bit_not : t -> t
val decr : t ref -> unit
val incr : t ref -> unit
val shift_left : t -> int -> t
val shift_right : t -> int -> t
val shift_right_logical : t -> int -> t
val of_int32_exn : int32 -> t
val to_int32_exn : t -> int32
val of_int64_exn : int64 -> t
val to_int64 : t -> int64
val of_nativeint_exn : nativeint -> t
val to_nativeint_exn : t -> nativeint
val of_int : int -> t
val to_int : t -> int option
val ounit_tests : unit -> OUnit.test
type repr = Core.Std.Int63.t
module type S =
sig
type t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module type S0 =
sig
type t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
val zero : t
end
module Pos :
sig
type t = Int63.Pos.t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Pos.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Pos.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Pos0 :
sig
type t = Int63.Pos0.t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Pos0.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Pos0.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos0.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos0.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
val zero : t
end
module Neg :
sig
type t = Int63.Neg.t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Neg.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Neg.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Neg0 :
sig
type t = Int63.Neg0.t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Neg0.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Neg0.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg0.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg0.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
val zero : t
end
module type Bounded_spec =
sig val name : string val lower : repr val upper : repr end
module type Bounded =
sig
val name : string
val lower : repr
val upper : repr
type t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Make_bounded :
functor (Spec : Bounded_spec) ->
sig
val name : string
val lower : repr
val upper : repr
type t = Int63.Make_bounded(Spec).t
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Make_bounded(Spec).comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key :
('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key :
('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Make_bounded(Spec).Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map :
('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi :
('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map :
('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ :
('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Make_bounded(Spec).Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Make_bounded(Spec).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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Pos_unsafe :
sig
type t = repr
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Pos_unsafe.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Pos_unsafe.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos_unsafe.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos_unsafe.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Pos0_unsafe :
sig
type t = repr
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Pos0_unsafe.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Pos0_unsafe.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos0_unsafe.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Pos0_unsafe.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
val zero : t
end
module Neg_unsafe :
sig
type t = repr
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Neg_unsafe.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Neg_unsafe.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg_unsafe.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg_unsafe.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
module Neg0_unsafe :
sig
type t = repr
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Neg0_unsafe.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key : ('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator) Int63.Neg0_unsafe.Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map : ('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi : ('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map : ('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ : ('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg0_unsafe.Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t = 'a Int63.Neg0_unsafe.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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
val zero : t
end
module Make_bounded_unsafe :
functor (Spec : Bounded_spec) ->
sig
val name : string
val lower : repr
val upper : repr
type t = repr
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
val ascending : t -> t -> int
val descending : t -> t -> int
module Replace_polymorphic_compare :
sig
val ( >= ) : t -> t -> bool
val ( <= ) : t -> t -> bool
val ( = ) : t -> t -> bool
val ( > ) : t -> t -> bool
val ( < ) : t -> t -> bool
val ( <> ) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val min : t -> t -> t
val max : t -> t -> t
end
type comparator = Int63.Make_bounded_unsafe(Spec).comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type 'v t = (Key.t, 'v, Key.comparator) Core.Core_map.t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) create_options =
('a, 'b, 'c)
Core.Core_map_intf.create_options_without_comparator
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) create_options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
create_options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
create_options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
create_options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
create_options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
create_options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) Core.Core_map.tree ->
('k, 'v, 'comparator) t_)
create_options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_
val add_multi :
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_
val change :
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_
val find : ('k, 'v, 'a) t_ -> 'k key_ -> 'v option
val find_exn : ('k, 'v, 'a) t_ -> 'k key_ -> 'v
val remove :
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_
val mem : ('k, 'a, 'b) t_ -> 'k key_ -> bool
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_
val fold :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) t_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_
val filter_map :
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_
val filter_mapi :
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_
val compare :
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int
val equal :
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool
val keys : ('k, 'a, 'b) t_ -> 'k key_ list
val data : ('a, 'v, 'b) t_ -> 'v list
val to_alist : ('k, 'v, 'a) t_ -> ('k key_ * 'v) list
val merge :
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
'v3 option) ->
('k, 'v3, 'comparator) t_
val min_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val min_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val max_elt : ('k, 'v, 'a) t_ -> ('k key_ * 'v) option
val max_elt_exn : ('k, 'v, 'a) t_ -> 'k key_ * 'v
val for_all : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) t_ -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'v, 'b) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a
val range_to_alist :
('k, 'v, 'a) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list
val prev_key :
('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val next_key :
('k, 'v, 'a) t_ -> 'k key_ -> ('k key_ * 'v) option
val rank : ('k, 'a, 'b) t_ -> 'k key_ -> int option
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) Core.Core_map.tree
end
module Set :
sig
module Elt :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type t = (Elt.t, Elt.comparator) Core.Core_set.t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type ('a, 'comparator) t_ = t
type ('a, 'comparator) tree =
('a, 'comparator)
Int63.Make_bounded_unsafe(Spec).Set.tree
type 'a elt_ = Elt.t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.create_options_without_comparator
val map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) Core.Core_set.t ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.create_options_without_comparator
val length : ('a, 'b) t_ -> int
val is_empty : ('a, 'b) t_ -> bool
val iter : ('a, 'b) t_ -> f:('a elt_ -> unit) -> unit
val fold :
('a, 'b) t_ ->
init:'accum -> f:('accum -> 'a elt_ -> 'accum) -> 'accum
val exists : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val for_all : ('a, 'b) t_ -> f:('a elt_ -> bool) -> bool
val count : ('a, 'b) t_ -> f:('a elt_ -> bool) -> int
val find : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_ option
val find_map :
('a, 'c) t_ -> f:('a elt_ -> 'b option) -> 'b option
val to_list : ('a, 'b) t_ -> 'a elt_ list
val to_array : ('a, 'b) t_ -> 'a elt_ array
val mem : ('a, 'b) t_ -> 'a elt_ -> bool
val add : ('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val remove :
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_
val union :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val inter :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val diff :
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_
val compare : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int
val equal : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val subset : ('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool
val fold_until :
('a, 'c) t_ ->
init:'b ->
f:('b -> 'a elt_ -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right :
('a, 'c) t_ -> init:'b -> f:('a elt_ -> 'b -> 'b) -> 'b
val filter :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_
val partition_tf :
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_
val elements : ('a, 'b) t_ -> 'a elt_ list
val min_elt : ('a, 'b) t_ -> 'a elt_ option
val min_elt_exn : ('a, 'b) t_ -> 'a elt_
val max_elt : ('a, 'b) t_ -> 'a elt_ option
val max_elt_exn : ('a, 'b) t_ -> 'a elt_
val choose : ('a, 'b) t_ -> 'a elt_ option
val choose_exn : ('a, 'b) t_ -> 'a elt_
val split :
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_
val group_by :
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list
val find_exn : ('a, 'b) t_ -> f:('a elt_ -> bool) -> 'a elt_
val find_index : ('a, 'b) t_ -> int -> 'a elt_ option
val remove_index :
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
end
val of_float : float -> t
val to_float : t -> float
module Hashable : sig type t = t end
val hash : t -> int
val hashable : t Core.Std.Hashable.Hashtbl.Hashable.t
module Table :
sig
type key = t
type ('a, 'b) hashtbl = ('a, 'b) Core.Std.Hashable.Hashtbl.t
type 'b t = (key, 'b) hashtbl
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
type ('a, 'b) t_ = 'b t
type 'a key_ = key
val hashable : key Core.Core_hashtbl_intf.Hashable.t
val create :
('a key_, unit -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_key of 'a key_ | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_report_all_dups :
('a key_,
('a key_ * 'b) list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'b) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_exn :
('a key_, ('a key_ * 'b) list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val of_alist_multi :
('a key_, ('a key_ * 'b) list -> ('a, 'b list) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key :
('a key_,
get_key:('r -> 'a key_) ->
'r list ->
[ `Duplicate_keys of 'a key_ list | `Ok of ('a, 'r) t_ ])
Core.Core_hashtbl_intf.create_options_without_hashable
val create_with_key_exn :
('a key_, get_key:('r -> 'a key_) -> 'r list -> ('a, 'r) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
val group :
('a key_,
get_key:('r -> 'a key_) ->
get_data:('r -> 'b) ->
combine:('b -> 'b -> 'b) -> 'r list -> ('a, 'b) t_)
Core.Core_hashtbl_intf.create_options_without_hashable
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
val add_multi :
('a, 'b list) t_ -> key:'a key_ -> data:'b -> unit
val remove_multi : ('a, 'b list) t_ -> 'a key_ -> unit
val map : ('a, 'b) t_ -> f:('b -> 'c) -> ('a, 'c) t_
val mapi :
('a, 'b) t_ -> f:(key:'a key_ -> data:'b -> 'c) -> ('a, 'c) t_
val filter_map :
('a, 'b) t_ -> f:('b -> 'c option) -> ('a, 'c) t_
val filter_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> 'c option) -> ('a, 'c) t_
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_
val partition_mapi :
('a, 'b) t_ ->
f:(key:'a key_ -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) ->
('a, 'c) t_ * ('a, 'd) t_
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
val find : ('a, 'b) t_ -> 'a key_ -> 'b option
val find_default :
('a, 'b) t_ -> 'a key_ -> default:(unit -> 'b) -> 'b
val find_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val iter_vals : ('a, 'b) t_ -> f:('b -> unit) -> unit
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_
val merge_into :
f:(key:'a key_ -> 'b -> 'b option -> 'b option) ->
src:('a, 'b) t_ -> dst:('a, 'b) t_ -> unit
val keys : ('a, 'b) t_ -> 'a key_ list
val data : ('a, 'b) t_ -> 'b list
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
val to_alist : ('a, 'b) t_ -> ('a key_ * 'b) list
val incr : ?by:int -> ('a, int) t_ -> 'a key_ -> unit
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a t) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ :
('a, int -> 'a t) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
type 'a t_ = t
type 'a elt_ = elt
val create :
('a, unit -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val of_list :
('a, 'a elt_ list -> 'a t_)
Core.Hash_set_intf.create_options_without_hashable
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t =
'a Int63.Make_bounded_unsafe(Spec).Hash_queue.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold :
'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> '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 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 = t
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val compare : t -> t -> int
val hash : t -> int
end
type 'a t =
'a Int63.Make_bounded_unsafe(Spec).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
val length : 'a t -> int
end
val sexp_of_t : t -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> t
val of_string : string -> t
val to_string : t -> string
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Map_to_safe.writer
val bin_write_t_ : t Bin_prot.Unsafe_write_c.writer
val bin_read_t : t Bin_prot.Read_ml.reader
val bin_read_t_ : t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
type repr = repr
val verify : repr -> t
end
val ounit_tests : unit -> OUnit.test
end