Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | Caching of implicit members | Martin Odersky | 2014-02-21 | 1 | -7/+11 | |
| | | | | Also, some streamlining in the way memberNames are computed. | |||||
* | Performance improvement: Special-case implementation of underlyingIfRepeated | Martin Odersky | 2014-02-21 | 1 | -2/+6 | |
| | ||||||
* | Peformance improvement: Better basetype caching | Martin Odersky | 2014-02-21 | 1 | -4/+4 | |
| | | | | Now first checks in cache before going into special case for static classes (derivesFrom on types is not free!) | |||||
* | Performance tuning: Inline TypeAlias case for hot maps. | Martin Odersky | 2014-02-21 | 4 | -42/+73 | |
| | ||||||
* | Bug fix: fix of typo in secondTry | Martin Odersky | 2014-02-21 | 1 | -1/+1 | |
| | ||||||
* | Bug fix: Logic for taking variance into account for TypeBounds comparisons ↵ | Martin Odersky | 2014-02-21 | 1 | -6/+3 | |
| | | | | was broken. | |||||
* | Bug fix: newSyntheticTypeParam did not incorporate paramFlags | Martin Odersky | 2014-02-21 | 1 | -1/+1 | |
| | ||||||
* | Reverted: Avoid using TypeBounds in alias refinements. | Martin Odersky | 2014-02-21 | 10 | -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.HashTable | Martin Odersky | 2014-02-21 | 1 | -3/+3 | |
| | ||||||
* | Drop unique hashing for superId bitsets | Martin Odersky | 2014-02-21 | 2 | -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 LRUCache | Martin Odersky | 2014-02-21 | 1 | -2/+2 | |
| | | | | Use eq for key comparisons in LRUCache. | |||||
* | Performance improvement: inline hasAltWith | Martin Odersky | 2014-02-21 | 2 | -2/+11 | |
| | | | | Gives us ~1%, it seems. | |||||
* | Avoid using TypeBounds in alias refinements. | Martin Odersky | 2014-02-21 | 10 | -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 RefinedType | Martin Odersky | 2014-02-21 | 4 | -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/runMain | Vlad Ureche | 2014-02-20 | 1 | -0/+232 | |
|\ | | | | | Script for running compiler outside sbt | |||||
| * | Script for running compiler outside sbt | Dmitry Petrashko | 2014-02-20 | 1 | -0/+232 | |
|/ | ||||||
* | Made blacklist in ScannerTest ignore the source path location of the ↵ | Martin Odersky | 2014-02-16 | 1 | -4/+4 | |
| | | | | blacklisted file. | |||||
* | Some small doc changes | Martin Odersky | 2014-02-16 | 2 | -1/+10 | |
| | ||||||
* | Merge pull request #23 from VladUreche/topic/scala-compile | DarkDimius | 2014-02-16 | 3 | -10/+28 | |
|\ | | | | | Add Scalac scanning to the Travis CI build | |||||
| * | Add Scalac scanning to the Travis CI build | Vlad Ureche | 2014-02-16 | 3 | -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 README | DarkDimius | 2014-02-15 | 1 | -0/+2 | |
| | ||||||
* | Removed clean (thanks @sjrd) | Vlad Ureche | 2014-02-14 | 1 | -1/+1 | |
| | ||||||
* | New worksheet highlighting some symbol and tree constructions | Martin Odersky | 2014-02-14 | 1 | -0/+104 | |
| | ||||||
* | Let Travis pick up the version from build.sbt | Vlad Ureche | 2014-02-14 | 1 | -3/+1 | |
| | ||||||
* | Merge pull request #21 from VladUreche/topic/travis | Vlad Ureche | 2014-02-14 | 2 | -0/+15 | |
|\ | | | | | Travis CI | |||||
| * | README with Travis badge | Vlad Ureche | 2014-02-14 | 1 | -0/+2 | |
| | | ||||||
| * | Travis CI | Vlad Ureche | 2014-02-14 | 1 | -0/+13 | |
|/ | ||||||
* | Avoid forming And/Or types with equal operands. | Martin Odersky | 2014-02-14 | 2 | -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 Odersky | 2014-02-14 | 1 | -28/+13 | |
| | ||||||
* | Two performance optimizations | Martin Odersky | 2014-02-13 | 6 | -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 Odersky | 2014-02-12 | 9 | -73/+89 | |
| | ||||||
* | Fixed a bug in LRUcache which prevented sizes >= 8. | Martin Odersky | 2014-02-12 | 3 | -3/+6 | |
| | ||||||
* | Merge branch 'origin/master' | Martin Odersky | 2014-02-11 | 2 | -4/+8 | |
|\ | ||||||
| * | Update README.md | odersky | 2014-02-07 | 1 | -1/+1 | |
| | | ||||||
| * | Update README.md | odersky | 2014-02-07 | 1 | -2/+6 | |
| | | ||||||
| * | Merge pull request #8 from VladUreche/issue/4 | Vlad Ureche | 2014-02-06 | 1 | -2/+2 | |
| |\ | | | | | | | Towards #4: dotc.tests working on my machine | |||||
| | * | Towards #4: dotc.tests working on my machine | Vlad Ureche | 2014-02-06 | 1 | -2/+2 | |
| |/ | | | | | | | File name issues | |||||
* | | Wrapped up definition of attachments. | Martin Odersky | 2014-02-11 | 2 | -41/+68 | |
| | | ||||||
* | | COnverted symOfTree and expandedTree to attachments. | Martin Odersky | 2014-02-11 | 3 | -18/+30 | |
| | | ||||||
* | | New scheme for attachments. | Martin Odersky | 2014-02-11 | 17 | -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 compilation | Martin Odersky | 2014-02-10 | 13 | -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 Odersky | 2014-02-10 | 7 | -75/+96 | |
| | | | ||||||
| * | | Make Definitions load all symbols in current runId. | Martin Odersky | 2014-02-10 | 8 | -1289/+63 | |
| | | | ||||||
| * | | WIP: Fixes to bring symbols forward | Martin Odersky | 2014-02-09 | 5 | -21/+66 | |
|/ / | ||||||
* | | Get rid of CompleteInCreationContext | Martin Odersky | 2014-02-09 | 2 | -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 context | Martin Odersky | 2014-02-09 | 8 | -197/+189 | |
| | | | | | | | | | | | | Instead current ctx is passed through everywhere. Question: can we factor out ctx better? | |||||
* | | Getting rid of some CompleInCreationContexts | Martin Odersky | 2014-02-09 | 4 | -17/+16 | |
| | | ||||||
* | | Making completer take an implicit context | Martin Odersky | 2014-02-09 | 11 | -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 Bench | Martin Odersky | 2014-02-09 | 1 | -3/+1 | |
| | | ||||||
* | | Move maxConstraint computation to RunInfo to avoid references to stale symbols. | Martin Odersky | 2014-02-09 | 3 | -11/+12 | |
| | |