Module Base__Map.Poly
A polymorphic Map.
include Base__.Map_intf.Creators2
val empty : (_, _) tval singleton : 'a -> 'b -> ('a, 'b) tval of_alist : ('a * 'b) list -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]val of_alist_or_error : ('a * 'b) list -> ('a, 'b) t Base.Or_error.tval of_alist_exn : ('a * 'b) list -> ('a, 'b) tval of_alist_multi : ('a * 'b) list -> ('a, 'b list) tval of_alist_fold : ('a * 'b) list -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c) tval of_alist_reduce : ('a * 'b) list -> f:('b -> 'b -> 'b) -> ('a, 'b) tval of_sorted_array : ('a * 'b) array -> ('a, 'b) t Base.Or_error.tval of_sorted_array_unchecked : ('a * 'b) array -> ('a, 'b) tval of_increasing_iterator_unchecked : len:int -> f:(int -> 'a * 'b) -> ('a, 'b) tval of_increasing_sequence : ('a * 'b) Base.Sequence.t -> ('a, 'b) t Base.Or_error.tval of_sequence : ('a * 'b) Base.Sequence.t -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]val of_sequence_or_error : ('a * 'b) Base.Sequence.t -> ('a, 'b) t Base.Or_error.tval of_sequence_exn : ('a * 'b) Base.Sequence.t -> ('a, 'b) tval of_sequence_multi : ('a * 'b) Base.Sequence.t -> ('a, 'b list) tval of_sequence_fold : ('a * 'b) Base.Sequence.t -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c) tval of_sequence_reduce : ('a * 'b) Base.Sequence.t -> f:('b -> 'b -> 'b) -> ('a, 'b) tval of_iteri : iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]val of_tree : ('a, 'b) tree -> ('a, 'b) t
include Base__.Map_intf.Accessors2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) tree with type comparator_witness := comparator_witness
val invariants : (_, _) t -> boolval is_empty : (_, _) t -> boolval length : (_, _) t -> intval add : ('a, 'b) t -> key:'a -> data:'b -> ('a, 'b) t Base__.Map_intf.Or_duplicate.tval add_exn : ('a, 'b) t -> key:'a -> data:'b -> ('a, 'b) tval set : ('a, 'b) t -> key:'a -> data:'b -> ('a, 'b) tval add_multi : ('a, 'b list) t -> key:'a -> data:'b -> ('a, 'b list) tval remove_multi : ('a, 'b list) t -> 'a -> ('a, 'b list) tval find_multi : ('a, 'b list) t -> 'a -> 'b listval change : ('a, 'b) t -> 'a -> f:('b option -> 'b option) -> ('a, 'b) tval update : ('a, 'b) t -> 'a -> f:('b option -> 'b) -> ('a, 'b) tval find : ('a, 'b) t -> 'a -> 'b optionval find_exn : ('a, 'b) t -> 'a -> 'bval remove : ('a, 'b) t -> 'a -> ('a, 'b) tval mem : ('a, 'b) t -> 'a -> boolval iter_keys : ('a, _) t -> f:('a -> unit) -> unitval iter : (_, 'b) t -> f:('b -> unit) -> unitval iteri : ('a, 'b) t -> f:(key:'a -> data:'b -> unit) -> unitval iteri_until : ('a, 'b) t -> f:(key:'a -> data:'b -> Base__.Map_intf.Continue_or_stop.t) -> Base__.Map_intf.Finished_or_unfinished.tval iter2 : ('a, 'b) t -> ('a, 'c) t -> f:(key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> unit) -> unitval map : ('a, 'b) t -> f:('b -> 'c) -> ('a, 'c) tval mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> 'c) -> ('a, 'c) tval fold : ('a, 'b) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'cval fold_right : ('a, 'b) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'cval fold2 : ('a, 'b) t -> ('a, 'c) t -> init:'d -> f:(key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd -> 'd) -> 'dval filter_keys : ('a, 'b) t -> f:('a -> bool) -> ('a, 'b) tval filter : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) tval filteri : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b) tval filter_map : ('a, 'b) t -> f:('b -> 'c option) -> ('a, 'c) tval filter_mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> 'c option) -> ('a, 'c) tval partition_mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> ('c, 'd) Base.Either.t) -> ('a, 'c) t * ('a, 'd) tval partition_map : ('a, 'b) t -> f:('b -> ('c, 'd) Base.Either.t) -> ('a, 'c) t * ('a, 'd) tval partitioni_tf : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b) t * ('a, 'b) tval partition_tf : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) t * ('a, 'b) tval combine_errors : ('a, 'b Base.Or_error.t) t -> ('a, 'b) t Base.Or_error.tval compare_direct : ('b -> 'b -> int) -> ('a, 'b) t -> ('a, 'b) t -> intval equal : ('b -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t -> boolval keys : ('a, _) t -> 'a listval data : (_, 'b) t -> 'b listval to_alist : ?key_order:[ `Increasing | `Decreasing ] -> ('a, 'b) t -> ('a * 'b) listval validate : name:('a -> string) -> 'b Base.Validate.check -> ('a, 'b) t Base.Validate.checkval validatei : name:('a -> string) -> ('a * 'b) Base.Validate.check -> ('a, 'b) t Base.Validate.checkval merge : ('a, 'b) t -> ('a, 'c) t -> f:(key:'a -> [ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd option) -> ('a, 'd) tval symmetric_diff : ('a, 'b) t -> ('a, 'b) t -> data_equal:('b -> 'b -> bool) -> ('a, 'b) Base__.Map_intf.Symmetric_diff_element.t Base.Sequence.tval fold_symmetric_diff : ('a, 'b) t -> ('a, 'b) t -> data_equal:('b -> 'b -> bool) -> init:'c -> f:('c -> ('a, 'b) Base__.Map_intf.Symmetric_diff_element.t -> 'c) -> 'cval min_elt : ('a, 'b) t -> ('a * 'b) optionval min_elt_exn : ('a, 'b) t -> 'a * 'bval max_elt : ('a, 'b) t -> ('a * 'b) optionval max_elt_exn : ('a, 'b) t -> 'a * 'bval for_all : (_, 'b) t -> f:('b -> bool) -> boolval for_alli : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> boolval exists : (_, 'b) t -> f:('b -> bool) -> boolval existsi : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> boolval count : (_, 'b) t -> f:('b -> bool) -> intval counti : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> intval split : ('a, 'b) t -> 'a -> ('a, 'b) t * ('a * 'b) option * ('a, 'b) tval append : lower_part:('a, 'b) t -> upper_part:('a, 'b) t -> [ `Ok of ('a, 'b) t | `Overlapping_key_ranges ]val subrange : ('a, 'b) t -> lower_bound:'a Base.Maybe_bound.t -> upper_bound:'a Base.Maybe_bound.t -> ('a, 'b) tval fold_range_inclusive : ('a, 'b) t -> min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'cval range_to_alist : ('a, 'b) t -> min:'a -> max:'a -> ('a * 'b) listval closest_key : ('a, 'b) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'a -> ('a * 'b) optionval nth : ('a, 'b) t -> int -> ('a * 'b) optionval nth_exn : ('a, 'b) t -> int -> 'a * 'bval rank : ('a, _) t -> 'a -> int optionval to_tree : ('a, 'b) t -> ('a, 'b) treeval to_sequence : ?order:[ `Increasing_key | `Decreasing_key ] -> ?keys_greater_or_equal_to:'a -> ?keys_less_or_equal_to:'a -> ('a, 'b) t -> ('a * 'b) Base.Sequence.tval binary_search : ('k, 'v) t -> compare:(key:'k -> data:'v -> 'key -> int) -> [ `Last_strictly_less_than | `Last_less_than_or_equal_to | `Last_equal_to | `First_equal_to | `First_greater_than_or_equal_to | `First_strictly_greater_than ] -> 'key -> ('k * 'v) optionval binary_search_segmented : ('k, 'v) t -> segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> ('k * 'v) option