Test two objects for inequality.
Test two objects for inequality.
true if !(this == that), false otherwise.
Equivalent to x.hashCode except for boxed numeric types and null.
Equivalent to x.hashCode except for boxed numeric types and null.
For numerics, it returns a hash value which is consistent
with value equality: if two value type instances compare
as true, then ## will produce the same hash value for each
of them.
For null returns a hashcode where null.hashCode throws a
NullPointerException.
a hash value consistent with ==
Test two objects for equality.
Test two objects for equality.
The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
true if the receiver object is equivalent to the argument; false otherwise.
.
...
Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics.
Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at
runtime, while the expression List(1).asInstanceOf[List[String]] will not.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the requested type.
the receiver object.
if the receiver object is not an instance of the erasure of type T0.
.
...
The direct child trees of this tree.
The direct child trees of this tree. EmptyTrees are always omitted. Lists are flattened.
Create a copy of the receiver object.
Apply pf' to each subtree on which the function is defined and collect the results.
Apply pf' to each subtree on which the function is defined and collect the results.
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).
Tests whether the argument (arg0) is a reference to the receiver object (this).
Tests whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an equivalence relation on
non-null instances of AnyRef, and has three additional properties:
x and y of type AnyRef, multiple invocations of
x.eq(y) consistently returns true or consistently returns false.x of type AnyRef, x.eq(null) and null.eq(x) returns false.null.eq(null) returns true. When overriding the equals or hashCode methods, it is important to ensure that their behavior is
consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they
should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
true if the argument is a reference to the receiver object; false otherwise.
The universal equality method defined in AnyRef.
Tests whether two trees are structurall equal.
Tests whether two trees are structurall equal.
Note that == on trees is reference equality.
Is there exists a part of this tree which satisfies predicate p?
Is there exists a part of this tree which satisfies predicate p?
Find all subtrees matching predicate p.
Find all subtrees matching predicate p. Same as withFilter
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as
well as the interaction between finalize and non-local returns
and exceptions, are all platform dependent.
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
If pf is defined for a given subtree, call super.
If pf is defined for a given subtree, call super.traverse(pf(tree)),
otherwise super.traverse(tree).
Returns string formatted according to given format string.
Returns string formatted according to given format string.
Format strings are as for String.format
(@see java.lang.String.format).
Extracts free term symbols from a tree that is reified or contains reified subtrees.
Extracts free term symbols from a tree that is reified or contains reified subtrees.
Extracts free type symbols from a tree that is reified or contains reified subtrees.
Extracts free type symbols from a tree that is reified or contains reified subtrees.
A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
not specified by SLS as a member of AnyRef
.
The hashCode method for reference types.
.
.
Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics.
Therefore the expression 1.isInstanceOf[String] will return false, while the
expression List(1).isInstanceOf[List[String]] will return true.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the specified type.
true if the receiver object is an instance of erasure of type T0; false otherwise.
The canonical way to test if a Tree represents a term.
The canonical way to test if a Tree represents a type.
Sets the tree's type to the result of the given function.
Sets the tree's type to the result of the given function. If the type is null, it remains null - the function is not called.
Equivalent to !(this eq that).
Equivalent to !(this eq that).
true if the argument is not a reference to the receiver object; false otherwise.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
not specified by SLS as a member of AnyRef
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
not specified by SLS as a member of AnyRef
Provides an alternate if tree is empty
Provides an alternate if tree is empty
The alternate tree
If this tree is non empty, this tree, otherwise alt.
.
.
...
.
...
.
...
.
...
Set tpe to give tp and return this.
Set tpe to give tp and return this.
Substitute symbols in to for corresponding occurrences of references to
symbols from in this type.
Substitute symbols in to for corresponding occurrences of references to
symbols from in this type.
Substitute given tree to for occurrences of nodes that represent
C.this, where C referes to the given class clazz.
Substitute given tree to for occurrences of nodes that represent
C.this, where C referes to the given class clazz.
Substitute types in to for corresponding occurrences of references to
symbols from in this tree.
Substitute types in to for corresponding occurrences of references to
symbols from in this tree.
When you want to know a little more than the class, but a lot less than the whole tree.
When you want to know a little more than the class, but a lot less than the whole tree.
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.
Obtains string representation of a tree
.
.
...
Find all subtrees matching predicate p.
Find all subtrees matching predicate p. Same as filter
(Since version 2.10.0) Use leftOfArrow instead
(Since version 2.10.0) Use resultOfEnsuring instead
A labelled expression. Not expressible in language syntax, but generated by the compiler to simulate while/do-while loops, and also by the pattern matcher.
The label acts much like a nested function, where
paramsrepresents the incoming parameters. The symbol given to the LabelDef should have a MethodType, as if it were a nested function.Jumps are apply nodes attributed with a label's symbol. The arguments from the apply node will be passed to the label and assigned to the Idents.
Forward jumps within a block are allowed.