Trees

abstract def newLazyTreeCopier: TreeCopier

abstract def newStrictTreeCopier: TreeCopier

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def Apply(sym: Symbol, args: Tree*): Tree

def Bind(sym: Symbol, body: Tree): Bind

def Block(stats: Tree*): Block

Block factory that flattens directly nested blocks.

def CaseDef(pat: Tree, body: Tree): CaseDef

casedef shorthand

def ClassDef(sym: Symbol, impl: Template): ClassDef

def DefDef(sym: Symbol, rhs: (List[List[Symbol]]) ⇒ Tree): DefDef

def DefDef(sym: Symbol, rhs: Tree): DefDef

def DefDef(sym: Symbol, mods: Modifiers, rhs: Tree): DefDef

def DefDef(sym: Symbol, vparamss: List[List[ValDef]], rhs: Tree): DefDef

def DefDef(sym: Symbol, mods: Modifiers, vparamss: List[List[ValDef]], rhs: Tree): DefDef

lazy val EmptyTreeTypeSubstituter: TreeTypeSubstituter

def Ident(sym: Symbol): Ident

def Ident(name: String): Ident

def LabelDef(sym: Symbol, params: List[Symbol], rhs: Tree): LabelDef

def Modifiers(mods: Set[Modifier], privateWithin: Name, annotations: List[Tree]): Modifiers

def Modifiers(flags: Long): Modifiers

def Modifiers(flags: Long, privateWithin: Name): Modifiers

def ModuleDef(sym: Symbol, impl: Template): ModuleDef

def New(tpe: Type, args: Tree*): Tree

def New(sym: Symbol, args: Tree*): Tree

0-1 argument list new, based on a symbol or type.

def New(tpt: Tree, argss: List[List[Tree]]): Tree

lazy val NoMods: Modifiers

def Select(qualifier: Tree, sym: Symbol): Select

def Select(qualifier: Tree, name: String): Select

def Super(sym: Symbol, mix: TypeName): Tree

def This(sym: Symbol): Tree

def TypeDef(sym: Symbol): TypeDef

A TypeDef node which defines abstract type or type parameter for given sym

def TypeDef(sym: Symbol, rhs: Tree): TypeDef

A TypeDef node which defines given sym with given tight hand side rhs.

def TypeTree(tp: Type): TypeTree

def ValDef(sym: Symbol): ValDef

def ValDef(sym: Symbol, rhs: Tree): ValDef

final def asInstanceOf[T0]: T0

def atPos[T <: Tree](pos: Position)(tree: T): T

def clone(): AnyRef

def duplicateTree(tree: Tree): Tree

object emptyValDef extends ValDef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

val treeCopy: TreeCopier

implicit def treeOps(tree: Tree): TreeOps

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def xtransform(transformer: Transformer, tree: Tree): Tree

def xtraverse(traverser: Traverser, tree: Tree): Unit