SimpleArraySet

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenSet[A]): SimpleArraySet[A]

def &~(that: GenSet[A]): SimpleArraySet[A]

def +(elem1: A, elem2: A, elems: A*): SimpleArraySet[A]

def +(elem: A): SimpleArraySet[A]

def ++(xs: GenTraversableOnce[A]): SimpleArraySet[A]

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

def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def ++=(xs: TraversableOnce[A]): SimpleArraySet.this.type

def +=(elem: A): SimpleArraySet.this.type

def +=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type

def +=!(elem: A): SimpleArraySet.this.type

Adds elem without checking for duplicates.

def -(elem1: A, elem2: A, elems: A*): SimpleArraySet[A]

def -(elem: A): SimpleArraySet[A]

def --(xs: GenTraversableOnce[A]): SimpleArraySet[A]

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

def -=(elem: A): SimpleArraySet.this.type

def -=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type

def /:[B](z: B)(op: (B, A) ⇒ B): B

def :\[B](z: B)(op: (A, B) ⇒ B): B

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def add(elem: A): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

def apply(elem: A): Boolean

def array: Array[A]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

final def capacity: Int

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

def clear(): Unit

def clone(): SimpleArraySet[A]

def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

def compact: Unit

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

def companion: GenericCompanion[SimpleArraySet]

def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

def contains(elem: A): Boolean

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: A](xs: Array[B]): Unit

def copyToArray[B >: A](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

def count(p: (A) ⇒ Boolean): Int

def diff(that: GenSet[A]): SimpleArraySet[A]

def draw(random: Random): A

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

def drop(n: Int): SimpleArraySet[A]

def dropRight(n: Int): SimpleArraySet[A]

def dropWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]

def empty: SimpleArraySet[A]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): SimpleArraySet[A]

Optimized by use of unchecked insertions.

def filterNot(p: (A) ⇒ Boolean): SimpleArraySet[A]

def finalize(): Unit

def find(elem: A): Option[A]

def find(p: (A) ⇒ Boolean): Option[A]

def findEntry[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.

def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): SimpleArraySet[B]

def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

def foldRight[B](z: B)(op: (A, B) ⇒ B): B

def forall(p: (A) ⇒ Boolean): Boolean

def foreach[U](f: (A) ⇒ U): Unit

def genericBuilder[B]: Builder[B, SimpleArraySet[B]]

final def getClass(): Class[_]

def groupBy[K](f: (A) ⇒ K): Map[K, SimpleArraySet[A]]

def grouped(size: Int): Iterator[SimpleArraySet[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: A

def headOption: Option[A]

val hints: Hints

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

final def indexOf(elem: A): Int

def init: SimpleArraySet[A]

def inits: Iterator[SimpleArraySet[A]]

def intersect(that: GenSet[A]): SimpleArraySet[A]

final def isArray: Boolean

Whether the internal representation is currently based on Array.

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastOption: Option[A]

def map(xs: TraversableOnce[A]): SimpleArraySet.this.type

def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def mapResult[NewTo](f: (SimpleArraySet[A]) ⇒ NewTo): Builder[A, NewTo]

def mapUnchecked[B, That](f: (A) ⇒ B): SimpleArraySet[B]

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

def max[B >: A](implicit cmp: Ordering[B]): A

def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

def min[B >: A](implicit cmp: Ordering[B]): A

def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: CheckingBuilder[A]

def newNonCheckingBuilder[B]: NonCheckingBuilder[A, B]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParSet[A]

def parCombiner: Combiner[A, ParSet[A]]

def partition(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])

Optimized by use of unchecked insertions.

def product[B >: A](implicit num: Numeric[B]): B

def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: A](op: (B, A) ⇒ B): B

def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: A](op: (A, B) ⇒ B): B

def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

def remove(elem: A): Boolean

def removeIndex(i: Int): Unit

def repr: SimpleArraySet[A]

final def resizeArray(fromCapacity: Int, toCapacity: Int): Unit

def resizedToHash: Boolean

def result(): SimpleArraySet[A]

def retain(p: (A) ⇒ Boolean): Unit

def reversed: List[A]

def sameElements[B >: A](that: GenIterable[B]): Boolean

def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That

def seq: Set[A]

def set: ExtHashSet[A]

final def setToArray(set: Iterable[A], size: Int): Unit

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): SimpleArraySet[A]

def sliding(size: Int, step: Int): Iterator[SimpleArraySet[A]]

def sliding(size: Int): Iterator[SimpleArraySet[A]]

def sortBy(f: (A) ⇒ A)(implicit ord: Ordering[A]): SortedSet[A]

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

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

Sorts this ArraaySet according to a comparison function in place.

def sorted(implicit ord: Ordering[A]): SortedSet[A]

Sorts this ArraaySet according to an Ordering in place.

def span(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])

def splitAt(n: Int): (SimpleArraySet[A], SimpleArraySet[A])

def stringPrefix: String

def subsetOf(that: GenSet[A]): Boolean

def subsets: Iterator[SimpleArraySet[A]]

def subsets(len: Int): Iterator[SimpleArraySet[A]]

def sum[B >: A](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: SimpleArraySet[A]

def tails: Iterator[SimpleArraySet[A]]

def take(n: Int): SimpleArraySet[A]

def takeRight(n: Int): SimpleArraySet[A]

def takeWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]

def thisCollection: Iterable[A]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[A1 >: A]: Buffer[A1]

def toCollection(repr: SimpleArraySet[A]): Iterable[A]

def toIndexedSeq: IndexedSeq[A]

def toIterable: Iterable[A]

def toIterator: Iterator[A]

def toList: List[A]

def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

def toSeq: Seq[A]

def toSet[B >: A]: Set[B]

def toStream: Stream[A]

def toString(): String

def toTraversable: Traversable[A]

def toVector: Vector[A]

def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): SimpleArraySet[SimpleArraySet[B]]

def union(that: GenSet[A]): SimpleArraySet[A]

def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (SimpleArraySet[A1], SimpleArraySet[A2])

def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (SimpleArraySet[A1], SimpleArraySet[A2], SimpleArraySet[A3])

def update(elem: A, included: Boolean): Unit

def view(from: Int, until: Int): IterableView[A, SimpleArraySet[A]]

def view: IterableView[A, SimpleArraySet[A]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, SimpleArraySet[A]]

def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, B), That]): That

def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, B), That]): That

def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, Int), That]): That

def |(that: GenSet[A]): SimpleArraySet[A]

def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1