The direct child trees of this tree.
The direct child trees of this tree. EmptyTrees are always omitted. Lists are flattened.
Apply pf' to each subtree on which the function is defined
Apply pf' to each subtree on which the function is defined
Like setType
, but if this is a previously empty TypeTree that
fact is remembered so that resetAllAttrs will snap back.
Like setType
, but if this is a previously empty TypeTree that
fact is remembered so that resetAllAttrs will snap back.
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).
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).
The universal equality method defined in AnyRef
.
Is there exists a part of this tree which satisfies predicate p
?
Is there exists a part of this tree which satisfies predicate p
?
Returns optionally first tree (in a preorder traversal) which satisfies predicate p
,
or None if none exists.
Returns optionally first tree (in a preorder traversal) which satisfies predicate p
,
or None if none exists.
Do all parts of this tree satisfy predicate p
?
Do all parts of this tree satisfy predicate p
?
Apply f
to each subtree
Apply f
to each subtree
The hashCode method for reference types.
The canonical way to test if a Tree represents a term.
The canonical way to test if a Tree represents a term.
The canonical way to test if a Tree represents a type.
The canonical way to test if a Tree represents a type.
Prefix under which to print this tree type.
Prefix under which to print this tree type. Defaults to product prefix (e.g. DefTree) but because that is used in reification it cannot be altered without breaking reflection.
Set tpe to give tp
and return this.
Set tpe to give tp
and return this.
Note that symbol is fixed as null at this level.
Note that symbol is fixed as null at this level. In SymTrees, it is overridden and implemented with a var, initialized to NoSymbol.
Trees which are not SymTrees but which carry symbols do so by
overriding def symbol
to forward it elsewhere. Examples:
Super(qual, _) // has qual's symbol Apply(fun, args) // has fun's symbol TypeApply(fun, args) // has fun's symbol AppliedTypeTree(tpt, args) // has tpt's symbol TypeTree(tpe) // has tpe's typeSymbol, if tpe != null
Attempting to set the symbol of a Tree which does not support it will induce an exception.
Creates a String representation of this object.
Find all subtrees matching predicate p
Find all subtrees matching predicate p
A tree that has an annotation attached to it. Only used for annotated types and annotation ascriptions, annotations on definitions are stored in the Modifiers. Eliminated by typechecker (typedAnnotated), the annotations are then stored in an AnnotatedType.