Template

Type Members

type ThisTree[-T >: Untyped] = Template[T]

The type constructor at the root of the tree
The type constructor at the root of the tree

Definition Classes
Template → DefTree → DenotingTree → Tree

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 addPos(pos: Position): Template.this.type

This item with a position that's the union of the given pos and the current position.
This item with a position that's the union of the given pos and the current position.

Definition Classes
Positioned
final def allAttachments: List[(Key[_], Any)]

The list of all keys and values attached to this container.
The list of all keys and values attached to this container.

Definition Classes
LinkSource
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def attachment[V](key: Key[V]): V

The attachment corresponding to key.
The attachment corresponding to key.

Definition Classes
LinkSource
Exceptions thrown
NoSuchElementException if no attachment with key exists
final def attachmentOrElse[V](key: Key[V], default: V): V

The attachment corresponding to key, or default if no attachment with key exists.
The attachment corresponding to key, or default if no attachment with key exists.

Definition Classes
LinkSource
def body(implicit ctx: Context): List[Tree[T]]
def checkPos(nonOverlapping: Boolean)(implicit ctx: Context): Unit

Check that all positioned items in this tree satisfy the following conditions:
Check that all positioned items in this tree satisfy the following conditions:
- Parent positions contain child positions
- If item is a non-empty tree, it has a position
Definition Classes
Positioned
def clone(): Tree[T]

Definition Classes
Tree → AnyRef
val constr: DefDef[T]
def contains(that: Positioned): Boolean

Definition Classes
Positioned
def denot(implicit ctx: Context): Denotation

The denotation referred tno by this tree.
The denotation referred tno by this tree. Defined for DenotingTrees and ProxyTrees, NoDenotation for other kinds of trees

Definition Classes
DenotingTree → Tree
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
Tree → Equals → AnyRef → Any
def fallbackToText(printer: Printer): Text

A fallback text representation, if the pattern matching in Printers does not have a case for this showable element
A fallback text representation, if the pattern matching in Printers does not have a case for this showable element

Definition Classes
Showable
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def force(x: AnyRef): Unit

Attributes
protected
Definition Classes
Template → WithLazyField
def forceIfLazy(implicit ctx: Context): List[Tree[T]]

Definition Classes
WithLazyField
def foreachInThicket(op: (Tree[T]) ⇒ Unit): Unit

If this is a thicket, perform op on each of its trees otherwise, perform op ion tree itself.
If this is a thicket, perform op on each of its trees otherwise, perform op ion tree itself.

Definition Classes
Tree
final def getAttachment[V](key: Key[V]): Option[V]

Optionally get attachment corresponding to key
Optionally get attachment corresponding to key

Definition Classes
LinkSource
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def hasType: Boolean

Does the tree have its type field set? Note: this operation is not referentially transparent, because it can observe the withType modifications.
Does the tree have its type field set? Note: this operation is not referentially transparent, because it can observe the withType modifications. Should be used only in special circumstances (we need it for printing trees with optional type info).

Definition Classes
Tree
def hashCode(): Int

Definition Classes
Tree → AnyRef → Any
def initialPos: Position

The initial, synthetic position.
The initial, synthetic position. This is usually the union of all positioned children's positions.

Definition Classes
Positioned
def isDef: Boolean

Does this tree define a new symbol that is not defined elsewhere?
Does this tree define a new symbol that is not defined elsewhere?

Definition Classes
DefTree → Tree
def isEmpty: Boolean

Is this tree either the empty tree or the empty ValDef?
Is this tree either the empty tree or the empty ValDef?

Definition Classes
Tree
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isPattern: Boolean

Is this a legal part of a pattern which is not at the same time a term?
Is this a legal part of a pattern which is not at the same time a term?

Definition Classes
Tree
def isTerm: Boolean

Does this tree represent a term?
Does this tree represent a term?

Definition Classes
Tree
def isType: Boolean

Does this tree represent a type?
Does this tree represent a type?

Definition Classes
Tree
def namedType: NamedType

Definition Classes
DefTree
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def orElse[U >: Untyped <: T](that: ⇒ Tree[U]): Tree[U]

if this tree is the empty tree, the alternative, else this tree
if this tree is the empty tree, the alternative, else this tree

Definition Classes
Tree
val parents: List[Tree[T]]
def pos: Position

The item's position.
The item's position.

Definition Classes
Positioned
final def pushAttachment[V](key: Key[V], value: V): Unit

Definition Classes
Container
final def putAttachment[V](key: Key[V], value: V): Option[V]

Add attachment with given key and value.
Add attachment with given key and value.
returns
Optionally, the old attachment with given key if one existed before. The new attachment is added at the position of the old one, or at the end if no attachment with same key existed.

Definition Classes
LinkSource
final def removeAttachment[V](key: Key[V]): Option[V]

Remove attachment with given key, if it exists.
Remove attachment with given key, if it exists.
returns
Optionally, the removed attachment with given key if one existed before.

Definition Classes
LinkSource
val self: ValDef[T]
def setPos(pos: Position): Unit

Destructively update curPos to given position.
Destructively update curPos to given position. Also, set any missing positions in children.

Attributes
protected
Definition Classes
Positioned
def show(implicit ctx: Context): String

The string representation of this showable element.
The string representation of this showable element.

Definition Classes
Showable
def showSummary(implicit ctx: Context): String

Definition Classes
Showable
def showSummary(depth: Int)(implicit ctx: Context): String

The summarized string representation of this showable element.
The summarized string representation of this showable element. Recursion depth is limited to some smallish value. Default is Config.summarizeDepth.

Definition Classes
Showable
final def symbol(implicit ctx: Context): Symbol

Shorthand for denot.symbol.
Shorthand for denot.symbol.

Definition Classes
Tree
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toList: List[Tree[T]]

Convert tree to a list.
Convert tree to a list. Gives a singleton list, except for thickets which return their element trees.

Definition Classes
Tree
def toText(printer: Printer): Text

The text representation of this showable element.
The text representation of this showable element. This normally dispatches to a pattern matching method in Printers.

Definition Classes
Tree → Showable
def tpe: T

The type of the tree.
The type of the tree. In case of an untyped tree, an UnAssignedTypeException is thrown. (Overridden by empty trees)

Definition Classes
Tree
def treeSize: Int

The number of nodes in this tree
The number of nodes in this tree

Definition Classes
Tree
final def typeOpt: Type

Definition Classes
Tree
def unforced: LazyTreeList

Definition Classes
Template → WithLazyField
def unforcedBody: LazyTreeList
def uniqueId: Int

Definition Classes
Tree
def unsupported(methodName: String): Nothing

Throws an UnsupportedOperationException with the given method name.
Throws an UnsupportedOperationException with the given method name.

Definition Classes
DotClass
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( ... )
def withPos(posd: Positioned): Template.this.type

Definition Classes
Positioned
def withPos(pos: Position): Template.this.type

A positioned item like this one with the position set to pos.
A positioned item like this one with the position set to pos. if the positioned item is source-derived, a clone is returned. If the positioned item is synthetic, the position is updated destructively and the item itself is returned.

Definition Classes
Positioned
def withType(tpe: Type)(implicit ctx: Context): ThisTree[Type]

Return a typed tree that's isomorphic to this tree, but has given type.
Return a typed tree that's isomorphic to this tree, but has given type. (Overridden by empty trees)

Definition Classes
Tree
def withTypeUnchecked(tpe: Type): ThisTree[Type]

Definition Classes
Tree

Related Doc: package Trees

case class Template[-T >: Untyped] extends DenotingTree[T] with DefTree[T] with WithLazyField[List[Tree[T]]] with Product with Serializable

Type Members

type ThisTree[-T >: Untyped] = Template[T]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addPos(pos: Position): Template.this.type

final def allAttachments: List[(Key[_], Any)]

final def asInstanceOf[T0]: T0

final def attachment[V](key: Key[V]): V

final def attachmentOrElse[V](key: Key[V], default: V): V

def body(implicit ctx: Context): List[Tree[T]]

def checkPos(nonOverlapping: Boolean)(implicit ctx: Context): Unit

def clone(): Tree[T]

val constr: DefDef[T]

def contains(that: Positioned): Boolean

def denot(implicit ctx: Context): Denotation

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def fallbackToText(printer: Printer): Text

def finalize(): Unit

def force(x: AnyRef): Unit

def forceIfLazy(implicit ctx: Context): List[Tree[T]]

def foreachInThicket(op: (Tree[T]) ⇒ Unit): Unit

final def getAttachment[V](key: Key[V]): Option[V]

final def getClass(): Class[_]

final def hasType: Boolean

def hashCode(): Int

def initialPos: Position

def isDef: Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isPattern: Boolean

def isTerm: Boolean

def isType: Boolean

def namedType: NamedType

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[U >: Untyped <: T](that: ⇒ Tree[U]): Tree[U]

val parents: List[Tree[T]]

def pos: Position

final def pushAttachment[V](key: Key[V], value: V): Unit

final def putAttachment[V](key: Key[V], value: V): Option[V]

final def removeAttachment[V](key: Key[V]): Option[V]

val self: ValDef[T]

def setPos(pos: Position): Unit

def show(implicit ctx: Context): String

def showSummary(implicit ctx: Context): String

def showSummary(depth: Int)(implicit ctx: Context): String

final def symbol(implicit ctx: Context): Symbol

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

def toList: List[Tree[T]]

def toText(printer: Printer): Text

def tpe: T

def treeSize: Int

final def typeOpt: Type

def unforced: LazyTreeList

def unforcedBody: LazyTreeList

def uniqueId: Int

def unsupported(methodName: String): Nothing

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withPos(posd: Positioned): Template.this.type

def withPos(pos: Position): Template.this.type

def withType(tpe: Type)(implicit ctx: Context): ThisTree[Type]

def withTypeUnchecked(tpe: Type): ThisTree[Type]

Inherited from Serializable

Inherited from Serializable

Inherited from WithLazyField[List[Tree[T]]]

Inherited from DefTree[T]

Inherited from DenotingTree[T]

Inherited from Tree[T]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Showable