| Commit message (Collapse) | Author | Age | Files | Lines |
|\
| |
| | |
Fix #2051: allow override T with => T or ()T
|
| | |
|
|\ \
| | |
| | | |
Tailrec for derivesFrom/lookupRefined/classSymbol/classSymbols
|
| | | |
|
| | | |
|
|\ \ \
| | | |
| | | | |
Allow inter-parameter dependencies
|
| | | |
| | | |
| | | |
| | | |
| | | | |
All PolyTypes get variances passed, so isTypeLambda is always true
and the deleted assert is never triggered.
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
The dropped method takes direct parameter types but a result type expression.
Since parameter types are now in general dependent as well, that method is
mostly redundant.
|
| | | |
| | | |
| | | |
| | | | |
Take parameter dependencies into account when typechecking arguments.
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | | |
Also: check validity of method types, so that no
forward references occur.
|
| | | |
| | | |
| | | |
| | | |
| | | | |
To allow for dependencies between method type parameters, construct MethodTypes
from a closure that maps the currently constructed MethodType to its parameter types.
|
|\ \ \ \
| |/ / /
|/| | | |
Fix #2077: Optimization of constant conditionals
|
| | |/
| |/|
| | |
| | |
| | | |
Move fixed logic to FirstTransform, where the other constant
folding operations are also done.
|
|\ \ \
| | | |
| | | | |
Fix #2089: Error when compiling ParSetLike, ParSet, SetLike, in this order
|
| |/ /
| | |
| | |
| | |
| | | |
This fix is inspired by 6c91684, but I couldn't tell you why it works
exactly, it's just something I tried.
|
|\ \ \
| | | |
| | | | |
Fix Symbol#sourceFile not working after Flatten
|
| | | |
| | | |
| | | |
| | | |
| | | | |
The SourceFile annotation is only present on the non-flattened top-level
class.
|
|\ \ \ \
| | | | |
| | | | | |
Fix #2071: handle HKApply in SAMType
|
| | |/ /
| |/| | |
|
|/ / / |
|
|/ /
| |
| |
| |
| |
| |
| | |
Before this commit, ParSetLike compiled fine as part of compileStdLib
but crashed when compiled by itself because we tried to force a LazyRef
while forcing the same LazyRef. This commit fixes this by being slightly
more lazy where it matters.
|
|\ \
| | |
| | | |
Fix #2066: Don't qualify private members in SelectionProto's...
|
| | |
| | |
| | |
| | |
| | | |
Now we never match `? { name: T }` with types that
have only a private `name` member. This is what scalac does, too.
|
| | |
| | |
| | |
| | | |
... unless they would be accessible in the given context.
|
| | |
| | |
| | |
| | | |
You can still have positions printed by explictly passing -Yprintpos
|
|\ \ \
| | | |
| | | | |
Fix #360: Improve avoidance algorithm
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
No more try-again business necessary.
|
| |/ /
| | |
| | |
| | |
| | |
| | | |
The essential change is that we do not throw away more
precise info of the avoided type if the expected type
is fully defined.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This was a mistake introduced in the previous commit, installAfter is
only safe to use in `IdentityDenotTransformer` phases, otherwise it
means that the phase denotation transformer is not run at all for this
particular denotation, this caused Ycheck to fail.
|
|/ /
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
If A method like:
override def foo(x: Object*)
overrides a Java method, it needs to be rewritten as:
def foo(x: Seq[Object])
override def foo(x: Array[Object]): Object = foo(Predef.wrapRefArray(x))
This should be handled by ElimRepeated but there were two bugs:
- `addVarArgsBridge` was called at phase `thisTransformer.next`, this is
too late to create the bridge since `T*` has already been rewritten as
`Seq[T]`
- The original method symbol needs to have the `override` flag dropped,
since it doesn't override anything.
Furthermore, RefChecks had to be moved after ElimRepeated, otherwise the
testcase would fail the overriding checks.
|
|\ \
| | |
| | | |
Fix bug in erasedLub leading to incorrect signatures
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Before this commit, the added testcase failed in a strange way:
14 | def bla(foo: Foo) = orElse2(identity).apply(foo)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|value of type <nonsensical><notype></nonsensical> does not take parameters
This happened because the TermRef for the apply method had an incorrect
signature, therefore its underlying type was NoType.
According to the documentation of `erasedLub`, the erasure should be:
"a common superclass or trait S of the argument classes, with the
following two properties:
S is minimal: no other common superclass or trait derives from S]
S is last : in the linearization of the first argument type `tp1`
there are no minimal common superclasses or traits that
come after S.
(the reason to pick last is that we prefer classes over traits that way)."
I'm not convinced that the implementation satisfies either of these two
properties, but this commit at least makes S closer to being minimal by
making sure that the last best candidate never derives from it.
|
|\ \ \
| | | |
| | | | |
Fix #2064: Avoid illegal types in OrDominator
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | | |
`superType` should never return a `TypeBounds` in the first place.
This commit makes sure it doesn't.
|
| | | |
| | | |
| | | |
| | | |
| | | | |
Need to skip type bounds in `underlying` chain, since
TypeBounds is not a legal operand type for OrType.
|
|\ \ \ \
| | | | |
| | | | | |
Fix type inference for HLists and HMaps
|
| | | | | |
|
| | | | |
| | | | |
| | | | |
| | | | | |
and a typo fixed
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Turned out hmaps.scala requires the arg alignment to compile.
So we have our first counterexample that we cannot drop this
hack. Now it is made safe in the sense that no constraints get
lost anymore.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Need to use fresh PolyParams instead of WildcardTypes
if constraint is committable.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
We previously tried to force S1 and S2 be the same type
when encountering a lub like `T1 { A = S1 } & T2 { A = S2 }`.
The comments in this commit explain why this is unsound, so
this rewrite is now made subject to a new config option, which
is off by default.
I verified that the new behavior does not affect the performance of
the junit tests.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
We approximate dependencies to parameters by Wildcards. This was already
done in one place, is now done in other places as well, instead of doing nothing for
dependent methods.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
No reason why we should not - normalize handles implicit
methods just fine. This fixes type errors in test HLists.scala.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
If an applied type has a refinement, it was
printed before as one large refinement type
including the type parameter bindings.
|