aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Reverted: Avoid using TypeBounds in alias refinements.Martin Odersky2014-02-2110-178/+75
| | | | The idea is to use the alias itself. This cuts down on # of typebounds created and makes operations on refined infos and applied types more direct. (reverted from commit 81f31f9b71bc4466d3f04f5ce28ef94051688ecd)
* Performance improvement: Replace == with equals in util.HashTableMartin Odersky2014-02-211-3/+3
|
* Drop unique hashing for superId bitsetsMartin Odersky2014-02-212-8/+1
| | | | Reason: (1) There are few sets: When compiling doty itself, 1.2K sets total, hashed to 500 uniques. (2) Bitset comparison is expensive because it relies on a double inclusion test. (This should be fixed in the Scala stdlib).
* Performance improvement in LRUCacheMartin Odersky2014-02-211-2/+2
| | | | Use eq for key comparisons in LRUCache.
* Performance improvement: inline hasAltWithMartin Odersky2014-02-212-2/+11
| | | | Gives us ~1%, it seems.
* Avoid using TypeBounds in alias refinements.Martin Odersky2014-02-2110-75/+178
| | | | The idea is to use the alias itself. This cuts down on # of typebounds created and makes operations on refined infos and applied types more direct.
* Disentangling SelectionProto and RefinedTypeMartin Odersky2014-02-214-35/+30
| | | | There were too many problems caused by it, and too little gained. So, now SelectionProto is no longer a Subtype of RefinedType.
* Merge pull request #26 from DarkDimius/runMainVlad Ureche2014-02-201-0/+232
|\ | | | | Script for running compiler outside sbt
| * Script for running compiler outside sbtDmitry Petrashko2014-02-201-0/+232
|/
* Made blacklist in ScannerTest ignore the source path location of the ↵Martin Odersky2014-02-161-4/+4
| | | | blacklisted file.
* Some small doc changesMartin Odersky2014-02-162-1/+10
|
* Merge pull request #23 from VladUreche/topic/scala-compileDarkDimius2014-02-163-10/+28
|\ | | | | Add Scalac scanning to the Travis CI build
| * Add Scalac scanning to the Travis CI buildVlad Ureche2014-02-163-10/+28
|/ | | | | And silence some of the error messages we print so the build log doesn't go above 4MB (Travis' limit)
* Added information about mailing list to READMEDarkDimius2014-02-151-0/+2
|
* Removed clean (thanks @sjrd)Vlad Ureche2014-02-141-1/+1
|
* New worksheet highlighting some symbol and tree constructionsMartin Odersky2014-02-141-0/+104
|
* Let Travis pick up the version from build.sbtVlad Ureche2014-02-141-3/+1
|
* Merge pull request #21 from VladUreche/topic/travisVlad Ureche2014-02-142-0/+15
|\ | | | | Travis CI
| * README with Travis badgeVlad Ureche2014-02-141-0/+2
| |
| * Travis CIVlad Ureche2014-02-141-0/+13
|/
* Avoid forming And/Or types with equal operands.Martin Odersky2014-02-142-10/+12
| | | | This can happen in particular in derivedAnd/Or type, when applying a substitution or other mapping which identifies two types that were different before.
* Streamlined treatment of ThisType in subtype checks.Martin Odersky2014-02-141-28/+13
|
* Two performance optimizationsMartin Odersky2014-02-136-57/+71
| | | | | 1) Split out wildApprox into separate function 2) Be more careful not to follow static prefix chains where not needed
* Some changes in the interest of speedups.Martin Odersky2014-02-129-73/+89
|
* Fixed a bug in LRUcache which prevented sizes >= 8.Martin Odersky2014-02-123-3/+6
|
* Merge branch 'origin/master'Martin Odersky2014-02-112-4/+8
|\
| * Update README.mdodersky2014-02-071-1/+1
| |
| * Update README.mdodersky2014-02-071-2/+6
| |
| * Merge pull request #8 from VladUreche/issue/4Vlad Ureche2014-02-061-2/+2
| |\ | | | | | | Towards #4: dotc.tests working on my machine
| | * Towards #4: dotc.tests working on my machineVlad Ureche2014-02-061-2/+2
| |/ | | | | | | File name issues
* | Wrapped up definition of attachments.Martin Odersky2014-02-112-41/+68
| |
* | COnverted symOfTree and expandedTree to attachments.Martin Odersky2014-02-113-18/+30
| |
* | New scheme for attachments.Martin Odersky2014-02-1117-27/+114
| | | | | | | | | | | | | | Added general way to put attachments on some base type (which needs to inherit from Attachment.Container). Used it to turn typedTree map into an attachment. Also, moved DotClass to dotc.util.
* | Merge branch 'wip/bring-forward': Incremental compilationMartin Odersky2014-02-1013-1339/+182
|\ \ | | | | | | | | | | | | 1) Make definitions load symbols in current run 2) Change handling of invalid parents. Instead of a copied denotation, we now invalidate the caches of the existing one. (Copying was not enough, as old versions of denotations kept leaking in).
| * | New scheme for incremental invalidation of parents.Martin Odersky2014-02-107-75/+96
| | |
| * | Make Definitions load all symbols in current runId.Martin Odersky2014-02-108-1289/+63
| | |
| * | WIP: Fixes to bring symbols forwardMartin Odersky2014-02-095-21/+66
|/ /
* | Get rid of CompleteInCreationContextMartin Odersky2014-02-092-8/+5
| | | | | | | | The only remaining completers that complete in creation context are the source completers defined in Namers. So a separate abstraction is no longer needed.
* | Symbol loaders no longer complete with creation contextMartin Odersky2014-02-098-197/+189
| | | | | | | | | | | | Instead current ctx is passed through everywhere. Question: can we factor out ctx better?
* | Getting rid of some CompleInCreationContextsMartin Odersky2014-02-094-17/+16
| |
* | Making completer take an implicit contextMartin Odersky2014-02-0911-71/+97
| | | | | | | | | | | | | | As a first step, we make the complete method in LazyType take an implicit context parameter. This requires a fairly large propagation of implicit contexts. The implicit parameter is ignored for classes inheriting from CompleteInCreationContext (which until now are all completers). The next step will be to make the complete methods of selective lazy types take the current context, rather than the creation context.
* | Fix for creating right number of compilers in BenchMartin Odersky2014-02-091-3/+1
| |
* | Move maxConstraint computation to RunInfo to avoid references to stale symbols.Martin Odersky2014-02-093-11/+12
| |
* | Skolems are permanent, but not packages.Martin Odersky2014-02-091-3/+5
| |
* | Generalize test infrastructureMartin Odersky2014-02-073-15/+17
| | | | | | | | Compiler tests can now be run with configurable number of compilers and runs in a compiler.
* | Invalidate companions after indexing.Martin Odersky2014-02-071-13/+10
| | | | | | | | Invalidating them before indexing means symbols are touched before a new version is entered, which leads to "compiled twice" errors.
* | Replace open package module logic by special member lookups in a package class.Martin Odersky2014-02-073-46/+52
| | | | | | | | Rather than fiddling with scopes, which can lead to race conditions, we now special case member lookup and mamber name filters in ClassDenotations that represent packages.
* | Make skolems live forever...Martin Odersky2014-02-062-6/+9
| | | | | | | | ... because there's no way to reload them in a new run.
* | Catch stale referencesMartin Odersky2014-02-063-7/+10
| | | | | | | | If a NamedType was denoted a SymDenotation one run, but stops being defined in the next, throw a staleSymbol error.
* | Checking for already existing symbols before creating new ones.Martin Odersky2014-02-065-14/+38
|/ | | | | Otherwise we get spurious "compiled twice" errors on every symbol defined in a run after the first one. Also, fixed a bug so that now run ids are correctly incremented.
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-02 13:02:55 +0000