BinaryNode

abstract def left: Node

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

abstract def nodeWithComputedType2(scope: SymbolScope = SymbolScope.empty, typeChildren: Boolean = false, retype: Boolean = false): Self

abstract def right: Node

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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 hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def nodeBuildTypedNode[T >: BinaryNode.this.type <: Node](newNode: T, newType: Type): T

def nodeChildNames: Iterable[String]

Names for the child nodes to show in AST dumps.

lazy val nodeChildren: Seq[Node]

All child nodes of this node.

def nodeHasType: Boolean

final def nodeMapChildren(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.

def nodePeekType: Type

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

Rebuild this node with a new list of children.

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

Rebuild this node with a new list of children unless all children are identical to the current ones.

def nodeRebuildWithType(tpe: Type): Self

def nodeType: Type

The current type of this node

final def nodeTyped(tpe: Type): BinaryNode.this.type

Return this Node with a Type assigned.

final def nodeTypedOrCopy(tpe: 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 nodeUntypedOrCopy: Self

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

final def nodeWithComputedType(scope: SymbolScope = SymbolScope.empty, typeChildren: Boolean = false, retype: Boolean = false): Self

Rebuild this node and all children with their computed type.

final def notify(): Unit

final def notifyAll(): Unit

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

final def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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