package incremental

You can search for identifiers within the package.

in-package search v0.2.0

Library for incremental computations

Install

md5=c1c01831c72847296ce2569d2cc4372f

sha512=0116a82509c9037529092c5a31bdc8f0c64ed3d4c7a58a67f5250685196c9830e352100c83185bba8b2db949ffc9e3f39a0bbfe14c07e0da63e0302ca24aaa7a

type t = state_witness Incremental.State.t

val sexp_of_t : t -> Sexplib0.Sexp.t

include Core.Invariant.S with type t := t

val invariant : t Base__Invariant_intf.inv

val t : t

t is the shared state for a call to Incremental.Make.

val keep_node_creation_backtrace : t -> bool

val set_keep_node_creation_backtrace : t -> bool -> unit

val max_height_allowed : t -> int

val set_max_height_allowed : t -> int -> unit

val num_active_observers : t -> int

val max_height_seen : t -> int

val num_nodes_became_necessary : t -> int

val num_nodes_became_unnecessary : t -> int

val num_nodes_changed : t -> int

val num_nodes_created : t -> int

val num_nodes_invalidated : t -> int

val num_nodes_recomputed : t -> int

val num_nodes_recomputed_directly_because_one_child : t -> int

val num_nodes_recomputed_directly_because_min_height : t -> int

val num_stabilizes : t -> int

val num_var_sets : t -> int

module Stats : sig ... end

val stats : t -> Stats.t