A typer mixin that implements typeclass derivation functionality
Handles programmable member selections of
Dynamic instances and values
with structural types. Two functionalities:
- Translates selection that does not typecheck according to the scala.Dynamic rules: foo.bar(baz) = quux ~~> foo.selectDynamic(bar).update(baz, quux) foo.bar = baz ~~> foo.updateDynamic("bar")(baz) foo.bar(x = bazX, y = bazY, baz, ...) ~~> foo.applyDynamicNamed("bar")(("x", bazX), ("y", bazY), ("", baz), ...) foo.bar(baz0, baz1, ...) ~~> foo.applyDynamic(bar)(baz0, baz1, ...) foo.bar ~~> foo.selectDynamic(bar)
The first matching rule of is applied.
- Translates member selections on structural types to calls of
Selectableinstance. @See handleStructural.
Lifter for eta expansion
An enumeration controlling the degree of forcing in "is-dully-defined" checks.
Info relating to implicits that is kept for one run
The implicit resolution part of type checking
Info relating to an import clause
Produces an inlined version of
call via its
Lift all impure or complex arguments
Lift all impure arguments
Lift all impure or complex arguments to
A class that handles argument lifting. Argument lifting is needed in the following scenarios: - eta expansion - applications with default arguments - applications with out-of-order named arguments Lifting generally lifts impure expressions only, except in the case of possible default arguments, where we lift also complex pure expressions, since in that case arguments can be duplicated as arguments to default argument methods.
This class creates symbols from definitions and imports and gives them lazy types.
During enter, trees are expanded as necessary, populating the expandedTree map. Symbols are created, and the symOfTree map is set up.
Symbol completion causes some trees to be already typechecked and typedTree entries are created to associate the typed trees with the untyped expanded originals.
During typer, original trees are first expanded using expandedTree. For each expanded member definition or import we extract and remove the corresponding symbol from the symOfTree map and complete it. We then consult the typedTree map to see whether a typed tree exists already. If yes, the typed tree is returned as result. Otherwise, we proceed with regular type checking.
The scheme is designed to allow sharing of nodes, as long as each duplicate appears in a different method.
No lifting at all
A version of Typer that keeps all symbols defined and referenced in a previously typed tree.
All definition nodes keep their symbols. All leaf nodes for idents, selects, and TypeTrees keep their types. Indexing is a no-op.
Otherwise, everything is as in Typer.
Post-attribution checking and transformation, which fulfills the following roles
- This phase performs the following checks.
- only one overloaded alternative defines default arguments
- applyDynamic methods are not overloaded
- all overrides conform to rules laid down by
- any value classes conform to rules laid down by
- this(...) constructor calls do not forward reference other definitions in their block (not even lazy vals).
- no forward reference in a local block jumps over a non-lazy val definition.
- a class and its companion object do not both define a class or module with the same name.
It warns about references to symbols labeled deprecated or migration.
It eliminates macro definitions.
- It makes members not private where necessary. The following members
cannot be private in the Java model:
- term members of traits
- the primary constructor of a value class
- the parameter accessor of a value class
- members accessed from an inner or companion class. All these members are marked as NotJavaPrivate. Unlike in Scala 2.x not-private members keep their name. It is up to the backend to find a unique expanded name for them. The rationale to do name changes that late is that they are very fragile.
todo: But RefChecks is not done yet. It's still a somewhat dirty port from the Scala 2 version. todo: move untrivial logic to their own mini-phases
Records the history of currently open implicit searches.
A search history maintains a list of open implicit searches (
open) a shortcut flag
indicating whether any of these are by name (
byname) and a reference to the root
search history (
root) which in turn maintains a possibly empty dictionary of
recursive implicit terms constructed during this search.
A search history provides operations to create a nested search history, check for divergence, enter by name references and definitions in the implicit dictionary, lookup recursive references and emit a complete implicit dictionary when the outermost search is complete.
The the state corresponding to the outermost context of an implicit searcch.
A set of term references where equality is =:=
check method to check that all top-level definitions
in tree are variance correct. Does not recurse inside methods.
The method should be invoked once for each Template.