package incr_map

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

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_bin_io
    
    Key
    
    Provide_hash
    
    Key
    
    Provide_of_sexp
    
    Key
    
    Replace_polymorphic_compare
    
    Set
    
    Diff
    
    Elt
    
    Provide_bin_io
    
    Elt
    
    Provide_hash
    
    Elt
    
    Provide_of_sexp
    
    Elt
incr_map.erase_key
- Opaque_map
  - Diff
  - Key
    
    Map
    
    Diff
    
    Key
    
    Provide_bin_io
    
    Key
    
    Provide_hash
    
    Key
    
    Provide_of_sexp
    
    Key
    
    Replace_polymorphic_compare
    
    Set
    
    Diff
    
    Elt
    
    Provide_bin_io
    
    Elt
    
    Provide_hash
    
    Elt
    
    Provide_of_sexp
    
    Elt
    
    Stable
    
    V1
  - Stable
    
    V1
    
    Diff

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module Key : sig ... end

module Value : sig ... end

Signature

module Key : sig ... end

module Value : sig ... end

type ('k, 'v) parametrized = ('k, 'v) t

type t = (Key.t, Value.t) parametrized

include Sexplib0.Sexpable.S with type t := t

val t_of_sexp : Sexplib0.Sexp.t -> t

val sexp_of_t : t -> Sexplib0.Sexp.t

include Core.Bin_prot.Binable.S with type t := t

include Bin_prot.Binable.S_only_functions with type t := t

val bin_size_t : t Bin_prot.Size.sizer

val bin_write_t : t Bin_prot.Write.writer

val bin_read_t : t Bin_prot.Read.reader

val __bin_read_t__ : (int -> t) Bin_prot.Read.reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

val bin_shape_t : Bin_prot.Shape.t

val bin_writer_t : t Bin_prot.Type_class.writer

val bin_reader_t : t Bin_prot.Type_class.reader

val bin_t : t Bin_prot.Type_class.t

include Ppx_compare_lib.Comparable.S with type t := t

val compare : t -> t -> int

include Ppx_compare_lib.Equal.S with type t := t

val equal : t -> t -> bool

val empty : t

val fold : 
  t ->
  init:'accum ->
  f:('accum -> (Key.t * Value.t) -> 'accum) ->
  'accum

val iter : t -> f:((Key.t * Value.t) -> unit) -> unit

val to_alist : t -> (Key.t * Value.t) list

val to_opaque_map : t -> (Key.t * Value.t) Opaque_map.t

val first : t -> (Key.t * Value.t) option

val last : t -> (Key.t * Value.t) option

val length : t -> int

val num_filtered_rows : t -> int

val num_unfiltered_rows : t -> int

val key_range : t -> Key.t Collate.Which_range.t

val rank_range : t -> int Collate.Which_range.t

include Legacy_diffable.S with type t := t

module Update : sig ... end

val update : t -> Update.t -> t

val diffs : from:t -> to_:t -> Update.t

val to_diffs : t -> Update.t

val of_diffs : Update.t -> t

include Streamable.S with type t := t

module Intermediate : sig ... end

val to_parts : t -> Intermediate.Part.t Base.Sequence.t

val finalize : Intermediate.t -> t

val this_type_does_not_support_ldiffable : unit

This strange value just encodes the fact that this type does not yet implement Ldiffable.S. When it does, delete this and then the compiler will show you places to update.

val find_by_key : t -> Key.t -> Value.t option

val prev : t -> Key.t -> (Key.t * Value.t) option

val next : t -> Key.t -> (Key.t * Value.t) option