src/compiler/scala/tools/nsc/util/TreeSet.scala


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

/* NSC -- new scala compiler
 * Copyright 2005 LAMP/EPFL
 * @author  Martin Odersky
 */
// $Id$
package scala.tools.nsc.util;

/** Sets implemented as binary trees.
 */
class TreeSet[T >: AllRef <: 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 == 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): unit = {
    def add(t: Tree): Tree = {
      if (t == 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 elements = {
    def elems(t: Tree): Iterator[T] = {
      var it = Iterator.single(t.elem);
      if (t.l != null) it = elems(t.l) append it;
      if (t.r != null) it = it append elems(t.r);
      it
    }
    if (tree == null) Iterator.empty else elems(tree)
  }

  override def toString(): String = {
    if (tree == null) "<empty>" else "(..." + tree.elem + "...)";
  }
}