UnionFindSet

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[E]): Set[E]

def &~(that: GenSet[E]): Set[E]

def +(elem1: E, elem2: E, elems: E*): Set[E]

def +(elem: E): Set[E]

def ++(xs: GenTraversableOnce[E]): Set[E]

def ++[B >: E, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[E], B, That]): That

def ++:[B >: E, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[E], B, That]): That

def ++:[B >: E, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[E], B, That]): That

def ++=(xs: TraversableOnce[E]): UnionFindSet.this.type

def +=(e: E): UnionFindSet.this.type

Add a new element

def +=(elem1: E, elem2: E, elems: E*): UnionFindSet.this.type

def -(elem1: E, elem2: E, elems: E*): Set[E]

def -(elem: E): Set[E]

def --(xs: GenTraversableOnce[E]): Set[E]

def --=(xs: TraversableOnce[E]): UnionFindSet.this.type

def -=(e: E): UnionFindSet.this.type

def -=(elem1: E, elem2: E, elems: E*): UnionFindSet.this.type

def /:[B](z: B)(op: (B, E) ⇒ B): B

def :\[B](z: B)(op: (E, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def add(elem: E): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, E) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Boolean) ⇒ A): (E) ⇒ A

def apply(elem: E): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Set[E]

def collect[B, That](pf: PartialFunction[E, B])(implicit bf: CanBuildFrom[Set[E], B, That]): That

def collectFirst[B](pf: PartialFunction[E, B]): Option[B]

def companion: GenericCompanion[Set]

def compose[A](g: (A) ⇒ E): (A) ⇒ Boolean

def contains(e: E): Boolean

def copyToArray[B >: E](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: E](xs: Array[B]): Unit

def copyToArray[B >: E](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: E](dest: Buffer[B]): Unit

def count(p: (E) ⇒ Boolean): Int

def diff(that: GenSet[E]): Set[E]

def drop(n: Int): Set[E]

def dropRight(n: Int): Set[E]

def dropWhile(p: (E) ⇒ Boolean): Set[E]

def elementsInTheSameClass(e: E): Iterable[E]

Return the elements belonging to the same group with e

def empty: Set[E]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (E) ⇒ Boolean): Boolean

def filter(p: (E) ⇒ Boolean): Set[E]

def filterNot(p: (E) ⇒ Boolean): Set[E]

def finalize(): Unit

def find(e: E): E

Find the representative (root) element of the class to which e belongs

def find(p: (E) ⇒ Boolean): Option[E]

def flatMap[B, That](f: (E) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[E], B, That]): That

def flatten[B](implicit asTraversable: (E) ⇒ GenTraversableOnce[B]): Set[B]

def fold[A1 >: E](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, E) ⇒ B): B

def foldRight[B](z: B)(op: (E, B) ⇒ B): B

def forall(p: (E) ⇒ Boolean): Boolean

def foreach[U](f: (E) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Set[B]]

final def getClass(): Class[_]

def groupBy[K](f: (E) ⇒ K): Map[K, Set[E]]

def grouped(size: Int): Iterator[Set[E]]

def groups: Iterable[Iterable[E]]

Iterator of each group

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: E

def headOption: Option[E]

def init: Set[E]

def inits: Iterator[Set[E]]

def intersect(that: GenSet[E]): Set[E]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[E]

Iterator of the elements contained in this set

def last: E

def lastOption: Option[E]

def map[B, That](f: (E) ⇒ B)(implicit bf: CanBuildFrom[Set[E], B, That]): That

def mapResult[NewTo](f: (Set[E]) ⇒ NewTo): Builder[E, NewTo]

def max[B >: E](implicit cmp: Ordering[B]): E

def maxBy[B](f: (E) ⇒ B)(implicit cmp: Ordering[B]): E

def min[B >: E](implicit cmp: Ordering[B]): E

def minBy[B](f: (E) ⇒ B)(implicit cmp: Ordering[B]): E

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[E, Set[E]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[E]

def parCombiner: Combiner[E, ParSet[E]]

def partition(p: (E) ⇒ Boolean): (Set[E], Set[E])

def product[B >: E](implicit num: Numeric[B]): B

def reduce[A1 >: E](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: E](op: (B, E) ⇒ B): B

def reduceLeftOption[B >: E](op: (B, E) ⇒ B): Option[B]

def reduceOption[A1 >: E](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: E](op: (E, B) ⇒ B): B

def reduceRightOption[B >: E](op: (E, B) ⇒ B): Option[B]

def remove(elem: E): Boolean

def repr: Set[E]

def representatives: Iterable[E]

Iterator of the root nodes of the groups

def result(): Set[E]

def retain(p: (E) ⇒ Boolean): Unit

def reversed: List[E]

def sameElements[B >: E](that: GenIterable[B]): Boolean

def scan[B >: E, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[E], B, That]): That

def scanLeft[B, That](z: B)(op: (B, E) ⇒ B)(implicit bf: CanBuildFrom[Set[E], B, That]): That

def scanRight[B, That](z: B)(op: (E, B) ⇒ B)(implicit bf: CanBuildFrom[Set[E], B, That]): That

def seq: Set[E]

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): Set[E]

def sliding(size: Int, step: Int): Iterator[Set[E]]

def sliding(size: Int): Iterator[Set[E]]

def span(p: (E) ⇒ Boolean): (Set[E], Set[E])

def splitAt(n: Int): (Set[E], Set[E])

def stringPrefix: String

def subsetOf(that: GenSet[E]): Boolean

def subsets(): Iterator[Set[E]]

def subsets(len: Int): Iterator[Set[E]]

def sum[B >: E](implicit num: Numeric[B]): B

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

def tail: Set[E]

def tails: Iterator[Set[E]]

def take(n: Int): Set[E]

def takeRight(n: Int): Set[E]

def takeWhile(p: (E) ⇒ Boolean): Set[E]

def thisCollection: Iterable[E]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, E, Col[E]]): Col[E]

def toArray[B >: E](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[A1 >: E]: Buffer[A1]

def toCollection(repr: Set[E]): Iterable[E]

def toIndexedSeq: IndexedSeq[E]

def toIterable: Iterable[E]

def toIterator: Iterator[E]

def toList: List[E]

def toMap[T, U](implicit ev: <:<[E, (T, U)]): Map[T, U]

def toSeq: Seq[E]

def toSet[B >: E]: Set[B]

def toStream: Stream[E]

def toString(): String

def toTraversable: Traversable[E]

def toVector: Vector[E]

def transpose[B](implicit asTraversable: (E) ⇒ GenTraversableOnce[B]): Set[Set[B]]

def union(x: E, y: E): Unit

Union the two sets containing x and y

def union(that: GenSet[E]): Set[E]

def unzip[A1, A2](implicit asPair: (E) ⇒ (A1, A2)): (Set[A1], Set[A2])

def unzip3[A1, A2, A3](implicit asTriple: (E) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

def update(elem: E, included: Boolean): Unit

def view(from: Int, until: Int): IterableView[E, Set[E]]

def view: IterableView[E, Set[E]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (E) ⇒ Boolean): FilterMonadic[E, Set[E]]

def zip[A1 >: E, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[E], (A1, B), That]): That

def zipAll[B, A1 >: E, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[E], (A1, B), That]): That

def zipWithIndex[A1 >: E, That](implicit bf: CanBuildFrom[Set[E], (A1, Int), That]): That

def |(that: GenSet[E]): Set[E]

def <<(cmd: Message[E]): Unit