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_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

module Which_range : sig ... end

type ('k, 'filter, 'order) t = {

filter : 'filter;
(*
User-defined type, usually algebraic data type, describing how the table can be filtered. You'll need to provide equal and to_predicate of type 'filter -> ('k -> 'v -> bool) for collate.
*)
order : 'order;
(*
User-defined type, usually algebraic data type, describing how the table can be sorted. You'll need to provide equal and to_compare of type functionally equivalent to 'order -> ('v -> 'v -> int) for collate.
*)
key_range : 'k Which_range.t;
(*
Select only rows between these keys (in the configured ordering)
*)
rank_range : int Which_range.t;
(*
After selecting rows according to key_range, select rows between these positions.
For example, if your (sorted & filtered) data is (A, 1); (B, 2); (C, 3), then both for key_range = All_rows; rank_range = From 1 and key_range = From B; rank_range = All_rows the result would be (B, 2); (C, 3)
*)

}

include Ppx_compare_lib.Equal.S3
  with type ('k, 'filter, 'order) t := ('k, 'filter, 'order) t

val equal : 
  ('a -> 'a -> bool) ->
  ('b -> 'b -> bool) ->
  ('c -> 'c -> bool) ->
  ('a, 'b, 'c) t ->
  ('a, 'b, 'c) t ->
  bool

val sexp_of_t : 
  ('k -> Sexplib0.Sexp.t) ->
  ('filter -> Sexplib0.Sexp.t) ->
  ('order -> Sexplib0.Sexp.t) ->
  ('k, 'filter, 'order) t ->
  Sexplib0.Sexp.t

val default : filter:'filter -> order:'order -> (_, 'filter, 'order) t

module Stable : sig ... end