ModuleDef

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

Test two objects for inequality.

final def ##(): Int

Equivalent to x.hashCode except for boxed numeric types and null.

def +(other: String): String

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

Test two objects for equality.

def addAttachment(attachment: Any): ModuleDef.this.type

.

final def asInstanceOf[T0]: T0

Cast the receiver object to be of type T0.

def attachments: Attachments { type Pos = Trees.this.Position }

.

def changeOwner(pairs: (Symbol, Symbol)*): Tree

def children: List[Tree]

The direct child trees of this tree.

def clone(): AnyRef

Create a copy of the receiver object.

def collect[T](pf: PartialFunction[Tree, T]): List[T]

Apply pf' to each subtree on which the function is defined and collect the results.

def correspondsStructure(that: Tree)(f: (Tree, Tree) ⇒ Boolean): Boolean

def defineType(tp: Type): ModuleDef.this.type

Like setType, but if this is a previously empty TypeTree that fact is remembered so that resetAllAttrs will snap back.

def duplicate: ModuleDef.this.type

Make a copy of this tree, keeping all attributes, except that all positions are focused (so nothing in this tree will be found when searching by position).

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

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

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

def ensuring(cond: Boolean): ModuleDef

final def eq(arg0: AnyRef): Boolean

Tests whether the argument (arg0) is a reference to the receiver object (this).

def equals(that: Any): Boolean

The universal equality method defined in AnyRef.

def equalsStructure(that: Tree): Boolean

Tests whether two trees are structurall equal.

def exists(p: (Tree) ⇒ Boolean): Boolean

Is there exists a part of this tree which satisfies predicate p?

def filter(f: (Tree) ⇒ Boolean): List[Tree]

Find all subtrees matching predicate p.

def finalize(): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.

def find(p: (Tree) ⇒ Boolean): Option[Tree]

Returns optionally first tree (in a preorder traversal) which satisfies predicate p, or None if none exists.

def forAll(p: (Tree) ⇒ Boolean): Boolean

Do all parts of this tree satisfy predicate p?

def foreach(f: (Tree) ⇒ Unit): Unit

Apply f to each subtree

def foreachPartial(pf: PartialFunction[Tree, Tree]): Unit

If pf is defined for a given subtree, call super.

def formatted(fmtstr: String): String

Returns string formatted according to given format string.

def freeTerms: List[FreeTermSymbol]

Extracts free term symbols from a tree that is reified or contains reified subtrees.

def freeTypes: List[FreeTypeSymbol]

Extracts free type symbols from a tree that is reified or contains reified subtrees.

final def getClass(): Class[_]

A representation that corresponds to the dynamic class of the receiver object.

def hasSymbol: Boolean

.

def hasSymbolWhich(f: (Symbol) ⇒ Boolean): Boolean

def hashCode(): Int

The hashCode method for reference types.

val id: Int

val impl: Template

def isDef: Boolean

.

def isEmpty: Boolean

.

def isErroneous: Boolean

def isErrorTyped: Boolean

final def isInstanceOf[T0]: Boolean

Test whether the dynamic type of the receiver object is T0.

def isTerm: Boolean

The canonical way to test if a Tree represents a term.

def isType: Boolean

The canonical way to test if a Tree represents a type.

def isTyped: Boolean

def keyword: String

def modifyType(f: (Type) ⇒ Type): Tree

Sets the tree's type to the result of the given function.

val mods: Modifiers

val name: TermName

final def ne(arg0: AnyRef): Boolean

Equivalent to !(this eq that).

final def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.

final def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.

def orElse(alt: ⇒ Tree): Tree

Provides an alternate if tree is empty

final def pos: Position

.

def pos_=(pos: Position): Unit

.

def removeAttachment[T](implicit arg0: ClassTag[T]): ModuleDef.this.type

.

val self: Any

val self: Any

def setPos(newpos: Position): ModuleDef.this.type

.

def setSymbol(sym: Symbol): ModuleDef.this.type

.

def setType(tp: Type): ModuleDef.this.type

Set tpe to give tp and return this.

def shallowDuplicate: Tree

def shortClass: String

def substituteSymbols(from: List[Symbol], to: List[Symbol]): Tree

Substitute symbols in to for corresponding occurrences of references to symbols from in this type.

def substituteThis(clazz: Symbol, to: Tree): Tree

Substitute given tree to for occurrences of nodes that represent C.this, where C referes to the given class clazz.

def substituteTypes(from: List[Symbol], to: List[Type]): Tree

Substitute types in to for corresponding occurrences of references to symbols from in this tree.

def summaryString: String

When you want to know a little more than the class, but a lot less than the whole tree.

var symbol: Symbol

Note that symbol is fixed as null at this level.

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

def toString(): String

Obtains string representation of a tree

final def tpe: Type

.

def tpe_=(t: Type): Unit

.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(f: (Tree) ⇒ Boolean): List[Tree]

Find all subtrees matching predicate p.

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

def x: ModuleDef

def x: ModuleDef