treehuggerDSL

Type Members

class AnnotationInfoStart extends AnyRef
class AnonFuncStart extends TreeDefStart[Forest.AnonFunc, Forest.Tree] with TptStart with VparamssStart
case class CaseStart(pat: Forest.Tree, guard: Forest.Tree) extends Product with Serializable
class ClassDefStart extends TreeDefStart[Forest.ClassDef, Forest.Tree] with TparamsStart with ParentsStart
case class ContextBoundsStart(typcon: Forest.Type) extends TypeBoundsStart with Product with Serializable
trait DefCreator extends AnyRef
trait DefStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends AnyRef
class DefSymStart extends SymVODDStart[Forest.DefDef, Forest.Tree] with DefCreator with TparamsStart with VparamssStart
class DefTreeStart extends TreeVODDStart[Forest.DefDef] with DefCreator with TparamsStart with VparamssStart
case class ForStart(enums: List[Forest.Enumerator]) extends Product with Serializable
class ForValFromStart extends TreeVODDStart[Forest.ForValFrom]
case class IfStart(cond: Forest.Tree, thenp: Forest.Tree) extends Product with Serializable
class ImportSelectorStart extends AnyRef
case class InfixStart(target: Forest.Tree, name: Forest.Name) extends Product with Serializable
case class InfixSymStart(target: Forest.Tree, sym: Forest.Symbol) extends Product with Serializable
case class LowerTypeBoundsStart(lo: Forest.Type) extends TypeBoundsStart with Product with Serializable
class ModuleDefStart extends TreeDefStart[Forest.ModuleDef, Forest.Tree] with ParentsStart
class NoBlockDefSymStart extends DefSymStart
class NoBlockDefTreeStart extends DefTreeStart
case class PRIVATEWITHIN(name: Forest.Name) extends Product with Serializable
trait PackageCreator extends TreeDefStart[Forest.PackageDef, Forest.Tree]
class PackageDefStart extends PackageCreator
class PackageSymStart extends PackageCreator
trait ParentsStart extends AnyRef
trait ProcCreator extends AnyRef
class ProcSymStart extends DefStart[Forest.ProcDef, Forest.Block] with ProcCreator with TparamsStart with VparamssStart
class ProcTreeStart extends TreeDefStart[Forest.ProcDef, Forest.Block] with ProcCreator with TparamsStart with VparamssStart
case class SelectStart(tree: Forest.Select) extends Product with Serializable
case class SuperStart(tree: Forest.Super) extends Product with Serializable
trait SymVODDStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends VODDStart[ResultTreeType, RhsTreeType]
class SymbolMethods extends AnyRef
trait TparamsStart extends AnyRef
trait TptStart extends AnyRef
class TraitDefStart extends ClassDefStart
trait TreeDefStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends DefStart[ResultTreeType, RhsTreeType]
class TreeMethods extends AnyRef
trait TreeVODDStart[ResultTreeType <: Forest.Tree] extends VODDStart[ResultTreeType, Forest.Tree] with TreeDefStart[ResultTreeType, Forest.Tree]
case class TryStart(body: Forest.Tree, catches: List[Forest.CaseDef], fin: Forest.Tree) extends Product with Serializable
sealed trait TypeBoundsStart extends AnyRef
trait TypeDefStart extends TreeDefStart[Forest.TypeDef, Forest.Tree] with TparamsStart
class TypeDefSymStart extends TypeDefStart
class TypeDefTreeStart extends TypeDefStart
class TypeMethods extends AnyRef
case class UpperTypeBoundsStart(hi: Forest.Type) extends TypeBoundsStart with Product with Serializable
trait VODDStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends DefStart[ResultTreeType, RhsTreeType] with TptStart

VODD, if it is not obvious, means ValOrDefDef.
VODD, if it is not obvious, means ValOrDefDef. This is the common code between a tree based on a pre-existing symbol and one being built from scratch.
trait ValCreator extends AnyRef
class ValNameStart extends TreeVODDStart[Forest.ValDef] with ValCreator
class ValSymStart extends SymVODDStart[Forest.ValDef, Forest.Tree] with ValCreator
class ValTreeStart extends TreeVODDStart[Forest.ValDef] with ValCreator
case class ViewBoundsStart(target: Forest.Type) extends TypeBoundsStart with Product with Serializable
trait VparamssStart extends AnyRef
case class WhileStart(cond: Forest.Tree) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
def AND(guards: Iterable[Forest.Tree]): Forest.Tree
def AND(guards: Forest.Tree*): Forest.Tree
def ANNOT(typ: Forest.Type, args: Iterable[Forest.Tree]): Forest.AnnotationInfo
def ANNOT(typ: Forest.Type, args: Forest.Tree*): Forest.AnnotationInfo
def ANONDEF(trees: Forest.Tree*): ClassDefStart
def ANONDEF(parents: Iterable[Forest.Type]): ClassDefStart
def ANONDEF(parent0: Forest.Type, parents: Forest.Type*): ClassDefStart
def ARRAY(xs: Iterable[Forest.Tree]): Forest.Tree
def ARRAY(xs: Forest.Tree*): Forest.Tree
def BACKQUOTED(name: Forest.Name): Forest.BackQuotedIdent
def BACKQUOTED(sym: Forest.Symbol): Forest.BackQuotedIdent
def BLOCK(xs: Forest.Tree*): Forest.Block
def BLOCK(xs: Iterable[Forest.Tree]): Forest.Block
def CASE(pat: Forest.Tree, ifs: IfStart): CaseStart
def CASE(pat: Forest.Tree): CaseStart
def CASECLASSDEF(sym: Forest.Symbol): ClassDefStart
def CASECLASSDEF(name: Forest.Name): ClassDefStart
def CASEOBJECTDEF(sym: Forest.Symbol): ModuleDefStart
def CASEOBJECTDEF(name: Forest.Name): ModuleDefStart
def CLASSDEF(sym: Forest.Symbol): ClassDefStart
def CLASSDEF(name: Forest.Name): ClassDefStart
def CONTRAVARIANT(symbol: Forest.Symbol): Forest.Symbol
def CONTRAVARIANT(name: Forest.Name): Forest.Name
def COVARIANT(symbol: Forest.Symbol): Forest.Symbol
def COVARIANT(name: Forest.Name): Forest.Name
def DEF(sym: Forest.Symbol): NoBlockDefSymStart
def DEF(sym: Forest.Symbol, tp: Forest.Type): DefSymStart
def DEF(name: Forest.Name): NoBlockDefTreeStart
def DEF(name: Forest.Name, tp: Forest.Type): DefTreeStart
def DEFAULT: CaseStart
def DEFINFER(name: Forest.Name): DefTreeStart
def DEFINFER(sym: Forest.Symbol): DefSymStart
def DEFTHIS: DefTreeStart
val FALSE: Forest.Literal
def FOR(xs: Iterable[Forest.Enumerator]): ForStart
def FOR(xs: Forest.Enumerator*): ForStart
def ID(name: Forest.Name): Forest.Ident
def ID(sym: Forest.Symbol): Forest.Tree
def IF(tree: Forest.Tree): IfStart
def IMPORT(expr: Forest.Tree, selectors: Iterable[Forest.ImportSelector]): Forest.Import
def IMPORT(expr: Forest.Tree, selectors: Forest.ImportSelector*): Forest.Import
def IMPORT(sym: Forest.Symbol, selectors: Iterable[Forest.ImportSelector]): Forest.Import
def IMPORT(sym: Forest.Symbol, selectors: Forest.ImportSelector*): Forest.Import
def IMPORT(pck: Forest.Name, selectors: Iterable[Forest.ImportSelector]): Forest.Import
def IMPORT(pck: Forest.Name, selectors: Forest.ImportSelector*): Forest.Import
def INFIX_CHAIN(sym: Forest.Symbol, trees: Iterable[Forest.Tree]): Forest.Tree
def INFIX_CHAIN(sym: Forest.Symbol, tree: Forest.Tree, trees: Forest.Tree*): Forest.Tree
def INFIX_CHAIN(name: Forest.Name, trees: Iterable[Forest.Tree]): Forest.Tree
def INFIX_CHAIN(name: Forest.Name, tree: Forest.Tree, trees: Forest.Tree*): Forest.Tree
def INTERP(name: Forest.Name, args: Forest.Tree*): Forest.Interpolated
def INTERP(sym: Forest.Symbol, args: Forest.Tree*): Forest.Interpolated
def LAMBDA(param: Iterable[Forest.ValDef]): AnonFuncStart
def LAMBDA(param: Forest.ValDef*): AnonFuncStart
def LAZYVAL(sym: Forest.Symbol): ValSymStart
def LAZYVAL(sym: Forest.Symbol, tp: Forest.Type): ValSymStart
def LAZYVAL(name: Forest.Name): ValNameStart
def LAZYVAL(name: Forest.Name, tp: Forest.Type): ValNameStart
def LEFT(tree: Forest.Tree): Forest.Tree
def LIST(xs: Iterable[Forest.Tree]): Forest.Tree
def LIST(xs: Forest.Tree*): Forest.Tree
object LIT extends (Any) ⇒ Forest.Literal
def MAKE_MAP(xs: Iterable[Forest.Tree]): Forest.Tree
def MAKE_MAP(xs: Forest.Tree*): Forest.Tree
def MATCHERROR(arg: Forest.Tree): Forest.Throw

Top level accessible.
def MINUS(tree: Forest.Tree): Forest.Select
def NEW(tpt: Forest.Tree, args: Forest.Tree*): Forest.Tree
def NEW(tp: Forest.Type, args: Forest.Tree*): Forest.Tree
val NIL: Forest.Tree
val NONE: Forest.Tree
def NOT(tree: Forest.Tree): Forest.Select
def NULL: Forest.Literal
def OBJECTDEF(sym: Forest.Symbol): ModuleDefStart
def OBJECTDEF(name: Forest.Name): ModuleDefStart
def OR(guards: Iterable[Forest.Tree]): Forest.Tree
def OR(guards: Forest.Tree*): Forest.Tree
def PACKAGE(sym: Forest.Symbol): PackageSymStart
def PACKAGE(name: Forest.Name): PackageDefStart
def PACKAGEHEADER(sym: Forest.Symbol): PackageSymStart
def PACKAGEHEADER(name: Forest.Name): PackageDefStart
def PACKAGEOBJECTDEF(sym: Forest.Symbol): ModuleDefStart
def PACKAGEOBJECTDEF(name: Forest.Name): ModuleDefStart
def PARAM(tree: Forest.Tree): ValTreeStart
def PARAM(sym: Forest.Symbol): ValSymStart
def PARAM(sym: Forest.Symbol, tp: Forest.Type): ValSymStart
def PARAM(name: Forest.Name): ValNameStart
def PARAM(name: Forest.Name, tp: Forest.Type): ValNameStart
def PAREN(trees: Iterable[Forest.Tree]): Forest.Tree
def PAREN(trees: Forest.Tree*): Forest.Tree
val PARTIALLY: Forest.Ident
def PLUS(tree: Forest.Tree): Forest.Select
def PROC(sym: Forest.Symbol): ProcSymStart
def PROC(name: Forest.Name): ProcTreeStart
def REF(name: Forest.Name): Forest.Ident
def REF(pre: Forest.Type, sym: Forest.Symbol): Forest.Tree
def REF(sym: Forest.Symbol): Forest.Tree
def RENAME(name: Forest.TermName): ImportSelectorStart
def RETURN(tree: Forest.Tree): Forest.Return
def RIGHT(tree: Forest.Tree): Forest.Tree
def SEQ(xs: Iterable[Forest.Tree]): Forest.Tree
def SEQ(xs: Forest.Tree*): Forest.Tree
def SEQARG(tree: Forest.Tree): Forest.Typed
val SEQ_WILDCARD: Forest.Ident
def SOME(xs: Iterable[Forest.Tree]): Forest.Tree
def SOME(xs: Forest.Tree*): Forest.Tree
def SUPER(name: Forest.Name): SuperStart
def SUPER(sym: Forest.Symbol): SuperStart
val SUPER: SuperStart
def THIS: Forest.This
def THIS(name: Forest.Name): Forest.This
def THIS(sym: Forest.Symbol): Forest.Tree

Typed trees from symbols.
def THROW(tree: Forest.Tree): Forest.Throw
def THROW(typ: Forest.Type, msg: Forest.Tree): Forest.Throw
def THROW(typ: Forest.Type, msg: String): Forest.Throw
def THROW(typ: Forest.Type): Forest.Throw

!!! should generalize null guard from match error here.
def TILDE(tree: Forest.Tree): Forest.Select
def TRAITDEF(sym: Forest.Symbol): ClassDefStart
def TRAITDEF(name: Forest.Name): ClassDefStart
val TRUE: Forest.Literal
def TRY(xs: Iterable[Forest.Tree]): TryStart
def TRY(xs: Forest.Tree*): TryStart
def TUPLE(trees: Iterable[Forest.Tree], flattenUnary: Boolean = false): Forest.Tree
def TUPLE(trees: Forest.Tree*): Forest.Tree
def TYPEVAR(sym: Forest.Symbol): TypeDefSymStart
def TYPEVAR(name: Forest.Name): TypeDefTreeStart
def TYPE_*(typ: Forest.Type): Forest.Type
def TYPE_<%<(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_<:<(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_=:=(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_ARRAY(typ: Forest.Type): Forest.Type
def TYPE_BYNAME(typ: Forest.Type): Forest.Type
def TYPE_EITHER(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_FUNCTION(typs: Iterable[Forest.Type]): Forest.Type
def TYPE_FUNCTION(typs: Forest.Type*): Forest.Type
def TYPE_FUNCTION(args: Iterable[Forest.Type], result: Forest.Type): Forest.Type
def TYPE_ITERATOR(typ: Forest.Type): Forest.Type
def TYPE_LEFT(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_LIST(typ: Forest.Type): Forest.Type
def TYPE_MAP(k: Forest.Type, v: Forest.Type): Forest.Type
def TYPE_OPTION(typ: Forest.Type): Forest.Type
def TYPE_ORDERED(typ: Forest.Type): Forest.Type
def TYPE_REF(tree: Forest.Tree): Forest.Type
def TYPE_REF(name: Forest.Name): Forest.Type
def TYPE_REF(sym: Forest.Symbol): Forest.Type
def TYPE_RIGHT(arg1: Forest.Type, arg2: Forest.Type): Forest.Type
def TYPE_SEQ(typ: Forest.Type): Forest.Type
def TYPE_SET(typ: Forest.Type): Forest.Type
def TYPE_SINGLETON(tree: Forest.Tree): Forest.Type
def TYPE_SOME(typ: Forest.Type): Forest.Type
def TYPE_STRUCT(tree: Iterable[Forest.Tree]): Forest.Type
def TYPE_STRUCT(tree: Forest.Tree*): Forest.Type
def TYPE_TUPLE(typs: Iterable[Forest.Type]): Forest.Type
def TYPE_TUPLE(typs: Forest.Type*): Forest.Type
def TYPE_VECTOR(typ: Forest.Type): Forest.Type
def UNIT: Forest.Literal
def VAL(tree: Forest.Tree): ValTreeStart
def VAL(sym: Forest.Symbol): ValSymStart
def VAL(sym: Forest.Symbol, tp: Forest.Type): ValSymStart
def VAL(name: Forest.Name): ValNameStart
def VAL(name: Forest.Name, tp: Forest.Type): ValNameStart
def VALFROM(name: Forest.Name): ForValFromStart
def VALFROM(name: Forest.Name, tp: Forest.Type): ForValFromStart
def VAR(tree: Forest.Tree): ValTreeStart
def VAR(sym: Forest.Symbol): ValSymStart
def VAR(sym: Forest.Symbol, tp: Forest.Type): ValSymStart
def VAR(name: Forest.Name): ValNameStart
def VAR(name: Forest.Name, tp: Forest.Type): ValNameStart
def VECTOR(xs: Iterable[Forest.Tree]): Forest.Tree
def VECTOR(xs: Forest.Tree*): Forest.Tree
def WHILE(tree: Forest.Tree): WhileStart
object WILD
val WILDCARD: Forest.Ident
val ZERO: Forest.Literal
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fn(lhs: Forest.Tree, op: Forest.Symbol, args: Forest.Tree*): Forest.Tree with Serializable
def fn(lhs: Forest.Tree, op: Forest.Name, args: Forest.Tree*): Forest.Tree with Serializable
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def infix(lhs: Forest.Tree, op: Forest.Symbol, args: Forest.Tree*): Forest.Infix
def infix(lhs: Forest.Tree, op: Forest.Name, args: Forest.Tree*): Forest.Infix
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def makePathType(tree: Forest.Tree): Forest.Type
def makeRefinedType(args: List[Forest.Type]): Forest.Type
def makeStructuralType(trees: List[Forest.Tree]): Forest.Type
def makeTupleType(trees: List[Forest.Tree], flattenUnary: Boolean = false): Forest.Tree
implicit def mkDocElementFromString(str: String): Forest.DocElement
implicit def mkEnumeratorFromIfStart(ifs: IfStart): Forest.Enumerator
implicit def mkEnumeratorFromValDef(tree: Forest.ValDef): Forest.Enumerator
implicit def mkImportSelectorFromString(name: String): Forest.ImportSelector
def mkInfixAnd(lhs: Forest.Tree, rhs: Forest.Tree): Forest.Infix
def mkInfixOr(lhs: Forest.Tree, rhs: Forest.Tree): Forest.Infix
implicit def mkSeqImportSelectorFromCandidates[A, M[A] <: Iterable[A]](in: M[A])(implicit arg0: (A) ⇒ Forest.ImportSelector): Seq[Forest.ImportSelector]
implicit def mkSeqTreeFromCandidates[A, M[A] <: Iterable[A]](in: M[A])(implicit arg0: (A) ⇒ Forest.Tree): Seq[Forest.Tree]
implicit def mkSeqTreeFromDefStarts[A <: Forest.Tree, M[A] <: Iterable[A], B <: Forest.Tree](in: M[DefStart[A, B]]): Seq[A]
implicit def mkSeqTreeFromSelectStarts[M[A] <: Iterable[A]](in: M[SelectStart]): Seq[Forest.Select]
implicit def mkSeqTreeFromSuperStarts[M[A] <: Iterable[A]](in: M[SuperStart]): Seq[Forest.Super]
implicit def mkSeqTypeDefFromCandidates[A <: TypeDefStart, M[A] <: Iterable[A]](in: M[A]): Seq[Forest.TypeDef]
implicit def mkSeqTypeFromCandidates[A, M[A] <: Iterable[A]](in: M[A])(implicit arg0: (A) ⇒ Forest.Type): Seq[Forest.Type]
implicit def mkSeqTypeTreeFromCandidates[M[A] <: Iterable[A]](in: M[Forest.Type]): Seq[Forest.TypeTree]
implicit def mkSymbolMethodsFromSymbol(target: Forest.Symbol): SymbolMethods
implicit def mkTreeFromDefStart[A <: Forest.Tree, B <: Forest.Tree](start: DefStart[A, B]): A
implicit def mkTreeFromSelectStart(ss: SelectStart): Forest.Select

(foo DOT bar) might be simply a Select, but more likely it is to be immediately followed by an Apply.
(foo DOT bar) might be simply a Select, but more likely it is to be immediately followed by an Apply. We don't want to add an actual apply method to arbitrary trees, so SelectStart is created with an apply - and if apply is not the next thing called, the implicit from SelectStart -> Tree will provide the tree.
implicit def mkTreeFromSuperStart(ss: SuperStart): Forest.Super

(SUPER) might be simply a Super.
implicit def mkTreeFromType(typ: Forest.Type): Forest.TypeTree
implicit def mkTreeFromTypeDefStart(tds: TypeDefStart): Forest.TypeDef
implicit def mkTreeMethods(target: Forest.Tree): TreeMethods
implicit def mkTreeMethodsFromSelectStart(ss: SelectStart): TreeMethods
implicit def mkTreeMethodsFromSuperStart(target: SuperStart): TreeMethods
implicit def mkTreeMethodsFromSymbol(target: Forest.Symbol): TreeMethods
implicit def mkTreeMethodsFromType(target: Forest.Type): TreeMethods
implicit def mkTypeFromString(str: String): Forest.Type
implicit def mkTypeFromSymbol(sym: Forest.Symbol): Forest.Type
implicit def mkTypeMethods(target: Forest.Type): TypeMethods

Implicits - some of these should probably disappear *
implicit def mkTypeMethodsFromSymbol(sym: Forest.Symbol): TypeMethods
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def nullSafe[T](f: (Forest.Tree) ⇒ Forest.Tree, ifNull: Forest.Tree): (Forest.Tree) ⇒ Forest.Tree
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package TreehuggerDSLs

object treehuggerDSL

Type Members

class AnnotationInfoStart extends AnyRef

class AnonFuncStart extends TreeDefStart[Forest.AnonFunc, Forest.Tree] with TptStart with VparamssStart

case class CaseStart(pat: Forest.Tree, guard: Forest.Tree) extends Product with Serializable

class ClassDefStart extends TreeDefStart[Forest.ClassDef, Forest.Tree] with TparamsStart with ParentsStart

case class ContextBoundsStart(typcon: Forest.Type) extends TypeBoundsStart with Product with Serializable

trait DefCreator extends AnyRef

trait DefStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends AnyRef

class DefSymStart extends SymVODDStart[Forest.DefDef, Forest.Tree] with DefCreator with TparamsStart with VparamssStart

class DefTreeStart extends TreeVODDStart[Forest.DefDef] with DefCreator with TparamsStart with VparamssStart

case class ForStart(enums: List[Forest.Enumerator]) extends Product with Serializable

class ForValFromStart extends TreeVODDStart[Forest.ForValFrom]

case class IfStart(cond: Forest.Tree, thenp: Forest.Tree) extends Product with Serializable

class ImportSelectorStart extends AnyRef

case class InfixStart(target: Forest.Tree, name: Forest.Name) extends Product with Serializable

case class InfixSymStart(target: Forest.Tree, sym: Forest.Symbol) extends Product with Serializable

case class LowerTypeBoundsStart(lo: Forest.Type) extends TypeBoundsStart with Product with Serializable

class ModuleDefStart extends TreeDefStart[Forest.ModuleDef, Forest.Tree] with ParentsStart

class NoBlockDefSymStart extends DefSymStart

class NoBlockDefTreeStart extends DefTreeStart

case class PRIVATEWITHIN(name: Forest.Name) extends Product with Serializable

trait PackageCreator extends TreeDefStart[Forest.PackageDef, Forest.Tree]

class PackageDefStart extends PackageCreator

class PackageSymStart extends PackageCreator

trait ParentsStart extends AnyRef

trait ProcCreator extends AnyRef

class ProcSymStart extends DefStart[Forest.ProcDef, Forest.Block] with ProcCreator with TparamsStart with VparamssStart

class ProcTreeStart extends TreeDefStart[Forest.ProcDef, Forest.Block] with ProcCreator with TparamsStart with VparamssStart

case class SelectStart(tree: Forest.Select) extends Product with Serializable

case class SuperStart(tree: Forest.Super) extends Product with Serializable

trait SymVODDStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends VODDStart[ResultTreeType, RhsTreeType]

class SymbolMethods extends AnyRef

trait TparamsStart extends AnyRef

trait TptStart extends AnyRef

class TraitDefStart extends ClassDefStart

trait TreeDefStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends DefStart[ResultTreeType, RhsTreeType]

class TreeMethods extends AnyRef

trait TreeVODDStart[ResultTreeType <: Forest.Tree] extends VODDStart[ResultTreeType, Forest.Tree] with TreeDefStart[ResultTreeType, Forest.Tree]

case class TryStart(body: Forest.Tree, catches: List[Forest.CaseDef], fin: Forest.Tree) extends Product with Serializable

sealed trait TypeBoundsStart extends AnyRef

trait TypeDefStart extends TreeDefStart[Forest.TypeDef, Forest.Tree] with TparamsStart

class TypeDefSymStart extends TypeDefStart

class TypeDefTreeStart extends TypeDefStart

class TypeMethods extends AnyRef

case class UpperTypeBoundsStart(hi: Forest.Type) extends TypeBoundsStart with Product with Serializable

trait VODDStart[ResultTreeType <: Forest.Tree, RhsTreeType <: Forest.Tree] extends DefStart[ResultTreeType, RhsTreeType] with TptStart

trait ValCreator extends AnyRef

class ValNameStart extends TreeVODDStart[Forest.ValDef] with ValCreator

class ValSymStart extends SymVODDStart[Forest.ValDef, Forest.Tree] with ValCreator

class ValTreeStart extends TreeVODDStart[Forest.ValDef] with ValCreator

case class ViewBoundsStart(target: Forest.Type) extends TypeBoundsStart with Product with Serializable

trait VparamssStart extends AnyRef

case class WhileStart(cond: Forest.Tree) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def AND(guards: Iterable[Forest.Tree]): Forest.Tree

def AND(guards: Forest.Tree*): Forest.Tree

def ANNOT(typ: Forest.Type, args: Iterable[Forest.Tree]): Forest.AnnotationInfo

def ANNOT(typ: Forest.Type, args: Forest.Tree*): Forest.AnnotationInfo

def ANONDEF(trees: Forest.Tree*): ClassDefStart

def ANONDEF(parents: Iterable[Forest.Type]): ClassDefStart

def ANONDEF(parent0: Forest.Type, parents: Forest.Type*): ClassDefStart

def ARRAY(xs: Iterable[Forest.Tree]): Forest.Tree

def ARRAY(xs: Forest.Tree*): Forest.Tree

def BACKQUOTED(name: Forest.Name): Forest.BackQuotedIdent

def BACKQUOTED(sym: Forest.Symbol): Forest.BackQuotedIdent

def BLOCK(xs: Forest.Tree*): Forest.Block

def BLOCK(xs: Iterable[Forest.Tree]): Forest.Block

def CASE(pat: Forest.Tree, ifs: IfStart): CaseStart

def CASE(pat: Forest.Tree): CaseStart

def CASECLASSDEF(sym: Forest.Symbol): ClassDefStart

def CASECLASSDEF(name: Forest.Name): ClassDefStart

def CASEOBJECTDEF(sym: Forest.Symbol): ModuleDefStart

def CASEOBJECTDEF(name: Forest.Name): ModuleDefStart

def CLASSDEF(sym: Forest.Symbol): ClassDefStart