SparseArray

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def ++=(xs: TraversableOnce[T]): SparseArray.this.type

def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def +=(elem: T): SparseArray.this.type

def +=(elem1: T, elem2: T, elems: T*): SparseArray.this.type

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

def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): 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, T) ⇒ B, combop: (B, B) ⇒ B): B

def apply(idx: Int): T

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

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

def combinations(n: Int): Iterator[SparseArray[T]]

def contains(elem: Any): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

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

def deep: IndexedSeq[Any]

val default: T

The default value which will appear to be stored at "empty" positions in the SparseArray

def density(): Float

def diff[B >: T](that: GenSeq[B]): SparseArray[T]

def distinct: SparseArray[T]

def drop(n: Int): SparseArray[T]

def dropRight(n: Int): SparseArray[T]

def dropWhile(p: (T) ⇒ Boolean): SparseArray[T]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (T) ⇒ Boolean): SparseArray[T]

def filterNot(p: (T) ⇒ Boolean): SparseArray[T]

def finalize(): Unit

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

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

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

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

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

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

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

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, SparseArray[T]]

def grouped(size: Int): Iterator[SparseArray[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def indexOf[B >: T](elem: B, from: Int): Int

def indexOf[B >: T](elem: B): Int

def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: T](that: GenSeq[B]): Int

def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

def indexWhere(p: (T) ⇒ Boolean): Int

def indices: Range

def init: SparseArray[T]

def inits: Iterator[SparseArray[T]]

def intersect[B >: T](that: GenSeq[B]): SparseArray[T]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastIndexOf[B >: T](elem: B, end: Int): Int

def lastIndexOf[B >: T](elem: B): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (T) ⇒ Boolean): Int

def lastOption: Option[T]

def length(): Int

def lengthCompare(len: Int): Int

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def mapResult[NewTo](f: (SparseArray[T]) ⇒ NewTo): Builder[T, NewTo]

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

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

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

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

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(): Builder[T, SparseArray[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def par: ParSeq[T]

def parCombiner: Combiner[T, ParSeq[T]]

def partition(p: (T) ⇒ Boolean): (SparseArray[T], SparseArray[T])

def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def permutations: Iterator[SparseArray[T]]

def prefixLength(p: (T) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: SparseArray[T]

def result(): SparseArray[T]

def reverse: SparseArray[T]

def reverseIterator: Iterator[T]

def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def reversed: List[T]

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

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

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

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

def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[T]

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): SparseArray[T]

def sliding(size: Int, step: Int): Iterator[SparseArray[T]]

def sliding(size: Int): Iterator[SparseArray[T]]

def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): SparseArray[T]

def sortWith(lt: (T, T) ⇒ Boolean): SparseArray[T]

def sorted[B >: T](implicit ord: Ordering[B]): SparseArray[T]

def span(p: (T) ⇒ Boolean): (SparseArray[T], SparseArray[T])

def splitAt(n: Int): (SparseArray[T], SparseArray[T])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

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

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

def tail: SparseArray[T]

def tails: Iterator[SparseArray[T]]

def take(n: Int): SparseArray[T]

def takeRight(n: Int): SparseArray[T]

def takeWhile(p: (T) ⇒ Boolean): SparseArray[T]

def thisCollection: IndexedSeq[T]

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

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

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

def toCollection(repr: SparseArray[T]): IndexedSeq[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

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

def toSeq: Seq[T]

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

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def update(idx: Int, elem: T): Unit

def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[SparseArray[T], B, That]): That

def view(from: Int, until: Int): IndexedSeqView[T, SparseArray[T]]

def view: IndexedSeqView[T, SparseArray[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, SparseArray[T]]

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

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

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[SparseArray[T], (A1, Int), That]): That

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