ValueSet

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[Value]): ValueSet

def &~(that: GenSet[Value]): ValueSet

def +(value: Value): ValueSet

def +(elem1: Value, elem2: Value, elems: Value*): ValueSet

def ++(elems: GenTraversableOnce[Value]): ValueSet

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

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

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

def -(value: Value): ValueSet

def -(elem1: Value, elem2: Value, elems: Value*): ValueSet

def --(xs: GenTraversableOnce[Value]): ValueSet

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

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

final def ==(arg0: Any): 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, Value) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(elem: Value): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Value, B])(implicit bf: CanBuildFrom[ValueSet, B, That]): That

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

def companion: GenericCompanion[Set]

def compare(k0: Value, k1: Value): Int

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

def contains(v: Value): Boolean

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

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

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

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

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

def diff(that: GenSet[Value]): ValueSet

def drop(n: Int): ValueSet

def dropRight(n: Int): ValueSet

def dropWhile(p: (Value) ⇒ Boolean): ValueSet

def empty: ValueSet

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (Value) ⇒ Boolean): ValueSet

def filterNot(p: (Value) ⇒ Boolean): ValueSet

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

def firstKey: Value

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

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

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

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

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

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

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

def from(from: Value): ValueSet

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

final def getClass(): Class[_]

def groupBy[K](f: (Value) ⇒ K): Map[K, ValueSet]

def grouped(size: Int): Iterator[ValueSet]

def hasAll(j: Iterator[Value]): Boolean

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Value

def headOption: Option[Value]

def init: ValueSet

def inits: Iterator[ValueSet]

def intersect(that: GenSet[Value]): ValueSet

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Value]

def iteratorFrom(start: Value): Iterator[Value]

def keySet: ValueSet

def keysIteratorFrom(start: Value): Iterator[Value]

def last: Value

def lastKey: Value

def lastOption: Option[Value]

def map[B, That](f: (Value) ⇒ B)(implicit bf: CanBuildFrom[ValueSet, B, That]): That

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

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

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

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

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[Value, ValueSet]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit def ordering: Ordering[Value]

def par: ParSet[Value]

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

def partition(p: (Value) ⇒ Boolean): (ValueSet, ValueSet)

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

def range(from: Value, until: Value): ValueSet

def rangeImpl(from: Option[Value], until: Option[Value]): ValueSet

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

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

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

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

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

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

def repr: ValueSet

def reversed: List[Value]

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

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

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

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

def seq: Set[Value]

def size: Int

def slice(from: Int, until: Int): ValueSet

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

def sliding(size: Int): Iterator[ValueSet]

def span(p: (Value) ⇒ Boolean): (ValueSet, ValueSet)

def splitAt(n: Int): (ValueSet, ValueSet)

def stringPrefix: String

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

def subsets(): Iterator[ValueSet]

def subsets(len: Int): Iterator[ValueSet]

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

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

def tail: ValueSet

def tails: Iterator[ValueSet]

def take(n: Int): ValueSet

def takeRight(n: Int): ValueSet

def takeWhile(p: (Value) ⇒ Boolean): ValueSet

def thisCollection: Iterable[Value]

def to(to: Value): ValueSet

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

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

def toBitMask: Array[Long]

Creates a bit mask for the zero-adjusted ids in this set as a new array of longs

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

def toCollection(repr: ValueSet): Iterable[Value]

def toIndexedSeq: IndexedSeq[Value]

def toIterable: Iterable[Value]

def toIterator: Iterator[Value]

def toList: List[Value]

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

def toSeq: Seq[Value]

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

def toStream: Stream[Value]

def toString(): String

def toTraversable: Traversable[Value]

def toVector: Vector[Value]

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

def union(that: GenSet[Value]): ValueSet

def until(until: Value): ValueSet

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

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

def view(from: Int, until: Int): IterableView[Value, ValueSet]

def view: IterableView[Value, ValueSet]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (Value) ⇒ Boolean): FilterMonadic[Value, ValueSet]

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

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

def zipWithIndex[A1 >: Value, That](implicit bf: CanBuildFrom[ValueSet, (A1, Int), That]): That

def |(that: GenSet[Value]): ValueSet

def finalize(): Unit