summaryrefslogtreecommitdiff
path: root/test/files
Commit message (Collapse)AuthorAgeFilesLines
* TypeTag => AbsTypeTag, ConcreteTypeTag => TypeTagEugene Burmako2012-06-0883-364/+336
| | | | | This protects everyone from the confusion caused by stuff like this: https://issues.scala-lang.org/browse/SI-5884
* removes array tagsEugene Burmako2012-06-0836-262/+56
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Before 2.10 we had a notion of ClassManifest that could be used to retain erasures of abstract types (type parameters, abstract type members) for being used at runtime. With the advent of ClassManifest (and its subtype Manifest) it became possible to write: def mkGenericArray[T: Manifest] = Array[T]() When compiling array instantiation, scalac would use a ClassManifest implicit parameter from scope (in this case, provided by a context bound) to remember Ts that have been passed to invoke mkGenericArray and use that information to instantiate arrays at runtime (via Java reflection). When redesigning manifests into what is now known as type tags, we decided to explore a notion of ArrayTags that would stand for abstract and pure array creators. Sure, ClassManifests were perfectly fine for this job, but they did too much - technically speaking, one doesn't necessarily need a java.lang.Class to create an array. Depending on a platform, e.g. within JavaScript runtime, one would want to use a different mechanism. As tempting as this idea was, it has also proven to be problematic. First, it created an extra abstraction inside the compiler. Along with class tags and type tags, we had a third flavor of tags - array tags. This has threaded the additional complexity though implicits and typers. Second, consequently, when redesigning tags multiple times over the course of Scala 2.10.0 development, we had to carry this extra abstraction with us, which exacerbated the overall feeling towards array tags. Finally, array tags didn't fit into the naming scheme we had for tags. Both class tags and type tags sound logical, because, they are descriptors for the things they are supposed to tag, according to their names. However array tags are the odd ones, because they don't actually tag any arrays. As funny as it might sound, the naming problem was the last straw that made us do away with the array tags. Hence this commit.
* Introduces scala-reflect.jarEugene Burmako2012-06-081-2/+2
|
* repairs the tests after the refactoring spreeEugene Burmako2012-06-08503-1563/+2455
|
* preparations: removes DynamicProxyEugene Burmako2012-06-083-93/+0
| | | | | This is necessary because toolboxes will no longer be available from the library. Christopher Vogt will take care of the second reincarnation of DynamicRef.
* macros: refactoring of fast track infrastructureEugene Burmako2012-06-084-0/+25
| | | | | | | | | As a result, hardwired macros don't need implementation stubs. This is very important, because in a few commits scala.reflect.makro.Context will move out from scala-library.jar. Also adding fast track entries doesn't require jumping through hoops with PDTs. It's as simple as defining PartialFunction[Tree, Any].
* Merge pull request #672 from axel22/issue/5857Adriaan Moors2012-06-081-0/+45
|\ | | | | Fixes SI-5857. More efficient min and max in Range and NumericRange
| * Fixes SI-5857.Aleksandar Prokopec2012-06-061-0/+45
| | | | | | | | | | | | | | | | Override `min` and `max` in `Range` and `NumericRange` to check if a default `Ordering` for the numeric type in question is used. If so, bypass traversal and compute the minimum or maximum element.
* | Merge pull request #677 from axel22/feature/util-hashing2Josh Suereth2012-06-074-63/+3
|\ \ | | | | | | Add the first iteration of the `util.hashing` package.
| * | Add the first iteration of the `util.hashing` package.Aleksandar Prokopec2012-06-074-63/+3
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Move `MurmurHash3` to `util.hashing`. Make the `class` private and retain a public companion `object`, and put the `MurmurHash3.Hashing` implementations for various types in the companion. Add a method which composes `ByteswapHashing` with some other hashing. Rename `hashOf` to `hash`. Fix chi-square test in a test-case. Review by @jsuereth. Moved a failing test that seems to use some other library version to pending.
* | | Generate abstract methods in scala.Byte and friends.Paul Phillips2012-06-063-37/+47
|/ / | | | | | | | | Rather than stub implementations. This saves over 50K of bytecode. I also added the necessary imports to silence the feature warnings.
* | Merge pull request #673 from axel22/issue/5880Josh Suereth2012-06-061-0/+41
|\ \ | | | | | | Fix SI-5880.
| * | Fix SI-5880.Aleksandar Prokopec2012-06-061-0/+41
| |/ | | | | | | Add a ChiSquare test for the new hash code.
* | Merge pull request #671 from axel22/issue/5867Josh Suereth2012-06-062-0/+15
|\ \ | | | | | | Fix SI-5867.
| * | Fix SI-5867.Aleksandar Prokopec2012-06-062-0/+15
| |/ | | | | | | Override clone for unrolled buffer.
* / Fix SI-5879.Aleksandar Prokopec2012-06-062-0/+90
|/ | | | | | | | | | | | | | | | Fix a bug where a key in an immutable hash map have the corresponding value different in the iteration than when doing lookup. This use to happen after calling `merge`. Fix the order in which a key-value pair appears in the collision resolution function - the first argument always comes from the `this` hash map. Deprecate `merge` in favour of `merged`, as this is a pure method. As an added benefit, the syntax for invoking `merge` is now nicer.
* Merge pull request #655 from axel22/feature/hasherJosh Suereth2012-06-041-0/+46
|\ | | | | Implementing Hashing typeclass
| * Fix `Hashing`.Aleksandar Prokopec2012-06-011-1/+1
| | | | | | | | | | | | Move `Hashing` to `scala.util.hashing`. Adde `Hashing.Default` to `Hashing` companion object. Change `TrieMap` to autoswitch from `Hashing.Default` to `TrieMap.MangledHashing`.
| * Remove Equality in favour of Equiv.Aleksandar Prokopec2012-06-011-2/+2
| | | | | | | | Make Equiv serializable.
| * Add Hashing and Equality typeclasses.Aleksandar Prokopec2012-06-011-0/+46
| | | | | | | | | | | | Modify TrieMap to use hashing and equality. Modify serialization in TrieMap appropriately.
* | Merge pull request #665 from retronym/ticket/5213Adriaan Moors2012-06-041-0/+30
|\ \ | | | | | | SI-5313 Revert to two traversals in substThisAndSym.
| * | SI-5313 Revert to two traversals in substThisAndSym.Jason Zaugg2012-06-031-0/+30
| |/ | | | | | | Partially reverts 334872e.
* | Merge pull request #661 from retronym/ticket/5683Adriaan Moors2012-06-032-0/+39
|\ \ | | | | | | SI-5683 Fail gracefully when transposing a ragged type arg matrix.
| * | SI-5683 Fail gracefully when transposing a ragged type arg matrix.Jason Zaugg2012-06-032-0/+39
| |/ | | | | | | | | | | | | | | The code used to do this, until `transpose` starting throwing IAE rather than AIOOBE. Symptomatic treatment only: The reported crasher now infers ill-kinded type args and reports an error.
* | Revert "#653 -- no lub for statement exprs' types"Adriaan Moors2012-06-032-3/+3
| | | | | | | | | | | | | | | | | | I should not have merged this pull request yet. I didn't notice we didn't have a full successful run of the test suite. It looks like it breaks test/files/continuations-neg/lazy.scala and given the pending amount of changes, I prefer to have a stable master. This reverts commit 037d3dcbc5896864aec0f9121eeda23fcc4cd610.
* | Merge pull request #653 from dragos/issue/skip-lub-in-blocksAdriaan Moors2012-06-032-3/+3
|\ \ | | | | | | | | | Don't compute least upper bounds for if-like exprs in statement position
| * | Don't compute least upper bounds for expressions in statement positions ↵Iulian Dragos2012-06-032-3/+3
| |/ | | | | | | | | | | | | | | | | | | inside blocks. This may save huge amount of time (Fixes SI-5862) for complicated lubs. I had to remove the a check in adapt for the part that transforms <expr> into { <expr>; () } when the expected type is Unit. The reason is in the code. As a side effect, we get more warnings for pure expressions in statement positions (see the change in the test file).
* | Merge pull request #650 from adriaanm/topic-virtpatmatAdriaan Moors2012-06-038-1/+75
|\ \ | | | | | | | | | | | | Unreachability analysis for pattern matches Thanks for reviewing, @retronym!
| * | Unreachability analysis for pattern matchesAdriaan Moors2012-06-018-1/+75
| |/ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Analyze matches for unreachable cases. A case is unreachable if it implies its preceding cases. Call `C` the formula that is satisfiable if the considered case matches. Call `P` the formula that is satisfiable if the cases preceding it match. The case is reachable if there is a model for `-P /\ C`. Thus, the case is unreachable if there is no model for `-(-P /\ C)`, or, equivalently, `P \/ -C`, or `C => P`. Unreachability needs a more precise model for type and value tests than exhaustivity. Before, `{case _: Int => case 1 =>}` would be modeled as `X = Int \/ X = 1.type`, and thus, the second case would be reachable if we can satisfy `X != Int /\ X = 1.type`. Of course, the case isn't reachable, yet the formula is satisfiable, so we must augment our model to take into account that `X = 1.type => X = Int`. This is done by `removeVarEq`, which models the following axioms about equality. It does so to retain the meaning of equality after replacing `V = C` (variable = constant) by a literal (fresh symbol). For each variable: 1. a sealed type test must result in exactly one of its partitions being chosen (the core of exhaustivity) 2. when a type test is true, tests of super types must also be true, and unrelated type tests must be false For example, `V : X ::= A | B | C`, and `A => B` (since `A extends B`). Coverage (1) is formulated as: `A \/ B \/ C`, and the implications of (2) are simply `V=A => V=B /\ V=X`, `V=B => V=X`, `V=C => V=X`. Exclusion for unrelated types typically results from matches such as `{case SomeConst => case OtherConst => }`. Here, `V=SomeConst.type => !V=OtherConst.type`. This is a conservative approximation. If these constants happen to be the same value dynamically (but the types don't tell us this), the last case is actually unreachable. Of course we must err on the safe side. We simplify the equality axioms as follows (in principle this could be done by the solver, but it's easy to do before solving). If we've already excluded a pair of assignments of constants to a certain variable at some point, say `(-A \/ -B)`, then don't exclude the symmetric one `(-B \/ -A)`. (Nor the positive implications `-B \/ A`, or `-A \/ B`, which would entail the equality axioms falsifying the whole formula.) TODO: We should also model dependencies between variables: if `V1` corresponds to `x: List[_]` and `V2` is `x.hd`, `V2` cannot be assigned at all when `V1 = null` or `V1 = Nil`. Right now this is implemented hackily by pruning counter-examples in exhaustivity. Unreachability would also benefit from a more faithful representation. I had to refactor some of the framework, but most of it is shared with exhaustivity. We must allow approximating tree makers twice, sharing variables, but using different approximations for values not statically known. When considering reachability of a case, we must assume, for example, that its unknown guard succeeds (otherwise it would wrongly be considered unreachable), whereas unknown guards in the preceding cases must be considered to fail (otherwise we could never get to those case, and again, it would falsely be considered unreachable). Since this analysis is relatively expensive, you may opt-out using `-Xno-patmat-analysis` (or annotating the selector with @unchecked). We hope to improve the performance in the near future. -Ystatistics has also been extended to provide some numbers on time spent in the equality-rewrite, solving and analyzing.
* / Closes t5399. Review by adriaanmMartin Odersky2012-06-021-0/+45
|/
* Merge pull request #638 from lrytz/wip/t5843Adriaan Moors2012-05-302-0/+24
|\ | | | | fix t5843
| * fix t5843Lukas Rytz2012-05-282-0/+24
| |
* | Merge pull request #634 from retronym/ticket/4579Adriaan Moors2012-05-302-0/+519
|\ \ | | | | | | SI-4579 Yoke the power of lisp.scala as a stress for the optimizer.
| * | SI-4579 Yoke the power of lisp.scala as a stress for the optimizer.Jason Zaugg2012-05-272-0/+519
| | | | | | | | | | | | The reported bug was fixed between 2.10.0-M1 and 2.10.0-M2.
* | | Merge pull request #636 from retronym/ticket/5845Adriaan Moors2012-05-282-0/+23
|\ \ \ | | | | | | | | SI-5845 Advances the example from a crasher to an inference failure.
| * | | SI-5845 Advances the example from a crasher to an inference failure.Jason Zaugg2012-05-282-0/+23
| |/ / | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | The inference failure itself seems like an instance of of SI-3346. But dependent method types (which triggered the crash), can be employed to avoid inferring the type constructor CC. class Num[T] { def mkOps = new Ops class Ops { def +++(rhs: T) = () } } class A { implicit def infixOps[T](lhs: T)(implicit num: Num[T]): num.Ops = num.mkOps implicit val n1: Num[Int] = new Num[Int] { } 5 +++ 5 }
* | | Merge pull request #635 from adriaanm/topic/virtpatmatAdriaan Moors2012-05-282-6/+12
|\ \ \ | |_|/ |/| | fixes for exhaustivity
| * | don't check exhaustivity involving user-defined unapplySeqAdriaan Moors2012-05-282-6/+12
| |/
* | Merge pull request #633 from retronym/topic/value-class-bridgeAdriaan Moors2012-05-273-0/+19
|\ \ | |/ |/| Fix a NSDNHAO in extension methods.
| * Fix a NSDNHAO in extension methods.Jason Zaugg2012-05-273-0/+19
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | A bridge method, created when we override a method from a superclass and refine the return type, was appearing as an overloaded alternative. (`erasure` doesn't create new scopes, so the bridges it builds are visible at earlier phases.) The problem was masked when compiling with specialization, which *does* create a new scope, shielding the code in question from the artefacts of erasure. To fix the problem, we filter out bridge methods from the overloaded alternatives returned by `.decl`, as would happen internally in `.member`.
* | Orphan checkfile remover.Paul Phillips2012-05-2632-988/+0
|/ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Are these -msil checkfiles used in some secret fashion? The level of activity suggest otherwise. Since scala-nightly-msil has been disabled for over a year, it's an easy rm unless someone speaks up. % tools/rm-orphan-checkfiles Scanning for orphan check files... rm 'test/disabled/run/code.check' rm 'test/files/jvm/t1652.check' rm 'test/files/neg/macro-argtype-mismatch.check' rm 'test/files/neg/macro-noncompilertree.check' rm 'test/files/neg/macro-nontree.check' rm 'test/files/run/Course-2002-01-msil.check' rm 'test/files/run/Course-2002-02-msil.check' rm 'test/files/run/Course-2002-03-msil.check' rm 'test/files/run/Course-2002-04-msil.check' rm 'test/files/run/Course-2002-08-msil.check' rm 'test/files/run/Course-2002-09-msil.check' rm 'test/files/run/Course-2002-10-msil.check' rm 'test/files/run/absoverride-msil.check' rm 'test/files/run/bitsets-msil.check' rm 'test/files/run/boolord-msil.check' rm 'test/files/run/bugs-msil.check' rm 'test/files/run/impconvtimes-msil.check' rm 'test/files/run/infix-msil.check' rm 'test/files/run/iq-msil.check' rm 'test/files/run/macro-invalidret-doesnt-conform-to-impl-rettype.check' rm 'test/files/run/macro-rettype-mismatch.check' rm 'test/files/run/misc-msil.check' rm 'test/files/run/promotion-msil.check' rm 'test/files/run/richs-msil.check' rm 'test/files/run/runtime-msil.check' rm 'test/files/run/tuples-msil.check' rm 'test/pending/jvm/t1464.check' rm 'test/pending/run/subarray.check' rm 'test/pending/run/t0446.check' rm 'test/pending/run/t5629.check' Scanning for orphan flags files... rm 'test/files/neg/macro-argtype-mismatch.flags' rm 'test/files/neg/macro-noncompilertree.flags' rm 'test/files/neg/macro-nontree.flags' rm 'test/files/pos/anyval-children.flags' rm 'test/files/pos/t3097.flags' rm 'test/files/run/macro-invalidret-doesnt-conform-to-impl-rettype.flags' rm 'test/files/run/macro-rettype-mismatch.flags'
* Merge pull request #612 from adriaanm/ticket/5829Adriaan Moors2012-05-261-0/+18
|\ | | | | fix SI-5829: refinement typeref has a prefix
| * fix SI-5829: refinement typeref has a prefixAdriaan Moors2012-05-241-0/+18
| |
* | Merge pull request #626 from retronym/ticket/4818Adriaan Moors2012-05-262-0/+13
|\ \ | | | | | | Test case closes SI-4818
| * | Test case closes SI-4818Jason Zaugg2012-05-252-0/+13
| |/ | | | | | | Fixed between 2.10.0 M2 and M3, with both the old and new pattern matcher.
* | Merge pull request #630 from retronym/ticket/5041Adriaan Moors2012-05-261-0/+9
|\ \ | | | | | | Test case closes SI-5041.
| * | Test case closes SI-5041.Jason Zaugg2012-05-261-0/+9
| | |
* | | Test case closes SI-4911.Jason Zaugg2012-05-262-0/+17
|/ / | | | | | | The unchecked warning departed sometime between 4afae5be...278a225.
* | Merge pull request #625 from retronym/ticket/5318-3Adriaan Moors2012-05-256-0/+45
|\ \ | | | | | | SI-5318 Make implicit divergence checking PolyType aware.
| * | SI-5318 Make implicit divergence checking PolyType aware.Jason Zaugg2012-05-256-0/+45
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Replaces the two active subclasses of `SymCollector` with direct use of traversal methods of `Type`. Wildcard free class type parameters, not just method type parameters, when stripping the core type of candidate implicits. The spec doesn't make any such distinction, and the enclosed test, t5318c, crashes without this change.
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-05 23:24:34 +0000