Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Fetching contributors…

Cannot retrieve contributors at this time

55 lines (46 sloc) 1.166 kB
/* NSC -- new Scala compiler
* Copyright 2005-2011 LAMP/EPFL
* @author Martin Odersky
*/
package scala.tools.nsc
package util
/** Sets implemented as binary trees.
*
* @author Martin Odersky
* @version 1.0
*/
class TreeSet[T >: Null <: AnyRef](less: (T, T) => Boolean) extends Set[T] {
private class Tree(val elem: T) {
var l: Tree = null
var r: Tree = null
}
private var tree: Tree = null
def findEntry(x: T): T = {
def find(t: Tree): T = {
if (t eq null) null
else if (less(x, t.elem)) find(t.l)
else if (less(t.elem, x)) find(t.r)
else t.elem
}
find(tree)
}
def addEntry(x: T) {
def add(t: Tree): Tree = {
if (t eq null) new Tree(x)
else if (less(x, t.elem)) { t.l = add(t.l); t }
else if (less(t.elem, x)) { t.r = add(t.r); t }
else t
}
tree = add(tree)
}
def iterator = {
def elems(t: Tree): Iterator[T] = {
if (t eq null) Iterator.empty
else elems(t.l) ++ (Iterator single t.elem) ++ elems(t.r)
}
elems(tree)
}
override def toString(): String = {
if (tree eq null) "<empty>" else "(..." + tree.elem + "...)"
}
}
Jump to Line
Something went wrong with that request. Please try again.