ExtHashSet

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[A]): ExtHashSet[A]

def &~(that: GenSet[A]): ExtHashSet[A]

def +(elem1: A, elem2: A, elems: A*): ExtHashSet[A]

def +(elem: A): ExtHashSet[A]

def ++(xs: GenTraversableOnce[A]): ExtHashSet[A]

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

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

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

def ++=(xs: TraversableOnce[A]): ExtHashSet.this.type

def +=(elem: A): ExtHashSet.this.type

def +=(elem1: A, elem2: A, elems: A*): ExtHashSet.this.type

def -(elem1: A, elem2: A, elems: A*): ExtHashSet[A]

def -(elem: A): ExtHashSet[A]

def --(xs: GenTraversableOnce[A]): ExtHashSet[A]

def --=(xs: TraversableOnce[A]): ExtHashSet.this.type

def -=(elem: A): ExtHashSet.this.type

def -=(elem1: A, elem2: A, elems: A*): ExtHashSet.this.type

def ->[B](y: B): (ExtHashSet[A], B)

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

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

final def ==(arg0: Any): Boolean

def add(elem: A): Boolean

def addElem(elem: A): Boolean

def addEntry(newEntry: AnyRef): 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, A) ⇒ B, combop: (B, B) ⇒ B): B

def alwaysInitSizeMap: Boolean

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

def apply(elem: A): Boolean

final def asInstanceOf[T0]: T0

def calcSizeMapSize(tableLength: Int): Int

def canEqual(that: Any): Boolean

def capacity(expectedSize: Int): Int

def clear(): Unit

def clearTable(): Unit

def clone(): HashSet[A]

def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[ExtHashSet[A], B, That]): That

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

def companion: ExtHashSet.type

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

def contains(elem: A): Boolean

def containsElem(elem: A): Boolean

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

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

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

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

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

def diff(that: GenSet[A]): ExtHashSet[A]

def draw(random: Random): A

Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

def drop(n: Int): ExtHashSet[A]

def dropRight(n: Int): ExtHashSet[A]

def dropWhile(p: (A) ⇒ Boolean): ExtHashSet[A]

final def elemToEntry(elem: A): AnyRef

def empty[A]: Set[A]

def empty: ExtHashSet[A]

def ensuring(cond: (ExtHashSet[A]) ⇒ Boolean, msg: ⇒ Any): ExtHashSet[A]

def ensuring(cond: (ExtHashSet[A]) ⇒ Boolean): ExtHashSet[A]

def ensuring(cond: Boolean, msg: ⇒ Any): ExtHashSet[A]

def ensuring(cond: Boolean): ExtHashSet[A]

final def entryToElem(entry: AnyRef): A

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (A) ⇒ Boolean): ExtHashSet[A]

def filterNot(p: (A) ⇒ Boolean): ExtHashSet[A]

def finalize(): Unit

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

def findEntry[B](other: B, correspond: (A, B) ⇒ Boolean): A

Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

def findEntry(elem: A): Option[A]

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

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ExtHashSet[B]

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

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

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

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

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

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

def groupBy[K](f: (A) ⇒ K): Map[K, ExtHashSet[A]]

def grouped(size: Int): Iterator[ExtHashSet[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def hashCodeIterator(hcode: Int): Iterator[A]

Returns an Iterator over all entries having the passed hashCode.

def head: A

def headOption: Option[A]

final def improve(hcode: Int, seed: Int): Int

final def index(hcode: Int): Int

def init: ExtHashSet[A]

def initWithContents(c: Contents[A]): Unit

def initialSize: Int

def inits: Iterator[ExtHashSet[A]]

def intersect(that: GenSet[A]): ExtHashSet[A]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastOption: Option[A]

def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ExtHashSet[A], B, That]): That

def mapResult[NewTo](f: (ExtHashSet[A]) ⇒ NewTo): Builder[A, NewTo]

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

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

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

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

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[A, ExtHashSet[A]]

def nnSizeMapAdd(h: Int): Unit

def nnSizeMapRemove(h: Int): Unit

def nnSizeMapReset(tableLength: Int): Unit

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParHashSet[A]

def parCombiner: Combiner[A, ParHashSet[A]]

def partition(p: (A) ⇒ Boolean): (ExtHashSet[A], ExtHashSet[A])

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

def randomSeed: Int

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

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

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

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

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

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

def remove(elem: A): Boolean

def removeElem(elem: A): Boolean

def repr: ExtHashSet[A]

def result(): ExtHashSet[A]

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

def reversed: List[A]

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

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

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

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

var seedvalue: Int

def seq: Set[A]

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

final def sizeMapBucketBitSize: Int

final def sizeMapBucketSize: Int

def sizeMapDisable(): Unit

def sizeMapInit(tableLength: Int): Unit

def sizeMapInitAndRebuild(): Unit

var sizemap: Array[Int]

def slice(from: Int, until: Int): ExtHashSet[A]

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

def sliding(size: Int): Iterator[ExtHashSet[A]]

def span(p: (A) ⇒ Boolean): (ExtHashSet[A], ExtHashSet[A])

def splitAt(n: Int): (ExtHashSet[A], ExtHashSet[A])

def stringPrefix: String

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

def subsets: Iterator[ExtHashSet[A]]

def subsets(len: Int): Iterator[ExtHashSet[A]]

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

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

var table: Array[AnyRef]

var tableSize: Int

def tableSizeSeed: Int

def tail: ExtHashSet[A]

def tails: Iterator[ExtHashSet[A]]

def take(n: Int): ExtHashSet[A]

def takeRight(n: Int): ExtHashSet[A]

def takeWhile(p: (A) ⇒ Boolean): ExtHashSet[A]

def thisCollection: Iterable[A]

var threshold: Int

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

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

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

def toCollection(repr: ExtHashSet[A]): Iterable[A]

def toIndexedSeq: IndexedSeq[A]

def toIterable: Iterable[A]

def toIterator: Iterator[A]

def toList: List[A]

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

def toParArray: ParArray[T]

def toSeq: Seq[A]

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

def toStream: Stream[A]

def toString(): String

def toTraversable: Traversable[A]

def toVector: Vector[A]

def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ExtHashSet[ExtHashSet[B]]

def union(that: GenSet[A]): ExtHashSet[A]

def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (ExtHashSet[A1], ExtHashSet[A2])

def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (ExtHashSet[A1], ExtHashSet[A2], ExtHashSet[A3])

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

def upsert(elem: A): Boolean

Updates or inserts elem.

def useSizeMap(t: Boolean): Unit

def view(from: Int, until: Int): IterableView[A, ExtHashSet[A]]

def view: IterableView[A, ExtHashSet[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, ExtHashSet[A]]

def withSetFilter(p: (A) ⇒ Boolean): FilteredSet[A]

Returns a lazily filtered immutable Set.

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

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

def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[ExtHashSet[A], (A1, Int), That]): That

def |(that: GenSet[A]): ExtHashSet[A]

def →[B](y: B): (ExtHashSet[A], B)

def +(other: String): String

def filter(p: (A) ⇒ Boolean): TraversableOnce[A]

def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: (A) ⇒ B): TraversableOnce[B]

def withFilter(p: (A) ⇒ Boolean): Iterator[A]

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