SeqCell

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addDependent[T <: Dependent](dep: T): T

Add a Dependent to this cell.

final def asInstanceOf[T0]: T0

val cells: Cell[T]*

def clone(): AnyRef

def currentValue: (Seq[T], Long)

The cell's value and most recent change time

def dependents: Seq[Dependent]

Get a List of the Dependents

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def get: Seq[T]

Get the cell's value

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def lift[A, B](cell: Cell[B])(f: (Seq[T], B) ⇒ A): Cell[A]

def lift[A](f: (Seq[T]) ⇒ A): Cell[A]

Create a new Cell by applying the function to this cell

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def notifyDependents(): Unit

Notify dependents of a state change.

def predicateChanged(which: Cell[_]): Unit

If the predicate cell changes, the Dependent will be notified

def removeDependent[T <: Dependent](dep: T): T

Remove a Dependent to this cell.

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

def unregisterFromAllDependencies(): Unit

Remove from all dependencies

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def whoDoIDependOn: Seq[Cell[_]]

Get a list of all the cells this Dependency depends on

def youDependOnMe(who: Cell[_]): Unit

The Cell notifies the Dependent of the dependency

def youDontDependOnMe(who: Cell[_]): Unit

The Cell notifies the Dependent of the removed dependency

def unregisterFromAllDepenencies(): Unit