TreeInfo

abstract val trees: SymbolTable

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object IsFalse extends SeeThroughBlocks[Boolean]

object IsIf extends SeeThroughBlocks[Option[(Tree, Tree, Tree)]]

object IsTrue extends SeeThroughBlocks[Boolean]

final def asInstanceOf[T0]: T0

def catchesAllOf(cdef: CaseDef, threshold: Type): Boolean

Does this CaseDef catch everything of a certain Type?

def catchesThrowable(cdef: CaseDef): Boolean

Does this CaseDef catch Throwable?

def clone(): AnyRef

def containsLeadingPredefImport(defs: List[Tree]): Boolean

Top-level definition sequence contains a leading import of Predef or scala.Predef.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def firstArgument(tree: Tree): Tree

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

The first constructor definitions in stats'

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

The arguments to the first constructor in stats'.

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

def hashCode(): Int

def isAbsTypeDef(tree: Tree): Boolean

def isAliasTypeDef(tree: Tree): Boolean

def isByNameParamType(tpt: Tree): Boolean

Is tpt a by-name parameter type?

def isCatchCase(cdef: CaseDef): Boolean

Is this pattern node a catch-all or type-test pattern?

def isDeclaration(tree: Tree): Boolean

def isDefaultCase(cdef: CaseDef): Boolean

Is this pattern node a catch-all (wildcard or variable) pattern?

def isDefinition(tree: Tree): Boolean

def isEarlyDef(tree: Tree): Boolean

def isEarlyTypeDef(tree: Tree): Boolean

def isEarlyValDef(tree: Tree): Boolean

final def isInstanceOf[T0]: Boolean

def isInterfaceMember(tree: Tree): Boolean

Is tree legal as a member definition of an interface?

def isLeftAssoc(operator: Name): Boolean

Is name a left-associative operator?

def isOwnerDefinition(tree: Tree): Boolean

def isPureDef(tree: Tree): Boolean

Is tree a pure (i.

def isPureExpr(tree: Tree): Boolean

Is tree a stable and pure expression?

def isRepeatedParamType(tpt: Tree): Boolean

Is tpt of the form T* ?

def isSelf(tree: Tree, enclClass: Symbol): Boolean

Is tree a this node which belongs to enclClass'?

def isSelfConstrCall(tree: Tree): Boolean

Is tree a self constructor call?

def isSelfOrSuperConstrCall(tree: Tree): Boolean

def isSequenceValued(tree: Tree): Boolean

Is this pattern node a sequence-valued pattern?

def isStar(x: Tree): Boolean

Is this tree a Star(_) after removing bindings?

def isSuperConstrCall(tree: Tree): Boolean

def isUnitInScala(tree: Tree, name: Name): Boolean

Compilation unit is class or object 'name' in package 'scala'

def isVarPattern(pat: Tree): Boolean

Is tree a variable pattern

def isVariableName(name: Name): Boolean

Is name a variable name?

def isVariableOrGetter(tree: Tree): Boolean

def isWildcardArg(tree: Tree): Boolean

Is the argument a (possibly bound) _ arg?

def isWildcardStarArg(tree: Tree): Boolean

Is this argument node of the form <expr> : _* ?

def isWildcardStarArgList(trees: List[Tree]): Boolean

def mayBeTypePat(tree: Tree): Boolean

can this type be a type pattern

def mayBeVarGetter(sym: Symbol): Boolean

def methPart(tree: Tree): Tree

The method part of an application node

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def preSuperFields(stats: List[Tree]): List[ValDef]

The value definitions marked PRESUPER in this statement sequence

def repeatedParams(tree: Tree): List[ValDef]

The parameter ValDefs from a def of the form T*.

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

def toString(): String

def unbind(x: Tree): Tree

The underlying pattern ignoring any bindings

final def wait(): Unit

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

final def wait(arg0: Long): Unit