BinaryNode

abstract def left: Node

abstract def rebuild(left: Node, right: Node): Self

abstract def right: Node

abstract def withInferredType(scope: Scope, typeChildren: Boolean): Self

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (BinaryNode, B)

final def :@(newType: Type): Self

Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def childNames: Iterable[String]

Names for the child nodes to show in AST dumps.

lazy val children: Seq[Node]

All child nodes of this node.

def clone(): AnyRef

def ensuring(cond: (BinaryNode) ⇒ Boolean, msg: ⇒ Any): BinaryNode

def ensuring(cond: (BinaryNode) ⇒ Boolean): BinaryNode

def ensuring(cond: Boolean, msg: ⇒ Any): BinaryNode

def ensuring(cond: Boolean): BinaryNode

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def getDumpInfo: DumpInfo

Return the name, main info, attribute info and named children

def hasType: Boolean

Check if this node has a type without marking the type as seen.

def hashCode(): Int

final def infer(scope: Scope = Map.empty, typeChildren: Boolean = false): Self

Rebuild this node and all children with their computed type.

final def isInstanceOf[T0]: Boolean

final def mapChildren(f: (Node) ⇒ Node, keepType: Boolean = false): Self

Apply a mapping function to all children of this node and recreate the node with the new children.

final def ne(arg0: AnyRef): Boolean

def nodeType: Type

The current type of this node.

final def notify(): Unit

final def notifyAll(): Unit

def peekType: Type

Get the current type of this node for debug output without marking it as seen.

final def rebuild(ch: IndexedSeq[Node]): Self

Rebuild this node with a new list of children.

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

final def toString(): String

final def untyped: Self

Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def withChildren(ch: IndexedSeq[Node]): Self

Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.

def →[B](y: B): (BinaryNode, B)