CompNode

abstract def canEqual(that: Any): Boolean

abstract def id: Int

unique identifier for this computation node

abstract def productArity: Int

abstract def productElement(n: Int): Any

abstract def sinks: Seq[Sink]

abstract def updateSinks(f: (Seq[Sink]) ⇒ Seq[Sink]): C

abstract def wf: WireReaderWriter

object defining how to serialise / deserialise data for that node

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ->[T, U](a: (T) ⇒ U)(implicit b: (CompNode.this.type) ⇒ T): U

final def ->[U](a: (CompNode.this.type) ⇒ U): U

final def ==(arg0: Any): Boolean

def addSink(sink: Sink): C

final def asInstanceOf[T0]: T0

def children: Iterator[Attributable]

def clone(): Attributable

final def eq(arg0: AnyRef): Boolean

def equals(a: Any): Boolean

def finalize(): Unit

def firstChild[T]: T

final def getClass(): Class[_]

def hasCheckpoint: Boolean

def hasChildren: Boolean

def hashCode(): Int

var index: Int

def initTreeProperties(): Unit

def isFirst: Boolean

final def isInstanceOf[T0]: Boolean

def isLast: Boolean

def isRoot: Boolean

def lastChild[T]: T

final def ne(arg0: AnyRef): Boolean

def next[T]: T

var next: Attributable

final def notify(): Unit

final def notifyAll(): Unit

def parent[T]: T

var parent: Attributable

def prev[T]: T

var prev: Attributable

def productIterator: Iterator[Any]

def productPrefix: String

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit