A creator for AnnotatedType types.

This symbol cast to a free term symbol.

This symbol cast to a free type symbol.

The attachment of the tree.

The attachment of the symbol.

A creator for BoundedWildcardType types.

Mark a variable as captured; i.e. force boxing in a *Ref type.

Convert type of a captured variable to *Ref type.

Collects all the symbols defined by subtrees of tree that are owned by prev, and then changes their owner to point to next.

This is an essential tool to battle owner chain corruption when moving trees from one lexical context to another. Whenever you take an attributed tree that has been typechecked under the Context owned by some symbol (let's call it x) and splice it elsewhere, into the Context owned by another symbol (let's call it y), it is imperative that you either call untypecheck or do changeOwner(tree, x, y).

Since at the moment untypecheck has fundamental problem that can sometimes lead to tree corruption, changeOwner becomes an indispensable tool in building 100% robust macros. Future versions of the reflection API might obviate the need in taking care of these low-level details, but at the moment this is what we've got.

A factory method for ClassDef nodes.

A creator for ClassInfoType types.

A creator for ConstantType types.

Creates an importer that moves reflection artifacts between universes.

If this symbol is a skolem, its corresponding type parameter, otherwise the symbol itself.

To quote Martin Odersky, skolems are synthetic type "constants" that are copies of existentially bound or universally bound type variables. E.g. if one is inside the right-hand side of a method:

def foo[T](x: T) = ... foo[List[T]]....

the skolem named T refers to the unknown type instance of T when foo is called. It needs to be different from the type parameter because in a recursive call as in the foo[List[T]] above the type parameter gets substituted with List[T], but the type skolem stays what it is.

The other form of skolem is an existential skolem. Say one has a function

def bar(xs: List[T] forSome { type T }) = xs.head

then each occurrence of xs on the right will have type List[T'] where T' is a fresh copy of T.

A factory method for DefDef nodes.

A factory method for DefDef nodes.

A factory method for DefDef nodes.

A factory method for DefDef nodes.

A factory method for DefDef nodes.

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

\@PP: Attempting to elaborate on the above, I find: If defineType is called on a TypeTree whose type field is null or NoType, this is recorded as "wasEmpty = true". That value is used in ResetAttrsTraverser, which nulls out the type field of TypeTrees for which wasEmpty is true, leaving the others alone.

untypecheck (or resetAttrs in compiler parlance) is used in situations where some speculative typing of a tree takes place, fails, and the tree needs to be returned to its former state to try again. So according to me: using defineType instead of setType is how you communicate that the type being set does not depend on any previous state, and therefore should be abandoned if the current line of type inquiry doesn't work out.

Symbol associated with the innermost enclosing lexical context. Walking the owner chain of this symbol will reveal information about more and more enclosing contexts.

Adds a given symbol to the given scope.

A creator for existential types. This generates:

tpe1 where { tparams }

where tpe1 is the result of extrapolating tpe with regard to tparams. Extrapolating means that type variables in tparams occurring in covariant positions are replaced by upper bounds, (minus any SingletonClass markers), type variables in tparams occurring in contravariant positions are replaced by upper bounds, provided the resulting type is legal with regard to stability, and does not contain any type variable in tparams.

The abstraction drops all type parameters that are not directly or indirectly referenced by type tpe1. If there are no remaining type parameters, simply returns result type tpe.

A creator for ExistentialType types.

Returns internal flags associated with the symbol.

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.

Calls initialize on all the symbols that the scope consists of.

Calls initialize on all the value and type parameters of the type.

Calls initialize on the owner and all the value and type parameters of the symbol.

Advanced tree factories

Forces all outstanding completers associated with this symbol. After this call returns, the symbol becomes immutable and thread-safe.

A creator for intersection type where intersections of a single type are replaced by the type itself, and repeated parent classes are merged.

!!! Repeated parent classes are not merged - is this a bug in the comment or in the code?

A creator for intersection type where intersections of a single type are replaced by the type itself.

Does this symbol or its underlying type represent a typechecking error?

Does this symbol represent a free term captured by reification? If yes, isTerm is also guaranteed to be true.

Does this symbol represent a free type captured by reification? If yes, isType is also guaranteed to be true.

Does this symbol represent the definition of a skolem? Skolems are used during typechecking to represent type parameters viewed from inside their scopes.

A factory method for LabelDef nodes.

A creator for MethodType types.

A factory method for ModuleDef nodes.

Create a new scope with the given initial elements.

A creator for NullaryMethodType types.

A creator for type parameterizations that strips empty type parameter lists. Use this factory method to indicate the type has kind * (it's a polymorphic value) until we start tracking explicit kinds equivalent to typeFun (except that the latter requires tparams nonEmpty).

Mark given identifier as a reference to a captured variable itself suppressing dereferencing with the elem field.

A creator for RefinedType types.

A creator for RefinedType types.

A creator for RefinedType types.

A creator for RefinedType types.

A creator for RefinedType types.

This is an internal implementation module.

Update the attachment with the payload of the given class type T removed. Returns the tree itself.

Update the attachment with the payload of the given class type T removed. Returns the symbol itself.

Disables flags on the symbol.

Sets the annotations of the symbol.

Enables flags on the symbol.

Sets the info of the symbol.

Sets the name of the symbol.

Sets the original field of the type tree.

Sets the owner of the symbol.

Sets the pos of the tree. Returns the tree itself.

Sets the privateWithin of the symbol.

Sets the symbol of the tree. Returns the tree itself.

Sets the tpe of the tree. Returns the tree itself.

A creator for SingleType types.

Retrieves the untyped list of subpatterns attached to selector dummy of an UnApply node. Useful in writing quasiquoting macros that do pattern matching.

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 refers to the given class clazz.

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

A creator for SuperType types.

A creator for ThisType types.

Transforms a given tree using the provided function.

A creator for TypeBounds types.

A factory method for TypeDef nodes.

A factory method for TypeDef nodes.

A creator for TypeRef types.

Transforms a given tree at a given owner using the provided function.

Transforms a given tree using the provided function.

Removes a given symbol to the given scope.

Updates the attachment with the payload slot of T added/updated with the provided value. Replaces an existing payload of the same type, if exists. Returns the tree itself.

Updates the attachment with the payload slot of T added/updated with the provided value. Replaces an existing payload of the same type, if exists. Returns the symbol itself.

A factory method for ValDef nodes.

A factory method for ValDef nodes.

Test two objects for inequality.

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.

The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

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.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

Tests whether the argument (that) 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:

• It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
• For any non-null instance 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).

The equality method for reference types. Default implementation delegates to eq.

See also equals in scala.Any.

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 the runtime class representation of the object.

The hashCode method for reference types. See hashCode in scala.Any.

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.

Convert a scala.reflect.Manifest to a scala.reflect.api.TypeTags#TypeTag.

Compiler usually generates these conversions automatically, when a manifest for a type T is in scope, and an implicit of type TypeTag[T] is requested, but this method can also be called manually. For example:

manifestToTypeTag(scala.reflect.runtime.currentMirror, implicitly[Manifest[String]])

Equivalent to !(this eq that).

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

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

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.

Convert a scala.reflect.api.TypeTags#TypeTag to a scala.reflect.Manifest.

Compiler usually generates these conversions automatically, when a type tag for a type T is in scope, and an implicit of type Manifest[T] is requested, but this method can also be called manually. For example:

typeTagToManifest(scala.reflect.runtime.currentMirror, implicitly[TypeTag[String]])