DerivedFromParamTree

The type constructor at the root of the tree

Return info of original symbol, where all references to siblings of the original symbol (i.e. sibling and original symbol have the same owner) are rewired to same-named parameters or accessors in the scope enclosing the current scope. The current scope is the scope owned by the defined symbol itself, that's why we have to look one scope further out. If the resulting type is an alias type, dealias it. This is necessary because the accessor of a type parameter is a private type alias that cannot be accessed from subclasses.

Complete the appropriate constructors so that OriginalSymbol attachments are pushed to DerivedTypeTrees.

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

The attachment corresponding to key.

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

Check that all positioned items in this tree satisfy the following conditions:

• Parent spans contain child spans
• If item is a non-empty tree, it has a position

Clone this node but assign it a fresh id which marks it as a node in file.

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

The union of startSpan and the spans of all positioned children that have the same source as this node, except that Inlined nodes only consider their call child.

Side effect: Any descendants without spans have but with the same source as this node have their span set to the end position of the envelope of all children to the left, or, if that one does not exist, to the start position of the envelope of all children to the right.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

• It is reflexive: for any instance x of type Any, x.equals(x) should return true.
• It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

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

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

Optionally get attachment corresponding to key

Does an attachment corresponding to key exist?

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).

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

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

Is this tree either the empty tree or the empty ValDef or an empty type ident?

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

Does this tree represent a term?

Does this tree represent a type?

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

Add attachment with given key and value.

Remove attachment with given key, if it exists.

The string representation of this showable element.

The string representation with each line after the first one indented by the given given margin (in spaces).

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

The span part of the item's position

This positioned item, widened to SrcPos. Used to make clear we only need the position, typically for error reporting.

Shorthand for denot.symbol.

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

Returns a string representation of the object.

The default representation is platform dependent.

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

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

The number of nodes in this tree

A unique identifier in case -Yshow-tree-ids, or -Ydebug-tree-with-id is set, -1 otherwise.

The watched tree; used only for printing

Install the derived type tree as a dependency on sym

Install the derived type tree as a dependency on original

Copy the sticky attachments from container to this container.

A positioned item like this one with given span. 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.

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