scala.tools.nsc.ast.parser.TreeBuilder

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

TreeBuilder
AnyRef
Any

Visibility

Public
All

Instance Constructors

new TreeBuilder ()

Type Members

class Enumerator extends AnyRef

Attributes
abstract
case class Filter (pos: Position, test: Tree) extends Enumerator with Product with Serializable
class GetVarTraverser extends Traverser

Traverse pattern and collect all variable names with their types in buffer The variables keep their positions; whereas the pattern is converted to be synthetic for all nodes that contain a variable position.
case class ValEq (pos: Position, pat: Tree, rhs: Tree) extends Enumerator with Product with Serializable
case class ValFrom (pos: Position, pat: Tree, rhs: Tree) extends Enumerator with Product with Serializable

Abstract Value Members

def freshName (prefix: String): Name

Attributes
abstract
def freshTermName (prefix: String): TermName

Attributes
abstract
def freshTypeName (prefix: String): TypeName

Attributes
abstract
val global : Global

Attributes
abstract
def o2p (offset: Int): Position

Attributes
abstract
def r2p (start: Int, point: Int, end: Int): Position

Attributes
abstract

Concrete Value Members

def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def != (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def ## (): Int

Attributes
final
Definition Classes
AnyRef → Any
def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def == (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def addEvidenceParams (owner: Name, vparamss: List[List[ValDef]], contextBounds: List[Tree]): List[List[ValDef]]

Append implicit parameter section if contextBounds' nonempty
def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
def byNameApplication (tpe: Tree): Tree
def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def convertToTypeName (t: Tree): Option[RefTree]
def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def equals (arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize (): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def freshName (): Name
def freshTermName (): TermName
def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
def hashCode (): Int

Definition Classes
AnyRef → Any
def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
def makeAlternative (ts: List[Tree]): Tree

Create tree for a pattern alternative
def makeAnnotated (t: Tree, annot: Tree): Tree
def makeAssign (lhs: Tree, rhs: Tree): Tree

Create a tree representing an assignment <lhs = rhs>
def makeBinop (isExpr: Boolean, left: Tree, op: TermName, right: Tree, opPos: Position): Tree

Create tree representing (unencoded) binary operation expression or pattern.
def makeBlock (stats: List[Tree]): Tree

Create block of statements stats'
def makeCaseDef (pat: Tree, guard: Tree, rhs: Tree): CaseDef

Create tree for case definition <case pat if guard => rhs>
def makeCatchFromExpr (catchExpr: Tree): CaseDef

Creates tree representing: { case x: Throwable => val catchFn = catchExpr if (catchFn isDefinedAt x) catchFn(x) else throw x }
def makeDoWhile (lname: TermName, body: Tree, cond: Tree): Tree

Create tree representing a do-while loop
def makeFor (enums: List[Enumerator], body: Tree): Tree

Create tree for for-do comprehension <for (enums) body>
def makeForYield (enums: List[Enumerator], body: Tree): Tree

Create tree for for-yield comprehension <for (enums) yield body>
def makeFunctionTypeTree (argtpes: List[Tree], restpe: Tree): Tree

Create a tree representing the function type (argtpes) => restpe
def makeGenerator (pos: Position, pat: Tree, valeq: Boolean, rhs: Tree): Enumerator

Create tree for for-comprehension generator <val pat0 <- rhs0>
def makeImportSelector (name: Name, nameOffset: Int): ImportSelector
def makeIntersectionTypeTree (tps: List[Tree]): Tree

A type tree corresponding to (possibly unary) intersection type
def makeLifted (gs: List[ValFrom], body: Tree): Tree

Create tree for a lifted expression XX-LIFTING
def makeNew (parents: List[Tree], self: ValDef, stats: List[Tree], argss: List[List[Tree]], npos: Position, cpos: Position): Tree

Create positioned tree representing an object creation <new parents { stats }
Create positioned tree representing an object creation <new parents { stats }
npos
the position of the new
cpos
the position of the anonymous class starting with parents
def makeParam (pname: TermName, tpe: Tree): ValDef
def makePatDef (mods: Modifiers, pat: Tree, rhs: Tree): List[Tree]

Create tree for pattern definition <mods val pat0 = rhs>
def makePatDef (pat: Tree, rhs: Tree): List[Tree]

Create tree for pattern definition <val pat0 = rhs>
def makeSelfDef (name: TermName, tpt: Tree): ValDef
def makeSequencedMatch (selector: Tree, cases: List[CaseDef]): Tree

For debugging only.
For debugging only. Desugar a match statement like so: val x = scrutinee x match { case case1 => ... case _ => x match { case case2 => ... case _ => x match ... } }
This way there are never transitions between nontrivial casedefs. Of course many things break: exhaustiveness and unreachable checking do not work, no switches will be generated, etc.
def makeSyntheticParam (pname: TermName): ValDef
def makeSyntheticTypeParam (pname: TypeName, bounds: Tree): TypeDef
def makeTupleTerm (trees: List[Tree], flattenUnary: Boolean): Tree
def makeTupleType (trees: List[Tree], flattenUnary: Boolean): Tree
def makeVisitor (cases: List[CaseDef], checkExhaustive: Boolean, prefix: String): Tree

Create visitor <x => x match cases>
def makeVisitor (cases: List[CaseDef], checkExhaustive: Boolean): Tree

Create visitor <x => x match cases>
def makeWhile (lname: TermName, cond: Tree, body: Tree): Tree

Create tree representing a while loop
def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def notify (): Unit

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
def productConstr : Select
def repeatedApplication (tpe: Tree): Tree
def rootId (name: Name): Select
def rootScalaDot (name: Name): Select
def scalaAnyRefConstr : Select
def scalaDot (name: Name): Select
def scalaScalaObjectConstr : Select
def scalaUnitConstr : Select
def serializableConstr : Select
def stripParens (t: Tree): Tree
def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
def toString (): String

Definition Classes
AnyRef → Any
def wait (): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long, arg1: Int): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()

TreeBuilder

class TreeBuilder extends AnyRef

Instance Constructors

new TreeBuilder ()

Type Members

class Enumerator extends AnyRef

case class Filter (pos: Position, test: Tree) extends Enumerator with Product with Serializable

class GetVarTraverser extends Traverser

case class ValEq (pos: Position, pat: Tree, rhs: Tree) extends Enumerator with Product with Serializable

case class ValFrom (pos: Position, pat: Tree, rhs: Tree) extends Enumerator with Product with Serializable

Abstract Value Members

def freshName (prefix: String): Name

def freshTermName (prefix: String): TermName

def freshTypeName (prefix: String): TypeName

val global : Global

def o2p (offset: Int): Position

def r2p (start: Int, point: Int, end: Int): Position

Concrete Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def addEvidenceParams (owner: Name, vparamss: List[List[ValDef]], contextBounds: List[Tree]): List[List[ValDef]]

def asInstanceOf [T0] : T0

def byNameApplication (tpe: Tree): Tree

def clone (): AnyRef

def convertToTypeName (t: Tree): Option[RefTree]

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

def freshName (): Name

def freshTermName (): TermName

def getClass (): java.lang.Class[_]

def hashCode (): Int

def isInstanceOf [T0] : Boolean

def makeAlternative (ts: List[Tree]): Tree

def makeAnnotated (t: Tree, annot: Tree): Tree

def makeAssign (lhs: Tree, rhs: Tree): Tree

def makeBinop (isExpr: Boolean, left: Tree, op: TermName, right: Tree, opPos: Position): Tree

def makeBlock (stats: List[Tree]): Tree

def makeCaseDef (pat: Tree, guard: Tree, rhs: Tree): CaseDef

def makeCatchFromExpr (catchExpr: Tree): CaseDef

def makeDoWhile (lname: TermName, body: Tree, cond: Tree): Tree

def makeFor (enums: List[Enumerator], body: Tree): Tree

def makeForYield (enums: List[Enumerator], body: Tree): Tree

def makeFunctionTypeTree (argtpes: List[Tree], restpe: Tree): Tree

def makeGenerator (pos: Position, pat: Tree, valeq: Boolean, rhs: Tree): Enumerator

def makeImportSelector (name: Name, nameOffset: Int): ImportSelector

def makeIntersectionTypeTree (tps: List[Tree]): Tree

def makeLifted (gs: List[ValFrom], body: Tree): Tree

def makeNew (parents: List[Tree], self: ValDef, stats: List[Tree], argss: List[List[Tree]], npos: Position, cpos: Position): Tree

def makeParam (pname: TermName, tpe: Tree): ValDef

def makePatDef (mods: Modifiers, pat: Tree, rhs: Tree): List[Tree]

def makePatDef (pat: Tree, rhs: Tree): List[Tree]

def makeSelfDef (name: TermName, tpt: Tree): ValDef

def makeSequencedMatch (selector: Tree, cases: List[CaseDef]): Tree

def makeSyntheticParam (pname: TermName): ValDef

def makeSyntheticTypeParam (pname: TypeName, bounds: Tree): TypeDef

def makeTupleTerm (trees: List[Tree], flattenUnary: Boolean): Tree

def makeTupleType (trees: List[Tree], flattenUnary: Boolean): Tree

def makeVisitor (cases: List[CaseDef], checkExhaustive: Boolean, prefix: String): Tree

def makeVisitor (cases: List[CaseDef], checkExhaustive: Boolean): Tree

def makeWhile (lname: TermName, cond: Tree, body: Tree): Tree

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

def productConstr : Select

def repeatedApplication (tpe: Tree): Tree

def rootId (name: Name): Select

def rootScalaDot (name: Name): Select

def scalaAnyRefConstr : Select

def scalaDot (name: Name): Select

def scalaScalaObjectConstr : Select

def scalaUnitConstr : Select

def serializableConstr : Select

def stripParens (t: Tree): Tree

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

def toString (): String

def wait (): Unit