LevelBasedTransaction

abstract def beforeDynamicDependencyInteraction(dependency: Levelbased.ReSource): Unit

allow the propagation to handle dynamic access to reactives

abstract def makeDerivedStructState[V](initialValue: V): State[V]

Creates the internal state of Deriveds

abstract def preparationPhase(initialWrites: Set[Levelbased.ReSource]): Unit

Locks (and potentially otherwise prepares) all affected reactive values to prevent interfering changes.

abstract def releasePhase(): Unit

Unlocks (and potentially otherwise reverts the propagation preparations for) each reactive value to allow future turns to run on them.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def access(reactive: Levelbased.ReSource): Value

object accessHandler extends Twoversion.AccessHandler

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def commitDependencyDiff(node: Levelbased.Derived, current: Set[Levelbased.ReSource])(updated: Set[Levelbased.ReSource]): Unit

def commitPhase(): Unit

Commits all uncommitted changes to the reactive element.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evaluate(r: Levelbased.Derived): Unit

Overrides the evaluator, this is essentially an inlined callback

def evaluateIn(head: Levelbased.Derived)(dt: Levelbased.ReevTicket[core.Core.Derived.Value]): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def initializationPhase(initialChanges: Map[Levelbased.ReSource, Levelbased.InitialChange]): Unit

Starts the propagation by applying the initial changes

def initialize(reactive: Levelbased.Derived, incoming: Set[Levelbased.ReSource], needsReevaluation: Boolean): Unit

to be implemented by the propagation algorithm, called when a new reactive has been instantiated and needs to be connected to the graph and potentially reevaluated.

def initializer: Levelbased.Initializer

final def isInstanceOf[T0]: Boolean

lazy val levelQueue: LevelQueue

def makeSourceStructState[V](initialValue: V): State[V]

Creates the internal state of ReSources

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def now[A](reactive: Levelbased.ReadAs[A]): A

def observe(f: Levelbased.Observation): Unit

def observerPhase(): Unit

Call all registered after-commit obverser functions.

val observers: ListBuffer[Levelbased.Observation]

final def prepareInitialChange(ic: Levelbased.InitialChange): Unit

def propagationPhase(): Unit

Performs the actual propagation, setting the new (not yet committed) values for each reactive element.

def register(reactive: Levelbased.ReSource): Unit

hook for schedulers to globally collect all created resources, usually does nothing

def rollbackPhase(): Unit

Reverts all uncommitted changes to the reactive element.

def schedule(commitable: Levelbased.ReSource): Unit

Schedules a temporarily written change to be committed by the turn.

final def synchronized[T0](arg0: ⇒ T0): T0

val toCommit: ListBuffer[Levelbased.ReSource]

def toString(): String

val token: Token

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def writeState(pulsing: Levelbased.ReSource)(value: Value): Unit

def finalize(): Unit