Entity

abstract def string: String

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def _addChildEntity(e: Entity)(implicit d: variable.DiffList): Unit

def _removeChildEntity(e: Entity)(implicit d: variable.DiffList): Unit

def addedChildHook(entity: Entity)(implicit d: variable.DiffList): Unit

final def asInstanceOf[T0]: T0

object attr

A collection of attributes, keyed by the attribute class.

def changedParentEntityHook(oldEntity: Entity, newEntity: Entity)(implicit d: variable.DiffList): Unit

def childEntities: ChildEntities

def childEntitiesIterator: Iterator[Entity]

def childEntitiesSize: Int

def clone(): AnyRef

final def depth: Int

def descendantsOfClass[A <: Entity](implicit m: ClassTag[A]): Seq[A]

def descendantsOfClass[A <: Entity](cls: Class[A]): Seq[A]

def entityRoot: Entity

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filterDescendants(test: (Entity) ⇒ Boolean): Seq[Entity]

Recursively descend sub-entities and return only those matching criterion

def finalize(): Unit

def getAncestor(numGenerationsBack: Int): Entity

final def getClass(): Class[_]

def hashCode(): Int

def id: Any

def initializeAttributesOfStructure(): Unit

def isConnected: Boolean

final def isInstanceOf[T0]: Boolean

def isLeaf: Boolean

var isObserved: Boolean

def isRoot: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numLeaves: Int

def parentEntity: Entity

def parentEntityOption: Option[Entity]

def parentEntityRef: EntityRef

def removedChildHook(entity: Entity)(implicit d: variable.DiffList): Unit

def safeChildEntitiesSeq: Seq[Entity]

final def setParentEntity(e: Entity)(implicit d: variable.DiffList): Unit

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