VectorLike

implicit abstract val elemTag: ClassTag[E]

abstract def iterator: Iterator[E]

abstract def newBuilder: VectorBuilder[E, V]

abstract val op: ScalarOps

abstract def seq: TraversableOnce[E]

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(s: E): V

Scales this vector by s.

def +[That >: V <: Vector[E]](v: That)(implicit bf: VectorCanBuildFrom[VectorLike.this.type, E, That]): That

Returns the sum of this and v.

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

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

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

def -[That >: V <: Vector[E]](v: That)(implicit bf: VectorCanBuildFrom[VectorLike.this.type, E, That]): That

Returns the difference of this and v.

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

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

final def ==(arg0: Any): Boolean

def @@(at: Int): V

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, E) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

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

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

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

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

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

def drop(n: Int): V

def dropRight(n: Int): V

def dropWhile(p: (E) ⇒ Boolean): V

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def filter(p: (E) ⇒ Boolean): V

def filterNot(p: (E) ⇒ Boolean): V

def finalize(): Unit

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

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

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

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

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

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

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: E

def headOption: Option[E]

def init: V

def inits: Iterator[V]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: E

def lastOption: Option[E]

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

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[E]

def parCombiner: Combiner[E, ParIterable[E]]

def partition(p: (E) ⇒ Boolean): (V, V)

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

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

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

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

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

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

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

def repr: V

def reversed: List[E]

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

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

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

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

def shorten: V

def size: Int

def slice(from: Int, until: Int): V

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

def sliding(size: Int): Iterator[V]

def span(p: (E) ⇒ Boolean): (V, V)

def splitAt(n: Int): (V, V)

def stringPrefix: String

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

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

def tail: V

def tails: Iterator[V]

def take(n: Int): V

def takeRight(n: Int): V

def takeWhile(p: (E) ⇒ Boolean): V

def thisCollection: Vector[E]

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

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

def toBuffer[B >: E]: Buffer[B]

def toCollection(repr: V): Vector[E]

def toIndexedSeq: IndexedSeq[E]

def toIterable: Iterable[E]

def toIterator: Iterator[E]

def toList: List[E]

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

def toSeq: Seq[E]

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

def toStream: Stream[E]

def toString(): String

def toTraversable: Traversable[E]

def toVector: scala.Vector[E]

def unary_+(): V

Returns identity.

def unary_-(): V

Returns negative complement of this.

def view(from: Int, until: Int): IterableView[E, V]

def view: IterableView[E, V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def widen(index: Index): V

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

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

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

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