sig
val __pa_ounit_275876e34cf609db118f3d84b799a790 : string
exception Bigsubstring_allocator_got_invalid_requested_size of int
val bigsubstring_allocator :
?initial_size:int -> unit -> Core.Std.Int.t -> Core.Std.Bigsubstring.t
module type Name =
sig
type t
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
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_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val find_and_remove : ('a, 'b) t_ -> 'a key_ -> 'b option
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 t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
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 t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
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 first : 'a t -> 'a option
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 compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
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 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
val of_string : string -> t
val to_string : t -> string
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
val between : t -> low:t -> high:t -> bool
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
val _squelch_unused_module_warning_ : unit
end
type comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b, 'c) map = ('a, 'b, 'c) Core.Core_map.t
type ('a, 'b, 'c) tree = ('a, 'b, 'c) Core.Core_map.tree
type 'v t = (t, 'v, comparator) map
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) options =
('a, 'b, 'c) Core.Core_map_intf.without_comparator
val empty : ('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_ | `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree -> ('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool) options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator, ('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) -> ('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ * [ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ -> ('k key_, 'v, 'comparator) tree
module Tree :
sig
type 'v t = (Key.t, 'v, comparator) tree
type ('k, 'v, 'c) t_ = 'v t
val empty : ('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator, 'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array ->
('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_
| `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree -> ('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool) options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ ->
('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator,
('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ -> f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) ->
('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ -> ('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ *
[ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ -> ('k key_, 'v, 'comparator) tree
val t_of_sexp :
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t :
('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
val compare : ('v -> 'v -> int) -> 'v t -> 'v t -> int
val t_of_sexp : (Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t : ('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
module Set :
sig
module Elt :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b) set = ('a, 'b) Core.Core_set.t
type ('a, 'b) tree = ('a, 'b) Core.Core_set.tree
type t = (t, comparator) set
type ('a, 'comparator) t_ = t
type 'a elt_ = Elt.t
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) set -> f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) set -> f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator, ('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) -> ('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree : ('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val empty : t
module Tree :
sig
type t = (Elt.t, comparator) tree
type ('a, 'b) t_ = t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) tree -> f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) tree ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator, ('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ ->
('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) ->
('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree :
('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
end
type 'a marshal_fun = 'a -> Core.Std.Bigsubstring.t option
type 'a unmarshal_fun = Core.Std.Bigsubstring.t -> 'a option
val protocol_version : [ `Prod | `Test ] ref
module Version :
sig
type t = Versioned_typed_tcp.Version.t
val min : t -> t -> t
val of_int : int -> t
val to_int : t -> int
val add : t -> int -> t
module Hashable : sig type t = t end
val hash : t -> int
val compare : t -> 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
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_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val find_and_remove : ('a, 'b) t_ -> 'a key_ -> 'b option
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 t_of_sexp : (Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
val sexp_of_t : ('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Core.Hash_set.t
type t = elt hash_set
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 t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Versioned_typed_tcp.Version.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 first : 'a t -> 'a option
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 compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Versioned_typed_tcp.Version.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 t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val bin_t : t Core.Std.Bin_prot.Type_class.t
val bin_read_t : t Core.Std.Bin_prot.Read_ml.reader
val bin_read_t_ : t Core.Std.Bin_prot.Unsafe_read_c.reader
val bin_read_t__ : (int -> t) Core.Std.Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Core.Std.Bin_prot.Type_class.reader
val bin_size_t : t Core.Std.Bin_prot.Size.sizer
val bin_write_t : t Core.Std.Bin_prot.Write_ml.writer
val bin_write_t_ : t Core.Std.Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Core.Std.Bin_prot.Type_class.writer
end
module type Versions =
sig
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
end
module type Datumable =
sig
type datum
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t -> (datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t -> (datum unmarshal_fun, exn) Core.Std.Result.t
end
module type Datum =
sig
type t
type datum = t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t -> (datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t -> (datum unmarshal_fun, exn) Core.Std.Result.t
end
module type Mode =
sig
type t
val current : unit -> t
val ( = ) : t -> t -> bool
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
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
module Dont_care_about_mode :
sig
type t =
Versioned_typed_tcp.Dont_care_about_mode.t =
Dont_care_about_mode
val __t_of_sexp__ : Sexplib.Sexp.t -> t
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val bin_size_t : 'a -> int
val bin_write_t_ :
Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
t -> Core.Std.Bin_prot.Unsafe_common.sptr
val bin_write_t :
Core.Std.Bin_prot.Common.buf ->
pos:Core.Std.Bin_prot.Common.pos -> t -> Core.Std.Bin_prot.Common.pos
val bin_writer_t : t Core.Std.Bin_prot.Type_class.writer
val bin_read_t__ : 'a -> 'b -> 'c -> 'd
val bin_read_t_ :
Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> t
val bin_read_t :
Core.Std.Bin_prot.Common.buf ->
pos_ref:Core.Std.Bin_prot.Common.pos ref -> t
val bin_reader_t : t Core.Std.Bin_prot.Type_class.reader
val bin_t : t Core.Std.Bin_prot.Type_class.t
val current : unit -> t
val ( = ) : t -> t -> bool
end
module Read_result :
sig
type ('name, 'data) t =
('name, 'data) Versioned_typed_tcp.Read_result.t = {
from : 'name;
ip : string;
time_received : Core.Std.Time.t;
time_sent : Core.Std.Time.t;
data : 'data;
}
val __t_of_sexp__ :
(Sexplib.Sexp.t -> 'name) ->
(Sexplib.Sexp.t -> 'data) -> Sexplib.Sexp.t -> ('name, 'data) t
val t_of_sexp :
(Sexplib.Sexp.t -> 'name) ->
(Sexplib.Sexp.t -> 'data) -> Sexplib.Sexp.t -> ('name, 'data) t
val sexp_of_t :
('name -> Sexplib.Sexp.t) ->
('data -> Sexplib.Sexp.t) -> ('name, 'data) t -> Sexplib.Sexp.t
val bin_size_t : ('a -> int) -> ('b -> int) -> ('a, 'b) t -> int
val bin_write_t_ :
('a ->
Bin_prot.Unsafe_common.eptr -> 'b -> Bin_prot.Unsafe_common.sptr) ->
(Bin_prot.Unsafe_common.sptr ->
Bin_prot.Unsafe_common.eptr -> 'c -> 'd) ->
'a -> Bin_prot.Unsafe_common.eptr -> ('b, 'c) t -> 'd
val bin_write_t :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Bin_prot.Unsafe_common.sptr) ->
(Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'b -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Common.buf ->
pos:Core.Std.Bin_prot.Common.pos ->
('a, 'b) t -> Core.Std.Bin_prot.Common.pos
val bin_writer_t :
'a Core.Std.Bin_prot.Type_class.writer ->
'b Core.Std.Bin_prot.Type_class.writer ->
('a, 'b) t Core.Std.Bin_prot.Type_class.writer
val bin_read_t__ : 'a -> 'b -> 'c -> 'd -> 'e -> 'f
val bin_read_t_ :
(Bin_prot.Unsafe_common.sptr_ptr -> Bin_prot.Unsafe_common.eptr -> 'a) ->
(Bin_prot.Unsafe_common.sptr_ptr -> Bin_prot.Unsafe_common.eptr -> 'b) ->
Bin_prot.Unsafe_common.sptr_ptr ->
Bin_prot.Unsafe_common.eptr -> ('a, 'b) t
val bin_read_t :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'name) ->
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'data) ->
Core.Std.Bin_prot.Common.buf ->
pos_ref:Core.Std.Bin_prot.Common.pos ref -> ('name, 'data) t
val bin_reader_t :
'a Core.Std.Bin_prot.Type_class.reader ->
'b Core.Std.Bin_prot.Type_class.reader ->
('a, 'b) t Core.Std.Bin_prot.Type_class.reader
val bin_t :
'a Core.Std.Bin_prot.Type_class.t ->
'b Core.Std.Bin_prot.Type_class.t ->
('a, 'b) t Core.Std.Bin_prot.Type_class.t
end
module Server_msg :
sig
module Control :
sig
type 'name t =
'name Versioned_typed_tcp.Server_msg.Control.t =
Unauthorized of string
| Duplicate of 'name
| Wrong_mode of 'name
| Too_many_clients of string
| Almost_full of int
| Connect of 'name
| Disconnect of 'name * Core.Std.Sexp.t
| Parse_error of 'name * string
| Protocol_error of string
val bin_size_t : ('a -> int) -> 'a t -> int
val bin_write_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a t -> Bin_prot.Unsafe_common.sptr
val bin_write_t :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Common.buf ->
pos:Core.Std.Bin_prot.Common.pos ->
'a t -> Core.Std.Bin_prot.Common.pos
val bin_writer_t :
'a Core.Std.Bin_prot.Type_class.writer ->
'a t Core.Std.Bin_prot.Type_class.writer
val bin_read_t__ : 'a -> 'b -> 'c -> 'd -> 'e
val bin_read_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'a) ->
Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'a t
val bin_read_t :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'name) ->
Core.Std.Bin_prot.Common.buf ->
pos_ref:Core.Std.Bin_prot.Common.pos ref -> 'name t
val bin_reader_t :
'a Core.Std.Bin_prot.Type_class.reader ->
'a t Core.Std.Bin_prot.Type_class.reader
val bin_t :
'a Core.Std.Bin_prot.Type_class.t ->
'a t Core.Std.Bin_prot.Type_class.t
val __t_of_sexp__ :
(Sexplib.Sexp.t -> 'name) -> Sexplib.Sexp.t -> 'name t
val t_of_sexp :
(Sexplib.Sexp.t -> 'name) -> Sexplib.Sexp.t -> 'name t
val sexp_of_t :
('name -> Sexplib.Sexp.t) -> 'name t -> Sexplib.Sexp.t
end
type ('name, 'data) t =
('name, 'data) Versioned_typed_tcp.Server_msg.t =
Control of 'name Control.t
| Data of ('name, 'data) Read_result.t
end
module Client_msg :
sig
module Control :
sig
type 'name t =
'name Versioned_typed_tcp.Client_msg.Control.t =
Connecting
| Connect of 'name
| Disconnect of 'name * Core.Std.Sexp.t
| Parse_error of 'name * string
| Protocol_error of string
val bin_size_t : ('a -> int) -> 'a t -> int
val bin_write_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a t -> Core.Std.Bin_prot.Unsafe_common.sptr
val bin_write_t :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Common.buf ->
pos:Core.Std.Bin_prot.Common.pos ->
'a t -> Core.Std.Bin_prot.Common.pos
val bin_writer_t :
'a Core.Std.Bin_prot.Type_class.writer ->
'a t Core.Std.Bin_prot.Type_class.writer
val bin_read_t__ : 'a -> 'b -> 'c -> 'd -> 'e
val bin_read_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'a) ->
Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'a t
val bin_read_t :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'name) ->
Core.Std.Bin_prot.Common.buf ->
pos_ref:Core.Std.Bin_prot.Common.pos ref -> 'name t
val bin_reader_t :
'a Core.Std.Bin_prot.Type_class.reader ->
'a t Core.Std.Bin_prot.Type_class.reader
val bin_t :
'a Core.Std.Bin_prot.Type_class.t ->
'a t Core.Std.Bin_prot.Type_class.t
val __t_of_sexp__ :
(Sexplib.Sexp.t -> 'name) -> Sexplib.Sexp.t -> 'name t
val t_of_sexp :
(Sexplib.Sexp.t -> 'name) -> Sexplib.Sexp.t -> 'name t
val sexp_of_t :
('name -> Sexplib.Sexp.t) -> 'name t -> Sexplib.Sexp.t
end
type ('name, 'data) t =
('name, 'data) Versioned_typed_tcp.Client_msg.t =
Control of 'name Control.t
| Data of ('name, 'data) Read_result.t
val __t_of_sexp__ :
(Sexplib.Sexp.t -> 'name) ->
(Sexplib.Sexp.t -> 'data) -> Sexplib.Sexp.t -> ('name, 'data) t
val t_of_sexp :
(Sexplib.Sexp.t -> 'name) ->
(Sexplib.Sexp.t -> 'data) -> Sexplib.Sexp.t -> ('name, 'data) t
val sexp_of_t :
('name -> Sexplib.Sexp.t) ->
('data -> Sexplib.Sexp.t) -> ('name, 'data) t -> Sexplib.Sexp.t
val bin_size_t : ('a -> int) -> ('b -> int) -> ('a, 'b) t -> int
val bin_write_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
(Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'b -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
('a, 'b) t -> Core.Std.Bin_prot.Unsafe_common.sptr
val bin_write_t :
(Core.Std.Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'a -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
(Bin_prot.Unsafe_common.sptr ->
Core.Std.Bin_prot.Unsafe_common.eptr ->
'b -> Core.Std.Bin_prot.Unsafe_common.sptr) ->
Core.Std.Bin_prot.Common.buf ->
pos:Core.Std.Bin_prot.Common.pos ->
('a, 'b) t -> Core.Std.Bin_prot.Common.pos
val bin_writer_t :
'a Core.Std.Bin_prot.Type_class.writer ->
'b Core.Std.Bin_prot.Type_class.writer ->
('a, 'b) t Core.Std.Bin_prot.Type_class.writer
val bin_read_t__ : 'a -> 'b -> 'c -> 'd -> 'e -> 'f
val bin_read_t_ :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'a) ->
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'b) ->
Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> ('a, 'b) t
val bin_read_t :
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'name) ->
(Core.Std.Bin_prot.Unsafe_common.sptr_ptr ->
Core.Std.Bin_prot.Unsafe_common.eptr -> 'data) ->
Core.Std.Bin_prot.Common.buf ->
pos_ref:Core.Std.Bin_prot.Common.pos ref -> ('name, 'data) t
val bin_reader_t :
'a Core.Std.Bin_prot.Type_class.reader ->
'b Core.Std.Bin_prot.Type_class.reader ->
('a, 'b) t Core.Std.Bin_prot.Type_class.reader
val bin_t :
'a Core.Std.Bin_prot.Type_class.t ->
'b Core.Std.Bin_prot.Type_class.t ->
('a, 'b) t Core.Std.Bin_prot.Type_class.t
end
module type Arg =
sig
module Send : Datum
module Recv : Datum
module Remote_name : Name
module My_name : Name
module Mode : Mode
end
module type S =
sig
module Send : Datum
module Recv : Datum
module Remote_name : Name
module My_name : Name
module Mode : Mode
type logfun =
[ `Recv of Recv.datum | `Send of Send.datum ] ->
Remote_name.t -> time_sent_received:Core.Std.Time.t -> unit
module Server :
sig
type t
val invariant : t Core.Std.Invariant.inv
val create :
?logfun:logfun ->
?now:(unit -> Core.Std.Time.t) ->
?enforce_unique_remote_name:bool ->
?is_client_ip_authorized:(string -> bool) ->
?warn_when_free_connections_lte_pct:float ->
?max_clients:int ->
listen_port:int -> My_name.t -> t Import.Deferred.t
val port : t -> int
val close : t -> Remote_name.t -> unit
val listen :
t -> (Remote_name.t, Recv.datum) Server_msg.t Import.Stream.t
val listen_ignore_errors :
?stop:unit Import.Deferred.t -> t -> Recv.datum Import.Stream.t
val send :
t ->
Remote_name.t ->
Send.datum ->
[ `Dropped | `Sent of Core.Std.Time.t ] Import.Deferred.t
val send_ignore_errors : t -> Remote_name.t -> Send.datum -> unit
val send_to_all :
t ->
Send.datum ->
[ `Dropped | `Partial_success | `Sent ] Import.Deferred.t
val send_to_all_ignore_errors : t -> Send.datum -> unit
val send_to_some :
t ->
Send.datum ->
Remote_name.t list ->
[ `Dropped | `Partial_success | `Sent ] Import.Deferred.t
val send_to_some_ignore_errors :
t -> Send.datum -> Remote_name.t list -> unit
val client_send_version : t -> Remote_name.t -> Version.t option
val flushed :
t ->
cutoff:unit Import.Deferred.t ->
([ `Flushed of Remote_name.t list ] *
[ `Not_flushed of Remote_name.t list ])
Import.Deferred.t
end
module Client :
sig
type t
val create :
?logfun:logfun ->
?now:(unit -> Core.Std.Time.t) ->
?check_remote_name:bool ->
ip:string ->
port:int ->
expected_remote_name:Remote_name.t ->
My_name.t -> t Import.Deferred.t
val connect : t -> unit Import.Deferred.t
val close_connection : t -> unit
val listen :
t -> (Remote_name.t, Recv.datum) Client_msg.t Import.Stream.t
val listen_ignore_errors :
?stop:unit Import.Deferred.t -> t -> Recv.datum Import.Stream.t
val send :
t ->
Send.datum ->
[ `Dropped | `Sent of Core.Std.Time.t ] Import.Deferred.t
val send_ignore_errors : t -> Send.datum -> unit
val state : t -> [ `Connected | `Connecting | `Disconnected ]
val last_connect_error : t -> exn option
val flushed :
t -> [ `Flushed | `Pending of Core.Std.Time.t Import.Deferred.t ]
end
end
module Make :
functor (Z : Arg) ->
sig
module Send :
sig
type t = Z.Send.datum
type datum = t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t -> (datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t -> (datum unmarshal_fun, exn) Core.Std.Result.t
end
module Recv :
sig
type t = Z.Recv.datum
type datum = t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t -> (datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t -> (datum unmarshal_fun, exn) Core.Std.Result.t
end
module Remote_name :
sig
type t = Z.Remote_name.t
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) Version.Table.hashtbl
type 'b t = (key, 'b) hashtbl
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_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val find_and_remove : ('a, 'b) t_ -> 'a key_ -> 'b option
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 t_of_sexp :
(Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
val sexp_of_t :
('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Version.Hash_set.hash_set
type t = elt hash_set
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 t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Z.Remote_name.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 first : 'a t -> 'a option
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 compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Z.Remote_name.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 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
val of_string : string -> t
val to_string : t -> string
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
val between : t -> low:t -> high:t -> bool
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
val _squelch_unused_module_warning_ : unit
end
type comparator = Z.Remote_name.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b, 'c) map = ('a, 'b, 'c) Z.My_name.Map.map
type ('a, 'b, 'c) tree = ('a, 'b, 'c) Z.My_name.Map.tree
type 'v t = (t, 'v, comparator) map
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) options =
('a, 'b, 'c) Z.My_name.Map.options
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator,
'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array ->
('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_
| `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree ->
('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool) options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ ->
('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator,
('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ ->
f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2
| `Left of 'v1
| `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) ->
('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ *
[ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ -> ('k key_, 'v, 'comparator) tree
module Tree :
sig
type 'v t = (Key.t, 'v, comparator) tree
type ('k, 'v, 'c) t_ = 'v t
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator,
'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array ->
('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_
| `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree ->
('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool)
options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ ->
data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ ->
('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator,
('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ ->
f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2
| `Left of 'v1
| `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) ->
('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ *
[ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a ->
f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) tree
val t_of_sexp :
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t :
('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
val compare : ('v -> 'v -> int) -> 'v t -> 'v t -> int
val t_of_sexp :
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t :
('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
module Set :
sig
module Elt :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b) set = ('a, 'b) Z.My_name.Set.set
type ('a, 'b) tree = ('a, 'b) Z.My_name.Set.tree
type t = (t, comparator) set
type ('a, 'comparator) t_ = t
type 'a elt_ = Elt.t
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) set -> f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) set ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator, ('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ ->
('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) ->
('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree :
('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val empty : t
module Tree :
sig
type t = (Elt.t, comparator) tree
type ('a, 'b) t_ = t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) tree ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) tree ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ ->
('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) ->
('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree :
('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
end
module My_name :
sig
type t = Z.My_name.t
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) Remote_name.Table.hashtbl
type 'b t = (key, 'b) hashtbl
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_exn : ('a, 'b) t_ -> 'a key_ -> 'b
val find_and_remove : ('a, 'b) t_ -> 'a key_ -> 'b option
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 t_of_sexp :
(Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> 'b t
val sexp_of_t :
('b -> Sexplib.Sexp.t) -> 'b t -> Sexplib.Sexp.t
end
module Hash_set :
sig
type elt = t
type 'a hash_set = 'a Remote_name.Hash_set.hash_set
type t = elt hash_set
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 t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
module Hash_queue :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Z.My_name.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 first : 'a t -> 'a option
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 compare : t -> t -> int
val hash : t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type 'a t = 'a Z.My_name.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 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
val of_string : string -> t
val to_string : t -> string
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
val between : t -> low:t -> high:t -> bool
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
val _squelch_unused_module_warning_ : unit
end
type comparator = Z.My_name.comparator
val comparator : (t, comparator) Core.Comparator.t
module Map :
sig
module Key :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b, 'c) map = ('a, 'b, 'c) Remote_name.Map.map
type ('a, 'b, 'c) tree = ('a, 'b, 'c) Remote_name.Map.tree
type 'v t = (t, 'v, comparator) map
type ('k, 'v, 'comparator) t_ = 'v t
type 'a key_ = Key.t
type ('a, 'b, 'c) options =
('a, 'b, 'c) Remote_name.Map.options
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator,
'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array ->
('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_
| `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree ->
('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool) options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ ->
('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator,
('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ ->
f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2
| `Left of 'v1
| `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) ->
('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ *
[ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a -> f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ -> ('k key_, 'v, 'comparator) tree
module Tree :
sig
type 'v t = (Key.t, 'v, comparator) tree
type ('k, 'v, 'c) t_ = 'v t
val empty :
('k, 'comparator, ('k, 'a, 'comparator) t_) options
val singleton :
('k, 'comparator,
'k key_ -> 'v -> ('k, 'v, 'comparator) t_)
options
val of_sorted_array :
('k, 'comparator,
('k key_ * 'v) array ->
('k, 'v, 'comparator) t_ Core.Or_error.t)
options
val of_sorted_array_unchecked :
('k, 'comparator,
('k key_ * 'v) array -> ('k, 'v, 'comparator) t_)
options
val of_alist :
('k, 'comparator,
('k key_ * 'v) list ->
[ `Duplicate_key of 'k key_
| `Ok of ('k, 'v, 'comparator) t_ ])
options
val of_alist_exn :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v, 'comparator) t_)
options
val of_alist_multi :
('k, 'comparator,
('k key_ * 'v) list -> ('k, 'v list, 'comparator) t_)
options
val of_alist_fold :
('k, 'comparator,
('k key_ * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) t_)
options
val of_tree :
('k, 'comparator,
('k key_, 'v, 'comparator) tree ->
('k, 'v, 'comparator) t_)
options
val invariants :
('k, 'comparator, ('k, 'v, 'comparator) t_ -> bool)
options
val is_empty : ('a, 'b, 'c) t_ -> bool
val length : ('a, 'b, 'c) t_ -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
key:'k key_ -> data:'v -> ('k, 'v, 'comparator) t_)
options
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) t_ ->
key:'k key_ ->
data:'v -> ('k, 'v list, 'comparator) t_)
options
val change :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ ->
('v option -> 'v option) -> ('k, 'v, 'comparator) t_)
options
val find :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v option)
options
val find_exn :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> 'v)
options
val remove :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k, 'v, 'comparator) t_)
options
val mem :
('k, 'comparator,
('k, 'a, 'comparator) t_ -> 'k key_ -> bool)
options
val iter :
('k, 'v, 'a) t_ ->
f:(key:'k key_ -> data:'v -> unit) -> unit
val iter2 :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
('k, 'v2, 'comparator) t_ ->
f:(key:'k key_ ->
data:[ `Both of 'v1 * 'v2
| `Left of 'v1
| `Right of 'v2 ] ->
unit) ->
unit)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
f:(key:'k key_ -> data:'v -> bool) ->
('k, 'v, 'comparator) t_)
options
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) t_)
options
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) t_ ->
f:(key:'k key_ -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'comparator) t_)
options
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> int)
options
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ -> bool)
options
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, 'comparator,
('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_)
options
val symmetric_diff :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
('k, 'v, 'comparator) t_ ->
data_equal:('v -> 'v -> bool) ->
('k key_ *
[ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ])
list)
options
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, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ ->
max:'k key_ ->
init:'a ->
f:(key:'k key_ -> data:'v -> 'a -> 'a) -> 'a)
options
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
min:'k key_ -> max:'k key_ -> ('k key_ * 'v) list)
options
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) t_ ->
'k key_ -> ('k key_ * 'v) option)
options
val rank :
('k, 'comparator,
('k, 'v, 'comparator) t_ -> 'k key_ -> int option)
options
val to_tree :
('k, 'v, 'comparator) t_ ->
('k key_, 'v, 'comparator) tree
val t_of_sexp :
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t :
('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
val compare : ('v -> 'v -> int) -> 'v t -> 'v t -> int
val t_of_sexp :
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> 'v t
val sexp_of_t :
('v -> Sexplib.Sexp.t) -> 'v t -> Sexplib.Sexp.t
end
module Set :
sig
module Elt :
sig
type t = t
val compare : t -> t -> int
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
type comparator = comparator
val comparator : (t, comparator) Core.Comparator.t_
end
type ('a, 'b) set = ('a, 'b) Remote_name.Set.set
type ('a, 'b) tree = ('a, 'b) Remote_name.Set.tree
type t = (t, comparator) set
type ('a, 'comparator) t_ = t
type 'a elt_ = Elt.t
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator, 'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) set -> f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) set ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator, ('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ ->
('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) ->
('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree :
('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val empty : t
module Tree :
sig
type t = (Elt.t, comparator) tree
type ('a, 'b) t_ = t
val empty :
('a, 'comparator, ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val singleton :
('a, 'comparator, 'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union_list :
('a, 'comparator,
('a, 'comparator) t_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_list :
('a, 'comparator, 'a elt_ list -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_sorted_array :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_ Core.Or_error.t)
Core.Core_set_intf.without_comparator
val of_sorted_array_unchecked :
('a, 'comparator,
'a elt_ array -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val stable_dedup_list :
('a, 'b, 'a elt_ list -> 'a elt_ list)
Core.Core_set_intf.without_comparator
val map :
('b, 'comparator,
('a, 'c) tree ->
f:('a -> 'b elt_) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val filter_map :
('b, 'comparator,
('a, 'c) tree ->
f:('a -> 'b elt_ option) -> ('b, 'comparator) t_)
Core.Core_set_intf.without_comparator
val of_tree :
('a, 'comparator,
('a elt_, 'comparator) tree -> ('a, 'comparator) t_)
Core.Core_set_intf.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 invariants :
('a, 'comparator, ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val mem :
('a, 'comparator,
('a, 'comparator) t_ -> 'a elt_ -> bool)
Core.Core_set_intf.without_comparator
val add :
('a, 'comparator,
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val remove :
('a, 'comparator,
('a, 'comparator) t_ ->
'a elt_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val union :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val inter :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val diff :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val compare_direct :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> int)
Core.Core_set_intf.without_comparator
val equal :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
val subset :
('a, 'comparator,
('a, 'comparator) t_ -> ('a, 'comparator) t_ -> bool)
Core.Core_set_intf.without_comparator
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 iter2 :
('a, 'comparator,
('a, 'comparator) t_ ->
('a, 'comparator) t_ ->
f:([ `Both of 'a elt_ * 'a elt_
| `Left of 'a elt_
| `Right of 'a elt_ ] -> unit) ->
unit)
Core.Core_set_intf.without_comparator
val filter :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val partition_tf :
('a, 'comparator,
('a, 'comparator) t_ ->
f:('a elt_ -> bool) ->
('a, 'comparator) t_ * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ ->
'a elt_ ->
('a, 'comparator) t_ * bool * ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val group_by :
('a, 'comparator,
('a, 'comparator) t_ ->
equiv:('a elt_ -> 'a elt_ -> bool) ->
('a, 'comparator) t_ list)
Core.Core_set_intf.without_comparator
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,
('a, 'comparator) t_ -> int -> ('a, 'comparator) t_)
Core.Core_set_intf.without_comparator
val to_tree :
('a, 'comparator) t_ -> ('a elt_, 'comparator) tree
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val compare : t -> t -> int
end
end
module Mode :
sig
type t = Versioned_typed_tcp.Make(Z).Mode.t
val current : unit -> t
val ( = ) : t -> t -> bool
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
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
end
type logfun =
[ `Recv of Recv.datum | `Send of Send.datum ] ->
Remote_name.t -> time_sent_received:Core.Std.Time.t -> unit
module Server :
sig
type t = Versioned_typed_tcp.Make(Z).Server.t
val invariant : t Core.Std.Invariant.inv
val create :
?logfun:logfun ->
?now:(unit -> Core.Std.Time.t) ->
?enforce_unique_remote_name:bool ->
?is_client_ip_authorized:(string -> bool) ->
?warn_when_free_connections_lte_pct:float ->
?max_clients:int ->
listen_port:int -> My_name.t -> t Import.Deferred.t
val port : t -> int
val close : t -> Remote_name.t -> unit
val listen :
t -> (Remote_name.t, Recv.datum) Server_msg.t Import.Stream.t
val listen_ignore_errors :
?stop:unit Import.Deferred.t -> t -> Recv.datum Import.Stream.t
val send :
t ->
Remote_name.t ->
Send.datum ->
[ `Dropped | `Sent of Core.Std.Time.t ] Import.Deferred.t
val send_ignore_errors : t -> Remote_name.t -> Send.datum -> unit
val send_to_all :
t ->
Send.datum ->
[ `Dropped | `Partial_success | `Sent ] Import.Deferred.t
val send_to_all_ignore_errors : t -> Send.datum -> unit
val send_to_some :
t ->
Send.datum ->
Remote_name.t list ->
[ `Dropped | `Partial_success | `Sent ] Import.Deferred.t
val send_to_some_ignore_errors :
t -> Send.datum -> Remote_name.t list -> unit
val client_send_version : t -> Remote_name.t -> Version.t option
val flushed :
t ->
cutoff:unit Import.Deferred.t ->
([ `Flushed of Remote_name.t list ] *
[ `Not_flushed of Remote_name.t list ])
Import.Deferred.t
end
module Client :
sig
type t = Versioned_typed_tcp.Make(Z).Client.t
val create :
?logfun:logfun ->
?now:(unit -> Core.Std.Time.t) ->
?check_remote_name:bool ->
ip:string ->
port:int ->
expected_remote_name:Remote_name.t ->
My_name.t -> t Import.Deferred.t
val connect : t -> unit Import.Deferred.t
val close_connection : t -> unit
val listen :
t -> (Remote_name.t, Recv.datum) Client_msg.t Import.Stream.t
val listen_ignore_errors :
?stop:unit Import.Deferred.t -> t -> Recv.datum Import.Stream.t
val send :
t ->
Send.datum ->
[ `Dropped | `Sent of Core.Std.Time.t ] Import.Deferred.t
val send_ignore_errors : t -> Send.datum -> unit
val state : t -> [ `Connected | `Connecting | `Disconnected ]
val last_connect_error : t -> exn option
val flushed :
t ->
[ `Flushed | `Pending of Core.Std.Time.t Import.Deferred.t ]
end
end
module Datumable_of_binable :
sig
module type T = sig type t end
module type T_bin =
sig
type t
val bin_t : t Core.Std.Bin_prot.Type_class.t
val bin_read_t : t Core.Std.Bin_prot.Read_ml.reader
val bin_read_t_ : t Core.Std.Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
(int -> t) Core.Std.Bin_prot.Unsafe_read_c.reader
val bin_reader_t : t Core.Std.Bin_prot.Type_class.reader
val bin_size_t : t Core.Std.Bin_prot.Size.sizer
val bin_write_t : t Core.Std.Bin_prot.Write_ml.writer
val bin_write_t_ : t Core.Std.Bin_prot.Unsafe_write_c.writer
val bin_writer_t : t Core.Std.Bin_prot.Type_class.writer
end
module V :
functor (V : T) ->
functor (T : T) ->
sig
module type S =
sig
val of_v : V.t -> T.t option
val to_v : T.t -> V.t option
end
end
module Make_datumable5 :
functor (Versions : Versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V2 : T_bin) ->
functor (V3 : T_bin) ->
functor (V4 : T_bin) ->
functor (V5 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
functor (V2_cvt : V(V2)(T).S) ->
functor (V3_cvt : V(V3)(T).S) ->
functor (V4_cvt : V(V4)(T).S) ->
functor (V5_cvt : V(V5)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t ->
(datum marshal_fun, exn)
Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t ->
(datum unmarshal_fun, exn)
Core.Std.Result.t
end
module type Pre_versions =
sig val low_version : Version.t val prod_version : Version.t end
module Five_versions :
functor (Versions : Pre_versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V2 : T_bin) ->
functor (V3 : T_bin) ->
functor (V4 : T_bin) ->
functor (V5 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
functor (V2_cvt : V(V2)(T).S) ->
functor (V3_cvt : V(V3)(T).S) ->
functor (V4_cvt : V(V4)(T).S) ->
functor (V5_cvt : V(V5)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t ->
(datum marshal_fun, exn)
Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t ->
(datum unmarshal_fun, exn)
Core.Std.Result.t
end
module Four_versions :
functor (Versions : Pre_versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V2 : T_bin) ->
functor (V3 : T_bin) ->
functor (V4 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
functor (V2_cvt : V(V2)(T).S) ->
functor (V3_cvt : V(V3)(T).S) ->
functor (V4_cvt : V(V4)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t ->
(datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t ->
(datum unmarshal_fun, exn) Core.Std.Result.t
end
module Three_versions :
functor (Versions : Pre_versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V2 : T_bin) ->
functor (V3 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
functor (V2_cvt : V(V2)(T).S) ->
functor (V3_cvt : V(V3)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t ->
(datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t ->
(datum unmarshal_fun, exn) Core.Std.Result.t
end
module Two_versions :
functor (Versions : Pre_versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V2 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
functor (V2_cvt : V(V2)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t ->
(datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t ->
(datum unmarshal_fun, exn) Core.Std.Result.t
end
module One_version :
functor (Versions : Pre_versions) ->
functor (T : T) ->
functor (V1 : T_bin) ->
functor (V1_cvt : V(V1)(T).S) ->
sig
type datum = T.t
val low_version : Version.t
val prod_version : Version.t
val test_version : Version.t
val lookup_marshal_fun :
Version.t -> (datum marshal_fun, exn) Core.Std.Result.t
val lookup_unmarshal_fun :
Version.t -> (datum unmarshal_fun, exn) Core.Std.Result.t
end
end
end