Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Collapsed some methods in PreDenotations… | Martin Odersky | 2013-03-05 | 3 | -84/+52 |
| | | | | … that were always called together. Also, some general polishing for Types. | ||||
* | Rewrite of isVolatile | Martin Odersky | 2013-03-04 | 3 | -91/+129 |
| | | | | Also, now all calls to NamedType#underlying are montored for infinite cycles. | ||||
* | Dropped context from altsWith/suchThat/hasAlt | Martin Odersky | 2013-03-04 | 1 | -12/+14 |
| | |||||
* | Renamed RefinedType#name, #info… | Martin Odersky | 2013-03-04 | 7 | -67/+49 |
| | | | | … to refinedName, refinedInfo. Also some other polishings in Types. | ||||
* | Added logic that retains symbol denotations from one run to the next if it ↵ | Martin Odersky | 2013-03-04 | 1 | -39/+63 |
| | | | | is safe to do so. | ||||
* | Polishing of Symbols. | Martin Odersky | 2013-03-04 | 3 | -41/+49 |
| | |||||
* | Finished polishing of SymDenotations | Martin Odersky | 2013-03-03 | 1 | -39/+57 |
| | |||||
* | Merge remote-tracking branch 'origin/master' | Martin Odersky | 2013-03-03 | 0 | -0/+0 |
|\ | |||||
| * | New LRU Cache implementation | Martin Odersky | 2013-03-03 | 3 | -95/+148 |
| | | |||||
* | | Split scopes into immutable and mutable parts. | Martin Odersky | 2013-03-03 | 8 | -82/+112 |
| | | | | | | | | The goal is that symbols should be entered/deleted directly into classes instead of their scopes. This is necesaary so that invariant about fingerPrint can be maintained. We achieve it by making the info scope have immutable type, so an explicit cast is needed to get around that. | ||||
* | | New LRU Cache implementation | Martin Odersky | 2013-03-03 | 4 | -99/+152 |
|/ | |||||
* | Polishing of denotations | Martin Odersky | 2013-03-02 | 6 | -122/+169 |
| | | | | | | | | 1. Dropped owner from denot#asSeenFrom. Code inspection shows that one needs to take the owner of the symbol in each alternative instead. 2. Changed fullName so that terms in the ownerchain leave a trace. Needed for disambiguating private symbols with expanded names. See worksheet nesting.sc for an example. 3. Changed fingerPrint so that only classes with children have their fingerPrints computed. Reason: When we lookup a member of a class initially, it's likely that the member is present, so a bloom filter will not buy us much and will take up memory. For parent classes it's different. We might have found the member already in the child, or in a different parent, so it's more likely that the fingerPrint is effective. | ||||
* | Bug fixes and cleanups for names. | Martin Odersky | 2013-03-01 | 4 | -31/+52 |
| | |||||
* | Fixes Name#slice. | Martin Odersky | 2013-02-28 | 2 | -1/+12 |
| | |||||
* | Polishing of Denotations and Transformers. | Martin Odersky | 2013-02-28 | 3 | -69/+137 |
| | |||||
* | more docs. | Martin Odersky | 2013-02-28 | 5 | -23/+31 |
| | | | | Plus renamed NullSignature -> NotAMethod | ||||
* | Some worksheets to start testing | Martin Odersky | 2013-02-28 | 4 | -19/+71 |
| | |||||
* | fixes to flags | Martin Odersky | 2013-02-28 | 1 | -5/+12 |
| | |||||
* | Fixes to names | Martin Odersky | 2013-02-28 | 1 | -7/+19 |
| | |||||
* | Cleanup of flags | Martin Odersky | 2013-02-27 | 5 | -30/+40 |
| | | | | Plus some more doc comments. | ||||
* | Cleanup of decorators | Martin Odersky | 2013-02-27 | 1 | -2/+15 |
| | |||||
* | Cleaup of Contexts | Martin Odersky | 2013-02-27 | 7 | -39/+112 |
| | |||||
* | Renamed DenotationSet -> PreDenotation | Martin Odersky | 2013-02-27 | 3 | -26/+26 |
| | |||||
* | Fixed ModuleDefs so that they produce code that keeps invariants of tree maps. | Martin Odersky | 2013-02-27 | 1 | -3/+23 |
| | | | | | We need to make sure that every symbol that needs to be changed in a treemap is visible in the tree. For that reason, ModuleDefs now generate ClassDefs that are integrated in the regular tree, next to the ValDef the represents the module. | ||||
* | Refinements to signature handling. | Martin Odersky | 2013-02-27 | 2 | -42/+73 |
| | | | | Decoupled paramSignature from erasure in the interest of efficiency. | ||||
* | Rename Shared -> SharedTree | Martin Odersky | 2013-02-27 | 4 | -21/+21 |
| | |||||
* | Filling in all ???s | Martin Odersky | 2013-02-27 | 26 | -147/+734 |
| | | | | | | | Added reporters. Added context for signatures. Implemented method signatures via erasure. Refined derivedNameType handling. | ||||
* | Fleshing out some ???'s | Martin Odersky | 2013-02-25 | 5 | -21/+25 |
| | |||||
* | Completed implementation of Flags | Martin Odersky | 2013-02-25 | 6 | -126/+242 |
| | | | | Including translation from Scala 2.x flags. | ||||
* | Systeamtic use of symbolicRef abbreviation. | Martin Odersky | 2013-02-25 | 3 | -3/+3 |
| | |||||
* | Refactoring and cleanup of several symbol creation related aspects. | Martin Odersky | 2013-02-24 | 15 | -566/+582 |
| | | | | | | | 1. Went back to old completer model where completers are types. 2. Made class denotations a simple optimzation of symbol denotatons (with more caches) by moving all class-specific attributes into ClassInfo. 3. Now all symbol and symbol denotation creations are routed through one of 3 methods: newNakedSymbol, newNakedClassSymbol, newSymDenotation. | ||||
* | Moving associatedFile from SymDenotation to Symbol | Martin Odersky | 2013-02-23 | 4 | -43/+50 |
| | | | | Motivation: This is something that stays invariant over all periods. but _can_ change between compilation runs. Therefore it matches the lifetime of a Symbol. | ||||
* | UnPickler now also reads trees. | Martin Odersky | 2013-02-22 | 2 | -300/+312 |
| | |||||
* | Added methods to substitute trees and change their owners. | Martin Odersky | 2013-02-22 | 4 | -9/+127 |
| | | | | Required also some better integration with TypeMaps. | ||||
* | Changed meaning of DefTree/isDef, plus other Tree changes | Martin Odersky | 2013-02-22 | 1 | -21/+39 |
| | | | | | | | | isDef now means: Defines a new symbol. Consequently, templates are DefTrees (because they define LocalDummy), but package clauses are not. DefTrees are now pickier about the names they accept. New generic instances of TreeAccumulator: ShallowFolder and DeepFolder. | ||||
* | Added substSym method and dropped NoPrefix requirement. | Martin Odersky | 2013-02-22 | 1 | -18/+43 |
| | | | | Substituters now work on arbitrary NamedTypes, even if the prefix is different from NoPrefix. | ||||
* | Added previously forgotten typed Try trees, modified params of typed Super ↵ | Martin Odersky | 2013-02-22 | 1 | -6/+14 |
| | | | | trees. | ||||
* | Misc fixes to typed trees, flags, and elsewhere. | Martin Odersky | 2013-02-21 | 7 | -76/+105 |
| | |||||
* | Some cleanups in Flags | Martin Odersky | 2013-02-21 | 1 | -34/+19 |
| | |||||
* | Changed function expansion and fleshed out checkType | Martin Odersky | 2013-02-21 | 1 | -47/+244 |
| | | | | Function expansion got changed so that it requires an explicit target type and that target type can be an arbitrary SAM type. | ||||
* | More utility methods and split up filter | Martin Odersky | 2013-02-21 | 4 | -28/+91 |
| | | | | More utility methods in types. Also replaced Denotation#filter with a set of more useful operations. | ||||
* | Generalized ArrayValue -> SeqLiteral | Martin Odersky | 2013-02-21 | 2 | -15/+28 |
| | | | | Also introduced new category of pattern trees. | ||||
* | Some more Definitions entries | Martin Odersky | 2013-02-21 | 1 | -21/+27 |
| | |||||
* | Shortcircuited all <:< and =:= calls in TypeComparers | Martin Odersky | 2013-02-21 | 1 | -6/+13 |
| | |||||
* | Refined tree typing and started on checks | Martin Odersky | 2013-02-20 | 5 | -66/+162 |
| | | | | | | | | Function nodes are now no longre typed trees; they are represented instead as blocks: { def $anonfun(…) = …; $anonfun }. Refined block typing to autiomatically widen some types when they occur as result type of a block. Started writing check code that enforces Scala's typesystem rules oin typed trees. | ||||
* | New utility operations. Made typeSymbol/termSymbol apply to TypeProxies. | Martin Odersky | 2013-02-20 | 1 | -1/+12 |
| | |||||
* | Moved TypeTrees defs into nested object tpd. | Martin Odersky | 2013-02-20 | 5 | -252/+257 |
| | | | | Reason: We need normal trees to do efficient pattern matching. So if we want to both pattern match and create trees we need to import Trees._ and TypedTrees.tpd. Then typed tree construction needs to be prefixed with tpd, e.g. tpd.Select(pre, name). | ||||
* | Completed pluggability hooks for trees. | Martin Odersky | 2013-02-20 | 1 | -57/+102 |
| | |||||
* | Merge branch 'simplified-completers' | Martin Odersky | 2013-02-19 | 10 | -402/+927 |
|\ | |||||
| * | Feasibility study for transformer plugins | Martin Odersky | 2013-02-19 | 2 | -5/+114 |
| | |