c

org.gnarf.linear

MutableMat

abstract class MutableMat[T] extends Mat[T]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MutableMat
  2. Mat
  3. Traversable
  4. GenTraversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. GenTraversableLike
  8. Parallelizable
  9. TraversableOnce
  10. GenTraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MutableMat()(implicit arg0: LinField[T], arg1: ClassTag[T])

Type Members

  1. class ColVec extends ImmutableVec[T]
    Definition Classes
    Mat
  2. class RowVec extends ImmutableVec[T]
    Definition Classes
    Mat
  3. type Self = Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  4. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def apply(row: Int, col: Int): T
    Definition Classes
    Mat
  2. abstract val numColumns: Int
    Definition Classes
    Mat
  3. abstract val numRows: Int
    Definition Classes
    Mat
  4. abstract def update(row: Int, col: Int, value: T): Unit

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def *(that: Mat[T]): Mat[T]
    Definition Classes
    Mat
  4. def *(that: Vec[T]): Vec[T]
    Definition Classes
    Mat
  5. def *(that: T): Mat[T]
    Definition Classes
    Mat
  6. def +(that: T): Mat[T]
    Definition Classes
    Mat
  7. def +(that: Mat[T]): Mat[T]
    Definition Classes
    Mat
  8. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike
  11. def -(that: T): Mat[T]
    Definition Classes
    Mat
  12. def -(that: Mat[T]): Mat[T]
    Definition Classes
    Mat
  13. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def ataLeastSquaresSolveFor(y: Vec[T]): LinearSystemSolution[T]

    Solve using AtAx = Aty method.

    Solve using AtAx = Aty method.

    Use leastSquaresSolveFor() instead unless you really must have this version.

    Definition Classes
    Mat
  22. val classTag: ClassTag[T]
    Definition Classes
    Mat
  23. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  25. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  26. def column(index: Int): Vec[T]
    Definition Classes
    Mat
  27. def columnSpace: Basis[T]

    Calculate A basis for the column space of this matrix.

    Calculate A basis for the column space of this matrix. Note that this is just one of the bases that span this space.

    Definition Classes
    Mat
  28. def columns: Seq[Vec[T]]
    Definition Classes
    Mat
  29. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  30. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def dataToString: String
    Definition Classes
    Mat
  36. def drop(n: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def dropWhile(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def echelonForm: (Mat[T], Mat[T])

    Returns U and M such that MA = U.

    Returns U and M such that MA = U.

    A is this matrix. U is a row echelon matrix. M is a matrix containing the transforms to get to U.

    returns

    (U,M)

    Definition Classes
    Mat
  39. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. def equals(that: Any): Boolean
    Definition Classes
    Mat → AnyRef → Any
  41. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  42. def factory: MatFactory
    Definition Classes
    Mat
  43. def filter(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def filterNot(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  46. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  47. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  48. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  49. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  53. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    Mat → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  54. def frobeniusNorm(implicit ips: InnerProductSpace[T]): T
    Definition Classes
    Mat
  55. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  56. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  57. def groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  59. def hashCode(): Int
    Definition Classes
    Mat → AnyRef → Any
  60. def head: T
    Definition Classes
    TraversableLike → GenTraversableLike
  61. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def init: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def inits: Iterator[Traversable[T]]
    Definition Classes
    TraversableLike
  64. def inverse: Mat[T]

    Invert this matrix if it is invertible.

    Invert this matrix if it is invertible.

    returns

    inverse of this matrix.

    Definition Classes
    Mat
  65. def isColumnEchelon: Boolean
    Definition Classes
    Mat
  66. def isDiagonal: Boolean
    Definition Classes
    Mat
  67. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  68. def isIdentity: Boolean
    Definition Classes
    Mat
  69. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  70. def isInvertible: Boolean
    Definition Classes
    Mat
  71. def isLowerTriangular: Boolean
    Definition Classes
    Mat
  72. def isRowEchelon: Boolean
    Definition Classes
    Mat
  73. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  74. def isUpperTriangular: Boolean
    Definition Classes
    Mat
  75. def isZero: Boolean
    Definition Classes
    Mat
  76. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def leastSquaresSolveFor(y: Vec[T]): Vec[T]

    Solve Ax = y by least squares method, giving an approximate x.

    Solve Ax = y by least squares method, giving an approximate x.

    A is this matrix which, y is provided vector. Returns approximate solution x.

    returns

    x

    Definition Classes
    Mat
  79. val linField: LinField[T]
    Definition Classes
    Mat
  80. def linearIndependentColumnSubset: IndexedSeq[Vec[T]]

    Returns a subset of the columns that are linearly independent

    Returns a subset of the columns that are linearly independent

    Definition Classes
    Mat
  81. def linearIndependentRowSubset: IndexedSeq[Vec[T]]

    Returns a subset of the rows that are linearly independent

    Returns a subset of the rows that are linearly independent

    Definition Classes
    Mat
  82. def map[U](f: (T) ⇒ U)(implicit arg0: LinField[U], arg1: ClassTag[U]): Mat[U]
    Definition Classes
    Mat
  83. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  84. def mapWithIndexes[U](f: (Int, Int) ⇒ (T) ⇒ U)(implicit arg0: LinField[U], arg1: ClassTag[U]): Mat[U]
    Definition Classes
    Mat
  85. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  93. def newBuilder: Builder[T, Traversable[T]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  94. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. final def notify(): Unit
    Definition Classes
    AnyRef
  96. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  97. def nullSpace: Basis[T]

    Calculate the null space for this matrix

    Calculate the null space for this matrix

    Definition Classes
    Mat
  98. def nullity: Int
    Definition Classes
    Mat
  99. def par: ParIterable[T]
    Definition Classes
    Parallelizable
  100. def parCombiner: Combiner[T, ParIterable[T]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  101. def partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def qrDecomposition(implicit ips: InnerProductSpace[T]): (Mat[T], Mat[T])

    Returns the QR decomposition of this matrix.

    Returns the QR decomposition of this matrix.

    returns

    (Q,R) where Q * R = this

    Definition Classes
    Mat
  104. def qrLeastSquaresSolveFor(y: Vec[T])(implicit ips: InnerProductSpace[T]): Vec[T]

    Least squares solve using Q/R decomposition.

    Least squares solve using Q/R decomposition.

    Use leastSquaresSolveFor() instead unless you really must have the Q/R version.

    Definition Classes
    Mat
  105. def rank: Int
    Definition Classes
    Mat
  106. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  108. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def reducedRowEchelonForm: (Mat[T], IndexedSeq[Int])

    Returns row reduced echelon form and row swap list.

    Returns row reduced echelon form and row swap list.

    U is the reduced row echelon matrix. rows is a mapping of rows from original matrix to U

    returns

    (U, rows)

    Definition Classes
    Mat
  113. def repr: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  115. def row(index: Int): Vec[T]
    Definition Classes
    Mat
  116. def rowSpace: Basis[T]

    Calculate A basis for the row space of this matrix.

    Calculate A basis for the row space of this matrix. Note that this is just one of the bases that span this space.

    Definition Classes
    Mat
  117. def rows: Seq[Vec[T]]
    Definition Classes
    Mat
  118. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  121. def seq: Traversable[T]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  122. val size: Int
    Definition Classes
    Mat → GenTraversableLike → TraversableOnce → GenTraversableOnce
  123. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  124. def slice(from: Int, until: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def solveFor(y: Vec[T]): LinearSystemSolution[T]

    Solve Ax = y for this matrix.

    Solve Ax = y for this matrix.

    A is this matrix, y is provided vector. Returns solution x

    returns

    x such that this * x = y

    Definition Classes
    Mat
  126. def span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def splitAt(n: Int): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  131. def tail: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def tails: Iterator[Traversable[T]]
    Definition Classes
    TraversableLike
  133. def take(n: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def takeWhile(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  135. def thisCollection: Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  136. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  137. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toCollection(repr: Traversable[T]): Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  140. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toIterable: Iterable[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toIterator: Iterator[T]
    Definition Classes
    TraversableLike → GenTraversableOnce
  143. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toSeq: Seq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toStream: Stream[T]
    Definition Classes
    TraversableLike → GenTraversableOnce
  148. def toString(): String
    Definition Classes
    Mat → TraversableLike → AnyRef → Any
  149. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  150. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def transpose: Mat[T]
    Definition Classes
    Mat
  152. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  153. def triangularSolveFor(y: Vec[T]): Vec[T]

    Solve Ax = y for this TRIANGULAR matrix.

    Solve Ax = y for this TRIANGULAR matrix.

    A is this matrix which is required to be upper triangular, y is provided vector. Returns solution x

    returns

    x such that this * x = y

    Definition Classes
    Mat
  154. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  155. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  156. def vectorFactory: VecFactory
    Definition Classes
    Mat
  157. def view(from: Int, until: Int): TraversableView[T, Traversable[T]]
    Definition Classes
    TraversableLike
  158. def view: TraversableView[T, Traversable[T]]
    Definition Classes
    TraversableLike
  159. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  160. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  161. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  162. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]
    Definition Classes
    TraversableLike → FilterMonadic

Inherited from Mat[T]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Traversable]

Inherited from TraversableLike[T, Traversable[T]]

Inherited from GenTraversableLike[T, Traversable[T]]

Inherited from Parallelizable[T, ParIterable[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, Traversable[T]]

Inherited from HasNewBuilder[T, Traversable[T]]

Inherited from AnyRef

Inherited from Any

Ungrouped