Class/Object

scalax.collection.mutable

EqHashSet

Related Docs: object EqHashSet | package mutable

Permalink

class EqHashSet[A <: AnyRef] extends Set[A] with SetLike[A, EqHashSet[A]] with EqHash[A, EqHashSet[A]]

Linear Supertypes
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EqHashSet
  2. EqHash
  3. Set
  4. SetLike
  5. Cloneable
  6. Cloneable
  7. Cloneable
  8. Shrinkable
  9. Builder
  10. Growable
  11. Clearable
  12. Scriptable
  13. Set
  14. SetLike
  15. Subtractable
  16. GenSet
  17. GenericSetTemplate
  18. GenSetLike
  19. Function1
  20. Iterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. GenIterable
  25. GenIterableLike
  26. Traversable
  27. Mutable
  28. Traversable
  29. GenTraversable
  30. GenericTraversableTemplate
  31. TraversableLike
  32. GenTraversableLike
  33. Parallelizable
  34. TraversableOnce
  35. GenTraversableOnce
  36. FilterMonadic
  37. HasNewBuilder
  38. AnyRef
  39. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EqHashSet(other: EqHashSet[A])

    Permalink
  2. new EqHashSet(_sizeHint: Int = EqHash.defCapacity)

    Permalink

Type Members

  1. abstract class EqHashIterator[A] extends Iterator[A]

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  2. class KeyIndexIterator extends (EqHash.this)#EqHashIterator[Int]

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  3. type Self = EqHashSet[A]

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

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    GenSetLike
  5. def +(elem1: A, elem2: A, elems: A*): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  6. def +(elem: A): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def ++(xs: GenTraversableOnce[A]): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

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

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

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

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

    Permalink
    Definition Classes
    Growable
  12. def +=(elem: A): EqHashSet.this.type

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

    Permalink
    Definition Classes
    Growable
  14. def -(elem1: A, elem2: A, elems: A*): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  15. def -(elem: A): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → SetLike → Subtractable → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  16. def --(xs: GenTraversableOnce[A]): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

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

    Permalink
    Definition Classes
    Shrinkable
  18. def -=(elem: A): EqHashSet.this.type

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

    Permalink
    Definition Classes
    Shrinkable
  20. def ->[B](y: B): (EqHashSet[A], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to ArrowAssoc[EqHashSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  21. def /:[B](z: B)(op: (B, A) ⇒ B): B

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  24. var _size: Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  25. def add(elem: A): Boolean

    Permalink
    Definition Classes
    EqHashSet → SetLike
  26. def addString(b: StringBuilder): StringBuilder

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

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

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

    Permalink
    Definition Classes
    Any
  33. def canEqual(other: Any): Boolean

    Permalink
    Definition Classes
    EqHashSet → IterableLike → Equals
  34. def clear: Unit

    Permalink
    Definition Classes
    EqHash
  35. def clone(): EqHashSet[A]

    Permalink
    Definition Classes
    EqHashSet → SetLike → Cloneable → AnyRef
  36. final def closeDeletion(index: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  37. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That

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

    Permalink
    Definition Classes
    TraversableOnce
  39. def companion: GenericCompanion[Set]

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

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. final def contains(elem: A): Boolean

    Permalink
    Definition Classes
    EqHashSet → SetLike → GenSetLike
    Annotations
    @inline()
  42. def containsElem(elem: A): Boolean

    Permalink
    Definition Classes
    EqHashSetEqHash
  43. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def diff(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  49. def drop(n: Int): EqHashSet[A]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  50. def dropRight(n: Int): EqHashSet[A]

    Permalink
    Definition Classes
    IterableLike
  51. def dropWhile(p: (A) ⇒ Boolean): EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def elemHashCode: (Array[AnyRef], Int) ⇒ Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHashSetEqHash
  53. def empty: EqHashSet[A]

    Permalink
    Definition Classes
    EqHashSet → SetLike → GenericSetTemplate
  54. def ensuring(cond: (EqHashSet[A]) ⇒ Boolean, msg: ⇒ Any): EqHashSet[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to Ensuring[EqHashSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: (EqHashSet[A]) ⇒ Boolean): EqHashSet[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to Ensuring[EqHashSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. def ensuring(cond: Boolean, msg: ⇒ Any): EqHashSet[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to Ensuring[EqHashSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  57. def ensuring(cond: Boolean): EqHashSet[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to Ensuring[EqHashSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  58. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  59. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    EqHash → AnyRef → Any
  60. def exists(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def filter(p: (A) ⇒ Boolean): EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterNot(p: (A) ⇒ Boolean): EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def finalize(): Unit

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[B]

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  72. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to StringFormat[EqHashSet[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  73. def from(other: EqHashSet[A]): Unit

    Permalink
    Definition Classes
    EqHash
  74. def genericBuilder[B]: Builder[B, Set[B]]

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

    Permalink
    Definition Classes
    AnyRef → Any
  76. def groupBy[K](f: (A) ⇒ K): Map[K, EqHashSet[A]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def grouped(size: Int): Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    IterableLike
  78. def hasDefiniteSize: Boolean

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

    Permalink
    Definition Classes
    EqHash → AnyRef → Any
  80. def head: A

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  82. final def index(key: AnyRef): Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  83. def index(maskedKey: AnyRef, keyHash: Int, tabLength: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  84. def init: EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  85. def inits: Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    TraversableLike
  86. def intersect(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    GenSetLike
  87. def isEmpty: Boolean

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

    Permalink
    Definition Classes
    Any
  89. final def isTraversableAgain: Boolean

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

    Permalink
    Definition Classes
    EqHashSet → GenSetLike → IterableLike → GenIterableLike
  91. def last: A

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

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

    Permalink
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  94. def mapResult[NewTo](f: (EqHashSet[A]) ⇒ NewTo): Builder[A, NewTo]

    Permalink
    Definition Classes
    Builder
  95. final def maskNull(key: AnyRef): AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  96. def max[B >: A](implicit cmp: Ordering[B]): A

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def maxCapacity: Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  99. def min[B >: A](implicit cmp: Ordering[B]): A

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def mkString: String

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def move(oldTable: Array[AnyRef], oldLength: Int, newTable: Array[AnyRef], newLength: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    EqHashSetEqHash
  105. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  106. def newBuilder: Builder[A, EqHashSet[A]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  107. final def nextKeyIndex(i: Int, len: Int): Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  108. def nonEmpty: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  110. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  111. def par: ParSet[A]

    Permalink
    Definition Classes
    Parallelizable
  112. def parCombiner: Combiner[A, ParSet[A]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  113. def partition(p: (A) ⇒ Boolean): (EqHashSet[A], EqHashSet[A])

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

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

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

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

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

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

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

    Permalink
    Definition Classes
    EqHashSet → SetLike
  122. def repr: EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def resize: Unit

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  124. def result(): EqHashSet[A]

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

    Permalink
    Definition Classes
    SetLike
  126. def reversed: List[A]

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  131. def seq: Set[A]

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

    Permalink
    Definition Classes
    EqHash
    Annotations
    @inline()
  133. final def sizeHint: Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHashSetEqHash
  134. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

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

    Permalink
    Definition Classes
    Builder
  136. def sizeHint(size: Int): Unit

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

    Permalink
    Definition Classes
    Builder
  138. def slice(from: Int, until: Int): EqHashSet[A]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  139. def sliding(size: Int, step: Int): Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    IterableLike
  140. def sliding(size: Int): Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    IterableLike
  141. def span(p: (A) ⇒ Boolean): (EqHashSet[A], EqHashSet[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def splitAt(n: Int): (EqHashSet[A], EqHashSet[A])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  143. final def step: Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqHashSetEqHash
  144. def stringPrefix: String

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

    Permalink
    Definition Classes
    GenSetLike
  146. def subsets(): Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    SetLike
  147. def subsets(len: Int): Iterator[EqHashSet[A]]

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

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

    Permalink
    Definition Classes
    AnyRef
  150. var table: Array[AnyRef]

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  151. def tail: EqHashSet[A]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def tails: Iterator[EqHashSet[A]]

    Permalink
    Definition Classes
    TraversableLike
  153. def take(n: Int): EqHashSet[A]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  154. def takeRight(n: Int): EqHashSet[A]

    Permalink
    Definition Classes
    IterableLike
  155. def takeWhile(p: (A) ⇒ Boolean): EqHashSet[A]

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
  158. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

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

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

    Permalink
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  161. def toCollection(repr: EqHashSet[A]): Iterable[A]

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to CollectionsHaveToParArray[EqHashSet[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EqHashSet[A]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  168. def toSeq: Seq[A]

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  175. def union(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    SetLike → GenSetLike
  176. final def unmaskNull(key: AnyRef): AnyRef

    Permalink
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  177. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  178. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

    Permalink
    Definition Classes
    SetLike
  180. def view(from: Int, until: Int): IterableView[A, EqHashSet[A]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  181. def view: IterableView[A, EqHashSet[A]]

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  189. def |(that: GenSet[A]): EqHashSet[A]

    Permalink
    Definition Classes
    GenSetLike
  190. def [B](y: B): (EqHashSet[A], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to ArrowAssoc[EqHashSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to any2stringadd[EqHashSet[A]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashSet: any2stringadd[EqHashSet[A]]).+(other)
    Definition Classes
    any2stringadd
  2. def filter(p: (A) ⇒ Boolean): TraversableOnce[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashSet: MonadOps[A]).filter(p)
    Definition Classes
    MonadOps
  3. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashSet: MonadOps[A]).flatMap(f)
    Definition Classes
    MonadOps
  4. def map[B](f: (A) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashSet: MonadOps[A]).map(f)
    Definition Classes
    MonadOps
  5. def withFilter(p: (A) ⇒ Boolean): Iterator[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from EqHashSet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashSet: MonadOps[A]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

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

    Permalink
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Scripting is deprecated.

Inherited from EqHash[A, EqHashSet[A]]

Inherited from Set[A]

Inherited from SetLike[A, EqHashSet[A]]

Inherited from Cloneable[Set[A]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, EqHashSet[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, EqHashSet[A]]

Inherited from Subtractable[A, EqHashSet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, Set]

Inherited from GenSetLike[A, EqHashSet[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, EqHashSet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, EqHashSet[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Set]

Inherited from TraversableLike[A, EqHashSet[A]]

Inherited from GenTraversableLike[A, EqHashSet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, EqHashSet[A]]

Inherited from HasNewBuilder[A, EqHashSet[A]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from EqHashSet[A] to CollectionsHaveToParArray[EqHashSet[A], T]

Inherited by implicit conversion MonadOps from EqHashSet[A] to MonadOps[A]

Inherited by implicit conversion any2stringadd from EqHashSet[A] to any2stringadd[EqHashSet[A]]

Inherited by implicit conversion StringFormat from EqHashSet[A] to StringFormat[EqHashSet[A]]

Inherited by implicit conversion Ensuring from EqHashSet[A] to Ensuring[EqHashSet[A]]

Inherited by implicit conversion ArrowAssoc from EqHashSet[A] to ArrowAssoc[EqHashSet[A]]

Inherited by implicit conversion alternateImplicit from EqHashSet[A] to ForceImplicitAmbiguity

Ungrouped