MatrixLike

implicit abstract val elemTag: ClassTag[E]

abstract def iterator: Iterator[Vector[E]]

abstract def newBuilder: MatrixBuilder[Vector[E], M]

abstract def seq: TraversableOnce[Vector[E]]

final def !=(arg0: Any): Boolean

final def ##(): Int

def *[That <: Vector[E]](v: That)(implicit vbf: VectorCanBuildFrom[That, E, That]): That

Returns the product of this and v.

def *[That >: M <: Matrix[E]](b: That)(implicit vbf: VectorCanBuildFrom[Vector[E], E, Vector[E]], mbf: MatrixCanBuildFrom[MatrixLike.this.type, Vector[E], That]): That

Returns the product of this and b.

def *(s: E): M

Scales this matrix by s.

def +[That >: M <: Matrix[E]](b: That)(implicit vbf: VectorCanBuildFrom[Vector[E], E, Vector[E]], mbf: MatrixCanBuildFrom[MatrixLike.this.type, Vector[E], That]): That

Returns the sum of this and b.

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

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

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

def -[That >: M <: Matrix[E]](b: That)(implicit vbf: VectorCanBuildFrom[Vector[E], E, Vector[E]], mbf: MatrixCanBuildFrom[MatrixLike.this.type, Vector[E], That]): That

Returns the difference of this and b.

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

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

final def ==(arg0: Any): Boolean

def @@(at: (Int, Int)): M

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

final def asInstanceOf[T0]: T0

def atCol(at: Int): M

def atRow(at: Int): M

def binaryOp[That >: M <: Matrix[E]](f: (Vector[E], Vector[E]) ⇒ Vector[E], b: That)(implicit bf: MatrixCanBuildFrom[MatrixLike.this.type, Vector[E], That]): That

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

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

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

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

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

def count(p: (Vector[E]) ⇒ Boolean): Int

def drop(n: Int): M

def dropRight(n: Int): M

def dropWhile(p: (Vector[E]) ⇒ Boolean): M

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Vector[E]) ⇒ Boolean): Boolean

def filter(p: (Vector[E]) ⇒ Boolean): M

def filterNot(p: (Vector[E]) ⇒ Boolean): M

def finalize(): Unit

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

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

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

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

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

def forall(p: (Vector[E]) ⇒ Boolean): Boolean

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Vector[E]

def headOption: Option[Vector[E]]

def init: M

def inits: Iterator[M]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: Vector[E]

def lastOption: Option[Vector[E]]

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

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

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

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

def minBy[B](f: (Vector[E]) ⇒ B)(implicit cmp: Ordering[B]): Vector[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[Vector[E]]

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

def partition(p: (Vector[E]) ⇒ Boolean): (M, M)

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

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

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

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

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

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

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

def repr: M

def reversed: List[Vector[E]]

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

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

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

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

def shorten: M

def size: Int

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

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

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

def span(p: (Vector[E]) ⇒ Boolean): (M, M)

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

def stringPrefix: String

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

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

def tail: M

def tails: Iterator[M]

def take(n: Int): M

def takeRight(n: Int): M

def takeWhile(p: (Vector[E]) ⇒ Boolean): M

def thisCollection: M

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

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

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

def toCollection(repr: M): M

def toIndexedSeq: IndexedSeq[Vector[E]]

def toIterable: Iterable[Vector[E]]

def toIterator: Iterator[Vector[E]]

def toList: List[Vector[E]]

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

def toSeq: Seq[Vector[E]]

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

def toStream: Stream[Vector[E]]

def toString(): String

def toTraversable: Traversable[Vector[E]]

def toVector: scala.Vector[Vector[E]]

def transposed(): M

Returns the transpose of this matrix..

def unaryOp(f: (Vector[E]) ⇒ Vector[E]): M

def unary_+(): M

Returns identity.

def unary_-(): M

Returns negative complement of this.

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

def view: IterableView[Vector[E], M]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def widen(index: Index2): M

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

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

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

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