incr_dom v0.11.0 · OCaml Package

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) ->
  ('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 subrange : 
  ?data_equal:('v -> 'v -> bool) ->
  ('k, 'v, 'cmp) Core_kernel.Map.t Incr.t ->
  ('k * 'k) option Incr.t ->
  ('k, 'v, 'cmp) Core_kernel.Map.t Incr.t

module Lookup : sig ... end

package incr_dom