SidupInitializer

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def initialize(reactive: Sidup.Derived, incoming: Set[Sidup.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.

final def isInstanceOf[T0]: Boolean

def makeDerivedStructState[V](initialValue: V): SidupState[V]

Creates the internal state of Deriveds

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

def register(reactive: of[State], inputs: Set[of[State]]): Unit

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

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit