summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Improved BitSet implementationsStefan Zeiger2011-12-019-179/+242
| | | | | | | | | | | | | | - Mutable and immutable BitSets now extend SortedSet, using a fixed Ordering.Int and an efficient bit mask based rangeImpl() - fromArray methods in both implementations are deprecated in favor of new fromBitMask and fromBitMaskNoCopy methods - New toBitMask method for converting bit sets back to Array[Long] bit masks - immutable.BitSet uses a more efficient Builder, based on mutable.BitSet (closes SI-4647) - Delete scala.tools.nsc.util.BitSet (not used anywhere) Review by @odersky
* Merge pull request #2 from skyluc/masterPaul Phillips2011-11-301-23/+23
|\ | | | | | | A bit more work on the layout layout
| * Fixed the layout layout. Added back the '†' and the description for tools.Luc Bourlier2011-11-301-23/+23
| |
* | Merge pull request #1 from jamie-allen/masterPaul Phillips2011-11-301-1/+1
|\ \ | |/ |/| | | The README.rst still says "Subversion repository"
| * Removed the word SubversionJamie Allen2011-11-301-1/+1
|/
* A bit of ascii art from @skyluc. This should make the README.rst prettier ↵Josh Suereth2011-11-301-23/+23
| | | | for showing the directory layout.
* Modified README to rst for github moveJosh Suereth2011-11-301-74/+107
|
* Fix for octal test.Paul Phillips2011-11-291-1/+4
| | | | | | At the last minute I made -Xfuture leading-0 an error and failed to update the checkfile.
* improve cps handling of if-then-else. no review.Tiark Rompf2011-11-295-29/+102
|
* Fixed -Xfuture 5.ds, deprecated 0-octal.Paul Phillips2011-11-299-60/+75
| | | | | | | | I messed up my trip to the future the first time around; now in the future 5.f is not an error but an attempt to call method "f" on 5 like nature intended. (Thank you simon for catching this.) And deprecated leading 0 for octal. Closes SI-5205.
* Fix for build.xml classpaths.Paul Phillips2011-11-291-5/+10
| | | | | | | | Found the cause of plugin build failures which have long haunted me at inopportune times. It's all built against locker instead of quick. Kind of a buzzkill to be fixing this during the "Ant End Times" but better now than never.
* Moved the test for SI-5230 from files to pendingEugene Burmako2011-11-292-0/+0
|
* Added the check against UnitClass in freeLocals...Eugene Burmako2011-11-292-1/+4
| | | | | | Added the check against UnitClass in freeLocalsTraverser. Closes SI-5245. Review by odersky.
* Test for SI-5230Eugene Burmako2011-11-292-0/+20
|
* Attempt to fix #5230. Review by burmako.Martin Odersky2011-11-291-2/+4
|
* Small change to get rid of naming awkwardness f...Martin Odersky2011-11-281-10/+11
| | | | | | | | | Small change to get rid of naming awkwardness for macros. Class based macros now have a parameter section (_this: Tree), module based macrod have an empty pararameter section () instead. So we can let them have the same name, because overloading resolution will distinguish them anyway. Review by burmako.
* -Yreify-copypaste: the copy/pasteable mode for ...Eugene Burmako2011-11-284-3/+70
| | | | | | | | | | | | | | | | | -Yreify-copypaste: the copy/pasteable mode for reification When experimenting with macros, I've found out that it's helpful to use the reifier to find out what Scala idioms map to what Tree shapes. However, stuff emitted by -Yreify-debug is too verbose, that's why I decided to put up a human-readable dumper. To use the dumps, you need to first import the following things: import scala.reflect.api._ import scala.reflect.mirror._ import scala.reflect.api.Modifier._ import scala.reflect.internal.Flags._ The stuff is really experimental, e.g. the tension between flags and modifiers needs to be thought out and addressed. Review by odersky.
* Revised macro defs, added a test case.Martin Odersky2011-11-287-19/+38
|
* Reflection toolboxes now respect settings that ...Eugene Burmako2011-11-286-1/+65
| | | | | | | | | | | Reflection toolboxes now respect settings that are provided to them. Before the fix CompilerCommand lacked the (args, settings, errorFn) ctor. I added it and provided means to augment passed settings with custom errorFn. Closes SI-5239. Review by odersky.
* test case for SI-3566vogt2011-11-281-0/+11
| | | | | no review
* Experimental version of macro definitions.Martin Odersky2011-11-288-64/+187
|
* Fix for erroneous bytecode generation.Paul Phillips2011-11-2822-247/+136
| | | | | | | | | | | | | | | | | | | A remedy for an IllegalAccessError where generated bytecode referred to an inaccessible type. Closes SI-1430. Bonus materials: - tore out all the invokedynamic support. The shipped jdk7 implementation shows limited resemblance to the one this was written against; the code mostly serves to distract. (I think I could get invokedynamic working pretty quickly, except that it would mean having a codebase for java7 and one for 5-6, which is not a yak I wish to shave today.) - gave NullClass and NothingClass objects of their own, which allowed a nice polymorphic simplification of isSubClass, plus a couple other streamlinings.
* fixed logic error in ant testsmichelou2011-11-271-2/+2
|
* added support for ant tests to partestmichelou2011-11-277-106/+210
|
* updated test cases for Scala Ant tasksmichelou2011-11-2732-121/+402
|
* attempt to fix reopened SI-5196michelou2011-11-272-25/+73
|
* Annotations reacquainted with reification.Paul Phillips2011-11-264-71/+90
| | | | | | | Had AnnotationInfo extend Product3 since it's no longer a case class. Tried to make reflection a little more robust. Closes SI-5223, review by vogt.
* low-hanging optimization fruit for virtpatmatAdriaan Moors2011-11-242-77/+97
| | | | | | | | | | | | | | removed unnecessary zero that was added to all matches... providing runOrElse's type args explicitly: speeds up compilation, removes hacks needed to bootstrap a bit of clean up to keep a list of list of treemakers, which encodes the match, until the last possible moment this list of list is going to be the subject of the analyses coming next no review
* Fast PartialFunction # orElse.Martin Odersky2011-11-2411-24/+32
|
* Reduced accumulation of repackExistentials.Paul Phillips2011-11-245-63/+58
| | | | | | | | | Was enjoying watching adriaan go for the record for redundant implementations of repackExistential, but eventually everyone has to join Club Code Reuse. Trimmed 2/3 of the implementations and put the remaining third somewhere it can be enjoyed by all. Continued by tearing apart and reassembling TypeVar. Review by moors.
* Minor restructuring in Implicits.Paul Phillips2011-11-245-197/+154
| | | | | | | | | | Another case where I tried to get into the performance party but ended up playing dungeons and dragons next door. However I did come away with an attractive tablecloth, which I draped over Implicits.scala before waving my magic wand. TRANSLATION: it's probably not faster but it's still better.
* Optimization of typedArgs.Paul Phillips2011-11-241-7/+17
| | | | | | | | Keep seeing what might be our single use of Tuple3#zipped so high in the profiling output. I don't think it's zipped3's fault, more that it figures prominently in a major consumer of compile time, but it's not going to hurt to send it on its merry way.
* Refinements of "def seq" and murmurhash.Paul Phillips2011-11-2419-57/+103
| | | | | | | | | | | | | | | | | | | | | | | | | | Trying to make hashcodes faster. Didn't achieve much on that front, so redirected into structural/consistency issues. The latter was lacking in terms of how/where "def seq" was defined. The documentation I can find doesn't give me much hint that the sequential form of my sequential collection might be a single-use iterator! (As in StringOps, ArrayOps.) If that's intentional it should be in huge letters. I'm assuming for now that it wasn't. Also, there was this: GenMapLike: def seq: Map[A, B] GenSetLike: def seq: Set[A] GenSeqLike: // nothing, returns Traversable So I added some def seqs where I needed the more specific types for my hashcode work. Hashcodewise, I broke the MurmurHash3 object into a reusable class and a collections-specific object, and I deprecated the methods which took GenTraversableOnce in favor of ones taking TraversableOnce, because there's no reason the hashcode library should have to know about things like "make sure to call seq before you traverse or you'll be sorry." Exclude things by their type and you can never make a mistake. End transmission.
* AnnotationInfo inertia takes me into continuati...Paul Phillips2011-11-237-154/+164
| | | | | | | | | | | | | | | | | | | | | | | | AnnotationInfo inertia takes me into continuations. And kept carrying me until I was carried away. The changes are mostly of the janitorial variety, just doing my part to make the interesting logic visible without being buried in low level compiler plumbing. Added at least one seriously convenient convenience method: tree modifyType fn // equivalent to if (tree.tpe == null) tree else tree setType fn(tree.tpe) This is the analogue to the recently added: symbol modifyInfo fn // same idea It's like having our carpets steam cleaned when we can keep pushing until machinery stays in the machine and the relevant logic stands gloriously on top. You'll eventually exclaim, "I didn't even know these carpets were that color!"
* New starr based on r26060.Paul Phillips2011-11-233-3/+3
|
* updated some code examplesmichelou2011-11-233-29/+34
|
* fixed deprecated number syntaxmichelou2011-11-231-7/+8
|
* - fixed code lifting of String, Int, ...vogt2011-11-231-1/+1
| | | | | Closes SI-3566. Review by moors.
* Slightly revised version for the new starr.Martin Odersky2011-11-232-2/+2
|
* Preparations for new version of AbstractPartial...Martin Odersky2011-11-234-9/+28
| | | | | | Preparations for new version of AbstractPartialFunctions that also does isDefinedAt correctly. Should be a new starr. Review by extempore.
* Enabling the use of 'compilerarg' with 'scalacf...Stefan Zeiger2011-11-231-6/+2
| | | | | | | | | Enabling the use of 'compilerarg' with 'scalacfork' task in the build process. 'compilerarg' was added in r26030 and pushed into starr with r26055. No review.
* Reworked AnnotationInfo patch.Paul Phillips2011-11-239-114/+84
| | | | | | | | Took a more ambitious swing based on input from martin. Eliminated the external map and gave annotations a more useful inheritance hierarchy. Eliminated AnnotationInfoBase and made LazyAnnotationInfo an AnnotationInfo (just like LazyType is a Type.) Review by odersky.
* New starr based on r26049.Paul Phillips2011-11-233-3/+3
|
* type test optimization now takes GADT hack into...Adriaan Moors2011-11-221-5/+5
| | | | | type test optimization now takes GADT hack into account
* optimized typedSubstAdriaan Moors2011-11-221-19/+24
|
* optimizing type tests and related stuffAdriaan Moors2011-11-222-10/+39
|
* a wider variety of treemakersAdriaan Moors2011-11-221-148/+163
| | | | | | optimized combining substitutions why we substitute in EqualityTestTreeMaker
* optimized version of condAdriaan Moors2011-11-221-0/+19
|
* fixed extraneous output. no review.Martin Odersky2011-11-221-1/+1
|
* Changed the way use cases are handled in scaladoc.Vlad Ureche2011-11-225-3/+55
| | | | | | | | | | If use cases are present, the original member disappears from the list. References SI-5054, but needs more work on the html part. If use cases are present along with links, scaladoc doesn't crash anymore. Closes SI-4898. Review by kzys.
generated by cgit v1.2.3 (git 2.39.1) at 2024-09-19 19:46:23 +0000