trait
NumericOps[+This] extends Any
Abstract Value Members
-
abstract
def
getClass(): Class[_]
-
abstract
def
repr: This
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
%[TT >: This, B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That
-
final
def
%=[TT >: This, B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): This
-
final
def
&[TT >: This, B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That
-
final
def
&=[TT >: This, B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): This
-
final
def
*[TT >: This, B, That](b: B)(implicit op: operators.OpMulMatrix.Impl2[TT, B, That]): That
-
-
final
def
+[TT >: This, B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That
-
final
def
+=[TT >: This, B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): This
-
final
def
-[TT >: This, B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That
-
final
def
-=[TT >: This, B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): This
-
final
def
/[TT >: This, B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That
-
final
def
/=[TT >: This, B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): This
-
final
def
:!=[TT >: This, B, That](b: B)(implicit op: operators.OpNe.Impl2[TT, B, That]): That
-
final
def
:%[TT >: This, B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That
-
final
def
:%=[TT >: This, B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): This
-
final
def
:&[TT >: This, B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That
-
final
def
:&=[TT >: This, B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): This
-
final
def
:*[TT >: This, B, That](b: B)(implicit op: operators.OpMulScalar.Impl2[TT, B, That]): That
-
-
final
def
:+[TT >: This, B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That
-
final
def
:+=[TT >: This, B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): This
-
final
def
:-[TT >: This, B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That
-
final
def
:-=[TT >: This, B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): This
-
final
def
:/[TT >: This, B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That
-
final
def
:/=[TT >: This, B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): This
-
final
def
:<[TT >: This, B, That](b: B)(implicit op: operators.OpLT.Impl2[TT, B, That]): That
-
final
def
:<=[TT >: This, B, That](b: B)(implicit op: operators.OpLTE.Impl2[TT, B, That]): That
-
final
def
:=[TT >: This, B](b: B)(implicit op: operators.OpSet.InPlaceImpl2[TT, B]): This
-
final
def
:==[TT >: This, B, That](b: B)(implicit op: operators.OpEq.Impl2[TT, B, That]): That
-
final
def
:>[TT >: This, B, That](b: B)(implicit op: operators.OpGT.Impl2[TT, B, That]): That
-
final
def
:>=[TT >: This, B, That](b: B)(implicit op: operators.OpGTE.Impl2[TT, B, That]): That
-
final
def
:^[TT >: This, B, That](b: B)(implicit op: operators.OpPow.Impl2[TT, B, That]): That
-
final
def
:^=[TT >: This, B](b: B)(implicit op: operators.OpPow.InPlaceImpl2[TT, B]): This
-
final
def
:^^[TT >: This, B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That
-
final
def
:^^=[TT >: This, B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): This
-
final
def
:|[TT >: This, B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That
-
final
def
:|=[TT >: This, B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): This
-
final
def
==(arg0: Any): Boolean
-
def
\[TT >: This, B, That](b: B)(implicit op: operators.OpSolveMatrixBy.Impl2[TT, B, That]): That
-
final
def
^^[TT >: This, B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That
-
final
def
^^=[TT >: This, B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): This
-
final
def
asInstanceOf[T0]: T0
-
final
def
dot[TT >: This, B, BB >: B, That](b: B)(implicit op: operators.OpMulInner.Impl2[TT, BB, That]): That
-
def
equals(arg0: Any): Boolean
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
norm[TT >: This, B, R](b: B)(implicit op: norm.Impl2[TT, B, R]): R
-
final
def
norm[TT >: This, R]()(implicit op: norm.Impl[TT, R]): R
-
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: operators.OpNot.Impl[TT, That]): That
-
final
def
unary_-[TT >: This, That](implicit op: operators.OpNeg.Impl[TT, That]): That
-
final
def
|[TT >: This, B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That
-
final
def
|=[TT >: This, B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): This
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.