package incr_dom

  1. Overview
  2. Docs
val of_set : ('k, 'cmp) Core.Set.t Incr.t -> ('k, unit, 'cmp) Core.Map.t Incr.t
val filter_mapi : ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v1 -> 'v2 option) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val mapi : ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v1 -> 'v2) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val filter_map : ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:('v1 -> 'v2 option) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val map : ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:('v1 -> 'v2) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val filter_mapi' : ?cutoff:'v1 Incr.Cutoff.t -> ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v1 Incr.t -> 'v2 option Incr.t) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val mapi' : ?cutoff:'v1 Incr.Cutoff.t -> ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v1 Incr.t -> 'v2 Incr.t) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val filter_map' : ?cutoff:'v1 Incr.Cutoff.t -> ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:('v1 Incr.t -> 'v2 option Incr.t) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val map' : ?cutoff:'v1 Incr.Cutoff.t -> ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:('v1 Incr.t -> 'v2 Incr.t) -> ('k, 'v2, 'cmp) Core.Map.t Incr.t
val partition_mapi : ?data_equal:('v1 -> 'v1 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v1 -> ('v2, 'v3) Core.Either.t) -> (('k, 'v2, 'cmp) Core.Map.t * ('k, 'v3, 'cmp) Core.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.Map.t -> 'acc) -> ?revert_to_init_when_empty:bool -> ('k, 'v, 'cmp) Core.Map.t Incr.t -> init:'acc -> add:(key:'k -> data:'v -> 'acc -> 'acc) -> remove:(key:'k -> data:'v -> 'acc -> 'acc) -> 'acc Incr.t
val mapi_count : ?data_equal:('v -> 'v -> bool) -> ('k1, 'v, 'cmp1) Core.Map.t Incr.t -> comparator:('k2, 'cmp2) Core.Map.comparator -> f:(key:'k1 -> data:'v -> 'k2) -> ('k2, int, 'cmp2) Core.Map.t Incr.t
val map_count : ?data_equal:('v -> 'v -> bool) -> ('k1, 'v, 'cmp1) Core.Map.t Incr.t -> comparator:('k2, 'cmp2) Core.Map.comparator -> f:('v -> 'k2) -> ('k2, int, 'cmp2) Core.Map.t Incr.t
val mapi_min : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:(key:'k -> data:'v -> 'r) -> 'r option Incr.t
val mapi_max : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:(key:'k -> data:'v -> 'r) -> 'r option Incr.t
val mapi_mn : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:('v -> 'r) -> 'r option Incr.t
val map_max : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:('v -> 'r) -> 'r option Incr.t
val min_value : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('v, 'b) Core.Map.comparator -> 'v option Incr.t
val max_value : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('v, 'b) Core.Map.comparator -> 'v option Incr.t
val mapi_bounds : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:(key:'k -> data:'v -> 'r) -> ('r * 'r) option Incr.t
val map_bounds : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('r, 'b) Core.Map.comparator -> f:('v -> 'r) -> ('r * 'r) option Incr.t
val value_bounds : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> comparator:('v, 'b) Core.Map.comparator -> ('v * 'v) option Incr.t
val merge : ?data_equal_left:('v1 -> 'v1 -> bool) -> ?data_equal_right:('v2 -> 'v2 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> ('k, 'v2, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> ('v1, 'v2) Core.Map.Merge_element.t -> 'v3 option) -> ('k, 'v3, 'cmp) Core.Map.t Incr.t
val unzip : ?left_result_equal:('v1 -> 'v1 -> bool) -> ?right_result_equal:('v2 -> 'v2 -> bool) -> ('k, 'v1 * 'v2, 'cmp) Core.Map.t Incr.t -> ('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.t
val unzip_mapi : ?data_equal:('v -> 'v -> bool) -> ?left_result_equal:('v1 -> 'v1 -> bool) -> ?right_result_equal:('v2 -> 'v2 -> bool) -> ('k, 'v, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v -> 'v1 * 'v2) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.t
val unzip_mapi' : ?cutoff:'v Incr.Cutoff.t -> ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> data:'v Incr.t -> 'v1 Incr.t * 'v2 Incr.t) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t * ('k, 'v2, 'cmp) Core.Map.t Incr.t
val merge' : ?cutoff:('v1, 'v2) Core.Map.Merge_element.t Incr.Cutoff.t -> ?data_equal_left:('v1 -> 'v1 -> bool) -> ?data_equal_right:('v2 -> 'v2 -> bool) -> ('k, 'v1, 'cmp) Core.Map.t Incr.t -> ('k, 'v2, 'cmp) Core.Map.t Incr.t -> f:(key:'k -> ('v1, 'v2) Core.Map.Merge_element.t Incr.t -> 'v3 option Incr.t) -> ('k, 'v3, 'cmp) Core.Map.t Incr.t
val flatten : ('k, 'v Incr.t, 'cmp) Core.Map.t -> ('k, 'v, 'cmp) Core.Map.t Incr.t
val join : ('k, 'v Incr.t, 'cmp) Core.Map.t Incr.t -> ('k, 'v, 'cmp) Core.Map.t Incr.t
val separate : ('k, 'v, 'cmp) Core.Map.t Incr.t -> data_equal:('v -> 'v -> bool) -> ('k, 'v Incr.t, 'cmp) Core.Map.t Incr.t
val keys : ('k, 'v, 'c) Core.Map.t Incr.t -> ('k, 'c) Core.Set.t Incr.t
val rank : ('k, 'v, 'cmp) Base.Map.t Incr.t -> 'k Incr.t -> int option Incr.t
val subrange : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'cmp) Core.Map.t Incr.t -> ('k Core.Maybe_bound.As_lower_bound.t * 'k Core.Maybe_bound.As_upper_bound.t) option Incr.t -> ('k, 'v, 'cmp) Core.Map.t Incr.t
val subrange_by_rank : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'cmp) Core.Map.t Incr.t -> (int Core.Maybe_bound.As_lower_bound.t * int Core.Maybe_bound.As_upper_bound.t) Incr.t -> ('k, 'v, 'cmp) Core.Map.t Incr.t
val rekey : ?data_equal:('v -> 'v -> bool) -> ('k1, 'v, 'cmp1) Core.Map.t Incr.t -> comparator:('k2, 'cmp2) Core.Map.comparator -> f:(key:'k1 -> data:'v -> 'k2) -> ('k2, 'v, 'cmp2) Core.Map.t Incr.t
val index_byi : ?data_equal:('v -> 'v -> bool) -> ('inner_key, 'v, 'inner_cmp) Core.Map.t Incr.t -> comparator:('outer_key, 'outer_cmp) Core.Map.comparator -> index:(key:'inner_key -> data:'v -> 'outer_key option) -> ('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t Incr.t
val index_by : ?data_equal:('v -> 'v -> bool) -> ('inner_key, 'v, 'inner_cmp) Core.Map.t Incr.t -> comparator:('outer_key, 'outer_cmp) Core.Map.comparator -> index:('v -> 'outer_key option) -> ('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t Incr.t
val unordered_fold_nested_maps : ?data_equal:('v -> 'v -> bool) -> ?revert_to_init_when_empty: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.Map.t, 'outer_cmp) Core.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.Map.comparator -> ('k1, ('k2, 'v, 'k2_cmp) Core.Map.t, 'k1_cmp) Core.Map.t Incr.t -> ('k2, ('k1, 'v, 'k1_cmp) Core.Map.t, 'k2_cmp) Core.Map.t Incr.t
val collapse : ?data_equal:('v -> 'v -> bool) -> ('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t Incr.t -> comparator:('inner_key, 'inner_cmp) Core.Map.comparator -> ('outer_key * 'inner_key, 'v, ('outer_cmp, 'inner_cmp) Core.Tuple2.comparator_witness) Core.Map.t Incr.t
val collapse_by : ?data_equal:('v -> 'v -> bool) -> ('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t Incr.t -> merge_keys:('outer_key -> 'inner_key -> 'combined_key) -> comparator:('combined_key, 'combined_cmp) Core.Map.comparator -> ('combined_key, 'v, 'combined_cmp) Core.Map.t Incr.t
val expand : ?data_equal:('v -> 'v -> bool) -> ('outer_key * 'inner_key, 'v, 'tuple_cmp) Core.Map.t Incr.t -> outer_comparator:('outer_key, 'outer_cmp) Core.Map.comparator -> inner_comparator:('inner_key, 'inner_cmp) Core.Map.comparator -> ('outer_key, ('inner_key, 'v, 'inner_cmp) Core.Map.t, 'outer_cmp) Core.Map.t Incr.t
val counti : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> f:(key:'k -> data:'v -> bool) -> int Incr.t
val count : ?data_equal:('v -> 'v -> bool) -> ('a, 'v, 'b) Core.Map.t Incr.t -> f:('v -> bool) -> int Incr.t
val for_alli : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> f:(key:'k -> data:'v -> bool) -> bool Incr.t
val for_all : ?data_equal:('v -> 'v -> bool) -> ('a, 'v, 'b) Core.Map.t Incr.t -> f:('v -> bool) -> bool Incr.t
val existsi : ?data_equal:('v -> 'v -> bool) -> ('k, 'v, 'a) Core.Map.t Incr.t -> f:(key:'k -> data:'v -> bool) -> bool Incr.t
val exists : ?data_equal:('v -> 'v -> bool) -> ('a, 'v, 'b) Core.Map.t Incr.t -> f:('v -> bool) -> bool Incr.t
val sum : ?data_equal:('v -> 'v -> bool) -> ('a, 'v, 'b) Core.Map.t Incr.t -> (module Abstract_algebra.Commutative_group.Without_sexp with type t = 'u) -> f:('v -> 'u) -> 'u Incr.t
module Lookup : sig ... end
module For_testing : sig ... end
OCaml

Innovation. Community. Security.