treeInfo

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def applyDepth(tree: Tree): Int

final def asInstanceOf[T0]: T0

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

def catchesThrowable(cdef: CaseDef): Boolean

def clone(): AnyRef

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

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

def firstDefinesClassOrObject(trees: List[Tree], name: Name): Boolean

Does list of trees start with a definition of a class of module with given name (ignoring imports)

def firstTypeArg(tree: Tree): Tree

def foreachMethodParamAndArg(t: Tree)(f: (Symbol, Tree) ⇒ Unit): Unit

def foreachMethodParamAndArg(params: List[Symbol], args: List[Tree])(f: (Symbol, Tree) ⇒ Unit): Boolean

final def getClass(): Class[_]

val global: Trees.this.type

def hashCode(): Int

def isAbsTypeDef(tree: Tree): Boolean

def isAliasTypeDef(tree: Tree): Boolean

def isAllowedInUniversalTrait(stat: Tree): Boolean

def isApplyDynamicName(name: Name): Boolean

def isByNameParamType(tpt: Tree): Boolean

def isCatchCase(cdef: CaseDef): Boolean

def isDeclarationOrTypeDef(tree: Tree): Boolean

def isDefaultCase(cdef: CaseDef): Boolean

def isDeprecatedIdentifier(tree: Tree): Boolean

def isEarlyDef(tree: Tree): Boolean

def isEarlyTypeDef(tree: Tree): Boolean

def isEarlyValDef(tree: Tree): Boolean

def isExprSafeToInline(tree: Tree): Boolean

final def isInstanceOf[T0]: Boolean

def isInterface(mods: HasFlags, body: List[Tree]): Boolean

def isInterfaceMember(tree: Tree): Boolean

Is tree legal as a member definition of an interface?

def isLeftAssoc(operator: Name): Boolean

def isPureDef(tree: Tree): Boolean

Is tree a pure (i.

def isRepeatedParamType(tpt: Tree): Boolean

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

def isSelfConstrCall(tree: Tree): Boolean

def isSelfOrSuperConstrCall(tree: Tree): Boolean

def isSequenceValued(tree: Tree): Boolean

def isStar(x: Tree): Boolean

def isSuperConstrCall(tree: Tree): Boolean

def isSwitchAnnotation(tpe: Type): Boolean

def isUncheckedAnnotation(tpe: Type): Boolean

def isVarPattern(pat: Tree): Boolean

def isVariableName(name: Name): Boolean

def isVariableOrGetter(tree: Tree): Boolean

def isVariablePattern(tree: Tree): Boolean

def isWildcardArg(tree: Tree): Boolean

def isWildcardStarArg(tree: Tree): Boolean

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

def mapMethodParamsAndArgs[R](params: List[Symbol], args: List[Tree])(f: (Symbol, Tree) ⇒ R): List[R]

def mayBeTypePat(tree: Tree): Boolean

def mayBeVarGetter(sym: Symbol): Boolean

def methPart(tree: Tree): Tree

final def ne(arg0: AnyRef): Boolean

def noPredefImportForUnit(body: Tree): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def stripNamedApplyBlock(tree: Tree): Tree

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

def toString(): String

def typeParameters(tree: Tree): List[TypeDef]

def unbind(x: Tree): Tree

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zipMethodParamsAndArgs(t: Tree): List[(Symbol, Tree)]

def zipMethodParamsAndArgs(params: List[Symbol], args: List[Tree]): List[(Symbol, Tree)]

def isPureExpr(tree: Tree): Boolean