| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
This more clearly separates the new implementation from the now
deprecated abstract class RedBlack and avoids naming conflicts
for the member classes.
|
|
|
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
|
|
| |
Use ArrayStack instead of Stack in TreeIterator for slightly increased
performance.
|
| |
|
|
|
|
|
|
|
|
|
|
| |
I haven't been able to find any reason for that reversal, but
this version is an improved version provided with SI-3796, which
never got committed along with the patch.
This version generates trees directly instead of using the methods
under test. It also puts an upper bound on tree size and, therefore,
execution time.
|
|
|
|
|
|
|
|
| |
changes necessary to plug it back in while preserving everything which
has happened since then in tests and such, but we should be the lookout
for overreversion. Review by phaller (but as a formality, I don't think
it requires direct review.)
|
|
A redblack tree scalacheck test contributed by dcsobral. No review.
|