Instance Constructors
-
new
BroadcastedDMColsISeq(underlying: DenseMatrix[T])
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
def
/:[B](z: B)(op: (B, DenseVector[T]) ⇒ B): B
-
-
def
:\[B](z: B)(op: (DenseVector[T], B) ⇒ B): B
-
-
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, DenseVector[T]) ⇒ B, combop: (B, B) ⇒ B): B
-
-
-
def
applyOrElse[A1 <: Int, B1 >: DenseVector[T]](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ DenseVector[T]
-
def
contains(elem: Any): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: DenseVector[T]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, DenseVector[T]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (DenseVector[T], B) ⇒ B): B
-
-
-
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
def
indexOf[B >: DenseVector[T]](elem: B, from: Int): Int
-
def
indexOf[B >: DenseVector[T]](elem: B): Int
-
def
indexOfSlice[B >: DenseVector[T]](that: GenSeq[B], from: Int): Int
-
-
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
def
lastIndexOf[B >: DenseVector[T]](elem: B, end: Int): Int
-
def
lastIndexOf[B >: DenseVector[T]](elem: B): Int
-
def
lastIndexOfSlice[B >: DenseVector[T]](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: DenseVector[T]](that: GenSeq[B]): Int
-
-
-
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
-
def
max[B >: DenseVector[T]](implicit cmp: Ordering[B]): DenseVector[T]
-
def
maxBy[B](f: (DenseVector[T]) ⇒ B)(implicit cmp: Ordering[B]): DenseVector[T]
-
def
min[B >: DenseVector[T]](implicit cmp: Ordering[B]): DenseVector[T]
-
def
minBy[B](f: (DenseVector[T]) ⇒ B)(implicit cmp: Ordering[B]): DenseVector[T]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
-
-
-
-
-
def
product[B >: DenseVector[T]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: DenseVector[T]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: DenseVector[T]](op: (B, DenseVector[T]) ⇒ B): B
-
-
def
reduceOption[A1 >: DenseVector[T]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: DenseVector[T]](op: (DenseVector[T], B) ⇒ B): B
-
-
-
-
-
-
def
reversed: List[DenseVector[T]]
-
-
-
-
-
-
-
-
def
size: Int
-
-
-
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: DenseVector[T]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[DenseVector[T], (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
def
toVector: scala.Vector[DenseVector[T]]
-
-
-
-
def
unzip[A1, A2](implicit asPair: (DenseVector[T]) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
-
-
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
-
Deprecated Value Members
-
def
/:\[A1 >: DenseVector[T]](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Serializable