Packages

trait ArraySet[A] extends MSet[A] with GenericSetTemplate[A, ArraySet] with SetLike[A, ArraySet[A]] with ExtSetMethods[A]

A growable and compactable mutable.Set implementation based on Array and mutable.Set. It switches to the latter representation as soon as a given threshold for the number of elements is reached. Thus this implementation is a kind of mixture of scala.collection.mutable{ResizableArray, Set, HashSet} aimed at increasing the performance of sets having up to 200 to 250 elements.

Linear Supertypes
ExtSetMethods[A], Set[A], SetLike[A, ArraySet[A]], Cloneable[Set[A]], Cloneable, Cloneable, Shrinkable[A], Builder[A, ArraySet[A]], Growable[A], Clearable, Scriptable[A], Set[A], SetLike[A, ArraySet[A]], Subtractable[A, ArraySet[A]], GenSet[A], GenericSetTemplate[A, ArraySet], GenSetLike[A, ArraySet[A]], (A) ⇒ Boolean, Iterable[A], Iterable[A], IterableLike[A, ArraySet[A]], Equals, GenIterable[A], GenIterableLike[A, ArraySet[A]], Traversable[A], Mutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, ArraySet], TraversableLike[A, ArraySet[A]], GenTraversableLike[A, ArraySet[A]], Parallelizable[A, ParSet[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, ArraySet[A]], HasNewBuilder[A, scalax.collection.mutable.ArraySet[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArraySet
  2. ExtSetMethods
  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

Type Members

  1. type Self = ArraySet[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +=(elem: A): ArraySet.this.type
    Definition Classes
    SetLike → Builder → Growable
  2. abstract def +=!(elem: A): ArraySet.this.type

    Adds elem without checking for duplicates.

    Adds elem without checking for duplicates.

    Attributes
    protected[scalax.collection]
  3. abstract def -=(elem: A): ArraySet.this.type
    Definition Classes
    SetLike → Shrinkable
  4. abstract def array: Array[A]
    Attributes
    protected[scalax.collection]
  5. abstract def capacity: Int

    For isArray == true, the current capacity of the internal array else 0.

  6. abstract def compact: Unit

    Compacts the current representation depending on ArraySet.Hints.compactUpToUsed.

  7. abstract def contains(elem: A): Boolean
    Definition Classes
    SetLike → GenSetLike
  8. abstract def draw(random: Random): A

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    random

    a random generator; it is essential that random be instantiated by the caller just once for any sequence of calls

    Definition Classes
    ExtSetMethods
  9. abstract def find(elem: A): Option[A]
  10. abstract def findEntry[B](toMatch: B, correspond: (A, B) ⇒ Boolean): A

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    toMatch

    a value not necessarily of type A; the entry to be searched for must have the same hashCode and be equal to this argument

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    ExtSetMethods
  11. abstract def hints: Hints

    The hints valid for this ArraySet!.

  12. abstract def isArray: Boolean

    Whether the internal representation is currently based on Array.

  13. abstract def iterator: Iterator[A]
    Definition Classes
    GenSetLike → GenIterableLike
  14. abstract def set: MSet[A]
    Attributes
    protected[scalax.collection]
  15. abstract def sorted(implicit ord: Ordering[A]): SortedSet[A]

    Sorts this ArraySet according to an Ordering in place.

    Sorts this ArraySet according to an Ordering in place.

    See also

    scala.collection.SeqLike

  16. abstract def upsert(elem: A): Boolean

    Updates or inserts elem.

    Updates or inserts elem.

    returns

    true if an insert took place.

    Attributes
    protected[scalax.collection]

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[A]): ArraySet[A]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[A]): ArraySet[A]
    Definition Classes
    GenSetLike
  5. def +(elem1: A, elem2: A, elems: A*): ArraySet[A]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

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

  6. def +(elem: A): ArraySet[A]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

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

  7. def ++(xs: GenTraversableOnce[A]): ArraySet[A]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

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

  8. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[A]): ArraySet.this.type
    Definition Classes
    Growable
  12. def +=(elem1: A, elem2: A, elems: A*): ArraySet.this.type
    Definition Classes
    Growable
  13. def -(elem1: A, elem2: A, elems: A*): ArraySet[A]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

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

  14. def -(elem: A): ArraySet[A]
    Definition Classes
    SetLike → SetLike → Subtractable → GenSetLike
    Annotations
    @migration
    Migration

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

  15. def --(xs: GenTraversableOnce[A]): ArraySet[A]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

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

  16. def --=(xs: TraversableOnce[A]): ArraySet.this.type
    Definition Classes
    Shrinkable
  17. def -=(elem1: A, elem2: A, elems: A*): ArraySet.this.type
    Definition Classes
    Shrinkable
  18. def ->[B](y: B): (ArraySet[A], B)
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to ArrowAssoc[ArraySet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  19. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. def add(elem: A): Boolean
    Definition Classes
    SetLike
  23. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  26. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def apply(elem: A): Boolean
    Definition Classes
    GenSetLike → Function1
  29. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  30. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  31. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  32. def clone(): ArraySet[A]
    Definition Classes
    SetLike → Cloneable → AnyRef
  33. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  34. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  35. def companion: GenericCompanion[ArraySet]
    Definition Classes
    ArraySet → Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  36. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  37. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  38. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  41. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def diff(that: GenSet[A]): ArraySet[A]
    Definition Classes
    SetLike → GenSetLike
  43. def drop(n: Int): ArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  44. def dropRight(n: Int): ArraySet[A]
    Definition Classes
    IterableLike
  45. def dropWhile(p: (A) ⇒ Boolean): ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  46. def empty: ArraySet[A]
    Definition Classes
    GenericSetTemplate
  47. def ensuring(cond: (ArraySet[A]) ⇒ Boolean, msg: ⇒ Any): ArraySet[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to Ensuring[ArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: (ArraySet[A]) ⇒ Boolean): ArraySet[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to Ensuring[ArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. def ensuring(cond: Boolean, msg: ⇒ Any): ArraySet[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to Ensuring[ArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  50. def ensuring(cond: Boolean): ArraySet[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to Ensuring[ArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  51. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  52. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  53. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def filter(p: (A) ⇒ Boolean): ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def filterNot(p: (A) ⇒ Boolean): ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  57. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  59. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ArraySet[B]
    Definition Classes
    GenericTraversableTemplate
  60. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  63. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  65. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to StringFormat[ArraySet[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  66. def genericBuilder[B]: Builder[B, ArraySet[B]]
    Definition Classes
    GenericTraversableTemplate
  67. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  68. def groupBy[K](f: (A) ⇒ K): Map[K, ArraySet[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def grouped(size: Int): Iterator[ArraySet[A]]
    Definition Classes
    IterableLike
  70. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  71. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  72. def head: A
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  73. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def init: ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def inits: Iterator[ArraySet[A]]
    Definition Classes
    TraversableLike
  76. def intersect(that: GenSet[A]): ArraySet[A]
    Definition Classes
    GenSetLike
  77. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  78. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  79. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  80. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

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

  83. def mapResult[NewTo](f: (ArraySet[A]) ⇒ NewTo): Builder[A, NewTo]
    Definition Classes
    Builder
  84. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  92. def newBuilder: Builder[A, ArraySet[A]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  93. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. final def notify(): Unit
    Definition Classes
    AnyRef
  95. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  96. def par: ParSet[A]
    Definition Classes
    Parallelizable
  97. def parCombiner: Combiner[A, ParSet[A]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  98. def partition(p: (A) ⇒ Boolean): (ArraySet[A], ArraySet[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  102. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  105. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def remove(elem: A): Boolean
    Definition Classes
    SetLike
  107. def repr: ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def result(): ArraySet[A]
    Definition Classes
    SetLike → Builder
  109. def retain(p: (A) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  110. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  111. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  112. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  113. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[ArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  115. def seq: Set[A]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  116. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  118. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  119. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  120. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  121. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  122. def slice(from: Int, until: Int): ArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  123. def sliding(size: Int, step: Int): Iterator[ArraySet[A]]
    Definition Classes
    IterableLike
  124. def sliding(size: Int): Iterator[ArraySet[A]]
    Definition Classes
    IterableLike
  125. def sortBy(f: (A) ⇒ A)(implicit ord: Ordering[A]): SortedSet[A]

    Sorts this ArraySet according to the Ordering which results from transforming an implicitly given Ordering with a transformation function in place.

    Sorts this ArraySet according to the Ordering which results from transforming an implicitly given Ordering with a transformation function in place.

    See also

    scala.collection.SeqLike

  126. def sortWith(lt: (A, A) ⇒ Boolean): SortedSet[A]

    Sorts this ArraySet according to a comparison function in place.

    Sorts this ArraySet according to a comparison function in place.

    See also

    scala.collection.SeqLike

  127. def span(p: (A) ⇒ Boolean): (ArraySet[A], ArraySet[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def splitAt(n: Int): (ArraySet[A], ArraySet[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def stringPrefix: String
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike
  130. def subsetOf(that: GenSet[A]): Boolean
    Definition Classes
    GenSetLike
  131. def subsets(): Iterator[ArraySet[A]]
    Definition Classes
    SetLike
  132. def subsets(len: Int): Iterator[ArraySet[A]]
    Definition Classes
    SetLike
  133. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  135. def tail: ArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def tails: Iterator[ArraySet[A]]
    Definition Classes
    TraversableLike
  137. def take(n: Int): ArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  138. def takeRight(n: Int): ArraySet[A]
    Definition Classes
    IterableLike
  139. def takeWhile(p: (A) ⇒ Boolean): ArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  140. def thisCollection: Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  141. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  142. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  144. def toCollection(repr: ArraySet[A]): Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  145. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  147. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  148. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to CollectionsHaveToParArray[ArraySet[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ArraySet[A]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  151. def toSeq: Seq[A]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  152. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  154. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  155. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  156. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ArraySet[ArraySet[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  158. def union(that: GenSet[A]): ArraySet[A]
    Definition Classes
    SetLike → GenSetLike
  159. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (ArraySet[A1], ArraySet[A2])
    Definition Classes
    GenericTraversableTemplate
  160. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (ArraySet[A1], ArraySet[A2], ArraySet[A3])
    Definition Classes
    GenericTraversableTemplate
  161. def update(elem: A, included: Boolean): Unit
    Definition Classes
    SetLike
  162. def view(from: Int, until: Int): IterableView[A, ArraySet[A]]
    Definition Classes
    IterableLike → TraversableLike
  163. def view: IterableView[A, ArraySet[A]]
    Definition Classes
    IterableLike → TraversableLike
  164. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  165. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  166. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  167. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, ArraySet[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  168. def withSetFilter(p: (A) ⇒ Boolean): FilteredSet[A]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  169. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArraySet[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  170. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArraySet[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  171. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[ArraySet[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  172. def |(that: GenSet[A]): ArraySet[A]
    Definition Classes
    GenSetLike
  173. def [B](y: B): (ArraySet[A], B)
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to ArrowAssoc[ArraySet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from ArraySet[A] to any2stringadd[ArraySet[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:
    (arraySet: any2stringadd[ArraySet[A]]).+(other)
    Definition Classes
    any2stringadd
  2. def filter(p: (A) ⇒ Boolean): TraversableOnce[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[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:
    (arraySet: MonadOps[A]).filter(p)
    Definition Classes
    MonadOps
  3. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from ArraySet[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:
    (arraySet: MonadOps[A]).flatMap(f)
    Definition Classes
    MonadOps
  4. def map[B](f: (A) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from ArraySet[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:
    (arraySet: MonadOps[A]).map(f)
    Definition Classes
    MonadOps
  5. def withFilter(p: (A) ⇒ Boolean): Iterator[A]
    Implicit
    This member is added by an implicit conversion from ArraySet[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:
    (arraySet: MonadOps[A]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def <<(cmd: Message[A]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

Inherited from ExtSetMethods[A]

Inherited from Set[A]

Inherited from SetLike[A, ArraySet[A]]

Inherited from Cloneable[Set[A]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, ArraySet[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, ArraySet[A]]

Inherited from Subtractable[A, ArraySet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, ArraySet]

Inherited from GenSetLike[A, ArraySet[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, ArraySet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, ArraySet[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from TraversableLike[A, ArraySet[A]]

Inherited from GenTraversableLike[A, ArraySet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, ArraySet[A]]

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

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

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

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

Ungrouped