Creates a Alternative node from the given components, having a given tree as a prototype.
Creates a Alternative node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Annotated node from the given components, having a given tree as a prototype.
Creates a Annotated node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a AppliedTypeTree node from the given components, having a given tree as a prototype.
Creates a AppliedTypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Apply node from the given components, having a given tree as a prototype.
Creates a Apply node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Assign node from the given components, having a given tree as a prototype.
Creates a Assign node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a AssignOrNamedArg node from the given components, having a given tree as a prototype.
Creates a AssignOrNamedArg node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Bind node from the given components, having a given tree as a prototype.
Creates a Bind node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Block node from the given components, having a given tree as a prototype.
Creates a Block node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a CaseDef node from the given components, having a given tree as a prototype.
Creates a CaseDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a ClassDef node from the given components, having a given tree as a prototype.
Creates a ClassDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a CompoundTypeTree node from the given components, having a given tree as a prototype.
Creates a CompoundTypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a DefDef node from the given components, having a given tree as a prototype.
Creates a DefDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a ExistentialTypeTree node from the given components, having a given tree as a prototype.
Creates a ExistentialTypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Function node from the given components, having a given tree as a prototype.
Creates a Function node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Ident node from the given components, having a given tree as a prototype.
Creates a Ident node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a If node from the given components, having a given tree as a prototype.
Creates a If node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Import node from the given components, having a given tree as a prototype.
Creates a Import node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a LabelDef node from the given components, having a given tree as a prototype.
Creates a LabelDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Literal node from the given components, having a given tree as a prototype.
Creates a Literal node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Match node from the given components, having a given tree as a prototype.
Creates a Match node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a ModuleDef node from the given components, having a given tree as a prototype.
Creates a ModuleDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a New node from the given components, having a given tree as a prototype.
Creates a New node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a PackageDef node from the given components, having a given tree as a prototype.
Creates a PackageDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a ReferenceToBoxed node from the given components, having a given tree as a prototype.
Creates a ReferenceToBoxed node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Return node from the given components, having a given tree as a prototype.
Creates a Return node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Select node from the given components, having a given tree as a prototype.
Creates a Select node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a SelectFromTypeTree node from the given components, having a given tree as a prototype.
Creates a SelectFromTypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a SingletonTypeTree node from the given components, having a given tree as a prototype.
Creates a SingletonTypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Star node from the given components, having a given tree as a prototype.
Creates a Star node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Super node from the given components, having a given tree as a prototype.
Creates a Super node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Template node from the given components, having a given tree as a prototype.
Creates a Template node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a This node from the given components, having a given tree as a prototype.
Creates a This node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Throw node from the given components, having a given tree as a prototype.
Creates a Throw node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Try node from the given components, having a given tree as a prototype.
Creates a Try node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a TypeApply node from the given components, having a given tree as a prototype.
Creates a TypeApply node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a TypeBoundsTree node from the given components, having a given tree as a prototype.
Creates a TypeBoundsTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a TypeDef node from the given components, having a given tree as a prototype.
Creates a TypeDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a TypeTree node from the given components, having a given tree as a prototype.
Creates a TypeTree node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a Typed node from the given components, having a given tree as a prototype.
Creates a Typed node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a UnApply node from the given components, having a given tree as a prototype.
Creates a UnApply node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
Creates a ValDef node from the given components, having a given tree as a prototype.
Creates a ValDef node from the given components, having a given tree as a prototype.
Having a tree as a prototype means that the tree's attachments, type and symbol will be copied into the result.
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.
Create a copy of the receiver object.
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 equality method for reference types.
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.
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.
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
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
a String representation of the object.
The type of standard (lazy) tree copiers.