UnionFind

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(d: D): D

Find the representing element for d.

final def asInstanceOf[T0]: T0

def clone(): UnionFind[D]

def contains(d: D): Boolean

Check whether an element is already present in the forest.

def elements: Iterator[D]

Iterator over all elements of this forest.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def makeSet(d: D): Unit

Add a new element to the forest.

def makeSetIfNew(d: D): Unit

Add a new element to the forest; the operation has no effect if the element is already present in the forest.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def representatives: Iterator[D]

Iterator over the elements representing sets; exactly one object will be enumerated for each set.

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def union(d: D, e: D): Unit

Join two sets.

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit