Packages

final class SimpleArraySet[A] extends ArraySet[A] with GenericSetTemplate[A, SimpleArraySet] with SetLike[A, SimpleArraySet[A]] with Serializable

A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.

Annotations
@SerialVersionUID()
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SimpleArraySet
  2. Serializable
  3. Serializable
  4. ArraySet
  5. ExtSetMethods
  6. FilterableSet
  7. Set
  8. SetLike
  9. Cloneable
  10. Cloneable
  11. Cloneable
  12. Shrinkable
  13. Builder
  14. Growable
  15. Clearable
  16. Scriptable
  17. Set
  18. SetLike
  19. Subtractable
  20. GenSet
  21. GenericSetTemplate
  22. GenSetLike
  23. Function1
  24. Iterable
  25. Iterable
  26. IterableLike
  27. Equals
  28. GenIterable
  29. GenIterableLike
  30. Traversable
  31. Mutable
  32. Traversable
  33. GenTraversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. GenTraversableLike
  37. Parallelizable
  38. TraversableOnce
  39. GenTraversableOnce
  40. FilterMonadic
  41. HasNewBuilder
  42. AnyRef
  43. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by ChainingOps
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  8. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SimpleArraySet(hints: Hints)

    hints

    Optimization hints controlling the growth of the underlying scala.collection.mutable.ArrayBuffer!.

Type Members

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

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]): SimpleArraySet[A]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[A]): SimpleArraySet[A]
    Definition Classes
    GenSetLike
  5. def +(elem1: A, elem2: A, elems: A*): SimpleArraySet[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): SimpleArraySet[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]): SimpleArraySet[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[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[A]): SimpleArraySet.this.type
    Definition Classes
    Growable
  12. def +=(elem: A): SimpleArraySet.this.type
    Definition Classes
    SimpleArraySet → SetLike → Builder → Growable
  13. def +=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type
    Definition Classes
    Growable
  14. def +=!(elem: A): SimpleArraySet.this.type

    Adds elem without checking for duplicates.

    Adds elem without checking for duplicates.

    Attributes
    protected[collection]
    Definition Classes
    SimpleArraySetArraySet
  15. def -(elem1: A, elem2: A, elems: A*): SimpleArraySet[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.

  16. def -(elem: A): SimpleArraySet[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.

  17. def --(xs: GenTraversableOnce[A]): SimpleArraySet[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.

  18. def --=(xs: TraversableOnce[A]): SimpleArraySet.this.type
    Definition Classes
    Shrinkable
  19. def -=(elem: A): SimpleArraySet.this.type
    Definition Classes
    SimpleArraySet → SetLike → Shrinkable
  20. def -=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type
    Definition Classes
    Shrinkable
  21. def ->[B](y: B): (SimpleArraySet[A], B)
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to ArrowAssoc[SimpleArraySet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  22. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. def add(elem: A): Boolean
    Definition Classes
    SimpleArraySet → SetLike
  24. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  26. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  27. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  29. def apply(elem: A): Boolean
    Definition Classes
    GenSetLike → Function1
  30. def array: Array[A]
    Attributes
    protected[collection]
    Definition Classes
    SimpleArraySetArraySet
  31. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  32. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  33. final def capacity: Int

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

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

    Definition Classes
    SimpleArraySetArraySet
  34. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  35. def clone(): SimpleArraySet[A]
    Definition Classes
    SimpleArraySet → SetLike → Cloneable → AnyRef
  36. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  38. def compact: Unit

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

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

    Definition Classes
    SimpleArraySetArraySet
  39. def companion: GenericCompanion[SimpleArraySet]
    Definition Classes
    SimpleArraySetArraySet → Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  40. def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. def contains(elem: A): Boolean
    Definition Classes
    SimpleArraySet → SetLike → GenSetLike
  42. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  46. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def diff(that: GenSet[A]): SimpleArraySet[A]
    Definition Classes
    SetLike → GenSetLike
  48. 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. Note that currently a near- but no true-uniform distribution is granted to allow for O(1) implementation.

    random

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

    Definition Classes
    SimpleArraySetExtSetMethods
  49. def drop(n: Int): SimpleArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  50. def dropRight(n: Int): SimpleArraySet[A]
    Definition Classes
    IterableLike
  51. def dropWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def empty: SimpleArraySet[A]
    Definition Classes
    GenericSetTemplate
  53. def ensuring(cond: (SimpleArraySet[A]) ⇒ Boolean, msg: ⇒ Any): SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: (SimpleArraySet[A]) ⇒ Boolean): SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: Boolean, msg: ⇒ Any): SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. def ensuring(cond: Boolean): SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  57. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  58. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  59. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  60. def filter(p: (A) ⇒ Boolean): SimpleArraySet[A]

    Optimized by use of unchecked insertions.

    Optimized by use of unchecked insertions.

    Definition Classes
    SimpleArraySet → TraversableLike → GenTraversableLike
  61. def filterNot(p: (A) ⇒ Boolean): SimpleArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def find(elem: A): Option[A]
    Definition Classes
    SimpleArraySetArraySet
  63. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def findElem[B](other: 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.

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    SimpleArraySetExtSetMethods
  65. def findElem(elem: A): Option[A]
    Definition Classes
    ExtSetMethods
  66. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  67. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): SimpleArraySet[B]
    Definition Classes
    GenericTraversableTemplate
  68. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  71. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  72. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    SimpleArraySet → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  73. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to StringFormat[SimpleArraySet[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  74. def genericBuilder[B]: Builder[B, SimpleArraySet[B]]
    Definition Classes
    GenericTraversableTemplate
  75. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  76. def groupBy[K](f: (A) ⇒ K): Map[K, SimpleArraySet[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def grouped(size: Int): Iterator[SimpleArraySet[A]]
    Definition Classes
    IterableLike
  78. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  79. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  80. def head: A
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  81. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. val hints: Hints

    The hints valid for this ArraySet!.

    The hints valid for this ArraySet!.

    Definition Classes
    SimpleArraySetArraySet
  83. final def indexOf(elem: A): Int
    Attributes
    protected
  84. final def indexOf[B](elem: B, pred: (A, B) ⇒ Boolean): Int
    Attributes
    protected
  85. def init: SimpleArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def inits: Iterator[SimpleArraySet[A]]
    Definition Classes
    TraversableLike
  87. def intersect(that: GenSet[A]): SimpleArraySet[A]
    Definition Classes
    GenSetLike
  88. final def isArray: Boolean

    Whether the internal representation is currently based on Array.

    Whether the internal representation is currently based on Array.

    Definition Classes
    SimpleArraySetArraySet
    Annotations
    @inline()
  89. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  90. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  91. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  92. def iterator: Iterator[A]
    Definition Classes
    SimpleArraySet → GenSetLike → IterableLike → GenIterableLike
  93. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def map(xs: TraversableOnce[A]): SimpleArraySet.this.type
    Attributes
    protected[collection]
  96. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[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.

  97. def mapResult[NewTo](f: (SimpleArraySet[A]) ⇒ NewTo): Builder[A, NewTo]
    Definition Classes
    Builder
  98. def mapUnchecked[B, That](f: (A) ⇒ B): SimpleArraySet[B]

    Faster mapping in case the caller ensures to insert no duplicates.

    Faster mapping in case the caller ensures to insert no duplicates.

    Attributes
    protected[collection]
  99. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  107. def newBuilder: CheckingBuilder[A]
    Definition Classes
    SimpleArraySet → SetLike → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  108. def newNonCheckingBuilder[B]: NonCheckingBuilder[A, B]
    Attributes
    protected[collection]
  109. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  111. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  112. def par: ParSet[A]
    Definition Classes
    Parallelizable
  113. def parCombiner: Combiner[A, ParSet[A]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  114. def partition(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])

    Optimized by use of unchecked insertions.

    Optimized by use of unchecked insertions.

    Definition Classes
    SimpleArraySet → TraversableLike → GenTraversableLike
  115. def pipe[B](f: (SimpleArraySet[A]) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to ChainingOps[SimpleArraySet[A]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  116. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  119. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  122. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def remove(elem: A): Boolean
    Definition Classes
    SetLike
  124. def removeIndex(i: Int): Unit
    Attributes
    protected
  125. def repr: SimpleArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. final def resizeArray(fromCapacity: Int, toCapacity: Int): Unit
    Attributes
    protected
  127. def resizedToHash: Boolean
    Attributes
    protected
  128. def result(): SimpleArraySet[A]
    Definition Classes
    SetLike → Builder
  129. def retain(p: (A) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  130. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  131. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  132. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[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.

  135. val self: SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to ChainingOps[SimpleArraySet[A]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  136. def seq: Set[A]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  137. def set: ExtHashSet[A]
    Attributes
    protected[collection]
    Definition Classes
    SimpleArraySetArraySet
  138. final def setToArray(set: Iterable[A], size: Int): Unit
    Attributes
    protected
  139. def size: Int
    Definition Classes
    SimpleArraySet → GenTraversableLike → TraversableOnce → GenTraversableOnce
  140. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  141. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  142. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  143. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  144. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  145. def slice(from: Int, until: Int): SimpleArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  146. def sliding(size: Int, step: Int): Iterator[SimpleArraySet[A]]
    Definition Classes
    IterableLike
  147. def sliding(size: Int): Iterator[SimpleArraySet[A]]
    Definition Classes
    IterableLike
  148. 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.

    Definition Classes
    ArraySet
    See also

    scala.collection.SeqLike

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

    Definition Classes
    ArraySet
    See also

    scala.collection.SeqLike

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

    Definition Classes
    SimpleArraySetArraySet
    See also

    scala.collection.SeqLike

  151. def span(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def splitAt(n: Int): (SimpleArraySet[A], SimpleArraySet[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def stringPrefix: String
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike
  154. def subsetOf(that: GenSet[A]): Boolean
    Definition Classes
    GenSetLike
  155. def subsets(): Iterator[SimpleArraySet[A]]
    Definition Classes
    SetLike
  156. def subsets(len: Int): Iterator[SimpleArraySet[A]]
    Definition Classes
    SetLike
  157. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  159. def tail: SimpleArraySet[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def tails: Iterator[SimpleArraySet[A]]
    Definition Classes
    TraversableLike
  161. def take(n: Int): SimpleArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  162. def takeRight(n: Int): SimpleArraySet[A]
    Definition Classes
    IterableLike
  163. def takeWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  164. def tap[U](f: (SimpleArraySet[A]) ⇒ U): SimpleArraySet[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to ChainingOps[SimpleArraySet[A]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  165. def thisCollection: Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  166. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  167. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  169. def toCollection(repr: SimpleArraySet[A]): Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  170. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  172. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  173. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to CollectionsHaveToParArray[SimpleArraySet[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (SimpleArraySet[A]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  176. def toSeq: Seq[A]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  177. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  179. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  180. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  181. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): SimpleArraySet[SimpleArraySet[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  183. def union(that: GenSet[A]): SimpleArraySet[A]
    Definition Classes
    SetLike → GenSetLike
  184. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (SimpleArraySet[A1], SimpleArraySet[A2])
    Definition Classes
    GenericTraversableTemplate
  185. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (SimpleArraySet[A1], SimpleArraySet[A2], SimpleArraySet[A3])
    Definition Classes
    GenericTraversableTemplate
  186. def update(elem: A, included: Boolean): Unit
    Definition Classes
    SetLike
  187. def upsert(elem: A): Boolean

    Updates or inserts elem.

    Updates or inserts elem.

    returns

    true if an insert took place.

    Attributes
    protected[collection]
    Definition Classes
    SimpleArraySetArraySet
  188. def view(from: Int, until: Int): IterableView[A, SimpleArraySet[A]]
    Definition Classes
    IterableLike → TraversableLike
  189. def view: IterableView[A, SimpleArraySet[A]]
    Definition Classes
    IterableLike → TraversableLike
  190. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  191. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  192. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  193. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, SimpleArraySet[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  194. def withSetFilter(p: (A) ⇒ Boolean): Set[A] with FilterableSet[A]
    Definition Classes
    FilterableSet
  195. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  196. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  197. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  198. def |(that: GenSet[A]): SimpleArraySet[A]
    Definition Classes
    GenSetLike
  199. def [B](y: B): (SimpleArraySet[A], B)
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[A] to ArrowAssoc[SimpleArraySet[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 SimpleArraySet[A] to any2stringadd[SimpleArraySet[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:
    (simpleArraySet: any2stringadd[SimpleArraySet[A]]).+(other)
    Definition Classes
    any2stringadd
  2. def filter(p: (A) ⇒ Boolean): TraversableOnce[A]
    Implicit
    This member is added by an implicit conversion from SimpleArraySet[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:
    (simpleArraySet: 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 SimpleArraySet[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:
    (simpleArraySet: 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 SimpleArraySet[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:
    (simpleArraySet: 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 SimpleArraySet[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:
    (simpleArraySet: MonadOps[A]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

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

    (Since version 2.11.0) scripting is deprecated

  4. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from ArraySet[A]

Inherited from ExtSetMethods[A]

Inherited from FilterableSet[A]

Inherited from Set[A]

Inherited from SetLike[A, SimpleArraySet[A]]

Inherited from Cloneable[Set[A]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[A, SimpleArraySet[A]]

Inherited from Growable[A]

Inherited from Clearable

Inherited from Scriptable[A]

Inherited from Set[A]

Inherited from SetLike[A, SimpleArraySet[A]]

Inherited from Subtractable[A, SimpleArraySet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, SimpleArraySet]

Inherited from GenSetLike[A, SimpleArraySet[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, SimpleArraySet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, SimpleArraySet[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from TraversableLike[A, SimpleArraySet[A]]

Inherited from GenTraversableLike[A, SimpleArraySet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, SimpleArraySet[A]]

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

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion ChainingOps from SimpleArraySet[A] to ChainingOps[SimpleArraySet[A]]

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

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

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

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

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

Ungrouped