package incr_map

You can search for identifiers within the package.

in-package search v0.2.0

package incr_map

incr_map
- Incr_map
  - For_testing
  - Instrumentation
  - Lookup
    
    For_debug
    
    M
    
    K
  - Make
    
    For_testing
    
    Incr
    
    Before_or_after
    
    Clock
    
    Cutoff
    
    Expert
    
    Dependency
    
    Node
    
    Step_result
    
    Infix
    
    Let_syntax
    
    Let_syntax
    
    Open_on_rhs
    
    Node_value
    
    Observer
    
    Update
    
    Packed
    
    Scope
    
    State
    
    Stats
    
    Unordered_array_fold_update
    
    Update
    
    Var
    
    Instrumentation
    
    Lookup
    
    For_debug
    
    M
    
    K
  - S
    
    For_testing
    
    Incr
    
    Cutoff
    
    Instrumentation
    
    Lookup
    
    For_debug
    
    M
    
    K
  - S_gen
    
    For_testing
    
    Incr
    
    Cutoff
    
    Instrumentation
    
    Lookup
    
    For_debug
    
    M
    
    K
incr_map.collate
- Incr_map_collate
  - Collate
    
    Stable
    
    V1
    
    Which_range
    
    V1
    
    Diff
    
    Which_range
    
    Diff
  - Collated
    
    Concrete
    
    Intermediate
    
    Part
    
    Key
    
    Update
    
    Diff
    
    Value
    
    Diff
    
    For_testing
    
    Make_concrete
    
    Intermediate
    
    Part
    
    Key
    
    Update
    
    Diff
    
    Value
    
    Private
    
    Stable
    
    V1
    
    Diff
  - Compare
  - Fold
  - With_caching
    
    Range_memoize_bucket
    
    Map
    
    Diff
    
    Key
    
    Provide_hash
    
    Provide_of_sexp
    
    Key
    
    Set
    
    Diff
    
    Elt
    
    Provide_hash
    
    Provide_of_sexp
    
    Elt
incr_map.erase_key
- Opaque_map
  - Diff
  - Key
    
    Map
    
    Diff
    
    Key
    
    Provide_hash
    
    Provide_of_sexp
    
    Key
    
    Set
    
    Diff
    
    Elt
    
    Provide_hash
    
    Provide_of_sexp
    
    Elt
    
    Stable
    
    V1
  - Stable
    
    V1
    
    Diff

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Key : sig ... end

type 'a t = (Key.t, 'a, Key.comparator_witness) Core.Map.t

include Sexplib0.Sexpable.S1 with type 'a t := 'a t

val t_of_sexp : (Sexplib0__.Sexp.t -> 'a) -> Sexplib0__.Sexp.t -> 'a t

val sexp_of_t : ('a -> Sexplib0__.Sexp.t) -> 'a t -> Sexplib0__.Sexp.t

include Ppx_compare_lib.Comparable.S1 with type 'a t := 'a t

val compare : 
  'a Base__Ppx_compare_lib.compare ->
  'a t Base__Ppx_compare_lib.compare

include Ppx_compare_lib.Equal.S1 with type 'a t := 'a t

val equal : 'a Base__Ppx_compare_lib.equal -> 'a t Base__Ppx_compare_lib.equal

include Core.Bin_prot.Binable.S1 with type 'a t := 'a t

val bin_shape_t : Bin_prot__.Shape.t -> Bin_prot__.Shape.t

val bin_size_t : ('a, 'a t) Bin_prot__.Size.sizer1

val bin_write_t : ('a, 'a t) Bin_prot__.Write.writer1

val bin_read_t : ('a, 'a t) Bin_prot__.Read.reader1

val __bin_read_t__ : ('a, int -> 'a t) Bin_prot__.Read.reader1

val bin_writer_t : ('a, 'a t) Bin_prot__.Type_class.S1.writer

val bin_reader_t : ('a, 'a t) Bin_prot__.Type_class.S1.reader

val bin_t : ('a, 'a t) Bin_prot__.Type_class.S1.t

include Diffable.S1 with type 'a t := 'a t

module Diff : sig ... end

val erase_key_incrementally : 
  ?data_equal:('data -> 'data -> bool) ->
  (('key, 'data, _) Core.Map.t, 'w) Incremental.t ->
  get:(key:'key -> data:'data -> 'a) ->
  ('a t, 'w) Incremental.t

When Opaque_maps are created incrementally we can be smart about insertion and get good performance around insertion and rebalancing.

empty, of_list, and of_array won't give you nice incrementality like erase_key_incrementally, but they are still fine if the primary goal is using the type itself outside of an incremental context.

But if possible, consider erase_key_incrementally.

val empty : _ t

val of_list : 'a list -> 'a t

val of_array : 'a array -> 'a t

module Stable : sig ... end