OldHashSet

Companion object OldHashSet

sealed abstract class OldHashSet[A] extends AbstractSet[A] with SetOps[A, OldHashSet, OldHashSet[A]] with StrictOptimizedIterableOps[A, OldHashSet, OldHashSet[A]] with IterableFactoryDefaults[A, OldHashSet] with Serializable

This class implements immutable sets using a hash trie.

Note: The builder of this hash set may return specialized representations for small sets.

A: the type of the elements contained in this hash set.

Linear Supertypes

java.io.Serializable, StrictOptimizedIterableOps[A, OldHashSet, OldHashSet[A]], AbstractSet[A], Set[A], SetOps[A, [X]OldHashSet[X], OldHashSet[A]], Iterable[A], collection.AbstractSet[A], collection.Set[A], Equals, collection.SetOps[A, [_]OldHashSet[_], OldHashSet[A]], (A) => Boolean, AbstractIterable[A], collection.Iterable[A], IterableFactoryDefaults[A, [x]OldHashSet[x]], IterableOps[A, [_]OldHashSet[_], OldHashSet[A]], IterableOnceOps[A, [_]OldHashSet[_], OldHashSet[A]], IterableOnce[A], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

OldHashSet
Serializable
StrictOptimizedIterableOps
AbstractSet
Set
SetOps
Iterable
AbstractSet
Set
Equals
SetOps
Function1
AbstractIterable
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Abstract Value Members

abstract def diff0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Diff with another hash set at a given level
Diff with another hash set at a given level
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The diff of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def filter0(p: (A) => Boolean, negate: Boolean, level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Attributes
protected
abstract def get0(key: A, hash: Int, level: Int): Boolean
Attributes
protected
abstract def intersect0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Intersection with another hash set at a given level
Intersection with another hash set at a given level
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The intersection of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def iterator: Iterator[A]
Definition Classes
IterableOnce
abstract def removed0(key: A, hash: Int, level: Int): OldHashSet[A]
Attributes
protected
abstract def subsetOf0(that: OldHashSet[A], level: Int): Boolean
A specialized implementation of subsetOf for when both this and that are OldHashSet[A] and we can take advantage of the tree structure of both operands and the precalculated hashcodes of the OldHashSet1 instances.
A specialized implementation of subsetOf for when both this and that are OldHashSet[A] and we can take advantage of the tree structure of both operands and the precalculated hashcodes of the OldHashSet1 instances.
that
the other set
level
the level of this and that hashset The purpose of level is to keep track of how deep we are in the tree. We need this information for when we arrive at a leaf and have to call get0 on that The value of level is 0 for a top-level OldHashSet and grows in increments of 5
returns
true if all elements of this set are contained in that set
Attributes
protected
abstract def union0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Union with a OldHashSet at a given level
Union with a OldHashSet at a given level
that
a OldHashSet
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The union of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def updated0(key: A, hash: Int, level: Int): OldHashSet[A]
Attributes
protected[collection]

Concrete Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def &(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def &~(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def +(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
final def ++(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def ++[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@inline()
final def -(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
Annotations
@inline()
final def --(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps → SetOps
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def addString(b: mutable.StringBuilder): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: mutable.StringBuilder, sep: String): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
Definition Classes
IterableOnceOps
def andThen[A](g: (Boolean) => A): (A) => A
Definition Classes
Function1
Annotations
@unspecialized()
final def apply(elem: A): Boolean
Definition Classes
SetOps → Function1
Annotations
@inline()
final def asInstanceOf[T0]: T0
Definition Classes
Any
def canEqual(that: Any): Boolean
Definition Classes
Set → Equals
def className: String
Attributes
protected[this]
Definition Classes
OldHashSet → Iterable
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def coll: OldHashSet.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[A, B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Definition Classes
IterableOnceOps
def compose[A](g: (A) => A): (A) => Boolean
Definition Classes
Function1
Annotations
@unspecialized()
def concat(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def concat[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
def contains(elem: A): Boolean
Definition Classes
OldHashSet → SetOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: A](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
def count(p: (A) => Boolean): Int
Definition Classes
IterableOnceOps
def diff(that: collection.Set[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps → SetOps
def drop(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def dropRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def dropWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def empty: OldHashSet[A]
Definition Classes
IterableFactoryDefaults → IterableOps
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(that: Any): Boolean
Definition Classes
Set → Equals → AnyRef → Any
def excl(elem: A): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def exists(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def filter(p: (A) => Boolean): OldHashSet[A]
Definition Classes
OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): OldHashSet[A]
Attributes
protected[collection]
Definition Classes
StrictOptimizedIterableOps
def filterNot(p: (A) => Boolean): OldHashSet[A]
Definition Classes
OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
def find(p: (A) => Boolean): Option[A]
Definition Classes
IterableOnceOps
def flatMap[B](f: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
def foldRight[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
def forall(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def foreach[U](f: (A) => U): Unit
Definition Classes
IterableOnceOps
def fromSpecific(coll: IterableOnce[A]): OldHashSet[A]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (A) => K): Map[K, OldHashSet[A]]
Definition Classes
IterableOps
def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, OldHashSet[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def hashCode(): Int
Definition Classes
Set → AnyRef → Any
def head: A
Definition Classes
IterableOps
def headOption: Option[A]
Definition Classes
IterableOps
def incl(elem: A): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def init: OldHashSet[A]
Definition Classes
OldHashSet → IterableOps
def inits: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def intersect(that: collection.Set[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def isEmpty: Boolean
Definition Classes
IterableOnceOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
def iterableFactory: OldHashSet
Definition Classes
OldHashSet → Set → Iterable → Set → Iterable → IterableOps
def knownSize: Int
Definition Classes
IterableOnce
def last: A
Definition Classes
IterableOps
def lastOption: Option[A]
Definition Classes
IterableOps
def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, OldHashSet.this.type]
Definition Classes
Iterable
def map[B](f: (A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def max[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def min[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[A, OldHashSet[A]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
def partition(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def product[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
def reduce[B >: A](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: A](op: (B, A) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: A](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: A](op: (A, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Definition Classes
IterableOnceOps
def removedAll(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
def reversed: collection.Iterable[A]
Attributes
protected
Definition Classes
IterableOnceOps
def scan[B >: A](z: B)(op: (B, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (A, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def size: Int
Definition Classes
IterableOnceOps
def sizeCompare(that: collection.Iterable[_]): Int
Definition Classes
IterableOps
def sizeCompare(otherSize: Int): Int
Definition Classes
IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def span(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def splitAt(n: Int): (OldHashSet[A], OldHashSet[A])
Definition Classes
IterableOps → IterableOnceOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
Definition Classes
IterableOnce
final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
def stringPrefix: String
Attributes
protected[this]
Definition Classes
Set → Iterable
def subsetOf(that: collection.Set[A]): Boolean
Definition Classes
OldHashSet → SetOps
def subsets(): Iterator[OldHashSet[A]]
Definition Classes
SetOps
def subsets(len: Int): Iterator[OldHashSet[A]]
Definition Classes
SetOps
def sum[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: OldHashSet[A]
Definition Classes
OldHashSet → IterableOps
def tails: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def take(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def takeRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def takeWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def tapEach[U](f: (A) => U): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def to[C1](factory: Factory[A, C1]): C1
Definition Classes
IterableOnceOps
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: IndexedSeq[A]
Definition Classes
IterableOnceOps
def toList: List[A]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: Seq[A]
Definition Classes
IterableOnceOps
def toSet[B >: A]: Set[B]
Definition Classes
IterableOnceOps
def toString(): String
Definition Classes
Set → Function1 → Iterable → AnyRef → Any
def toVector: Vector[A]
Definition Classes
IterableOnceOps
def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): OldHashSet[OldHashSet[B]]
Definition Classes
IterableOps
final def union(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (OldHashSet[A1], OldHashSet[A2], OldHashSet[A3])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def view: View[A]
Definition Classes
IterableOps
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
def withFilter(p: (A) => Boolean): WithFilter[A, [_]OldHashSet[_]]
Definition Classes
IterableOps
def zip[B](that: IterableOnce[B]): OldHashSet[(A, B)]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): OldHashSet[(A1, B)]
Definition Classes
IterableOps
def zipWithIndex: OldHashSet[(A, Int)]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def |(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()

Deprecated Value Members

def +(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
def ++:[B >: A](that: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
def -(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
final def /:[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
final def :\[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.
def companion: IterableFactory[[_]OldHashSet[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding() @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
final def repr: OldHashSet[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def seq: OldHashSet.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
final def toIterable: OldHashSet.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def toIterator: Iterator[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
final def toStream: Stream[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: collection.Traversable[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
def view(from: Int, until: Int): View[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from StrictOptimizedIterableOps[A, OldHashSet, OldHashSet[A]]

Value Members

def collect[B](pf: PartialFunction[A, B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def dropRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): OldHashSet[A]
Attributes
protected[collection]
Definition Classes
StrictOptimizedIterableOps
def flatMap[B](f: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def map[B](f: (A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def partition(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def scanLeft[B](z: B)(op: (B, A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def span(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
def takeRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def tapEach[U](f: (A) => U): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (OldHashSet[A1], OldHashSet[A2], OldHashSet[A3])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def zip[B](that: IterableOnce[B]): OldHashSet[(A, B)]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def zipWithIndex: OldHashSet[(A, Int)]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Inherited from SetOps[A, [X]OldHashSet[X], OldHashSet[A]]

Value Members

final def +(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
final def -(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
Annotations
@inline()
final def --(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps → SetOps
def removedAll(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps

Inherited from collection.Set[A]

Value Members

def canEqual(that: Any): Boolean
Definition Classes
Set → Equals
def equals(that: Any): Boolean
Definition Classes
Set → Equals → AnyRef → Any
def hashCode(): Int
Definition Classes
Set → AnyRef → Any
def stringPrefix: String
Attributes
protected[this]
Definition Classes
Set → Iterable
def toString(): String
Definition Classes
Set → Function1 → Iterable → AnyRef → Any

Inherited from collection.SetOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

final def &(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def &~(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def ++(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def apply(elem: A): Boolean
Definition Classes
SetOps → Function1
Annotations
@inline()
def subsets(): Iterator[OldHashSet[A]]
Definition Classes
SetOps
def subsets(len: Int): Iterator[OldHashSet[A]]
Definition Classes
SetOps
final def union(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def |(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
def +(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
def -(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

Inherited from (A) => Boolean

Value Members

def andThen[A](g: (Boolean) => A): (A) => A
Definition Classes
Function1
Annotations
@unspecialized()
def compose[A](g: (A) => A): (A) => Boolean
Definition Classes
Function1
Annotations
@unspecialized()

Inherited from collection.Iterable[A]

Value Members

final def coll: OldHashSet.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, OldHashSet.this.type]
Definition Classes
Iterable
def seq: OldHashSet.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
final def toIterable: OldHashSet.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

Inherited from IterableFactoryDefaults[A, [x]OldHashSet[x]]

Value Members

def empty: OldHashSet[A]
Definition Classes
IterableFactoryDefaults → IterableOps
def fromSpecific(coll: IterableOnce[A]): OldHashSet[A]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def newSpecificBuilder: Builder[A, OldHashSet[A]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps

Inherited from IterableOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

final def ++[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@inline()
def concat[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
def drop(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def dropWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def groupBy[K](f: (A) => K): Map[K, OldHashSet[A]]
Definition Classes
IterableOps
def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, OldHashSet[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def head: A
Definition Classes
IterableOps
def headOption: Option[A]
Definition Classes
IterableOps
def inits: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
def last: A
Definition Classes
IterableOps
def lastOption: Option[A]
Definition Classes
IterableOps
def scan[B >: A](z: B)(op: (B, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def scanRight[B](z: B)(op: (A, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def sizeCompare(that: collection.Iterable[_]): Int
Definition Classes
IterableOps
def sizeCompare(otherSize: Int): Int
Definition Classes
IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def splitAt(n: Int): (OldHashSet[A], OldHashSet[A])
Definition Classes
IterableOps → IterableOnceOps
def tails: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def take(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def takeWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): OldHashSet[OldHashSet[B]]
Definition Classes
IterableOps
def view: View[A]
Definition Classes
IterableOps
def withFilter(p: (A) => Boolean): WithFilter[A, [_]OldHashSet[_]]
Definition Classes
IterableOps
def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): OldHashSet[(A1, B)]
Definition Classes
IterableOps
def ++:[B >: A](that: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
def companion: IterableFactory[[_]OldHashSet[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding() @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
final def repr: OldHashSet[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
final def toTraversable: collection.Traversable[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
def view(from: Int, until: Int): View[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from IterableOnceOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

final def addString(b: mutable.StringBuilder): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: mutable.StringBuilder, sep: String): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
Definition Classes
IterableOnceOps
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Definition Classes
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: A](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
def count(p: (A) => Boolean): Int
Definition Classes
IterableOnceOps
def exists(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def find(p: (A) => Boolean): Option[A]
Definition Classes
IterableOnceOps
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
def foldRight[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
def forall(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def foreach[U](f: (A) => U): Unit
Definition Classes
IterableOnceOps
def isEmpty: Boolean
Definition Classes
IterableOnceOps
def max[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def min[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def product[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
def reduce[B >: A](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: A](op: (B, A) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: A](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: A](op: (A, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reversed: collection.Iterable[A]
Attributes
protected
Definition Classes
IterableOnceOps
def size: Int
Definition Classes
IterableOnceOps
def sum[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
def to[C1](factory: Factory[A, C1]): C1
Definition Classes
IterableOnceOps
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: IndexedSeq[A]
Definition Classes
IterableOnceOps
def toList: List[A]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: Seq[A]
Definition Classes
IterableOnceOps
def toSet[B >: A]: Set[B]
Definition Classes
IterableOnceOps
def toVector: Vector[A]
Definition Classes
IterableOnceOps
final def /:[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
final def :\[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
final def toIterator: Iterator[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
final def toStream: Stream[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream

Inherited from IterableOnce[A]

Value Members

abstract def iterator: Iterator[A]
Definition Classes
IterableOnce
def knownSize: Int
Definition Classes
IterableOnce
def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
Definition Classes
IterableOnce

Inherited from AnyRef

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Any

Value Members

final def asInstanceOf[T0]: T0
Definition Classes
Any
final def isInstanceOf[T0]: Boolean
Definition Classes
Any

Ungrouped

abstract def diff0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Diff with another hash set at a given level
Diff with another hash set at a given level
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The diff of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def filter0(p: (A) => Boolean, negate: Boolean, level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Attributes
protected
abstract def get0(key: A, hash: Int, level: Int): Boolean
Attributes
protected
abstract def intersect0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Intersection with another hash set at a given level
Intersection with another hash set at a given level
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The intersection of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def iterator: Iterator[A]
Definition Classes
IterableOnce
abstract def removed0(key: A, hash: Int, level: Int): OldHashSet[A]
Attributes
protected
abstract def subsetOf0(that: OldHashSet[A], level: Int): Boolean
A specialized implementation of subsetOf for when both this and that are OldHashSet[A] and we can take advantage of the tree structure of both operands and the precalculated hashcodes of the OldHashSet1 instances.
A specialized implementation of subsetOf for when both this and that are OldHashSet[A] and we can take advantage of the tree structure of both operands and the precalculated hashcodes of the OldHashSet1 instances.
that
the other set
level
the level of this and that hashset The purpose of level is to keep track of how deep we are in the tree. We need this information for when we arrive at a leaf and have to call get0 on that The value of level is 0 for a top-level OldHashSet and grows in increments of 5
returns
true if all elements of this set are contained in that set
Attributes
protected
abstract def union0(that: OldHashSet[A], level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
Union with a OldHashSet at a given level
Union with a OldHashSet at a given level
that
a OldHashSet
level
the depth in the tree. We need to keep track of the level to know how deep we are in the tree
buffer
a temporary buffer that is used for temporarily storing elements when creating new branch nodes
offset0
the first offset into the buffer in which we are allowed to write
returns
The union of this and that at the given level. Unless level is zero, the result is not a self-contained OldHashSet but needs to be stored at the correct depth
Attributes
protected
abstract def updated0(key: A, hash: Int, level: Int): OldHashSet[A]
Attributes
protected[collection]
final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def &(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def &~(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def +(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
final def ++(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
final def ++[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@inline()
final def -(elem: A): OldHashSet[A]
Definition Classes
SetOps → SetOps
Annotations
@inline()
final def --(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps → SetOps
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def addString(b: mutable.StringBuilder): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: mutable.StringBuilder, sep: String): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
Definition Classes
IterableOnceOps
def andThen[A](g: (Boolean) => A): (A) => A
Definition Classes
Function1
Annotations
@unspecialized()
final def apply(elem: A): Boolean
Definition Classes
SetOps → Function1
Annotations
@inline()
final def asInstanceOf[T0]: T0
Definition Classes
Any
def canEqual(that: Any): Boolean
Definition Classes
Set → Equals
def className: String
Attributes
protected[this]
Definition Classes
OldHashSet → Iterable
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def coll: OldHashSet.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[A, B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Definition Classes
IterableOnceOps
def compose[A](g: (A) => A): (A) => Boolean
Definition Classes
Function1
Annotations
@unspecialized()
def concat(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def concat[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
def contains(elem: A): Boolean
Definition Classes
OldHashSet → SetOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: A](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
def count(p: (A) => Boolean): Int
Definition Classes
IterableOnceOps
def diff(that: collection.Set[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps → SetOps
def drop(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def dropRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def dropWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def empty: OldHashSet[A]
Definition Classes
IterableFactoryDefaults → IterableOps
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(that: Any): Boolean
Definition Classes
Set → Equals → AnyRef → Any
def excl(elem: A): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def exists(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def filter(p: (A) => Boolean): OldHashSet[A]
Definition Classes
OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): OldHashSet[A]
Attributes
protected[collection]
Definition Classes
StrictOptimizedIterableOps
def filterNot(p: (A) => Boolean): OldHashSet[A]
Definition Classes
OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
def find(p: (A) => Boolean): Option[A]
Definition Classes
IterableOnceOps
def flatMap[B](f: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
def foldRight[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
def forall(p: (A) => Boolean): Boolean
Definition Classes
IterableOnceOps
def foreach[U](f: (A) => U): Unit
Definition Classes
IterableOnceOps
def fromSpecific(coll: IterableOnce[A]): OldHashSet[A]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (A) => K): Map[K, OldHashSet[A]]
Definition Classes
IterableOps
def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, OldHashSet[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def hashCode(): Int
Definition Classes
Set → AnyRef → Any
def head: A
Definition Classes
IterableOps
def headOption: Option[A]
Definition Classes
IterableOps
def incl(elem: A): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def init: OldHashSet[A]
Definition Classes
OldHashSet → IterableOps
def inits: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def intersect(that: collection.Set[A]): OldHashSet[A]
Definition Classes
OldHashSet → SetOps
def isEmpty: Boolean
Definition Classes
IterableOnceOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
def iterableFactory: OldHashSet
Definition Classes
OldHashSet → Set → Iterable → Set → Iterable → IterableOps
def knownSize: Int
Definition Classes
IterableOnce
def last: A
Definition Classes
IterableOps
def lastOption: Option[A]
Definition Classes
IterableOps
def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, OldHashSet.this.type]
Definition Classes
Iterable
def map[B](f: (A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def max[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def min[B >: A](implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
Definition Classes
IterableOnceOps
def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
Definition Classes
IterableOnceOps
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[A, OldHashSet[A]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
def partition(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def product[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
def reduce[B >: A](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: A](op: (B, A) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: A](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: A](op: (A, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Definition Classes
IterableOnceOps
def removedAll(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
def reversed: collection.Iterable[A]
Attributes
protected
Definition Classes
IterableOnceOps
def scan[B >: A](z: B)(op: (B, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (A, B) => B): OldHashSet[B]
Definition Classes
IterableOps
def size: Int
Definition Classes
IterableOnceOps
def sizeCompare(that: collection.Iterable[_]): Int
Definition Classes
IterableOps
def sizeCompare(otherSize: Int): Int
Definition Classes
IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def span(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def splitAt(n: Int): (OldHashSet[A], OldHashSet[A])
Definition Classes
IterableOps → IterableOnceOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
Definition Classes
IterableOnce
final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
def stringPrefix: String
Attributes
protected[this]
Definition Classes
Set → Iterable
def subsetOf(that: collection.Set[A]): Boolean
Definition Classes
OldHashSet → SetOps
def subsets(): Iterator[OldHashSet[A]]
Definition Classes
SetOps
def subsets(len: Int): Iterator[OldHashSet[A]]
Definition Classes
SetOps
def sum[B >: A](implicit num: math.Numeric[B]): B
Definition Classes
IterableOnceOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: OldHashSet[A]
Definition Classes
OldHashSet → IterableOps
def tails: Iterator[OldHashSet[A]]
Definition Classes
IterableOps
def take(n: Int): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def takeRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def takeWhile(p: (A) => Boolean): OldHashSet[A]
Definition Classes
IterableOps → IterableOnceOps
def tapEach[U](f: (A) => U): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def to[C1](factory: Factory[A, C1]): C1
Definition Classes
IterableOnceOps
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: IndexedSeq[A]
Definition Classes
IterableOnceOps
def toList: List[A]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: Seq[A]
Definition Classes
IterableOnceOps
def toSet[B >: A]: Set[B]
Definition Classes
IterableOnceOps
def toString(): String
Definition Classes
Set → Function1 → Iterable → AnyRef → Any
def toVector: Vector[A]
Definition Classes
IterableOnceOps
def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): OldHashSet[OldHashSet[B]]
Definition Classes
IterableOps
final def union(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (OldHashSet[A1], OldHashSet[A2], OldHashSet[A3])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def view: View[A]
Definition Classes
IterableOps
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
def withFilter(p: (A) => Boolean): WithFilter[A, [_]OldHashSet[_]]
Definition Classes
IterableOps
def zip[B](that: IterableOnce[B]): OldHashSet[(A, B)]
Definition Classes
StrictOptimizedIterableOps → IterableOps
def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): OldHashSet[(A1, B)]
Definition Classes
IterableOps
def zipWithIndex: OldHashSet[(A, Int)]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def |(that: collection.Set[A]): OldHashSet[A]
Definition Classes
SetOps
Annotations
@inline()
def +(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
def ++:[B >: A](that: IterableOnce[B]): OldHashSet[B]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
def -(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Definition Classes
SetOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
final def /:[B](z: B)(op: (B, A) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
final def :\[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.
def companion: IterableFactory[[_]OldHashSet[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding() @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
final def repr: OldHashSet[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def seq: OldHashSet.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
final def toIterable: OldHashSet.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def toIterator: Iterator[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
final def toStream: Stream[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: collection.Traversable[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
def view(from: Int, until: Int): View[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Packages

OldHashSet

Companion object OldHashSet

sealed abstract class OldHashSet[A] extends AbstractSet[A] with SetOps[A, OldHashSet, OldHashSet[A]] with StrictOptimizedIterableOps[A, OldHashSet, OldHashSet[A]] with IterableFactoryDefaults[A, OldHashSet] with Serializable

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from StrictOptimizedIterableOps[A, OldHashSet, OldHashSet[A]]

Value Members

Inherited from SetOps[A, [X]OldHashSet[X], OldHashSet[A]]

Value Members

Inherited from collection.Set[A]

Value Members

Inherited from collection.SetOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

Inherited from (A) => Boolean

Value Members

Inherited from collection.Iterable[A]

Value Members

Inherited from IterableFactoryDefaults[A, [x]OldHashSet[x]]

Value Members

Inherited from IterableOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

Inherited from IterableOnceOps[A, [_]OldHashSet[_], OldHashSet[A]]

Value Members

Inherited from IterableOnce[A]

Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

Ungrouped

OldHashSet