package incremental

You can search for identifiers within the package.

in-package search v0.2.0

package incremental

incremental
- Incremental
  - Before_or_after
  - Clock
  - Config
    
    Default
    
    Incremental_config
  - Cutoff
  - Expert
    
    Dependency
    
    Node
    
    Step_result
  - For_analyzer
    
    Cutoff
    
    Dot_user_info
    
    Kind
    
    Node_id
    
    Hash_queue
    
    Hash_set
    
    Provide_bin_io
    
    X
    
    Provide_of_sexp
    
    X
    
    Map
    
    Diff
    
    Key
    
    Provide_bin_io
    
    Key
    
    Provide_hash
    
    Provide_of_sexp
    
    Key
    
    Set
    
    Diff
    
    Elt
    
    Provide_bin_io
    
    Elt
    
    Provide_hash
    
    Provide_of_sexp
    
    Elt
    
    Table
    
    Provide_bin_io
    
    Key
    
    Provide_of_sexp
    
    Key
    
    Stabilization_num
    
    Map
    
    Diff
    
    Key
    
    Provide_bin_io
    
    Key
    
    Provide_hash
    
    Provide_of_sexp
    
    Key
    
    Set
    
    Diff
    
    Elt
    
    Provide_bin_io
    
    Elt
    
    Provide_hash
    
    Provide_of_sexp
    
    Elt
  - Infix
  - Let_syntax
    
    Let_syntax
    
    Open_on_rhs
  - Make
    
    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
  - Make_with_config
    
    Before_or_after
    
    C
    
    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
  - Node_value
  - Observer
    
    Update
  - Packed
  - Private
  - S
    
    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
  - S_gen
    
    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
  - Scope
  - State
    
    S
    
    Stats
  - Unordered_array_fold_update
  - Update
  - Var
incremental.incremental_step_function
- Incremental_step_function
incremental.memoize
- Incr_memoize
  - Make
    
    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
    
    Incr_with_store_params
    
    Let_syntax
    
    Let_syntax
  - Store
  - Store_params

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Key : sig ... end

module Diff : sig ... end

include Core.Map_intf.S_plain with module Key := Key and module Diff := Diff

type +'a t = (Key.t, 'a, Key.comparator_witness) Core__.Map_intf.Map.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.Map_intf.Creators_generic
  with type ('a, 'b, 'c) t := 'b t
  with type ('a, 'b, 'c) tree :=
         (Key.t, 'b, Key.comparator_witness) Core__.Map_intf.Tree.t
  with type 'k key := Key.t
  with type 'c cmp := Key.comparator_witness
  with type ('a, 'b, 'c) create_options :=
         ('a, 'b, 'c) Core__.Map_intf.Without_comparator.t
  with type ('a, 'b, 'c) access_options :=
         ('a, 'b, 'c) Core__.Map_intf.Without_comparator.t

val empty : ('k, 'cmp, 'a t) Core__.Map_intf.Without_comparator.t

val singleton : 
  ('k, 'cmp, Key.t -> 'v -> 'v t) Core__.Map_intf.Without_comparator.t

val map_keys : 
  ('k2,
    'cmp2,
    'v t ->
    f:(Key.t -> Key.t) ->
    [ `Duplicate_key of Key.t | `Ok of 'v t ])
    Core__.Map_intf.Without_comparator.t

val map_keys_exn : 
  ('k2, 'cmp2, 'v t -> f:(Key.t -> Key.t) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val transpose_keys : 
  ('k1,
    'cmp1,
    ('k2, 'cmp2, 'a t t -> 'a t t) Core__.Map_intf.Without_comparator.t)
    Core__.Map_intf.Without_comparator.t

val of_sorted_array : 
  ('k, 'cmp, (Key.t * 'v) array -> 'v t Base__.Or_error.t)
    Core__.Map_intf.Without_comparator.t

val of_sorted_array_unchecked : 
  ('k, 'cmp, (Key.t * 'v) array -> 'v t) Core__.Map_intf.Without_comparator.t

val of_increasing_iterator_unchecked : 
  ('k, 'cmp, len:int -> f:(int -> Key.t * 'v) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_alist : 
  ('k, 'cmp, (Key.t * 'v) list -> [ `Duplicate_key of Key.t | `Ok of 'v t ])
    Core__.Map_intf.Without_comparator.t

val of_alist_or_error : 
  ('k, 'cmp, (Key.t * 'v) list -> 'v t Base__.Or_error.t)
    Core__.Map_intf.Without_comparator.t

val of_alist_exn : 
  ('k, 'cmp, (Key.t * 'v) list -> 'v t) Core__.Map_intf.Without_comparator.t

val of_alist_multi : 
  ('k, 'cmp, (Key.t * 'v) list -> 'v list t)
    Core__.Map_intf.Without_comparator.t

val of_alist_fold : 
  ('k, 'cmp, (Key.t * 'v1) list -> init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> 'v2 t)
    Core__.Map_intf.Without_comparator.t

val of_alist_reduce : 
  ('k, 'cmp, (Key.t * 'v) list -> f:('v -> 'v -> 'v) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_increasing_sequence : 
  ('k, 'cmp, (Key.t * 'v) Base__.Sequence.t -> 'v t Base__.Or_error.t)
    Core__.Map_intf.Without_comparator.t

val of_sequence : 
  ('k,
    'cmp,
    (Key.t * 'v) Base__.Sequence.t ->
    [ `Duplicate_key of Key.t | `Ok of 'v t ])
    Core__.Map_intf.Without_comparator.t

val of_sequence_or_error : 
  ('k, 'cmp, (Key.t * 'v) Base__.Sequence.t -> 'v t Base__.Or_error.t)
    Core__.Map_intf.Without_comparator.t

val of_sequence_exn : 
  ('k, 'cmp, (Key.t * 'v) Base__.Sequence.t -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_sequence_multi : 
  ('k, 'cmp, (Key.t * 'v) Base__.Sequence.t -> 'v list t)
    Core__.Map_intf.Without_comparator.t

val of_sequence_fold : 
  ('k,
    'cmp,
    (Key.t * 'v1) Base__.Sequence.t ->
    init:'v2 ->
    f:('v2 -> 'v1 -> 'v2) ->
    'v2 t)
    Core__.Map_intf.Without_comparator.t

val of_sequence_reduce : 
  ('k, 'cmp, (Key.t * 'v) Base__.Sequence.t -> f:('v -> 'v -> 'v) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_list_with_key : 
  ('k,
    'cmp,
    'v list ->
    get_key:('v -> Key.t) ->
    [ `Duplicate_key of Key.t | `Ok of 'v t ])
    Core__.Map_intf.Without_comparator.t

val of_list_with_key_or_error : 
  ('k, 'cmp, 'v list -> get_key:('v -> Key.t) -> 'v t Base__.Or_error.t)
    Core__.Map_intf.Without_comparator.t

val of_list_with_key_exn : 
  ('k, 'cmp, 'v list -> get_key:('v -> Key.t) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_list_with_key_multi : 
  ('k, 'cmp, 'v list -> get_key:('v -> Key.t) -> 'v list t)
    Core__.Map_intf.Without_comparator.t

val of_list_with_key_fold : 
  ('k,
    'cmp,
    'v list ->
    get_key:('v -> Key.t) ->
    init:'acc ->
    f:('acc -> 'v -> 'acc) ->
    'acc t)
    Core__.Map_intf.Without_comparator.t

val of_list_with_key_reduce : 
  ('k, 'cmp, 'v list -> get_key:('v -> Key.t) -> f:('v -> 'v -> 'v) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_iteri : 
  ('k,
    'cmp,
    iteri:(f:(key:Key.t -> data:'v -> unit) -> unit) ->
    [ `Duplicate_key of Key.t | `Ok of 'v t ])
    Core__.Map_intf.Without_comparator.t

val of_iteri_exn : 
  ('k, 'cmp, iteri:(f:(key:Key.t -> data:'v -> unit) -> unit) -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_tree : 
  ('k,
    'cmp,
    (Key.t, 'v, Key.comparator_witness) Core__.Map_intf.Tree.t ->
    'v t)
    Core__.Map_intf.Without_comparator.t

val of_hashtbl_exn : 
  ('k, 'cmp, (Key.t, 'v) Core.Hashtbl.t -> 'v t)
    Core__.Map_intf.Without_comparator.t

val of_key_set : 
  (Key.t, Key.comparator_witness) Base.Set.t ->
  f:(Key.t -> 'v) ->
  'v t

Never requires a comparator because it can get one from the input Set.t.

val quickcheck_generator : 
  ('k,
    'cmp,
    Key.t Core.Quickcheck.Generator.t ->
    'v Core.Quickcheck.Generator.t ->
    'v t Core.Quickcheck.Generator.t)
    Core__.Map_intf.Without_comparator.t

include Diffable.S1_plain with type 'a t := 'a t and module Diff := Diff

val map : 'a t -> f:('a -> 'b) -> 'b t

module Provide_of_sexp (Key : sig ... end) : sig ... end

module Provide_bin_io
  (Key : sig ... end) : 
  Core.Map_intf.Binable.S1 with type 'a t := 'a t

module Provide_hash (Key : sig ... end) : sig ... end

val quickcheck_observer : 
  Key.t Core.Quickcheck.Observer.t ->
  'v Core.Quickcheck.Observer.t ->
  'v t Core.Quickcheck.Observer.t

val quickcheck_shrinker : 
  ('k,
    'cmp,
    Key.t Core.Quickcheck.Shrinker.t ->
    'v Core.Quickcheck.Shrinker.t ->
    'v t Core.Quickcheck.Shrinker.t)
    Core__.Map_intf.Without_comparator.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