Packages

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
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OldHashSet
  2. Serializable
  3. StrictOptimizedIterableOps
  4. AbstractSet
  5. Set
  6. SetOps
  7. Iterable
  8. AbstractSet
  9. Set
  10. Equals
  11. SetOps
  12. Function1
  13. AbstractIterable
  14. Iterable
  15. IterableFactoryDefaults
  16. IterableOps
  17. IterableOnceOps
  18. IterableOnce
  19. AnyRef
  20. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. 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
  2. abstract def filter0(p: (A) => Boolean, negate: Boolean, level: Int, buffer: Array[OldHashSet[A]], offset0: Int): OldHashSet[A]
    Attributes
    protected
  3. abstract def get0(key: A, hash: Int, level: Int): Boolean
    Attributes
    protected
  4. 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
  5. abstract def iterator: Iterator[A]
    Definition Classes
    IterableOnce
  6. abstract def removed0(key: A, hash: Int, level: Int): OldHashSet[A]
    Attributes
    protected
  7. 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
  8. 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
  9. abstract def updated0(key: A, hash: Int, level: Int): OldHashSet[A]
    Attributes
    protected[collection]

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def +(elem: A): OldHashSet[A]
    Definition Classes
    SetOps → SetOps
  6. final def ++(that: IterableOnce[A]): OldHashSet[A]
    Definition Classes
    SetOps
    Annotations
    @inline()
  7. final def ++[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  8. final def -(elem: A): OldHashSet[A]
    Definition Classes
    SetOps → SetOps
    Annotations
    @inline()
  9. final def --(that: IterableOnce[A]): OldHashSet[A]
    Definition Classes
    SetOps → SetOps
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def addString(b: mutable.StringBuilder): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  13. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
    Definition Classes
    IterableOnceOps
  14. def andThen[A](g: (Boolean) => A): (A) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  15. final def apply(elem: A): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  18. def className: String
    Attributes
    protected[this]
    Definition Classes
    OldHashSet → Iterable
  19. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  20. final def coll: OldHashSet.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  21. def collect[B](pf: PartialFunction[A, B]): OldHashSet[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  22. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  23. def compose[A](g: (A) => A): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  24. def concat(that: IterableOnce[A]): OldHashSet[A]
    Definition Classes
    OldHashSet → SetOps
  25. def concat[B >: A](suffix: IterableOnce[B]): OldHashSet[B]
    Definition Classes
    IterableOps
  26. def contains(elem: A): Boolean
    Definition Classes
    OldHashSet → SetOps
  27. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  28. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
  29. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
  30. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  31. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  32. def diff(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    OldHashSet → SetOps → SetOps
  33. def drop(n: Int): OldHashSet[A]
    Definition Classes
    IterableOps → IterableOnceOps
  34. def dropRight(n: Int): OldHashSet[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  35. def dropWhile(p: (A) => Boolean): OldHashSet[A]
    Definition Classes
    IterableOps → IterableOnceOps
  36. def empty: OldHashSet[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(that: Any): Boolean
    Definition Classes
    Set → Equals → AnyRef → Any
  39. def excl(elem: A): OldHashSet[A]
    Definition Classes
    OldHashSet → SetOps
  40. def exists(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  41. def filter(p: (A) => Boolean): OldHashSet[A]
    Definition Classes
    OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  42. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): OldHashSet[A]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  43. def filterNot(p: (A) => Boolean): OldHashSet[A]
    Definition Classes
    OldHashSet → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  44. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  45. def find(p: (A) => Boolean): Option[A]
    Definition Classes
    IterableOnceOps
  46. def flatMap[B](f: (A) => IterableOnce[B]): OldHashSet[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  47. def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): OldHashSet[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  48. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  49. def foldLeft[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  50. def foldRight[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  51. def forall(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  52. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  53. def fromSpecific(coll: IterableOnce[A]): OldHashSet[A]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  54. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  55. def groupBy[K](f: (A) => K): Map[K, OldHashSet[A]]
    Definition Classes
    IterableOps
  56. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, OldHashSet[B]]
    Definition Classes
    IterableOps
  57. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  58. def grouped(size: Int): Iterator[OldHashSet[A]]
    Definition Classes
    IterableOps
  59. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  60. def head: A
    Definition Classes
    IterableOps
  61. def headOption: Option[A]
    Definition Classes
    IterableOps
  62. def incl(elem: A): OldHashSet[A]
    Definition Classes
    OldHashSet → SetOps
  63. def init: OldHashSet[A]
    Definition Classes
    OldHashSet → IterableOps
  64. def inits: Iterator[OldHashSet[A]]
    Definition Classes
    IterableOps
  65. def intersect(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    OldHashSet → SetOps
  66. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  67. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  68. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  69. def iterableFactory: OldHashSet
    Definition Classes
    OldHashSet → Set → Iterable → Set → Iterable → IterableOps
  70. def knownSize: Int
    Definition Classes
    IterableOnce
  71. def last: A
    Definition Classes
    IterableOps
  72. def lastOption: Option[A]
    Definition Classes
    IterableOps
  73. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, OldHashSet.this.type]
    Definition Classes
    Iterable
  74. def map[B](f: (A) => B): OldHashSet[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  75. def max[B >: A](implicit ord: math.Ordering[B]): A
    Definition Classes
    IterableOnceOps
  76. def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Definition Classes
    IterableOnceOps
  77. def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  78. def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  79. def min[B >: A](implicit ord: math.Ordering[B]): A
    Definition Classes
    IterableOnceOps
  80. def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Definition Classes
    IterableOnceOps
  81. def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  82. def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  83. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  84. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  85. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  86. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  87. def newSpecificBuilder: Builder[A, OldHashSet[A]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  88. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  89. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  90. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  91. def partition(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  92. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (OldHashSet[A1], OldHashSet[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  93. def product[B >: A](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  94. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  95. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  96. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  97. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  98. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  99. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  100. def removedAll(that: IterableOnce[A]): OldHashSet[A]
    Definition Classes
    SetOps
  101. def reversed: collection.Iterable[A]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  102. def scan[B >: A](z: B)(op: (B, B) => B): OldHashSet[B]
    Definition Classes
    IterableOps
  103. def scanLeft[B](z: B)(op: (B, A) => B): OldHashSet[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  104. def scanRight[B](z: B)(op: (A, B) => B): OldHashSet[B]
    Definition Classes
    IterableOps
  105. def size: Int
    Definition Classes
    IterableOnceOps
  106. def sizeCompare(that: collection.Iterable[_]): Int
    Definition Classes
    IterableOps
  107. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  108. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  109. def slice(from: Int, until: Int): OldHashSet[A]
    Definition Classes
    IterableOps → IterableOnceOps
  110. def sliding(size: Int, step: Int): Iterator[OldHashSet[A]]
    Definition Classes
    IterableOps
  111. def sliding(size: Int): Iterator[OldHashSet[A]]
    Definition Classes
    IterableOps
  112. def span(p: (A) => Boolean): (OldHashSet[A], OldHashSet[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  113. def splitAt(n: Int): (OldHashSet[A], OldHashSet[A])
    Definition Classes
    IterableOps → IterableOnceOps
  114. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
    Definition Classes
    IterableOnce
  115. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  116. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  117. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  118. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  119. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  120. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  121. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Set → Iterable
  122. def subsetOf(that: collection.Set[A]): Boolean
    Definition Classes
    OldHashSet → SetOps
  123. def subsets(): Iterator[OldHashSet[A]]
    Definition Classes
    SetOps
  124. def subsets(len: Int): Iterator[OldHashSet[A]]
    Definition Classes
    SetOps
  125. def sum[B >: A](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  126. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  127. def tail: OldHashSet[A]
    Definition Classes
    OldHashSet → IterableOps
  128. def tails: Iterator[OldHashSet[A]]
    Definition Classes
    IterableOps
  129. def take(n: Int): OldHashSet[A]
    Definition Classes
    IterableOps → IterableOnceOps
  130. def takeRight(n: Int): OldHashSet[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  131. def takeWhile(p: (A) => Boolean): OldHashSet[A]
    Definition Classes
    IterableOps → IterableOnceOps
  132. def tapEach[U](f: (A) => U): OldHashSet[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  133. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  134. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  135. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  136. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOnceOps
  137. final def toIterable: OldHashSet.this.type
    Definition Classes
    Iterable → IterableOps
  138. def toList: List[A]
    Definition Classes
    IterableOnceOps
  139. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  140. def toSeq: Seq[A]
    Definition Classes
    IterableOnceOps
  141. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  142. def toString(): String
    Definition Classes
    Set → Function1 → Iterable → AnyRef → Any
  143. def toVector: Vector[A]
    Definition Classes
    IterableOnceOps
  144. def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): OldHashSet[OldHashSet[B]]
    Definition Classes
    IterableOps
  145. final def union(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    SetOps
    Annotations
    @inline()
  146. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (OldHashSet[A1], OldHashSet[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  147. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (OldHashSet[A1], OldHashSet[A2], OldHashSet[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  148. def view: View[A]
    Definition Classes
    IterableOps
  149. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  150. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  151. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  152. def withFilter(p: (A) => Boolean): WithFilter[A, [_]OldHashSet[_]]
    Definition Classes
    IterableOps
  153. def zip[B](that: IterableOnce[B]): OldHashSet[(A, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  154. def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): OldHashSet[(A1, B)]
    Definition Classes
    IterableOps
  155. def zipWithIndex: OldHashSet[(A, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  156. final def |(that: collection.Set[A]): OldHashSet[A]
    Definition Classes
    SetOps
    Annotations
    @inline()

Deprecated Value Members

  1. 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

  2. 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

  3. 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

  4. 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 /:

  5. 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 :\

  6. 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) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  7. def companion: IterableFactory[[_]OldHashSet[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  8. 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

  9. 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)

  10. 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

  11. def seq: OldHashSet.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  12. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  13. final def toStream: Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  14. final def toTraversable: collection.Traversable[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  15. 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 java.io.Serializable

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

Inherited from AbstractSet[A]

Inherited from Set[A]

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

Inherited from Iterable[A]

Inherited from collection.AbstractSet[A]

Inherited from collection.Set[A]

Inherited from Equals

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

Inherited from (A) => Boolean

Inherited from AbstractIterable[A]

Inherited from collection.Iterable[A]

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

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

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

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped