summaryrefslogtreecommitdiff
path: root/test/files/scalacheck/redblacktree.scala
Commit message (Collapse)AuthorAgeFilesLines
* Fix SI-5986.Aleksandar Prokopec2012-06-271-2/+2
| | | | | | | | | | | | Here we had an issue that RedBlack does not work the same way for sets - which are not supposed to replace an element if it is the same (wrt equals) and maps - which should replace the corresponding values. Adding an overwrite parameter which decides whether to overwrite added keys if they are the same in the ordering. Fix tests.
* Custom coded version of range/from/to/until.Erik Rozendaal2012-01-211-16/+10
| | | | | 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-151-13/+18
| | | | Performance of `to` and `until` is now the same.
* Test for maximum height of red-black tree.Erik Rozendaal2012-01-081-0/+5
|
* Renamed object RedBlack to RedBlackTree.Erik Rozendaal2012-01-071-0/+212
This more clearly separates the new implementation from the now deprecated abstract class RedBlack and avoids naming conflicts for the member classes.