CompilerState

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[S, P <: Phase { type State = S }](t: (P, S)): CompilerState

Return a new CompilerState with the given mapping of phase to phase state

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

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val compiler: QueryCompiler

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

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

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

def ensuring(cond: Boolean): CompilerState

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

def get[P <: Phase](p: P): Option[get.P.State]

Get the phase state for a phase

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map(f: (Node) ⇒ Node): CompilerState

Return a new CompilerState with a transformed AST

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val symbolNamer: SymbolNamer

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

def toString(): String

val tree: Node

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val wellTyped: Boolean

def withNode(tree: Node): CompilerState

Return a new CompilerState which encapsulates the specified AST

def withWellTyped(wellTyped: Boolean): CompilerState

Return a new CompilerState which indicates whether or not the AST should be well-typed after every phase.

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

def +(other: String): String