SetTrie

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

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

def ++=(xs: TraversableOnce[Set[T]]): SetTrie.this.type

def +=(el: Set[T]): SetTrie.this.type

def +=(elem1: Set[T], elem2: Set[T], elems: Set[T]*): SetTrie.this.type

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

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

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

def --=(xs: TraversableOnce[Set[T]]): SetTrie.this.type

def -=(el: Set[T]): SetTrie.this.type

def -=(elem1: Set[T], elem2: Set[T], elems: Set[T]*): SetTrie.this.type

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

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

final def ==(arg0: Any): Boolean

def add(elem: Set[T]): 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, Set[T]) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Boolean) ⇒ A): (Set[T]) ⇒ A

def apply(elem: Set[T]): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Set[Set[T]]

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

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

def companion: GenericCompanion[Set]

def compose[A](g: (A) ⇒ Set[T]): (A) ⇒ Boolean

def contains(el: Set[T]): Boolean

def containsSubset(el: Set[T]): Boolean

Check whether the set-trie contains some element that is a (strict or non-strict) subset of the given set.

def containsSuperset(el: Set[T]): Boolean

Check whether the set-trie contains some element that is a (strict or non-strict) super-set of the given set.

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

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

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

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

def count(p: (Set[T]) ⇒ Boolean): Int

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

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

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

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

def empty: Set[Set[T]]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (Set[T]) ⇒ Boolean): Boolean

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

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

def find(p: (Set[T]) ⇒ Boolean): Option[Set[T]]

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

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

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

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

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

def forall(p: (Set[T]) ⇒ Boolean): Boolean

def foreach[U](f: (Set[T]) ⇒ U): Unit

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Set[T]

def headOption: Option[Set[T]]

def init: Set[Set[T]]

def inits: Iterator[Set[Set[T]]]

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

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Set[T]]

def last: Set[T]

def lastOption: Option[Set[T]]

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

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

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

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

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

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

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[Set[T], Set[Set[T]]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[Set[T]]

def parCombiner: Combiner[Set[T], ParSet[Set[T]]]

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

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

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

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

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

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

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

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

def remove(elem: Set[T]): Boolean

def repr: Set[Set[T]]

def result(): Set[Set[T]]

def retain(p: (Set[T]) ⇒ Boolean): Unit

def reversed: List[Set[T]]

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

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

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

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

def seq: Set[Set[T]]

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[Set[T]]

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

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

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

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

def stringPrefix: String

def subsetOf(that: GenSet[Set[T]]): Boolean

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

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

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

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

def tail: Set[Set[T]]

def tails: Iterator[Set[Set[T]]]

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

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

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

def thisCollection: Iterable[Set[T]]

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

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

def toBuffer[A1 >: Set[T]]: Buffer[A1]

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

def toIndexedSeq: IndexedSeq[Set[T]]

def toIterable: Iterable[Set[T]]

def toIterator: Iterator[Set[T]]

def toList: List[Set[T]]

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

def toSeq: Seq[Set[T]]

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

def toStream: Stream[Set[T]]

def toString(): String

def toTraversable: Traversable[Set[T]]

def toVector: Vector[Set[T]]

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

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

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

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

def update(elem: Set[T], included: Boolean): Unit

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

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

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

final def wait(arg0: Long): Unit

final def wait(): Unit

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

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

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

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

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

def <<(cmd: Message[Set[T]]): Unit

def finalize(): Unit