diff options
author | Erik Rozendaal <erik@deler.org> | 2012-01-06 23:19:39 +0100 |
---|---|---|
committer | Erik Rozendaal <erik@deler.org> | 2012-01-06 23:19:39 +0100 |
commit | f656142ddbcecfd3f8482e2b55067de3d0ebd3ce (patch) | |
tree | c246d3ab63ab51c7d50debc380d69342071e31cf /src/library/scala/collection/immutable/TreeSet.scala | |
parent | 7e92b3c60574d7fc0a0e83de738b835f4f98a685 (diff) | |
download | scala-f656142ddbcecfd3f8482e2b55067de3d0ebd3ce.tar.gz scala-f656142ddbcecfd3f8482e2b55067de3d0ebd3ce.tar.bz2 scala-f656142ddbcecfd3f8482e2b55067de3d0ebd3ce.zip |
Restore old RedBlack class to maintain backwards compatibility.
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.
Diffstat (limited to 'src/library/scala/collection/immutable/TreeSet.scala')
-rw-r--r-- | src/library/scala/collection/immutable/TreeSet.scala | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/library/scala/collection/immutable/TreeSet.scala b/src/library/scala/collection/immutable/TreeSet.scala index f7ceafdf8f..899ef0e5eb 100644 --- a/src/library/scala/collection/immutable/TreeSet.scala +++ b/src/library/scala/collection/immutable/TreeSet.scala @@ -47,7 +47,7 @@ object TreeSet extends ImmutableSortedSetFactory[TreeSet] { * @define willNotTerminateInf */ @SerialVersionUID(-5685982407650748405L) -class TreeSet[A] private (tree: RedBlack.Tree[A, Unit])(implicit val ordering: Ordering[A]) +class TreeSet[A] private (tree: RedBlack.Node[A, Unit])(implicit val ordering: Ordering[A]) extends SortedSet[A] with SortedSetLike[A, TreeSet[A]] with Serializable { import immutable.{RedBlack => RB} @@ -105,7 +105,7 @@ class TreeSet[A] private (tree: RedBlack.Tree[A, Unit])(implicit val ordering: O def this()(implicit ordering: Ordering[A]) = this(null)(ordering) - private def newSet(t: RedBlack.Tree[A, Unit]) = new TreeSet[A](t) + private def newSet(t: RedBlack.Node[A, Unit]) = new TreeSet[A](t) /** A factory to create empty sets of the same type of keys. */ |