summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Merge branch 'develop'Paul Phillips2012-02-1719-548/+1083
|\
| *---. Merge remote-tracking branches 'VladUreche/issue/5005', ↵Paul Phillips2012-02-1718-547/+1078
| |\ \ \ | | | | | | | | | | | | | | | 'adriaanm/topic/virtpatmat', 'dcsobral/ticket/5439' and 'magarciaEPFL/cleanInliner' into develop
| | | | * significantly faster Inliner, with extensive documentation.Miguel Garcia2012-02-173-336/+635
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | The same inlining decisions are made as before, see -Ylog:inliner, with a focus on lines starting with "[log inliner] Inlining" review by @VladUreche @dragos @paulp
| | | * | Move code to a better place.Daniel C. Sobral2012-02-171-2/+3
| | | |/
| | * | [vpm] simpler implementation of switch emissionAdriaan Moors2012-02-171-30/+13
| | | |
| | * | [vpm] PF's missingCase, cleaned up isDefinedAt genAdriaan Moors2012-02-174-94/+122
| | | |
| | * | [vpm] avoid triggering virtualized matchingAdriaan Moors2012-02-171-9/+9
| | | |
| | * | [vpm] generate proper isDefinedAt for switchesAdriaan Moors2012-02-173-3/+35
| | | | | | | | | | | | | | | | don't consider the matcherror-throwing catch-all case (generated by virtpatmat) a default case
| | * | [vpm] working type switch for try/catchAdriaan Moors2012-02-179-107/+295
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | catch handlers are now also translated by the virtualizing pattern matcher emit type-based switches when possible, fallback to catch-all with full pattern match (the logic used to emit constant-based switches was generalized to type-based switches, abstracting out how to refer to the scrutinee and the shape of a default/catch-all case) this was the last missing piece of essential functionality now the virtualizing pattern matcher and the old one are mutually exclusive: -Yvirtpatmat disables the old matcher logic completely
| | * | remove unused `tree` argument from typedCasesAdriaan Moors2012-02-173-6/+6
| | |/
| * / Prevent extaneous output in SI-5005Vlad Ureche2012-02-161-1/+5
| |/
* / Fixed AnyRef specialization.Paul Phillips2012-02-1711-32/+148
|/ | | | | | | | | | At least for the value of fix which means "better than it was in 2.9." I accidentally spent a long while trying to fix something I didn't realize I hadn't broken. But then I lucked into partially fixing it, so that's good news. See run/t5488-fn.scala if you want to see what still doesn't work. (It's covered at SI-4770, which is now reopened.) Closes SI-5488.
* Merge remote-tracking branch 'erikrozendaal/SI-5331' into developPaul Phillips2012-02-158-89/+1181
|\
| * Removed TODOs.Erik Rozendaal2012-01-241-2/+2
| |
| * Custom implementations of drop/take/slice.Erik Rozendaal2012-01-235-12/+75
| | | | | | | | This mainly helps performance when comparing keys is expensive.
| * Custom coded version of range/from/to/until.Erik Rozendaal2012-01-214-42/+59
| | | | | | | | | | This avoids unnecessary allocation of Option and Function objects, mostly helping performance of small trees.
| * Optimized implementation of TreeMap/TreeSet#to method.Erik Rozendaal2012-01-156-24/+77
| | | | | | | | Performance of `to` and `until` is now the same.
| * Test for maximum height of red-black tree.Erik Rozendaal2012-01-081-0/+5
| |
| * Fix silly copy-paste error.Erik Rozendaal2012-01-071-9/+9
| |
| * Tests for takeWhile/dropWhile/span.Erik Rozendaal2012-01-074-8/+32
| | | | | | | | Also simplified implementation of span to just use splitAt.
| * Renamed object RedBlack to RedBlackTree.Erik Rozendaal2012-01-076-469/+690
| | | | | | | | | | | | This more clearly separates the new implementation from the now deprecated abstract class RedBlack and avoids naming conflicts for the member classes.
| * Restore old RedBlack class to maintain backwards compatibility.Erik Rozendaal2012-01-064-171/+452
| | | | | | | | | | | | | | | | | | The class is marked as deprecated and no longer used by the TreeMap/TreeSet implementation but is restored in case it was used by anyone else (since it was not marked as private to the Scala collection library). Renamed RedBlack.{Tree,RedTree,BlackTree} to Node, RedNode, and BlackNode to work around name clash with RedBlack class.
| * Deprecate TreeMap.isSmaller and TreeSet.isSmaller.Erik Rozendaal2012-01-062-0/+2
| | | | | | | | | | | | These methods were used by the old RedBlack tree implementation, but are no longer required and were not defined in any interface. Use ordering or compare instead.
| * Add implementation notes. Consistently use eq/ne to compare with null.Erik Rozendaal2012-01-051-7/+24
| |
| * Move nth method to RedBlack. Inline factories for tree nodes.Erik Rozendaal2012-01-053-18/+20
| |
| * Optimize foreach and iterators.Erik Rozendaal2012-01-045-44/+103
| |
| * Use null to represent empty trees. Removed Empty/NonEmpty classes.Erik Rozendaal2012-01-034-404/+367
| |
| * Implemented range without using pattern matching.Erik Rozendaal2012-01-021-9/+14
| |
| * Implemented deletes without pattern matching.Erik Rozendaal2012-01-021-61/+72
| |
| * Moved key/value/left/right fields up to NonEmpty class. Don't relyErik Rozendaal2012-01-023-33/+57
| | | | | | | | on pattern matching for updating the tree.
| * Minimize number of calls to ordering.Erik Rozendaal2011-12-281-13/+14
| |
| * Added some tests for TreeMap/TreeSet.Erik Rozendaal2011-12-282-0/+182
| |
| * Improved performance of RedBlack.NonEmpty.nth (helps take/drop/split/etc).Erik Rozendaal2011-12-281-2/+3
| |
| * Performance improvements for iteration (foreach and iterator).Erik Rozendaal2011-12-283-18/+51
| |
| * TreeMap/TreeSet no longer keep track of the size (the RedBlack treeErik Rozendaal2011-12-282-40/+31
| | | | | | | | already does so).
| * Made RedBlack private to the scala.collection.immutable package.Erik Rozendaal2011-12-282-10/+12
| | | | | | | | | | Use ArrayStack instead of Stack in TreeIterator for slightly increased performance.
| * Make sure the redblack test compiles and runs.Erik Rozendaal2011-12-282-42/+37
| |
| * Use single shared Empty instance across all RedBlack trees.Erik Rozendaal2011-12-283-23/+32
| |
| * Changed abstract class RedBlack to singleton object.Erik Rozendaal2011-12-283-10/+13
| |
| * Moved type parameter A from RedBlack to Tree.Erik Rozendaal2011-12-283-71/+71
| |
| * Moved from Empty case object to case class in preparation of movingErik Rozendaal2011-12-283-15/+15
| | | | | | | | type parameter A.
| * Moved from implicit ordering value to implicit parameter.Erik Rozendaal2011-12-281-17/+15
| |
| * Switched from isSmaller to ordering.Erik Rozendaal2011-12-281-9/+9
| |
| * Implemented takeWhile/dropWhile/span to use tree splitting. ThisErik Rozendaal2011-12-282-0/+26
| | | | | | | | | | changes the operation from O(n log n) to O(n) and allows for more structural sharing.
| * Implemented drop/take/slice/splitAt/dropRight/takeRight forErik Rozendaal2011-12-283-0/+53
| | | | | | | | | | | | TreeMap/TreeSet by splitting the underlying RedBlack tree. This makes the operation O(log n) instead of O(n) and allows more structural sharing.
| * RedBlack.scala: Change count from 'def' to 'val' in NonEmpty treeErik Rozendaal2011-12-281-1/+1
| | | | | | | | | | to ensure TreeSet/TreeMap 'range' operations are O(log n) instead of O(n).
| * Optimized implementation of init/tail for TreeSet/TreeMap.Erik Rozendaal2011-12-282-0/+6
| |
| * Optimized implementations of head/headOption/last/lastOption forErik Rozendaal2011-12-283-0/+19
| | | | | | | | TreeMap/TreeSet.
| * Use custom implementation for iterating over RedBlack trees. RawErik Rozendaal2011-12-281-5/+31
| | | | | | | | performance is much better than '++' based iterator.
| * Use RedBlack.iterator to create iterators for TreeSet/TreeMap.Erik Rozendaal2011-12-282-2/+2
| | | | | | | | | | | | | | This turns iterator creation from an O(n) operation into an O(log n) operation. Unfortunately, it halves actual iteration speed (consuming the iterator fully), probably due to the many by-name closures that are needed.
generated by cgit v1.2.3 (git 2.39.1) at 2024-09-17 22:52:08 +0000