OldHashSet

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

This class implements immutable sets using a hash trie.

This class implements immutable sets using a hash trie.

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

Type Params
A

the type of the elements contained in this hash set.

Companion
object
trait Serializable
trait StrictOptimizedIterableOps[A, [A] =>> OldHashSet[A], OldHashSet[A]]
class AbstractSet[A]
trait Set[A]
trait SetOps[A, [A] =>> OldHashSet[A], OldHashSet[A]]
trait Iterable[A]
class AbstractSet[A]
trait Set[A]
trait Equals
trait SetOps[A, [A] =>> OldHashSet[A], OldHashSet[A]]
trait A => Boolean
class AbstractIterable[A]
trait Iterable[A]
trait IterableFactoryDefaults[A, [A] =>> OldHashSet[A]]
trait IterableOps[A, [A] =>> OldHashSet[A], OldHashSet[A]]
trait IterableOnceOps[A, [A] =>> OldHashSet[A], OldHashSet[A]]
trait IterableOnce[A]
class Object
trait Matchable
class Any

Value members

Concrete methods

override def concat(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps
def contains(elem: A): Boolean
override def diff(that: Set[A]): OldHashSet[A]
Definition Classes
SetOps -> SetOps
def excl(elem: A): OldHashSet[A]
override def filter(p: A => Boolean): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
override def filterNot(p: A => Boolean): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
def incl(elem: A): OldHashSet[A]
override def init: OldHashSet[A]
Definition Classes
IterableOps
override def intersect(that: Set[A]): OldHashSet[A]
Definition Classes
SetOps
override def iterableFactory: IterableFactory[[A] =>> OldHashSet[A]]
Definition Classes
Set -> Iterable -> Set -> Iterable -> IterableOps
override def subsetOf(that: Set[A]): Boolean
Definition Classes
SetOps
override def tail: OldHashSet[A]
Definition Classes
IterableOps

Inherited methods

@inline
final def &(that: Set[A]): OldHashSet[A]
Inherited from
SetOps
@inline
final def &~(that: Set[A]): OldHashSet[A]
Inherited from
SetOps
final override def +(elem: A): OldHashSet[A]
Definition Classes
SetOps -> SetOps
Inherited from
SetOps
@inline
final def ++[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Inherited from
IterableOps
@inline
final def ++(that: IterableOnce[A]): OldHashSet[A]
Inherited from
SetOps
@inline
final override def -(elem: A): OldHashSet[A]
Definition Classes
SetOps -> SetOps
Inherited from
SetOps
final override def --(that: IterableOnce[A]): OldHashSet[A]
Definition Classes
SetOps -> SetOps
Inherited from
SetOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
@unspecialized
def andThen[A](g: Boolean => A): A => A
Inherited from
Function1
@inline
final def apply(elem: A): Boolean
Inherited from
SetOps
def canEqual(that: Any): Boolean
Inherited from
Set
override def collect[B](pf: PartialFunction[A, B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Inherited from
IterableOnceOps
@unspecialized
def compose[A](g: A => A): A => Boolean
Inherited from
Function1
def concat[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
Inherited from
IterableOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: A](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Inherited from
IterableOnceOps
def count(p: A => Boolean): Int
Inherited from
IterableOnceOps
def drop(n: Int): OldHashSet[A]
Inherited from
IterableOps
override def dropRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def dropWhile(p: A => Boolean): OldHashSet[A]
Inherited from
IterableOps
override def empty: OldHashSet[A]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from
IterableFactoryDefaults
override def equals(that: Any): Boolean
Definition Classes
Set -> Equals -> Any
Inherited from
Set
def exists(p: A => Boolean): Boolean
Inherited from
IterableOnceOps
def find(p: A => Boolean): Option[A]
Inherited from
IterableOnceOps
override def flatMap[B](f: A => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def flatten[B](toIterableOnce: A => IterableOnce[B]): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, A) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: (A, B) => B): B
Inherited from
IterableOnceOps
def forall(p: A => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: A => U): Unit
Inherited from
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[A]): OldHashSet[A]
Inherited from
IterableFactoryDefaults
def groupBy[K](f: A => K): Map[K, OldHashSet[A]]
Inherited from
IterableOps
def groupMap[K, B](key: A => K)(f: A => B): Map[K, OldHashSet[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: A => K)(f: A => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[OldHashSet[A]]
Inherited from
IterableOps
override def hashCode(): Int
Definition Classes
Set -> Any
Inherited from
Set
def head: A
Inherited from
IterableOps
def headOption: Option[A]
Inherited from
IterableOps
def inits: Iterator[OldHashSet[A]]
Inherited from
IterableOps
def isEmpty: Boolean
Inherited from
IterableOnceOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def iterator: Iterator[A]
Inherited from
IterableOnce
def knownSize: Int
Inherited from
IterableOnce
def last: A
Inherited from
IterableOps
def lastOption: Option[A]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, OldHashSet[A]]
Inherited from
Iterable
override def map[B](f: A => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def max[B >: A](ord: Ordering[B]): A
Inherited from
IterableOnceOps
def maxBy[B](f: A => B)(cmp: Ordering[B]): A
Inherited from
IterableOnceOps
def maxByOption[B](f: A => B)(cmp: Ordering[B]): Option[A]
Inherited from
IterableOnceOps
def maxOption[B >: A](ord: Ordering[B]): Option[A]
Inherited from
IterableOnceOps
def min[B >: A](ord: Ordering[B]): A
Inherited from
IterableOnceOps
def minBy[B](f: A => B)(cmp: Ordering[B]): A
Inherited from
IterableOnceOps
def minByOption[B](f: A => B)(cmp: Ordering[B]): Option[A]
Inherited from
IterableOnceOps
def minOption[B >: A](ord: Ordering[B]): Option[A]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
protected def newSpecificBuilder: Builder[A, OldHashSet[A]]
Inherited from
IterableFactoryDefaults
@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
override def partition(p: A => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: A => Either[A1, A2]): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def product[B >: A](num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: A](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: A](op: (B, A) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: A](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: A](op: (A, B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Inherited from
IterableOnceOps
def removedAll(that: IterableOnce[A]): OldHashSet[A]
Inherited from
SetOps
protected def reversed: Iterable[A]
Inherited from
IterableOnceOps
def scan[B >: A](z: B)(op: (B, B) => B): OldHashSet[B]
Inherited from
IterableOps
override def scanLeft[B](z: B)(op: (B, A) => B): OldHashSet[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (A, B) => B): OldHashSet[B]
Inherited from
IterableOps
def size: Int
Inherited from
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int
Inherited from
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from
IterableOps
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): OldHashSet[A]
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[OldHashSet[A]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[OldHashSet[A]]
Inherited from
IterableOps
override def span(p: A => Boolean): (OldHashSet[A], OldHashSet[A])
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def splitAt(n: Int): (OldHashSet[A], OldHashSet[A])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def stepper[S <: Stepper[_]](shape: StepperShape[A, S]): S
Inherited from
IterableOnce
def subsets(): Iterator[OldHashSet[A]]
Inherited from
SetOps
def subsets(len: Int): Iterator[OldHashSet[A]]
Inherited from
SetOps
def sum[B >: A](num: Numeric[B]): B
Inherited from
IterableOnceOps
def tails: Iterator[OldHashSet[A]]
Inherited from
IterableOps
def take(n: Int): OldHashSet[A]
Inherited from
IterableOps
override def takeRight(n: Int): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def takeWhile(p: A => Boolean): OldHashSet[A]
Inherited from
IterableOps
override def tapEach[U](f: A => U): OldHashSet[A]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def to[C1](factory: Factory[A, C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: A](ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: A]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[A]
Inherited from
IterableOnceOps
final def toIterable: OldHashSet[A]
Inherited from
Iterable
def toList: List[A]
Inherited from
IterableOnceOps
def toMap[K, V](ev: A <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
def toSeq: Seq[A]
Inherited from
IterableOnceOps
def toSet[B >: A]: Set[B]
Inherited from
IterableOnceOps
override def toString(): String
Definition Classes
Set -> Function1 -> Iterable -> Any
Inherited from
Set
def toVector: Vector[A]
Inherited from
IterableOnceOps
def transpose[B](asIterable: A => Iterable[B]): OldHashSet[OldHashSet[B]]
Inherited from
IterableOps
@inline
final def union(that: Set[A]): OldHashSet[A]
Inherited from
SetOps
override def unzip[A1, A2](asPair: A => (A1, A2)): (OldHashSet[A1], OldHashSet[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](asTriple: A => (A1, A2, A3)): (OldHashSet[A1], OldHashSet[A2], OldHashSet[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def view: View[A]
Inherited from
IterableOps
def withFilter(p: A => Boolean): WithFilter[A, [A] =>> OldHashSet[A]]
Inherited from
IterableOps
override def zip[B](that: IterableOnce[B]): OldHashSet[(A, B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): OldHashSet[(A1, B)]
Inherited from
IterableOps
override def zipWithIndex: OldHashSet[(A, Int)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
@inline
final def |(that: Set[A]): OldHashSet[A]
Inherited from
SetOps

Deprecated and Inherited methods

@deprecated("Use ++ with an explicit collection argument instead of + with varargs", "2.13.0")
def +(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Deprecated
Inherited from
SetOps
@deprecated("Use ++ instead of ++: for collections of type Iterable", "2.13.0")
def ++:[B >: A](that: IterableOnce[B]): OldHashSet[B]
Deprecated
Inherited from
IterableOps
@deprecated("Use &- with an explicit collection argument instead of - with varargs", "2.13.0")
def -(elem1: A, elem2: A, elems: A*): OldHashSet[A]
Deprecated
Inherited from
SetOps
@inline @deprecated("Use foldLeft instead of /:", "2.13.0")
final def /:[B](z: B)(op: (B, A) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use foldRight instead of :\\", "2.13.0")
final def :\[B](z: B)(op: (A, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@deprecated("`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", "2.13.0")
def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @deprecated("Use iterableFactory instead", "2.13.0")
def companion: IterableFactory[[A] =>> OldHashSet[A]]
Deprecated
Inherited from
IterableOps
@inline @deprecated("Use `dest ++= coll` instead", "2.13.0")
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Deprecated
Inherited from
IterableOnceOps
@deprecated("Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
Inherited from
IterableOnceOps
@deprecated("Use coll instead of repr in a collection implementation, use the collection value itself from the outside", "2.13.0")
final def repr: OldHashSet[A]
Deprecated
Inherited from
IterableOps
@deprecated("Iterable.seq always returns the iterable itself", "2.13.0")
def seq: OldHashSet[A]
Deprecated
Inherited from
Iterable
@inline @deprecated("Use .iterator instead of .toIterator", "2.13.0")
final def toIterator: Iterator[A]
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use .to(LazyList) instead of .toStream", "2.13.0")
final def toStream: Stream[A]
Deprecated
Inherited from
IterableOnceOps
@deprecated("Use toIterable instead", "2.13.0")
final def toTraversable: Iterable[A]
Deprecated
Inherited from
IterableOps
@deprecated("Use .view.slice(from, until) instead of .view(from, until)", "2.13.0")
def view(from: Int, until: Int): View[A]
Deprecated
Inherited from
IterableOps