TypedNode

abstract def children: Seq[Node]

abstract def kind: String

Used in toString representation.

abstract def nextSibling: Option[Node]

abstract def nodeType: Option[NodeType]

abstract def parent: Option[Node]

abstract def previousSibling: Option[Node]

abstract def problem: Option[String]

abstract def span: Span

abstract def token: Option[Token]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def content: String

def elements: Seq[Node]

Total sequence of nodes (flattened)

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evaluate(context: Context, output: Output): Option[Value]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def identifierAt(offset: Int): Option[IdentifiedNode]

final def isInstanceOf[T0]: Boolean

def isLeaf: Boolean

def leafAt(offset: Int): Option[Node]

final def ne(arg0: AnyRef): Boolean

def nextSiblings: Seq[Node]

final def notify(): Unit

final def notifyAll(): Unit

def optimized: Option[String]

def parents: Seq[Node]

def previousSiblings: Seq[Node]

def referenceAt(offset: Int): Option[ReferenceNode]

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

def toString(): String

def translate(className: String, labels: Labels): Code

final def wait(): Unit

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

final def wait(arg0: Long): Unit