DenseVector

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: V, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[V], B, That]): That

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

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

def :+[B >: V, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[V], B, That]): That

def :\[B](z: B)(op: (V, 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, V) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (V) ⇒ C): PartialFunction[Int, C]

def apply(idx: Int): V

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[V, B])(implicit bf: CanBuildFrom[IndexedSeq[V], B, That]): That

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

def combinations(n: Int): Iterator[IndexedSeq[V]]

def companion: GenericCompanion[IndexedSeq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ V

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

val denseCount: Int

How many items are not sparse

def denseIterator: Iterator[(Int, V)]

Iterator of indices and values of all non-sparse values

def diff[B >: V](that: GenSeq[B]): IndexedSeq[V]

def distinct: IndexedSeq[V]

def drop(n: Int): IndexedSeq[V]

def dropRight(n: Int): IndexedSeq[V]

def dropWhile(p: (V) ⇒ Boolean): IndexedSeq[V]

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def extend(cnt: Int): AdaptiveVector[V]

Grow by adding count sparse values to the end

def filter(p: (V) ⇒ Boolean): IndexedSeq[V]

def filterNot(p: (V) ⇒ Boolean): IndexedSeq[V]

def finalize(): Unit

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

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

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

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

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

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

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

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

final def getClass(): java.lang.Class[_]

def groupBy[K](f: (V) ⇒ K): Map[K, IndexedSeq[V]]

def grouped(size: Int): Iterator[IndexedSeq[V]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: V

def headOption: Option[V]

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

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

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

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

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

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

def indices: Range

def init: IndexedSeq[V]

def inits: Iterator[IndexedSeq[V]]

def intersect[B >: V](that: GenSeq[B]): IndexedSeq[V]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

val iseq: Vector[V]

def iterator: Iterator[V]

def last: V

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

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

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

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

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

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

def lastOption: Option[V]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[V]

def map[B, That](f: (V) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[V], B, That]): That

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

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

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

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

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[V, IndexedSeq[V]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Int, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

def par: ParSeq[V]

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

def partition(p: (V) ⇒ Boolean): (IndexedSeq[V], IndexedSeq[V])

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

def permutations: Iterator[IndexedSeq[V]]

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

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

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

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

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

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

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

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

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

def repr: IndexedSeq[V]

def reverse: IndexedSeq[V]

def reverseIterator: Iterator[V]

def reverseMap[B, That](f: (V) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[V], B, That]): That

def reversed: List[V]

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

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

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

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

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

def seq: Seq[V]

def size: Int

def slice(from: Int, until: Int): IndexedSeq[V]

def sliding[B >: V](size: Int, step: Int): Iterator[IndexedSeq[V]]

def sliding[B >: V](size: Int): Iterator[IndexedSeq[V]]

def sortBy[B](f: (V) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[V]

def sortWith(lt: (V, V) ⇒ Boolean): IndexedSeq[V]

def sorted[B >: V](implicit ord: Ordering[B]): IndexedSeq[V]

def span(p: (V) ⇒ Boolean): (IndexedSeq[V], IndexedSeq[V])

val sparseValue: V

def splitAt(n: Int): (IndexedSeq[V], IndexedSeq[V])

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

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

def stringPrefix: String

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

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

def tail: IndexedSeq[V]

def tails: Iterator[IndexedSeq[V]]

def take(n: Int): IndexedSeq[V]

def takeRight(n: Int): IndexedSeq[V]

def takeWhile(p: (V) ⇒ Boolean): IndexedSeq[V]

def thisCollection: IndexedSeq[V]

def toArray[B >: V](implicit arg0: ClassManifest[B]): Array[B]

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

def toCollection(repr: IndexedSeq[V]): IndexedSeq[V]

def toIndexedSeq[B >: V]: IndexedSeq[B]

def toIterable: Iterable[V]

def toIterator: Iterator[V]

def toList: List[V]

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

def toSeq: Seq[V]

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

def toStream: Stream[V]

def toString(): String

def toTraversable: Traversable[V]

def transpose[B](implicit asTraversable: (V) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

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

def unzip[A1, A2](implicit asPair: (V) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (V) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated(idx: Int, v: V): AdaptiveVector[V]

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

def view(from: Int, until: Int): SeqView[V, IndexedSeq[V]]

def view: SeqView[V, IndexedSeq[V]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (V) ⇒ Boolean): FilterMonadic[V, IndexedSeq[V]]

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

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

def zipWithIndex[A1 >: V, That](implicit bf: CanBuildFrom[IndexedSeq[V], (A1, Int), That]): That

def elements: Iterator[V]

def equalsWith[B](that: Seq[B])(f: (V, B) ⇒ Boolean): Boolean

def findIndexOf(p: (V) ⇒ Boolean): Int

def findLastIndexOf(p: (V) ⇒ Boolean): Int

def first: V

def firstOption: Option[V]

def productElements: Iterator[Any]

def projection: SeqView[V, IndexedSeq[V]]

def reversedElements: Iterator[V]