sig
type ('a, +'b) t
module T : sig type 'a key = 'a type ('a, 'b) t = ('a, 'b) t end
type ('a, 'b) binable = ('a, 'b) t
val bin_size_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Size.sizer2
val bin_write_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Map_to_safe.writer2
val bin_write_t_ :
('a, 'b, ('a, 'b) binable) Bin_prot.Unsafe_write_c.writer2
val bin_read_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Map_to_safe.reader2
val bin_read_t_ : ('a, 'b, ('a, 'b) binable) Bin_prot.Unsafe_read_c.reader2
val bin_read_t__ :
('a, 'b, int -> ('a, 'b) binable) Bin_prot.Unsafe_read_c.reader2
val bin_writer_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Type_class.S2.writer
val bin_reader_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Type_class.S2.reader
val bin_t : ('a, 'b, ('a, 'b) binable) Bin_prot.Type_class.S2.t
type ('a, 'b) sexpable = ('a, 'b) t
val sexp_of_t :
('a -> Sexplib.Sexp.t) ->
('b -> Sexplib.Sexp.t) -> ('a, 'b) sexpable -> Sexplib.Sexp.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) ->
(Sexplib.Sexp.t -> 'b) -> Sexplib.Sexp.t -> ('a, 'b) sexpable
val empty : ('a, 'b) t
val singleton : 'a -> 'b -> ('a, 'b) t
val is_empty : ('a, 'b) t -> bool
val cardinal : ('a, 'b) t -> int
val add : key:'a -> data:'b -> ('a, 'b) t -> ('a, 'b) t
val add_multi : key:'a -> data:'b -> ('a, 'b list) t -> ('a, 'b list) t
val change : ('a, 'b) t -> 'a -> ('b option -> 'b option) -> ('a, 'b) t
val find_exn : ('a, 'b) t -> 'a -> 'b
val find : ('a, 'b) t -> 'a -> 'b option
val remove : ('a, 'b) t -> 'a -> ('a, 'b) t
val mem : ('a, 'b) t -> 'a -> bool
val iter : f:(key:'a -> data:'b -> unit) -> ('a, 'b) t -> unit
val map : f:('a -> 'b) -> ('c, 'a) t -> ('c, 'b) t
val mapi : f:(key:'a -> data:'b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val fold : f:(key:'a -> data:'b -> 'c -> 'c) -> ('a, 'b) t -> init:'c -> 'c
val fold_right :
f:(key:'a -> data:'b -> 'c -> 'c) -> ('a, 'b) t -> init:'c -> 'c
val filter : f:(key:'a -> data:'b -> bool) -> ('a, 'b) t -> ('a, 'b) t
val filter_map : f:('a -> 'b option) -> ('c, 'a) t -> ('c, 'b) t
val filter_mapi :
f:(key:'a -> data:'b -> 'c option) -> ('a, 'b) t -> ('a, 'c) t
val compare : ('a -> 'a -> int) -> ('b, 'a) t -> ('b, 'a) t -> int
val equal : ('a -> 'a -> bool) -> ('b, 'a) t -> ('b, 'a) t -> bool
val keys : ('a, 'b) t -> 'a list
val has_key : ('a, 'b) t -> 'a -> bool
val data : ('a, 'b) t -> 'b list
val of_alist :
('a * 'b) list -> [ `Duplicate_key of 'a | `Ok of ('a, 'b) t ]
val of_alist_exn : ('a * 'b) list -> ('a, 'b) t
val of_alist_multi : ('a * 'b) list -> ('a, 'b list) t
val to_alist : ('a, 'b) t -> ('a * 'b) list
val combine_alist :
('a * 'b) list -> init:'c -> f:('b -> 'c -> 'c) -> ('a, 'c) t
val merge :
f:(key:'a -> 'b option -> 'c option -> 'd option) ->
('a, 'b) t -> ('a, 'c) t -> ('a, 'd) t
val min_elt : ('a, 'b) t -> ('a * 'b) option
val min_elt_exn : ('a, 'b) t -> 'a * 'b
val max_elt : ('a, 'b) t -> ('a * 'b) option
val max_elt_exn : ('a, 'b) t -> 'a * 'b
val for_all : f:('a -> bool) -> ('b, 'a) t -> bool
val exists : f:('a -> bool) -> ('b, 'a) t -> bool
val fold_range_inclusive :
('a, 'b) t ->
min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val range_to_alist : ('a, 'b) t -> min:'a -> max:'a -> ('a * 'b) list
val next_key : ('a, 'b) t -> 'a -> 'a option
val prev_key : ('a, 'b) t -> 'a -> 'a option
val rank : ('a, 'b) t -> 'a -> int option
module type Key = Core_map_intf.Key
module type S = Core_map_intf.S
module type S_binable =
sig
type key
type +'a t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
type 'a sexpable = 'a t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold : f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
type 'a binable = 'a t
val bin_size_t : ('a, 'a binable) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a binable) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a binable) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a binable) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a binable) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ :
('a, int -> 'a binable) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a binable) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a binable) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a binable) Bin_prot.Type_class.S1.t
end
module Make :
functor (Key : Key) ->
sig
type key = Key.t
type +'a t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
type 'a sexpable = 'a t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
end
module Make_binable :
functor
(Key : sig
type t
type sexpable = t
val sexp_of_t : sexpable -> Sexplib.Sexp.t
val t_of_sexp : Sexplib.Sexp.t -> sexpable
val compare : t -> t -> int
type binable = t
val bin_size_t : binable Bin_prot.Size.sizer
val bin_write_t : binable Bin_prot.Map_to_safe.writer
val bin_write_t_ : binable Bin_prot.Unsafe_write_c.writer
val bin_read_t : binable Bin_prot.Read_ml.reader
val bin_read_t_ : binable Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
(int -> binable) Bin_prot.Unsafe_read_c.reader
val bin_writer_t : binable Bin_prot.Type_class.writer
val bin_reader_t : binable Bin_prot.Type_class.reader
val bin_t : binable Bin_prot.Type_class.t
end) ->
sig
type key = Key.t
type 'a t = 'a Make(Key).t
module T : sig type 'a key = key type ('a, 'b) t = 'b t end
type 'a sexpable = 'a t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a sexpable -> Sexplib.Sexp.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a sexpable
val empty : 'a t
val singleton : key -> 'a -> 'a t
val is_empty : 'a t -> bool
val cardinal : 'a t -> int
val add : key:key -> data:'a -> 'a t -> 'a t
val add_multi : key:key -> data:'a -> 'a list t -> 'a list t
val change : 'a t -> key -> ('a option -> 'a option) -> 'a t
val find_exn : 'a t -> key -> 'a
val find : 'a t -> key -> 'a option
val remove : 'a t -> key -> 'a t
val mem : 'a t -> key -> bool
val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
val map : f:('a -> 'b) -> 'a t -> 'b t
val mapi : f:(key:key -> data:'a -> 'b) -> 'a t -> 'b t
val fold :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val fold_right :
f:(key:key -> data:'a -> 'b -> 'b) -> 'a t -> init:'b -> 'b
val filter : f:(key:key -> data:'a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val filter_mapi : f:(key:key -> data:'a -> 'b option) -> 'a t -> 'b t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> key list
val has_key : 'a t -> key -> bool
val data : 'a t -> 'a list
val of_alist :
(key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val to_alist : 'a t -> (key * 'a) list
val combine_alist :
(key * 'a) list -> init:'b -> f:('a -> 'b -> 'b) -> 'b t
val merge :
f:(key:key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val min_elt : 'a t -> (key * 'a) option
val min_elt_exn : 'a t -> key * 'a
val max_elt : 'a t -> (key * 'a) option
val max_elt_exn : 'a t -> key * 'a
val for_all : f:('a -> bool) -> 'a t -> bool
val exists : f:('a -> bool) -> 'a t -> bool
val fold_range_inclusive :
'a t ->
min:key ->
max:key -> init:'b -> f:(key:key -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:key -> max:key -> (key * 'a) list
val prev_key : 'a t -> key -> key option
val next_key : 'a t -> key -> key option
val rank : 'a t -> key -> int option
type 'a binable = 'a t
val bin_size_t : ('a, 'a binable) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a binable) Bin_prot.Map_to_safe.writer1
val bin_write_t_ : ('a, 'a binable) Bin_prot.Unsafe_write_c.writer1
val bin_read_t : ('a, 'a binable) Bin_prot.Map_to_safe.reader1
val bin_read_t_ : ('a, 'a binable) Bin_prot.Unsafe_read_c.reader1
val bin_read_t__ :
('a, int -> 'a binable) Bin_prot.Unsafe_read_c.reader1
val bin_writer_t : ('a, 'a binable) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a binable) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a binable) Bin_prot.Type_class.S1.t
end
end