RandomIterHashSet

Instance Constructors

new RandomIterHashSet()

Type Members

type Self = HashSet[A]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def &(that: GenSet[A]): HashSet[A]

Definition Classes
GenSetLike
def &~(that: GenSet[A]): HashSet[A]

Definition Classes
GenSetLike
def +(elem1: A, elem2: A, elems: A*): HashSet[A]

Definition Classes
SetLike → SetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.
def +(elem: A): HashSet[A]

Definition Classes
SetLike → SetLike → GenSetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.
def ++(xs: GenTraversableOnce[A]): HashSet[A]

Definition Classes
SetLike → SetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.
def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike
def ++=(xs: TraversableOnce[A]): RandomIterHashSet.this.type

Definition Classes
Growable
def +=(elem: A): RandomIterHashSet.this.type

Definition Classes
HashSet → SetLike → Builder → Growable
def +=(elem1: A, elem2: A, elems: A*): RandomIterHashSet.this.type

Definition Classes
Growable
def -(elem1: A, elem2: A, elems: A*): HashSet[A]

Definition Classes
SetLike → Subtractable
Annotations
@migration
Migration
(Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.
def -(elem: A): HashSet[A]

Definition Classes
SetLike → SetLike → Subtractable → GenSetLike
Annotations
@migration
Migration
(Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.
def --(xs: GenTraversableOnce[A]): HashSet[A]

Definition Classes
SetLike → Subtractable
Annotations
@migration
Migration
(Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.
def --=(xs: TraversableOnce[A]): RandomIterHashSet.this.type

Definition Classes
Shrinkable
def -=(elem: A): RandomIterHashSet.this.type

Definition Classes
HashSet → SetLike → Shrinkable
def -=(elem1: A, elem2: A, elems: A*): RandomIterHashSet.this.type

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

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (A, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def add(elem: A): Boolean

Definition Classes
HashSet → SetLike
def addElem(elem: A): Boolean

Attributes
protected
Definition Classes
FlatHashTable
def addEntry(newEntry: AnyRef): Boolean

Attributes
protected
Definition Classes
FlatHashTable
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

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

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def alwaysInitSizeMap: Boolean

Attributes
protected
Definition Classes
FlatHashTable
def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
def apply(elem: A): Boolean

Definition Classes
GenSetLike → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def calcSizeMapSize(tableLength: Int): Int

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def canEqual(that: Any): Boolean

Definition Classes
IterableLike → Equals
def capacity(expectedSize: Int): Int

Attributes
protected
Definition Classes
FlatHashTable
def clear(): Unit

Definition Classes
HashSet → SetLike → Builder → Growable → Clearable
def clearTable(): Unit

Attributes
protected
Definition Classes
FlatHashTable
def clone(): HashSet[A]

Definition Classes
HashSet → SetLike → Cloneable → AnyRef
def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[HashSet]

Definition Classes
HashSet → Set → Set → GenSet → Iterable → Traversable → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

Definition Classes
Function1
Annotations
@unspecialized()
def contains(elem: A): Boolean

Definition Classes
HashSet → SetLike → GenSetLike
def containsElem(elem: A): Boolean

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: A](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: A](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: A](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (A) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def diff(that: GenSet[A]): HashSet[A]

Definition Classes
SetLike → GenSetLike
def doSome[U](numUserToDo: Int, f: (A) ⇒ U): Unit
def drop(n: Int): HashSet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): HashSet[A]

Definition Classes
IterableLike
def dropWhile(p: (A) ⇒ Boolean): HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
final def elemToEntry(elem: A): AnyRef

Attributes
protected
Definition Classes
HashUtils
def empty: HashSet[A]

Definition Classes
GenericSetTemplate
final def entryToElem(entry: AnyRef): A

Attributes
protected
Definition Classes
HashUtils
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
GenSetLike → Equals → AnyRef → Any
def exists(p: (A) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (A) ⇒ Boolean): HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (A) ⇒ Boolean): HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (A) ⇒ Boolean): Option[A]

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def findEntry(elem: A): Option[A]

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): HashSet[B]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (A, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (A) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (A) ⇒ U): Unit

Definition Classes
HashSet → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def genericBuilder[B]: Builder[B, HashSet[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (A) ⇒ K): Map[K, HashSet[A]]

Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[HashSet[A]]

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

Definition Classes
GenSetLike → AnyRef → Any
def head: A

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[A]

Definition Classes
TraversableLike → GenTraversableLike
final def improve(hcode: Int, seed: Int): Int

Attributes
protected
Definition Classes
HashUtils
final def index(hcode: Int): Int

Attributes
protected
Definition Classes
FlatHashTable
def init: HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
def initWithContents(c: Contents[A]): Unit

Attributes
protected
Definition Classes
FlatHashTable
def initialSize: Int

Definition Classes
FlatHashTable
def inits: Iterator[HashSet[A]]

Definition Classes
TraversableLike
def intersect(that: GenSet[A]): HashSet[A]

Definition Classes
GenSetLike
def isEmpty: Boolean

Definition Classes
SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isSizeMapDefined: Boolean

Attributes
protected
Definition Classes
FlatHashTable
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def iterator: Iterator[A]

Definition Classes
RandomIterHashSet → HashSet → FlatHashTable → GenSetLike → IterableLike → GenIterableLike
def last: A

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[A]

Definition Classes
TraversableLike → GenTraversableLike
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
SetLike → TraversableLike → GenTraversableLike → FilterMonadic
Annotations
@migration
Migration
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
def mapResult[NewTo](f: (HashSet[A]) ⇒ NewTo): Builder[A, NewTo]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: A](implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[A, HashSet[A]]

Attributes
protected[this]
Definition Classes
SetLike → SetLike → TraversableLike → HasNewBuilder
def nnSizeMapAdd(h: Int): Unit

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def nnSizeMapRemove(h: Int): Unit

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def nnSizeMapReset(tableLength: Int): Unit

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def par: ParHashSet[A]

Definition Classes
HashSet → CustomParallelizable → Parallelizable
def parCombiner: Combiner[A, ParHashSet[A]]

Attributes
protected[this]
Definition Classes
CustomParallelizable → Parallelizable
def partition(p: (A) ⇒ Boolean): (HashSet[A], HashSet[A])

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: A](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def randomSeed: Int

Attributes
protected
Definition Classes
FlatHashTable
def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

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

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: A](op: (A, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def remove(elem: A): Boolean

Definition Classes
HashSet → SetLike
def removeElem(elem: A): Boolean

Attributes
protected
Definition Classes
FlatHashTable
def repr: HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
def result(): HashSet[A]

Definition Classes
SetLike → Builder
def retain(p: (A) ⇒ Boolean): Unit

Definition Classes
SetLike
def reversed: List[A]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameElements[B >: A](that: GenIterable[B]): Boolean

Definition Classes
IterableLike → GenIterableLike
def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[HashSet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
var seedvalue: Int

Attributes
protected
Definition Classes
FlatHashTable
def seq: Set[A]

Definition Classes
Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
HashSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

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

Definition Classes
Builder
def sizeHint(size: Int): Unit

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

Definition Classes
Builder
final def sizeMapBucketBitSize: Int

Attributes
protected
Definition Classes
HashUtils
final def sizeMapBucketSize: Int

Attributes
protected
Definition Classes
HashUtils
def sizeMapDisable(): Unit

Attributes
protected
Definition Classes
FlatHashTable
def sizeMapInit(tableLength: Int): Unit

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def sizeMapInitAndRebuild(): Unit

Attributes
protected
Definition Classes
FlatHashTable
Annotations
@deprecatedOverriding( ... , "2.11.0" )
var sizemap: Array[Int]

Attributes
protected
Definition Classes
FlatHashTable
def slice(from: Int, until: Int): HashSet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[HashSet[A]]

Definition Classes
IterableLike
def sliding(size: Int): Iterator[HashSet[A]]

Definition Classes
IterableLike
def span(p: (A) ⇒ Boolean): (HashSet[A], HashSet[A])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (HashSet[A], HashSet[A])

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Definition Classes
SetLike → TraversableLike → GenTraversableLike
def subsetOf(that: GenSet[A]): Boolean

Definition Classes
GenSetLike
def subsets(): Iterator[HashSet[A]]

Definition Classes
SetLike
def subsets(len: Int): Iterator[HashSet[A]]

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

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
var table: Array[AnyRef]

Attributes
protected
Definition Classes
FlatHashTable
var tableSize: Int

Attributes
protected
Definition Classes
FlatHashTable
def tableSizeSeed: Int

Attributes
protected
Definition Classes
FlatHashTable
def tail: HashSet[A]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[HashSet[A]]

Definition Classes
TraversableLike
def take(n: Int): HashSet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): HashSet[A]

Definition Classes
IterableLike
def takeWhile(p: (A) ⇒ Boolean): HashSet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Iterable[A]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
var threshold: Int

Attributes
protected
Definition Classes
FlatHashTable
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[A1 >: A]: Buffer[A1]

Definition Classes
SetLike → TraversableOnce → GenTraversableOnce
def toCollection(repr: HashSet[A]): Iterable[A]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[A]

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toList: List[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[A]

Definition Classes
SetLike → TraversableOnce → GenTraversableOnce
def toSet[B >: A]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

Definition Classes
SetLike → Function1 → TraversableLike → AnyRef → Any
def toTraversable: Traversable[A]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): HashSet[HashSet[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def union(that: GenSet[A]): HashSet[A]

Definition Classes
SetLike → GenSetLike
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (HashSet[A1], HashSet[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (HashSet[A1], HashSet[A2], HashSet[A3])

Definition Classes
GenericTraversableTemplate
def update(elem: A, included: Boolean): Unit

Definition Classes
SetLike
def useSizeMap(t: Boolean): Unit

Definition Classes
HashSet
def view(from: Int, until: Int): IterableView[A, HashSet[A]]

Definition Classes
IterableLike → TraversableLike
def view: IterableView[A, HashSet[A]]

Definition Classes
IterableLike → TraversableLike
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, HashSet[A]]

Definition Classes
TraversableLike → FilterMonadic
def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashSet[A], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashSet[A], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[HashSet[A], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike
def |(that: GenSet[A]): HashSet[A]

Definition Classes
GenSetLike

Deprecated Value Members

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

Definition Classes
SetLike → Scriptable
Annotations
@deprecated
Deprecated
(Since version 2.11.0) Scripting is deprecated.

Inherited from HashSet[A]

Inherited from Serializable

Inherited from CustomParallelizable[A, ParHashSet[A]]

Inherited from FlatHashTable[A]

Inherited from HashUtils[A]

Inherited from AbstractSet[A]

Inherited from Set[A]

Inherited from SetLike[A, HashSet[A]]

Inherited from Cloneable[Set[A]]

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, HashSet[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, HashSet[A]]

Inherited from Subtractable[A, HashSet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, HashSet]

Inherited from GenSetLike[A, HashSet[A]]

Inherited from (A) ⇒ Boolean

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, HashSet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, HashSet[A]]

Inherited from AbstractTraversable[A]

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, HashSet]

Inherited from TraversableLike[A, HashSet[A]]

Inherited from GenTraversableLike[A, HashSet[A]]

Inherited from Parallelizable[A, ParHashSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, HashSet[A]]

Inherited from HasNewBuilder[A, scala.collection.mutable.HashSet[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped

Related Doc: package util

final class RandomIterHashSet[A] extends HashSet[A]

Instance Constructors

new RandomIterHashSet()

Type Members

type Self = HashSet[A]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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[HashSet[A], B, That]): That

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

def companion: GenericCompanion[HashSet]

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]): HashSet[A]

def doSome[U](numUserToDo: Int, f: (A) ⇒ U): Unit

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

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

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

final def elemToEntry(elem: A): AnyRef

def empty: HashSet[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): HashSet[A]

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

def finalize(): Unit

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

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

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

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): HashSet[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