Module Ui_incr.Map

val of_set : ('k'cmp) Core_kernel.Set.t Incr.t -> ('k, unit, 'cmp) Core_kernel.Map.t Incr.t
val filter_mapi : ?⁠data_equal:('v1 -> 'v1 -> bool) -> ('k'v1'cmp) Core_kernel.Map.t Incr.t -> f:(key:'k -> data:'v1 -> 'v2 option) -> ('k'v2'cmp) Core_kernel.Map.t Incr.t
val mapi : ?⁠data_equal:('v1 -> 'v1 -> bool) -> ('k'v1'cmp) Core_kernel.Map.t Incr.t -> f:(key:'k -> data:'v1 -> 'v2) -> ('k'v2'cmp) Core_kernel.Map.t Incr.t
val filter_mapi' : ?⁠cutoff:'v1 Incr.Cutoff.t -> ?⁠data_equal:('v1 -> 'v1 -> bool) -> ('k'v1'cmp) Core_kernel.Map.t Incr.t -> f:(key:'k -> data:'v1 Incr.t -> 'v2 option Incr.t) -> ('k'v2'cmp) Core_kernel.Map.t Incr.t
val mapi' : ?⁠cutoff:'v1 Incr.Cutoff.t -> ?⁠data_equal:('v1 -> 'v1 -> bool) -> ('k'v1'cmp) Core_kernel.Map.t Incr.t -> f:(key:'k -> data:'v1 Incr.t -> 'v2 Incr.t) -> ('k'v2'cmp) Core_kernel.Map.t Incr.t
val unordered_fold : ?⁠data_equal:('v -> 'v -> bool) -> ?⁠update:(key:'k -> old_data:'v -> new_data:'v -> 'acc -> 'acc) -> ?⁠specialized_initial:(init:'acc -> ('k'v'cmp) Core_kernel.Map.t -> 'acc) -> ('k'v'cmp) Core_kernel.Map.t Incr.t -> init:'acc -> add:(key:'k -> data:'v -> 'acc -> 'acc) -> remove:(key:'k -> data:'v -> 'acc -> 'acc) -> 'acc Incr.t
val merge : ?⁠data_equal_left:('v1 -> 'v1 -> bool) -> ?⁠data_equal_right:('v2 -> 'v2 -> bool) -> ('k'v1'cmp) Core_kernel.Map.t Incr.t -> ('k'v2'cmp) Core_kernel.Map.t Incr.t -> f:(key:'k -> [ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] -> 'v3 option) -> ('k'v3'cmp) Core_kernel.Map.t Incr.t
val flatten : ('k'v Incr.t'cmp) Core_kernel.Map.t -> ('k'v'cmp) Core_kernel.Map.t Incr.t
val join : ('k'v Incr.t'cmp) Core_kernel.Map.t Incr.t -> ('k'v'cmp) Core_kernel.Map.t Incr.t
val separate : ('k'v'cmp) Core_kernel.Map.t Incr.t -> data_equal:('v -> 'v -> bool) -> ('k'v Incr.t'cmp) Core_kernel.Map.t Incr.t
val keys : ('k'v'c) Core_kernel.Map.t Incr.t -> ('k'c) Core_kernel.Set.t Incr.t
val subrange : ?⁠data_equal:('v -> 'v -> bool) -> ('k'v'cmp) Core_kernel.Map.t Incr.t -> ('k Core_kernel.Maybe_bound.As_lower_bound.t * 'k Core_kernel.Maybe_bound.As_upper_bound.t) option Incr.t -> ('k'v'cmp) Core_kernel.Map.t Incr.t
val subrange_by_rank : ?⁠data_equal:('v -> 'v -> bool) -> ('k'v'cmp) Core_kernel.Map.t Incr.t -> (int Core_kernel.Maybe_bound.As_lower_bound.t * int Core_kernel.Maybe_bound.As_upper_bound.t) Incr.t -> ('k'v'cmp) Core_kernel.Map.t Incr.t
val index_by : ('inner_key'v'inner_cmp) Core_kernel.Map.t Incr.t -> comparator:('outer_key'outer_cmp) Core_kernel.Map.comparator -> index:('v -> 'outer_key option) -> ('outer_key('inner_key'v'inner_cmp) Core_kernel.Map.t'outer_cmp) Core_kernel.Map.t Incr.t
val unordered_fold_nested_maps : ?⁠data_equal:('v -> 'v -> bool) -> ?⁠update:(outer_key:'outer_key -> inner_key:'inner_key -> old_data:'v -> new_data:'v -> 'acc -> 'acc) -> ('outer_key('inner_key'v'inner_cmp) Core_kernel.Map.t'outer_cmp) Core_kernel.Map.t Incr.t -> init:'acc -> add:(outer_key:'outer_key -> inner_key:'inner_key -> data:'v -> 'acc -> 'acc) -> remove:(outer_key:'outer_key -> inner_key:'inner_key -> data:'v -> 'acc -> 'acc) -> 'acc Incr.t
val transpose : ?⁠data_equal:('v -> 'v -> bool) -> ('k2'k2_cmp) Core_kernel.Map.comparator -> ('k1('k2'v'k2_cmp) Core_kernel.Map.t'k1_cmp) Core_kernel.Map.t Incr.t -> ('k2('k1'v'k1_cmp) Core_kernel.Map.t'k2_cmp) Core_kernel.Map.t Incr.t
module Lookup : sig ... end
module For_testing : sig ... end