aboutsummaryrefslogtreecommitdiff
path: root/test
Commit message (Collapse)AuthorAgeFilesLines
* Test reorgMartin Odersky2015-02-071-1/+1
|
* New test: moduleSubtypingMartin Odersky2015-01-141-0/+1
| | | | Tests (non)equivalence of modules and their ThisTypes.
* Simplify and fix bounds propagation in constraints.Martin Odersky2015-01-081-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | The previous scheme did not ensure that transitivity was eliminated. Example scenario: We have in the constraint P <: Q for constrained variables P, Q and add Q <: T Previous propagation added the constraint and then tested whether the bounds of all variables were satisfiable. For Q we test P <: T but that is true because P <: Q and we already added the constraint Q <: T. So we fail to add the constraint P <: T, and transitivity is no longer eliminated. Instead we now test the new bounds (in this case P <: T) *before* adding the new constraint Q <: T. This is also simpler than the previous scheme.
* Fixed bug that caused error message to be suppressed.Martin Odersky2015-01-081-3/+0
| | | | | | Symptom was: When compiling Definitions.scala with the changes in the subsequent commits, an empty tree was passed as implicit parameter, without an "implicit not found" error being reported. The problem needed a fix in TyperState.
* Disable context escape detectionMartin Odersky2014-12-191-2/+3
| | | | | | | | | I get very frequent build failures due to the mutual Scala<->Java dependency. It builds for a long time, then decides that getCtx overrides nothing. The only way to fix is another clean build. Total time lost: >5 minutes. These happened occasionally before but have become much more frequent under ScalaIDe4.0, to the point where this becomes a major drag on productity. Context escape detection is nice but if it stops us getting work done, not worth the effort.
* Treat i0239 specially. It shows some problems that could be of interest.Dmitry Petrashko2014-12-171-0/+1
|
* Enable backend specific tests. Flag those that failDmitry Petrashko2014-12-161-15/+25
|
* Label test with nested cycles and simple patterns.Dmitry Petrashko2014-12-161-0/+1
|
* Update class-path dependant tests. Disable one.Dmitry Petrashko2014-12-161-3/+5
|
* Add test for backend.Dmitry Petrashko2014-12-161-1/+3
|
* Disable backend by default in tests.Dmitry Petrashko2014-12-161-1/+5
|
* Erasure is on by default.Dmitry Petrashko2014-12-161-30/+30
| | | | Remove historical enabling of erasure for some tests: its enabled by default now
* Merge pull request #279 from dotty-staging/test/#91odersky2014-12-131-0/+1
|\ | | | | Two new tests
| * Two new testsMartin Odersky2014-12-131-0/+1
| | | | | | | | | | 1) Verify we survive illegal infinite paths. Closes #91. 2) Verify we handle fbounds in and types correctly.
* | Disable implicit conversions between from `Null` and `Nothing`.Martin Odersky2014-12-131-0/+1
|/ | | | | | | | | | | | This is necessary to reject code like val x: Boolean = null Without the restriction, this code would typecheck and expand to val x: Boolean = Predef.Boolean2boolean(null) since `null` counts as a value of type `java.kang.Boolean`.
* One more test case, coming from #214.Martin Odersky2014-12-131-1/+1
|
* Fix #248: Class cannot inherit from refinement typesMartin Odersky2014-12-131-0/+1
| | | | | | We now check that classes do not inherit from refinement types (unless they are an encoding of parameterized types), nor from & or | types.
* Merge pull request #242 from dotty-staging/fix/mixinsDmitry Petrashko2014-11-261-2/+1
|\ | | | | Fix/mixins
| * Allow deep subtypes in dotc_transform.Martin Odersky2014-11-261-1/+1
| | | | | | | | The clause got accidentally dropped in the rebase.
| * Fixed data race in ResolveSuperMartin Odersky2014-11-261-2/+1
| | | | | | | | | | | | | | | | | | | | The datarace happened because for method "transform" implemented by ResolveSuper which disambiguated overridden methods. Previously, there was a reference FirstTransform.this.transform of type termRefWithSig to the method implemented in a super trait. Now the same reference points to the newly implemented method. Solved because ResolveSuper now generates symbolic references.
* | Allow refinements that refine already refined types.Martin Odersky2014-11-261-0/+1
|/ | | | | | | | | | | | | | | | | | | | | | | | | | Previously, a double definition errorfor `T` was produced in a case like this: type T1 = C { T <: A } type T2 = T1 { T <: B } This was caused by the way T1 was treated in the refinement class that is used to typecheck the type. Desugaring of T2 with `refinedTypeToClass` would give trait <refinement> extends T1 { type T <: B } and `normalizeToClassRefs` would transform this to: trait <refinement> extends C { type T <: A; type T <: B } Hence the double definition. The new scheme desugars the rhs of `T2` to: trait <refinement> extends C { this: T1 => type T <: B } which avoids the problem. Also, added tests that #232 (fix/boundsPropagation) indeed considers all refinements together when comparing refined types.
* Fixed cycle detection.Martin Odersky2014-11-241-1/+1
| | | | Now detects the cycles reported by @retronym
* Added and corrected testsMartin Odersky2014-11-241-2/+2
| | | | to reflect last commit.
* Fixes in TypeComparer for RefinedTypes.Martin Odersky2014-11-241-2/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | The previous scheme did not propagate bounds correctly. More generally, given a comparison T { X <: A } <: U { X <: B } it would errenously decompose this to T <: U, A <: B But we really need to check whether the total constraint for X in T { X <: A } subsumes the total constraint for X in T { X <: B } The new scheme propagates only if the binding in the lower type is an alias. E.g. T { X = A } <: Y { X <: B } decomposes to T { A = A } <: U, A <: B The change uncovered another bug, where in the slow path we too a member relative to a refined type; We need to "narrow" the type to a RefinedThis instead. (See use of "narrow" in TypeComparer). That change uncovered a third bug concerning the underlying type of a RefinedThis. The last bug was fixed in a previous commit (84f32cd814f2e07725b6ad1f6bff23d4ee38c397). Two tests (1048, 1843) which were pos tests for scalac but failed compling in dotc have changed their status and location. They typecheck now, but fail later. They have been moved to pending. There's a lot of diagnostic code in TypeComparer to figure out the various problems. I left it in to be able to come back to the commit in case there are more problems. The checks and diagnostics will be removed in a subsequent commit.
* Make reduceProjection use lookupRefinedMartin Odersky2014-11-241-1/+1
| | | | | | | | | | | Needed some fixes to lookup refined. The potential alias type is now calculated by taking the member of the original refined type, instead of by simply following the refined info. This takes into account refinements that were defined after the refinement type that contains the alias. The change amde another test (transform) hit the deep subtype limit, which is now disabled.
* Enabling java testsDmitry Petrashko2014-11-221-5/+5
|
* create dummy first constructor for Java classesOndrej Lhotak2014-11-221-1/+0
| | | | | | The dummy constructor is needed so that the real constructors see the import of the companion object. The constructor has a parameter of type Unit so that no Java code can call it.
* support running java-interop testsOndrej Lhotak2014-11-222-3/+10
|
* Add tests for the overriding of typesGuillaume Martres2014-11-181-1/+1
| | | | These tests work correctly since 222e9a478f7b851582550973df6a9d141766e49a
* Enable pos/overrides.scala in testsGuillaume Martres2014-11-181-0/+1
|
* Merge pull request #228 from dotty-staging/fix/overridingodersky2014-11-181-0/+2
|\ | | | | Fix/overriding
| * Check that overriding members refine the types of overridden ones.Martin Odersky2014-11-181-1/+1
| | | | | | | | | | Somehow this was lost in porting (or was this done somewhere else in scalac?).
| * Fix OverridingPairsMartin Odersky2014-11-141-0/+2
| | | | | | | | | | | | | | | | OverridingPairs had several bugs which caused pairs to be lost, which caused missing overrides checks. Fixing OverridingPairs revealed several test failures (and a problem in Synthetics generation which was fixed in the last commit). Tests that became negative are all moved into neg/overrides.scala, and the original versions in pos were fixed.
* | Moved pending tests that work into pos and neg.Martin Odersky2014-11-171-0/+2
|/ | | | | | | One test (t2613) required lifting a hard recursion limit in findMember (used for debug only, will be removed in the future). The same test also requires -Yno-deep-subtypes to be reset, so it's in pos_special instead of pos.
* Added methods to prepare-for and transform a complete compilation unit tree.Martin Odersky2014-11-121-5/+5
| | | | Should replace destructive inits.
* Merge pull request #220 from dotty-staging/refactor/DefTreesDmitry Petrashko2014-11-113-15/+15
|\ | | | | Refactor/def trees
| * Drop modifiers as separate data from MemberDef treesMartin Odersky2014-11-103-15/+15
| | | | | | | | Typed MemberDef trees now take the modifiers from their symbol's data.
* | Fix subtyping checks involving ThisType and PolyParamGuillaume Martres2014-11-111-0/+1
|/
* Merge pull request #217 from dotty-staging/transform/mixinDmitry Petrashko2014-11-101-1/+1
|\ | | | | Transform/mixin
| * Merge memoize with miniphases following it into one group.Martin Odersky2014-11-091-1/+1
| |
| * Reinstantiated full tests.Martin Odersky2014-11-091-2/+2
| | | | | | | | | | The fix to Types in 9bb35512 (Retract of optimization in computeDenot) allowed the two tests to compile "twice" again.
| * New Mixin scheme.Martin Odersky2014-11-091-2/+2
| | | | | | | | | | | | | | Split into two phases, ResolveSuper before Erasure and Mixin after. Likewise GettersSetters is split into Getters and Memoize. All tests pass, except two tests fail when compiled twice. Will investigate next why.
| * Improved version of mixin.Martin Odersky2014-11-091-1/+1
| | | | | | | | | | Now also handles all supercalls. Seems to do the right thing on pos/traits.scala. But does not pass most tests because the sym transformer forces too many things.
* | Merge pull request #207 from dotty-staging/transform/privateToStaticodersky2014-11-091-1/+1
|\| | | | | Transform/private to static
| * New phase: RestoreScopesMartin Odersky2014-11-091-1/+1
| | | | | | | | | | | | | | | | Cleans up after LambdaLift and Flatten. RestoreScopes exhibited a problem (double definition) when compiling Unpickler. The root of the problem was in Applications.scala. The effect was that arguments woulkd be lifted out, but then the argument expression would be used anyway. That caused a closure to be present twice which caused the double def error much later. -Ycheck did not catch it because the two closure expressions were in non-overlapping scopes.
| * New miniphase: FlattenMartin Odersky2014-11-091-1/+1
| |
* | Detect cycles involving types bounded by singleton typesGuillaume Martres2014-11-061-0/+2
|/ | | | This fixes #193.
* Merge pull request #180 from smarter/fix/nosymbol-subtypingodersky2014-11-061-1/+1
|\ | | | | Fix subtyping of types without symbols
| * Fix subtyping of types without symbolsGuillaume Martres2014-10-091-1/+1
| |
* | Fix treatment of by name functionsMartin Odersky2014-10-271-4/+1
| | | | | | | | | | | | | | By-name functions like `(=> T) => T` were not treated correctly before. Witness the disabled `-Ycheck:gettersSetters` for transform/TreeCheckers in thge test suite. This commit changes the scheme how => T types are treated and fixes the problems with by-name functions.
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-31 00:44:37 +0000