in scala.collection.immutable
class TreeSet

@scala.serializable

class TreeSet [A]
extends scala.collection.immutable.RedBlack[A]
with scala.collection.immutable.SortedSet[A]
with scala.ScalaObject
This class implements immutable sets using a tree.
Author:
Martin Odersky
Version:
2.0, 02/01/2007

Constructor Summary
def this ()(view$4: (A) => scala.Ordered[A])

def this (size: scala.Int, t: scala.collection.immutable.RedBlack.Tree[scala.Unit])(view$3: (A) => scala.Ordered[A])

Val Summary
val size : scala.Int

protected val tree : scala.collection.immutable.RedBlack.Tree[scala.Unit]

Def Summary
def + (elem: A) : scala.collection.immutable.TreeSet[A]
A new TreeSet with the entry added is returned,
def - (elem: A) : scala.collection.immutable.TreeSet[A]

override def compare (a0: A, a1: A) : scala.Int

def contains (elem: A) : scala.Boolean
Checks if this set contains element elem.
def elements : scala.Iterator[A]
Creates a new iterator over all elements contained in this object.
def elementsSlow : scala.Iterator[A]

def empty [B] : scala.collection.immutable.Set[B]
A factory to create empty maps of the same type of keys.
override def exists (f: (A) => scala.Boolean) : scala.Boolean

override def first : A

override def forall (f: (A) => scala.Boolean) : scala.Boolean

override def foreach (f: (A) => scala.Unit) : scala.Unit

def insert (elem: A) : scala.collection.immutable.TreeSet[A]
A new TreeSet with the entry added is returned, assuming that elem is not in the TreeSet.
def isSmaller (x: A, y: A) : scala.Boolean

override def last : A

override def rangeImpl (from: scala.Option[A], until: scala.Option[A]) : scala.collection.immutable.TreeSet[A]

Def inherited from scala.collection.immutable.RedBlack[A]
blacken , isSmaller, mkTree
Constructor Detail
def this ()(view$4: (A) => scala.Ordered[A])

def this (size: scala.Int, t: scala.collection.immutable.RedBlack.Tree[scala.Unit])(view$3: (A) => scala.Ordered[A])

Val Detail
val size : scala.Int

protected val tree : scala.collection.immutable.RedBlack.Tree[scala.Unit]

Def Detail
def + (elem: A): scala.collection.immutable.TreeSet[A]
A new TreeSet with the entry added is returned,

def - (elem: A): scala.collection.immutable.TreeSet[A]

override def compare (a0: A, a1: A): scala.Int

def contains (elem: A): scala.Boolean
Checks if this set contains element elem.
Parameters:
elem - the element to check for membership.
Returns:
true, iff elem is contained in this set.

def elements : scala.Iterator[A]
Creates a new iterator over all elements contained in this object.
Returns:
the new iterator

def elementsSlow : scala.Iterator[A]

def empty [B]: scala.collection.immutable.Set[B]
A factory to create empty maps of the same type of keys.

override def exists (f: (A) => scala.Boolean): scala.Boolean

override def first : A

override def forall (f: (A) => scala.Boolean): scala.Boolean

override def foreach (f: (A) => scala.Unit): scala.Unit

def insert (elem: A): scala.collection.immutable.TreeSet[A]
A new TreeSet with the entry added is returned, assuming that elem is not in the TreeSet.

def isSmaller (x: A, y: A): scala.Boolean

override def last : A

override def rangeImpl (from: scala.Option[A], until: scala.Option[A]): scala.collection.immutable.TreeSet[A]