Module type Incremental_intf.S_gen

S_gen is the type of the module returned by Incremental.Make. It is a specialization of the interface of Incremental, with:

The comments for components of S_gen are in module type Incremental below.

module State : sig ... end
type 'a t
val sexp_of_t : ('a -> Ppx_sexp_conv_lib.Sexp.t) -> 'a t -> Ppx_sexp_conv_lib.Sexp.t
type 'a incremental := 'a t
include Core_kernel.Invariant.S1 with type 'a t := 'a t
type 'a t
val invariant : 'a Base__.Invariant_intf.inv -> 'a t Base__.Invariant_intf.inv
val is_const : _ t -> bool
val is_valid : _ t -> bool
val is_necessary : _ t -> bool
val const : 'a -> 'a t
val return : 'a -> 'a t
val map : 'a t -> f:('a -> 'b) -> 'b t
val (>>|) : 'a t -> ('a -> 'b) -> 'b t
include Map_n with type 'a t := 'a t
type 'a t
include Map_n_gen with type ('a, 'w) t := 'a t
type ('a, 'w) t
val map2 : ('a1'w) t -> ('a2'w) t -> f:('a1 -> 'a2 -> 'b) -> ('b'w) t
val map3 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'b) -> ('b'w) t
val map4 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'b) -> ('b'w) t
val map5 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'b) -> ('b'w) t
val map6 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'b) -> ('b'w) t
val map7 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'b) -> ('b'w) t
val map8 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'b) -> ('b'w) t
val map9 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'b) -> ('b'w) t
val map10 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'b) -> ('b'w) t
val map11 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> ('a11'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'a11 -> 'b) -> ('b'w) t
val map12 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> ('a11'w) t -> ('a12'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'a11 -> 'a12 -> 'b) -> ('b'w) t
val map13 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> ('a11'w) t -> ('a12'w) t -> ('a13'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'a11 -> 'a12 -> 'a13 -> 'b) -> ('b'w) t
val map14 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> ('a11'w) t -> ('a12'w) t -> ('a13'w) t -> ('a14'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'a11 -> 'a12 -> 'a13 -> 'a14 -> 'b) -> ('b'w) t
val map15 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> ('a5'w) t -> ('a6'w) t -> ('a7'w) t -> ('a8'w) t -> ('a9'w) t -> ('a10'w) t -> ('a11'w) t -> ('a12'w) t -> ('a13'w) t -> ('a14'w) t -> ('a15'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'a11 -> 'a12 -> 'a13 -> 'a14 -> 'a15 -> 'b) -> ('b'w) t
val bind : 'a t -> f:('a -> 'b t) -> 'b t
val (>>=) : 'a t -> ('a -> 'b t) -> 'b t
include Bind_n with type 'a t := 'a t
type 'a t
include Bind_n_gen with type ('a, 'w) t := 'a t
type ('a, 'w) t
val bind2 : ('a1'w) t -> ('a2'w) t -> f:('a1 -> 'a2 -> ('b'w) t) -> ('b'w) t
val bind3 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> f:('a1 -> 'a2 -> 'a3 -> ('b'w) t) -> ('b'w) t
val bind4 : ('a1'w) t -> ('a2'w) t -> ('a3'w) t -> ('a4'w) t -> f:('a1 -> 'a2 -> 'a3 -> 'a4 -> ('b'w) t) -> ('b'w) t
module Infix : sig ... end
val join : 'a t t -> 'a t
val if_ : bool t -> then_:'a t -> else_:'a t -> 'a t
val freeze : ?⁠when_:('a -> bool) -> 'a t -> 'a t
val depend_on : 'a t -> depend_on:_ t -> 'a t
val necessary_if_alive : 'a t -> 'a t
val for_all : bool t array -> bool t
val exists : bool t array -> bool t
val all : 'a t list -> 'a list t
val both : 'a t -> 'b t -> ('a * 'b) t
val array_fold : 'a t array -> init:'b -> f:('b -> 'a -> 'b) -> 'b t
val reduce_balanced : 'a t array -> f:('a -> 'b) -> reduce:('b -> 'b -> 'b) -> 'b t option
module Unordered_array_fold_update : sig ... end
val unordered_array_fold : ?⁠full_compute_every_n_changes:int -> 'a t array -> init:'b -> f:('b -> 'a -> 'b) -> update:('a'b) Unordered_array_fold_update.t -> 'b t
val opt_unordered_array_fold : ?⁠full_compute_every_n_changes:int -> 'a option t array -> init:'b -> f:('b -> 'a -> 'b) -> f_inverse:('b -> 'a -> 'b) -> 'b option t
val sum : ?⁠full_compute_every_n_changes:int -> 'a t array -> zero:'a -> add:('a -> 'a -> 'a) -> sub:('a -> 'a -> 'a) -> 'a t
val opt_sum : ?⁠full_compute_every_n_changes:int -> 'a option t array -> zero:'a -> add:('a -> 'a -> 'a) -> sub:('a -> 'a -> 'a) -> 'a option t
val sum_int : int t array -> int t
val sum_float : float t array -> float t
module Scope : sig ... end
module Var : sig ... end
module Observer : sig ... end
val observe : ?⁠should_finalize:bool -> 'a t -> 'a Observer.t
module Update : sig ... end
val on_update : 'a t -> f:('a Update.t -> unit) -> unit
val stabilize : unit -> unit
val am_stabilizing : unit -> bool
module Cutoff : sig ... end
val set_cutoff : 'a t -> 'a Cutoff.t -> unit
val get_cutoff : 'a t -> 'a Cutoff.t
val lazy_from_fun : (unit -> 'a) -> 'a Core_kernel.Lazy.t
val default_hash_table_initial_size : int
val memoize_fun : ?⁠initial_size:int -> 'a Base.Hashtbl.Key.t -> ('a -> 'b) -> ('a -> 'b) Core_kernel.Staged.t
val memoize_fun_by_key : ?⁠initial_size:int -> 'key Base.Hashtbl.Key.t -> ('a -> 'key) -> ('a -> 'b) -> ('a -> 'b) Core_kernel.Staged.t
val weak_memoize_fun : ?⁠initial_size:int -> 'a Base.Hashtbl.Key.t -> ('a -> 'b Core_kernel.Heap_block.t) -> ('a -> 'b Core_kernel.Heap_block.t) Core_kernel.Staged.t
val weak_memoize_fun_by_key : ?⁠initial_size:int -> 'key Base.Hashtbl.Key.t -> ('a -> 'key) -> ('a -> 'b Core_kernel.Heap_block.t) -> ('a -> 'b Core_kernel.Heap_block.t) Core_kernel.Staged.t
val user_info : _ t -> Core_kernel.Info.t option
val set_user_info : _ t -> Core_kernel.Info.t option -> unit
module Node_value : sig ... end
val node_value : 'a t -> 'a Node_value.t

node_value t returns whatever value t happens to have in it, regardless of whether t is valid, necessary, or stale. One should use observe for a more sensible semantics, reserving node_value for debugging.

module Packed : sig ... end
val pack : _ t -> Packed.t
val save_dot : string -> unit
module Let_syntax : sig ... end
module Before_or_after : sig ... end
module Step_function = Incremental__.Import.Step_function
module Clock : sig ... end
module Expert : sig ... end