| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
The bug is already fixed in PR #1724 while fixing another issue
|
|\
| |
| | |
Fix compilation of ParSetLike by itself
|
|/
|
|
|
|
|
| |
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.
|
|\ \
| | |
| | | |
-Yplain-printer: do not print positions by default
|
|/ /
| |
| |
| | |
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.
|
|\ \
| | |
| | | |
Fix overriding a Java method with varargs
|
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
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.
|
|\ \
| |/
|/| |
Move tests/tasty/* to tests/pickling/*
|
| |
| |
| |
| |
| | |
These two directories were tested using the same flags, but tests/tasty
compiled all of its files at once which is usually not what is intended.
|
|\ \
| |/
|/| |
restore position offset in DelegatingReporter
|
| | |
|
|\ \
| | |
| | | |
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
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Type inference tends to take quite different paths for non-variant
and variant data structures. Since, non-variant hmap has already exposed quite
a few problems, it's good to test it also in the covariant case.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
I believe this worked only accidentally because we matched
more things with wildcards which turned out to be flawed. The test
errors show some funky _#_ types, so not sure whether the tests
are still valid or not. Moved back to pending awaiting further
resolution.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
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.
|
| | | | | |
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Variance changes quite a few things for type inference, so
it's good to check a non-variant version as well.
|
| | | | | |
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
These now compile with the changes to dependent methods, except
for one which is invalid under dotty.
|
| | | | | |
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
The HLists test brought out the unsoundness of alias
rewriting in glbs which is tackled in the last commit.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
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.
|
|\ \ \ \ \
| | | | | |
| | | | | | |
Change "recursive/cyclic definitions needs type" errors to Message
|
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
Fall-back to reporting "overloaded or recursive needs type".
|
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
Split error messages for recursive method and overloaded method needs type into two (but
did not solve the analysis which to show).
Make CyclicReference type error construct corresponding error message.
|
| | | | | | |
|
| |\ \ \ \ \
| | | | | | |
| | | | | | |
| | | | | | | |
ennru_RecursiveNeedsType
|
| | | | | | | |
|
|\ \ \ \ \ \ \
| | | | | | | |
| | | | | | | | |
Disallow subtypes of Function1 acting as implicit conversions
|