sig
type ('k, 'v) t = ('k, 'v, Comparator.Poly.comparator) Map.Poly.tree
val empty :
('k, 'comparator, ('k, 'a, 'comparator) tree)
Core_map_intf.without_comparator
val singleton :
('k, 'comparator, 'k key -> 'v -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val of_alist :
('k, 'comparator,
('k key * 'v) list ->
[ `Duplicate_key of 'k key | `Ok of ('k, 'v, 'comparator) tree ])
Core_map_intf.without_comparator
val of_alist_exn :
('k, 'comparator, ('k key * 'v) list -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val of_alist_multi :
('k, 'comparator, ('k key * 'v) list -> ('k, 'v list, 'comparator) tree)
Core_map_intf.without_comparator
val of_alist_fold :
('k, 'comparator,
('k key * 'v1) list ->
init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k, 'v2, 'comparator) tree)
Core_map_intf.without_comparator
val of_tree :
('k, 'comparator,
('k key, 'v, 'comparator) tree -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val is_empty : ('a, 'b, 'c) tree -> bool
val length : ('a, 'b, 'c) tree -> int
val add :
('k, 'comparator,
('k, 'v, 'comparator) tree ->
key:'k key -> data:'v -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val add_multi :
('k, 'comparator,
('k, 'v list, 'comparator) tree ->
key:'k key -> data:'v -> ('k, 'v list, 'comparator) tree)
Core_map_intf.without_comparator
val change :
('k, 'comparator,
('k, 'v, 'comparator) tree ->
'k key -> ('v option -> 'v option) -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val find :
('k, 'comparator, ('k, 'v, 'comparator) tree -> 'k key -> 'v option)
Core_map_intf.without_comparator
val find_exn :
('k, 'comparator, ('k, 'v, 'comparator) tree -> 'k key -> 'v)
Core_map_intf.without_comparator
val remove :
('k, 'comparator,
('k, 'v, 'comparator) tree -> 'k key -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val mem :
('k, 'comparator, ('k, 'a, 'comparator) tree -> 'k key -> bool)
Core_map_intf.without_comparator
val iter : ('k, 'v, 'a) tree -> f:(key:'k key -> data:'v -> unit) -> unit
val map :
('k, 'v1, 'comparator) tree ->
f:('v1 -> 'v2) -> ('k, 'v2, 'comparator) tree
val mapi :
('k, 'v1, 'comparator) tree ->
f:(key:'k key -> data:'v1 -> 'v2) -> ('k, 'v2, 'comparator) tree
val fold :
('k, 'v, 'b) tree ->
init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a
val fold_right :
('k, 'v, 'b) tree ->
init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a
val filter :
('k, 'comparator,
('k, 'v, 'comparator) tree ->
f:(key:'k key -> data:'v -> bool) -> ('k, 'v, 'comparator) tree)
Core_map_intf.without_comparator
val filter_map :
('k, 'comparator,
('k, 'v1, 'comparator) tree ->
f:('v1 -> 'v2 option) -> ('k, 'v2, 'comparator) tree)
Core_map_intf.without_comparator
val filter_mapi :
('k, 'comparator,
('k, 'v1, 'comparator) tree ->
f:(key:'k key -> data:'v1 -> 'v2 option) -> ('k, 'v2, 'comparator) tree)
Core_map_intf.without_comparator
val compare_direct :
('k, 'comparator,
('v -> 'v -> int) ->
('k, 'v, 'comparator) tree -> ('k, 'v, 'comparator) tree -> int)
Core_map_intf.without_comparator
val equal :
('k, 'comparator,
('v -> 'v -> bool) ->
('k, 'v, 'comparator) tree -> ('k, 'v, 'comparator) tree -> bool)
Core_map_intf.without_comparator
val keys : ('k, 'a, 'b) tree -> 'k key list
val data : ('a, 'v, 'b) tree -> 'v list
val to_alist : ('k, 'v, 'a) tree -> ('k key * 'v) list
val merge :
('k, 'comparator,
('k, 'v1, 'comparator) tree ->
('k, 'v2, 'comparator) tree ->
f:(key:'k key ->
[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] -> 'v3 option) ->
('k, 'v3, 'comparator) tree)
Core_map_intf.without_comparator
val min_elt : ('k, 'v, 'a) tree -> ('k key * 'v) option
val min_elt_exn : ('k, 'v, 'a) tree -> 'k key * 'v
val max_elt : ('k, 'v, 'a) tree -> ('k key * 'v) option
val max_elt_exn : ('k, 'v, 'a) tree -> 'k key * 'v
val for_all : ('k, 'v, 'a) tree -> f:('v -> bool) -> bool
val exists : ('k, 'v, 'a) tree -> f:('v -> bool) -> bool
val fold_range_inclusive :
('k, 'comparator,
('k, 'v, 'comparator) tree ->
min:'k key ->
max:'k key -> init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a)
Core_map_intf.without_comparator
val range_to_alist :
('k, 'comparator,
('k, 'v, 'comparator) tree ->
min:'k key -> max:'k key -> ('k key * 'v) list)
Core_map_intf.without_comparator
val prev_key :
('k, 'comparator,
('k, 'v, 'comparator) tree -> 'k key -> ('k key * 'v) option)
Core_map_intf.without_comparator
val next_key :
('k, 'comparator,
('k, 'v, 'comparator) tree -> 'k key -> ('k key * 'v) option)
Core_map_intf.without_comparator
val rank :
('k, 'comparator, ('k, 'v, 'comparator) tree -> 'k key -> int option)
Core_map_intf.without_comparator
val to_tree : ('k, 'v, 'comparator) tree -> ('k key, 'v, 'comparator) tree
val t_of_sexp :
(Sexplib.Sexp.t -> 'k) ->
(Sexplib.Sexp.t -> 'v) -> Sexplib.Sexp.t -> ('k, 'v) Map.Poly.Tree.t
val sexp_of_t :
('k -> Sexplib.Sexp.t) ->
('v -> Sexplib.Sexp.t) -> ('k, 'v) Map.Poly.Tree.t -> Sexplib.Sexp.t
end