aboutsummaryrefslogtreecommitdiff
path: root/compiler/src/dotty/tools/dotc/ast/TreeInfo.scala
Commit message (Collapse)AuthorAgeFilesLines
* Fix constant type val value inline in constructors.Nicolas Stucki2017-04-161-2/+11
|
* Fix #2266: Do not replace constant type lazy vals with constant.Nicolas Stucki2017-04-151-1/+1
|
* Names are no longer SeqsMartin Odersky2017-04-111-1/+1
| | | | | | | | Drop Seq implementation of name. This implementation was always problematic because it entailed potentially very costly conversions to toSimpleName. We now have better control over when we convert a name to a simple name.
* Rename PolyTypeTree -> LambdaTypeTreeMartin Odersky2017-04-061-1/+1
|
* Fix #2067: Compute defKind at Typer, not NamerMartin Odersky2017-03-081-17/+10
| | | | | | | It's hard to predict for defKind all the desugarings that can be applied to a definition. Better to do it once the desugarings have been applied. NoInit and PureInterface are both tested only after Typer, so it's OK to delay their initialization until regular Typer.
* Don't set PureInterface when a default param is presentGuillaume Martres2017-03-081-5/+10
| | | | | | | | | | | The default param will be desugared into a method with a body, so setting PureInterface would be wrong. The enclosed test previously failed with a pickling difference, because the unpickler correctly decided to not set the PureInterface flag since it saw the default param method. This fixes the tasty_dotc_util which failed since the last commit because FreshNameCreator was now incorrectly recognized as a PureInterface.
* Extend argument pretyping to case-closuresMartin Odersky2017-02-211-0/+2
|
* Generalize test whether access is to a refinementMartin Odersky2017-01-281-1/+1
| | | | | | A previous type comparison was wrong because it did not map refined-this types. I believe it was also redundant, so the easiest fix is to drop it.
* Implement structural type member accessMartin Odersky2017-01-051-0/+22
| | | | New scheme for implementing structural type member access.
* Create implicit closures to math expected implicit functionsMartin Odersky2016-12-171-2/+10
| | | | | When the expected type is an implicit function, create an implicit closure to match it.
* Refactor function operations in DefinitionsMartin Odersky2016-12-171-1/+3
| | | | | | | | | Also: show implicit function types correctly. Also: refine applications of implicit funcitons - don't do it for closure trees - don't do it after typer.
* Move compiler and compiler tests to compiler dirFelix Mulder2016-11-221-0/+733
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-19 10:06:22 +0000