trait
NumericOps[+This] extends AnyRef
Abstract Value Members
-
abstract
def
repr: This
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
%[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpMod, That]): That
-
final
def
%=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpMod]): This
-
final
def
&&[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpAnd, That]): That
-
final
def
*[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpMulMatrix, That]): That
-
final
def
*=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpMulScalar]): This
-
final
def
+[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpAdd, That]): That
-
final
def
+=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpAdd]): This
-
-
final
def
-[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpSub, That]): That
-
final
def
-=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpSub]): This
-
final
def
/[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpDiv, That]): That
-
final
def
/=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpDiv]): This
-
final
def
:!=[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpNe, That]): That
-
final
def
:%[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpMod, That]): That
-
final
def
:%=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpMod]): This
-
final
def
:&&[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpAnd, That]): That
-
final
def
:*[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpMulScalar, That]): That
-
final
def
:*=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpMulScalar]): This
-
final
def
:+[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpAdd, That]): That
-
final
def
:+=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpAdd]): This
-
final
def
:-[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpSub, That]): That
-
final
def
:-=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpSub]): This
-
final
def
:/[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpDiv, That]): That
-
final
def
:/=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpDiv]): This
-
final
def
:<[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpLT, That]): That
-
final
def
:<=[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpLTE, That]): That
-
final
def
:=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpSet]): This
-
final
def
:==[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpEq, That]): That
-
final
def
:>[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpGT, That]): That
-
final
def
:>=[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpGTE, That]): That
-
final
def
:^[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpPow, That]): That
-
final
def
:^=[TT >: This, B](b: B)(implicit op: BinaryUpdateOp[TT, B, OpPow]): This
-
final
def
:^^[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpXor, That]): That
-
final
def
:||[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpOr, That]): That
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
\[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpSolveMatrixBy, That]): That
-
final
def
^^[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpXor, That]): That
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
dot[TT >: This, B, BB >: B, That](b: B)(implicit op: BinaryOp[TT, BB, OpMulInner, That]): That
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
t[TT >: This, That, Slice1, Slice2, Result](a: Slice1, b: Slice2)(implicit op: CanTranspose[TT, That], canSlice: CanSlice2[That, Slice1, Slice2, Result]): Result
-
final
def
t[TT >: This, That](implicit op: CanTranspose[TT, That]): That
-
def
toString(): String
-
final
def
unary_![TT >: This, That](implicit op: UnaryOp[TT, OpNot, That]): That
-
final
def
unary_-[TT >: This, That](implicit op: UnaryOp[TT, OpNeg, That]): That
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
||[TT >: This, B, That](b: B)(implicit op: BinaryOp[TT, B, OpOr, That]): That
Inherited from AnyRef
Inherited from Any
In some sense, this is the real root of the linalg hierarchy. It provides methods for doing operations on a Tensor-like thing. All methods farm out to some implicit or another. We use this when we don't care about the index into the Tensor, or if we don't really have an index.