Class/Object

breeze.linalg

DenseMatrix

Related Docs: object DenseMatrix | package linalg

Permalink

final class DenseMatrix[V] extends Matrix[V] with MatrixLike[V, DenseMatrix[V]] with Serializable

A DenseMatrix is a matrix with all elements found in an array. It is column major unless isTranspose is true, It is designed to be fast: Double- (and potentially Float-)valued DenseMatrices can be used with blas, and support operations to that effect.

Annotations
@SerialVersionUID()
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DenseMatrix
  2. Serializable
  3. Serializable
  4. Matrix
  5. MatrixLike
  6. Tensor
  7. TensorLike
  8. NumericOps
  9. ImmutableNumericOps
  10. QuasiTensor
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DenseMatrix(rows: Int, data: Array[V], offset: Int)

    Permalink

    Creates a matrix with the specified data array and rows.

    Creates a matrix with the specified data array and rows. columns inferred automatically

  2. new DenseMatrix(rows: Int, cols: Int, data: Array[V])

    Permalink

    Creates a matrix with the specified data array, rows, and columns.

    Creates a matrix with the specified data array, rows, and columns. Data must be column major

  3. new DenseMatrix(rows: Int, cols: Int, data: Array[V], offset: Int)

    Permalink

    Creates a matrix with the specified data array, rows, and columns.

    Creates a matrix with the specified data array, rows, and columns. Data must be column major

  4. new DenseMatrix(rows: Int, cols: Int)(implicit man: ClassTag[V])

    Permalink

    Creates a matrix with the specified data array, rows, and columns.

  5. new DenseMatrix(rows: Int, cols: Int, data: Array[V], offset: Int, majorStride: Int, isTranspose: Boolean = false)

    Permalink

    rows

    number of rows

    cols

    number of cols

    data

    The underlying data. Column-major unless isTranpose is true. Mutate at your own risk. Note that this matrix may be a view of the data. Use linearIndex(r,c) to calculate indices.

    offset

    starting point into array

    majorStride

    distance separating columns (or rows, for isTranspose). should have absolute value >= rows (or cols, for isTranspose)

    isTranspose

    if true, then the matrix is considered to be "transposed" (that is, row major)

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def %[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That

    Permalink

    Alias for :%(b) when b is a scalar.

    Alias for :%(b) when b is a scalar.

    Definition Classes
    ImmutableNumericOps
  4. final def %:%[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That

    Permalink

    Element-wise modulo of this and b.

    Element-wise modulo of this and b.

    Definition Classes
    ImmutableNumericOps
  5. final def %=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Alias for :%=(b) when b is a scalar.

    Alias for :%=(b) when b is a scalar.

    Definition Classes
    NumericOps
  6. final def &[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That

    Permalink

    Alias for :&&(b) for all b.

    Alias for :&&(b) for all b.

    Definition Classes
    ImmutableNumericOps
  7. final def &:&[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That

    Permalink

    Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.

    Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.

    Definition Classes
    ImmutableNumericOps
  8. final def &=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise and of this and b.

    Mutates this by element-wise and of this and b.

    Definition Classes
    NumericOps
  9. final def *[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMulMatrix.Impl2[TT, B, That]): That

    Permalink

    Matrix multiplication (and scalar multiplication that follows standard order of operations)

    Matrix multiplication (and scalar multiplication that follows standard order of operations)

    Definition Classes
    ImmutableNumericOps
  10. final def *:*[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMulScalar.Impl2[TT, B, That]): That

    Permalink

    Element-wise product of this and b.

    Element-wise product of this and b.

    Definition Classes
    ImmutableNumericOps
  11. final def *=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Alias for :*=(b) when b is a scalar.

    Alias for :*=(b) when b is a scalar.

    Definition Classes
    NumericOps
  12. final def +[TT >: DenseMatrix[V], B, C, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That

    Permalink

    Alias for :+(b) for all b.

    Alias for :+(b) for all b.

    Definition Classes
    NumericOps
  13. final def +:+[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That

    Permalink

    Element-wise sum of this and b.

    Element-wise sum of this and b.

    Definition Classes
    ImmutableNumericOps
  14. final def +=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Alias for :+=(b) for all b.

    Alias for :+=(b) for all b.

    Definition Classes
    NumericOps
  15. final def -[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That

    Permalink

    Alias for :-(b) for all b.

    Alias for :-(b) for all b.

    Definition Classes
    ImmutableNumericOps
  16. final def -:-[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That

    Permalink

    Element-wise difference of this and b.

    Element-wise difference of this and b.

    Definition Classes
    ImmutableNumericOps
  17. final def -=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Alias for :-=(b) for all b.

    Alias for :-=(b) for all b.

    Definition Classes
    NumericOps
  18. final def /[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That

    Permalink

    Alias for :/(b) when b is a scalar.

    Alias for :/(b) when b is a scalar.

    Definition Classes
    ImmutableNumericOps
  19. final def /:/[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That

    Permalink

    Element-wise quotient of this and b.

    Element-wise quotient of this and b.

    Definition Classes
    ImmutableNumericOps
  20. final def /=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Alias for :/=(b) when b is a scalar.

    Alias for :/=(b) when b is a scalar.

    Definition Classes
    NumericOps
  21. final def :!=[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpNe.Impl2[TT, B, That]): That

    Permalink

    Element-wise inequality comparator of this and b.

    Element-wise inequality comparator of this and b.

    Definition Classes
    ImmutableNumericOps
  22. final def :%=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise modulo of b into this.

    Mutates this by element-wise modulo of b into this.

    Definition Classes
    NumericOps
  23. final def :&=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise and of this and b.

    Mutates this by element-wise and of this and b.

    Definition Classes
    NumericOps
  24. final def :*=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise multiplication of b into this.

    Mutates this by element-wise multiplication of b into this.

    Definition Classes
    NumericOps
  25. final def :+=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise addition of b into this.

    Mutates this by element-wise addition of b into this.

    Definition Classes
    NumericOps
  26. final def :-=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise subtraction of b from this

    Mutates this by element-wise subtraction of b from this

    Definition Classes
    NumericOps
  27. final def :/=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise division of b into this

    Mutates this by element-wise division of b into this

    Definition Classes
    NumericOps
  28. final def :=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpSet.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise assignment of b into this.

    Mutates this by element-wise assignment of b into this.

    Definition Classes
    NumericOps
  29. final def :==[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpEq.Impl2[TT, B, That]): That

    Permalink

    Element-wise equality comparator of this and b.

    Element-wise equality comparator of this and b.

    Definition Classes
    ImmutableNumericOps
  30. final def :^=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpPow.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise exponentiation of this by b.

    Mutates this by element-wise exponentiation of this by b.

    Definition Classes
    NumericOps
  31. final def :^^=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise xor of this and b.

    Mutates this by element-wise xor of this and b.

    Definition Classes
    NumericOps
  32. final def :|=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise or of this and b.

    Mutates this by element-wise or of this and b.

    Definition Classes
    NumericOps
  33. final def <:<[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpLT.Impl2[TT, B, That]): That

    Permalink

    Element-wise less=than comparator of this and b.

    Element-wise less=than comparator of this and b.

    Definition Classes
    NumericOps
  34. final def <:=[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpLTE.Impl2[TT, B, That]): That

    Permalink

    Element-wise less-than-or-equal-to comparator of this and b.

    Element-wise less-than-or-equal-to comparator of this and b.

    Definition Classes
    NumericOps
  35. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  36. final def >:=[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpGTE.Impl2[TT, B, That]): That

    Permalink

    Element-wise greater-than-or-equal-to comparator of this and b.

    Element-wise greater-than-or-equal-to comparator of this and b.

    Definition Classes
    NumericOps
  37. final def >:>[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpGT.Impl2[TT, B, That]): That

    Permalink

    Element-wise greater-than comparator of this and b.

    Element-wise greater-than comparator of this and b.

    Definition Classes
    NumericOps
  38. def \[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpSolveMatrixBy.Impl2[TT, B, That]): That

    Permalink

    Shaped solve of this by b.

    Shaped solve of this by b.

    Definition Classes
    ImmutableNumericOps
  39. final def ^:^[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpPow.Impl2[TT, B, That]): That

    Permalink

    Element-wise exponentiation of this and b.

    Element-wise exponentiation of this and b.

    Definition Classes
    ImmutableNumericOps
  40. final def ^^[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That

    Permalink

    Alias for :^^(b) for all b.

    Alias for :^^(b) for all b.

    Definition Classes
    ImmutableNumericOps
  41. final def ^^:^^[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That

    Permalink

    Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.

    Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.

    Definition Classes
    ImmutableNumericOps
  42. final def ^^=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise xor of this and b.

    Mutates this by element-wise xor of this and b.

    Definition Classes
    NumericOps
  43. def active: TensorActive[(Int, Int), V, DenseMatrix[V]]

    Permalink
    Definition Classes
    TensorLike
  44. def activeIterator: Iterator[((Int, Int), V)]

    Permalink
    Definition Classes
    DenseMatrixQuasiTensor
  45. def activeKeysIterator: Iterator[(Int, Int)]

    Permalink
    Definition Classes
    DenseMatrixQuasiTensor
  46. def activeSize: Int

    Permalink
    Definition Classes
    DenseMatrixTensorLike
  47. def activeValuesIterator: Iterator[V]

    Permalink
    Definition Classes
    DenseMatrixQuasiTensor
  48. def allVisitableIndicesActive: Boolean

    Permalink
  49. def apply(row: Int, col: Int): V

    Permalink
    Definition Classes
    DenseMatrixMatrix
  50. final def apply(i: (Int, Int)): V

    Permalink
    Definition Classes
    MatrixTensorLikeQuasiTensor
  51. def apply[Slice1, Slice2, Result](slice1: Slice1, slice2: Slice2)(implicit canSlice: CanSlice2[DenseMatrix[V], Slice1, Slice2, Result]): Result

    Permalink

    Method for slicing that is tuned for Matrices.

    Method for slicing that is tuned for Matrices.

    Definition Classes
    TensorLike
  52. def apply[Result](a: (Int, Int), slice: (Int, Int)*)(implicit canSlice: CanSlice[DenseMatrix[V], Seq[(Int, Int)], Result]): Result

    Permalink

    Slice a sequence of elements.

    Slice a sequence of elements. Must be at least 2.

    Definition Classes
    TensorLike
  53. def apply[Slice, Result](slice: Slice)(implicit canSlice: CanSlice[DenseMatrix[V], Slice, Result]): Result

    Permalink

    method for slicing a tensor.

    method for slicing a tensor. For instance, DenseVectors support efficient slicing by a Range object.

    Definition Classes
    TensorLike
  54. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  55. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. val cols: Int

    Permalink

    number of cols

    number of cols

    Definition Classes
    DenseMatrixMatrix
  57. def copy: DenseMatrix[V]

    Permalink
    Definition Classes
    DenseMatrixMatrix
  58. val data: Array[V]

    Permalink

    The underlying data.

    The underlying data. Column-major unless isTranpose is true. Mutate at your own risk. Note that this matrix may be a view of the data. Use linearIndex(r,c) to calculate indices.

  59. def delete(cols: Seq[Int], axis: _1.type): DenseMatrix[V]

    Permalink
  60. def delete(rows: Seq[Int], axis: _0.type): DenseMatrix[V]

    Permalink
  61. def delete(col: Int, axis: _1.type): DenseMatrix[V]

    Permalink
  62. def delete(row: Int, axis: _0.type): DenseMatrix[V]

    Permalink
  63. final def dot[TT >: DenseMatrix[V], B, BB >: B, That](b: B)(implicit op: operators.OpMulInner.Impl2[TT, BB, That]): That

    Permalink

    Inner product of this and b.

    Inner product of this and b.

    Definition Classes
    ImmutableNumericOps
  64. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  65. def equals(p1: Any): Boolean

    Permalink
    Definition Classes
    Matrix → AnyRef → Any
  66. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  67. def findAll(f: (V) ⇒ Boolean): IndexedSeq[(Int, Int)]

    Permalink

    Returns all indices k whose value satisfies a predicate.

    Returns all indices k whose value satisfies a predicate.

    Definition Classes
    QuasiTensor
  68. def flatten(view: View = View.Prefer): DenseVector[V]

    Permalink

    Converts this matrix to a DenseVector (column-major) If view = true (or View.Require), throws an exception if we cannot return a view.

    Converts this matrix to a DenseVector (column-major) If view = true (or View.Require), throws an exception if we cannot return a view. otherwise returns a view. If view == false (or View.Copy) returns a copy If view == View.Prefer (the default), returns a view if possible, otherwise returns a copy.

    Views are only possible (if(isTranspose) majorStride == cols else majorStride == rows) == true

    Definition Classes
    DenseMatrixMatrix
  69. def forall(fn: (V) ⇒ Boolean): Boolean

    Permalink

    Returns true if and only if the given predicate is true for all elements.

    Returns true if and only if the given predicate is true for all elements.

    Definition Classes
    TensorLike
  70. def forall(fn: ((Int, Int), V) ⇒ Boolean): Boolean

    Permalink

    Returns true if and only if the given predicate is true for all elements.

    Returns true if and only if the given predicate is true for all elements.

    Definition Classes
    TensorLike
  71. def foreachKey[U](fn: ((Int, Int)) ⇒ U): Unit

    Permalink

    Applies the given function to each key in the tensor.

    Applies the given function to each key in the tensor.

    Definition Classes
    TensorLike
  72. def foreachPair[U](fn: ((Int, Int), V) ⇒ U): Unit

    Permalink

    Applies the given function to each key and its corresponding value.

    Applies the given function to each key and its corresponding value.

    Definition Classes
    TensorLike
  73. def foreachValue[U](fn: (V) ⇒ U): Unit

    Permalink

    Applies the given function to each value in the map (one for each element of the domain, including zeros).

    Applies the given function to each value in the map (one for each element of the domain, including zeros).

    Definition Classes
    TensorLike
  74. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  75. def hashCode(): Int

    Permalink
    Definition Classes
    QuasiTensor → AnyRef → Any
  76. def indexAt(i: Int): Int

    Permalink
  77. def isActive(i: Int): Boolean

    Permalink
  78. def isContiguous: Boolean

    Permalink

    Returns true if this dense matrix takes up a contiguous segment of the array

  79. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  80. val isTranspose: Boolean

    Permalink

    if true, then the matrix is considered to be "transposed" (that is, row major)

  81. def iterator: Iterator[((Int, Int), V)]

    Permalink
    Definition Classes
    MatrixQuasiTensor
  82. def keySet: Set[(Int, Int)]

    Permalink
    Definition Classes
    MatrixQuasiTensor
  83. def keys: TensorKeys[(Int, Int), V, DenseMatrix[V]]

    Permalink
    Definition Classes
    TensorLike
  84. def keysIterator: Iterator[(Int, Int)]

    Permalink
    Definition Classes
    MatrixQuasiTensor
  85. def linearIndex(row: Int, col: Int): Int

    Permalink

    Calculates the index into the data array for row and column

  86. val majorStride: Int

    Permalink

    distance separating columns (or rows, for isTranspose).

    distance separating columns (or rows, for isTranspose). should have absolute value >= rows (or cols, for isTranspose)

  87. def map[V2, That](fn: (V) ⇒ V2)(implicit canMapValues: CanMapValues[DenseMatrix[V], V, V2, That]): That

    Permalink
    Definition Classes
    MatrixLike
  88. def mapActivePairs[TT >: DenseMatrix[V], O, That](f: ((Int, Int), V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, (Int, Int), V, O, That]): That

    Permalink

    Maps all active key-value pairs values.

    Maps all active key-value pairs values.

    Definition Classes
    TensorLike
  89. def mapActiveValues[TT >: DenseMatrix[V], O, That](f: (V) ⇒ O)(implicit bf: CanMapActiveValues[TT, V, O, That]): That

    Permalink

    Maps all non-zero values.

    Maps all non-zero values.

    Definition Classes
    TensorLike
  90. def mapPairs[TT >: DenseMatrix[V], O, That](f: ((Int, Int), V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, (Int, Int), V, O, That]): That

    Permalink

    Creates a new map containing a transformed copy of this map.

    Creates a new map containing a transformed copy of this map.

    Definition Classes
    TensorLike
  91. def mapValues[TT >: DenseMatrix[V], O, That](f: (V) ⇒ O)(implicit bf: CanMapValues[TT, V, O, That]): That

    Permalink

    Creates a new map containing a transformed copy of this map.

    Creates a new map containing a transformed copy of this map.

    Definition Classes
    TensorLike
  92. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  93. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  94. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  95. val offset: Int

    Permalink

    starting point into array

  96. def pairs: TensorPairs[(Int, Int), V, DenseMatrix[V]]

    Permalink
    Definition Classes
    TensorLike
  97. def repr: DenseMatrix[V]

    Permalink
    Definition Classes
    DenseMatrixImmutableNumericOps
  98. def reshape(rows: Int, cols: Int, view: View = View.Prefer): DenseMatrix[V]

    Permalink

    Reshapes this matrix to have the given number of rows and columns If view = true (or View.Require), throws an exception if we cannot return a view.

    Reshapes this matrix to have the given number of rows and columns If view = true (or View.Require), throws an exception if we cannot return a view. otherwise returns a view. If view == false (or View.Copy) returns a copy If view == View.Prefer (the default), returns a view if possible, otherwise returns a copy.

    Views are only possible (if(isTranspose) majorStride == cols else majorStride == rows) == true

    rows * cols must equal size, or cols < 0 && (size / rows * rows == size)

    rows

    the number of rows

    cols

    the number of columns, or -1 to auto determine based on size and rows

  99. def rowColumnFromLinearIndex(index: Int): (Int, Int)

    Permalink
  100. val rows: Int

    Permalink

    number of rows

    number of rows

    Definition Classes
    DenseMatrixMatrix
  101. def size: Int

    Permalink
    Definition Classes
    MatrixTensorLike
  102. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  103. final def t[TT >: DenseMatrix[V], That, Slice1, Result](a: Slice1)(implicit op: CanTranspose[TT, That], canSlice: CanSlice[That, Slice1, Result]): Result

    Permalink

    A transposed view of this object, followed by a slice.

    A transposed view of this object, followed by a slice. Sadly frequently necessary.

    Definition Classes
    ImmutableNumericOps
  104. final def t[TT >: DenseMatrix[V], That, Slice1, Slice2, Result](a: Slice1, b: Slice2)(implicit op: CanTranspose[TT, That], canSlice: CanSlice2[That, Slice1, Slice2, Result]): Result

    Permalink

    A transposed view of this object, followed by a slice.

    A transposed view of this object, followed by a slice. Sadly frequently necessary.

    Definition Classes
    ImmutableNumericOps
  105. final def t[TT >: DenseMatrix[V], That](implicit op: CanTranspose[TT, That]): That

    Permalink

    A transposed view of this object.

    A transposed view of this object.

    Definition Classes
    ImmutableNumericOps
  106. def toArray: Array[V]

    Permalink

    Converts this matrix to a flat Array (column-major)

  107. def toDenseMatrix(implicit cm: ClassTag[V], zero: Zero[V]): DenseMatrix[V]

    Permalink
    Definition Classes
    DenseMatrixMatrix
  108. def toDenseVector: DenseVector[V]

    Permalink

    Converts this matrix to a DenseVector (column-major)

  109. def toString(): String

    Permalink
    Definition Classes
    Matrix → AnyRef → Any
  110. def toString(maxLines: Int = Terminal.terminalHeight - 3, maxWidth: Int = Terminal.terminalWidth): String

    Permalink
    Definition Classes
    Matrix
  111. final def unary_![TT >: DenseMatrix[V], That](implicit op: operators.OpNot.Impl[TT, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
  112. final def unary_-[TT >: DenseMatrix[V], That](implicit op: operators.OpNeg.Impl[TT, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
  113. def update(row: Int, col: Int, v: V): Unit

    Permalink
    Definition Classes
    DenseMatrixMatrix
  114. final def update(i: (Int, Int), e: V): Unit

    Permalink
    Definition Classes
    MatrixTensorLikeQuasiTensor
  115. def valueAt(row: Int, col: Int): V

    Permalink
  116. def valueAt(i: Int): V

    Permalink
  117. def values: TensorValues[(Int, Int), V, DenseMatrix[V]]

    Permalink
    Definition Classes
    TensorLike
  118. def valuesIterator: Iterator[V]

    Permalink
    Definition Classes
    MatrixQuasiTensor
  119. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  120. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  121. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  122. final def |[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That

    Permalink

    Alias for :||(b) for all b.

    Alias for :||(b) for all b.

    Definition Classes
    ImmutableNumericOps
  123. final def |:|[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That

    Permalink

    Element-wise logical "or" operator -- returns true if either element is non-zero.

    Element-wise logical "or" operator -- returns true if either element is non-zero.

    Definition Classes
    ImmutableNumericOps
  124. final def |=[TT >: DenseMatrix[V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): DenseMatrix[V]

    Permalink

    Mutates this by element-wise or of this and b.

    Mutates this by element-wise or of this and b.

    Definition Classes
    NumericOps

Deprecated Value Members

  1. final def :%[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use %:% instead.

  2. final def :&[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use &:& instead.

  3. final def :*[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpMulScalar.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use *:* instead.

  4. final def :+[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use +:+ instead.

  5. final def :-[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use -:- instead.

  6. final def :/[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use /:/ instead.

  7. final def :<[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpLT.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    NumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use <:< instead.

  8. final def :<=[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpLTE.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    NumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use <:= instead.

  9. final def :>[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpGT.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    NumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use >:> instead.

  10. final def :>=[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpGTE.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    NumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use >:= instead.

  11. final def :^[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpPow.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use : instead.

  12. final def :^^[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use : instead.

  13. final def :|[TT >: DenseMatrix[V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That

    Permalink
    Definition Classes
    ImmutableNumericOps
    Annotations
    @deprecated
    Deprecated

    (Since version 0.13) This operator has confusing and often surprising precedence that leads to bugs. Use |:| instead.

  14. def all(implicit semi: Semiring[V]): Boolean

    Permalink

    Returns true if all elements are non-zero

    Returns true if all elements are non-zero

    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use breeze.linalg.all instead

  15. def any(implicit semi: Semiring[V]): Boolean

    Permalink

    Returns true if some element is non-zero

    Returns true if some element is non-zero

    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use breeze.linalg.any instead

  16. def argmax(implicit ord: Ordering[V]): (Int, Int)

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use argmax(t) instead of t.argmax

  17. def argmin(implicit ord: Ordering[V]): (Int, Int)

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use argmin(t) instead of t.argmin

  18. def argsort(implicit ord: Ordering[V]): IndexedSeq[(Int, Int)]

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use argsort(t) instead of t.argsort

  19. def argtopk(k: Int)(implicit ordering: Ordering[V]): IndexedSeq[(Int, Int)]

    Permalink

    Returns the k indices with maximum value.

    Returns the k indices with maximum value. (NOT absolute value.)

    k

    how many to return

    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use argtopk(t, k) instead of t.argtopk(k)

  20. def forallValues(fn: (V) ⇒ Boolean): Boolean

    Permalink

    Returns true if and only if the given predicate is true for all elements.

    Returns true if and only if the given predicate is true for all elements.

    Definition Classes
    TensorLike
    Annotations
    @deprecated
    Deprecated

    (Since version 0.8) Please use 'forall' with the same arguments, which is more in accordance with scala.collections syntax

  21. def max(implicit ord: Ordering[V]): V

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use max(t) instead of t.max

  22. def min(implicit ord: Ordering[V]): V

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use min(t) instead of t.min

  23. def sum(implicit num: Numeric[V]): V

    Permalink
    Definition Classes
    QuasiTensor
    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) Use sum(t) instead of t.sum

  24. def trace(implicit numeric: Numeric[V]): V

    Permalink

    Computes the sum along the diagonal.

    Computes the sum along the diagonal.

    Annotations
    @deprecated
    Deprecated

    (Since version 0.6) use trace(dm) instead

  25. def unsafeUpdate(row: Int, col: Int, v: V): Unit

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 0.12-SNAPSHOT) This isn't actually any faster according to benchmarks

  26. def unsafeValueAt(row: Int, col: Int): V

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 0.12-SNAPSHOT) This isn't actually any faster according to benchmarks

Inherited from Serializable

Inherited from Serializable

Inherited from Matrix[V]

Inherited from MatrixLike[V, DenseMatrix[V]]

Inherited from Tensor[(Int, Int), V]

Inherited from TensorLike[(Int, Int), V, DenseMatrix[V]]

Inherited from NumericOps[DenseMatrix[V]]

Inherited from ImmutableNumericOps[DenseMatrix[V]]

Inherited from QuasiTensor[(Int, Int), V]

Inherited from AnyRef

Inherited from Any

Ungrouped