trait Counter2Ops extends AnyRef
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- Counter2Ops
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- class CanZipMapValuesCounter2[K1, K2, V, RV] extends CanZipMapValues[Counter2[K1, K2, V], V, RV, Counter2[K1, K2, RV]]
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- implicit def addIntoVS[K1, K2, V](implicit arg0: Semiring[V]): OpAdd.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def addIntoVV[K1, K2, V](implicit arg0: Semiring[V]): OpAdd.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def addVS[K1, K2, V](implicit arg0: Semiring[V], arg1: Zero[V]): OpAdd.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def addVV[K1, K2, V](implicit arg0: Semiring[V], arg1: Zero[V]): OpAdd.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- implicit def canAxpy[K1, K2, V](implicit arg0: Semiring[V]): scaleAdd.InPlaceImpl3[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def canCopy[K1, K2, V](implicit arg0: Zero[V], arg1: Semiring[V]): CanCopy[Counter2[K1, K2, V]]
- implicit def canDivIntoVS[K1, K2, V](implicit arg0: Field[V]): OpDiv.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def canDivIntoVV[K1, K2, V](implicit arg0: Field[V]): OpDiv.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def canDivVS[K1, K2, V](implicit copy: CanCopy[Counter2[K1, K2, V]], semiring: Field[V]): OpDiv.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def canDivVV[K1, K2, V](implicit copy: CanCopy[Counter2[K1, K2, V]], semiring: Field[V]): OpDiv.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def canMulIntoVS[K1, K2, V](implicit arg0: Semiring[V]): OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def canMulIntoVS_M[K1, K2, V](implicit arg0: Semiring[V]): OpMulMatrix.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def canMulIntoVV[K1, K2, V](implicit arg0: Semiring[V]): OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def canMulVS[K1, K2, V](implicit semiring: Semiring[V]): OpMulScalar.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def canMulVS_M[K1, K2, V](implicit semiring: Semiring[V]): OpMulMatrix.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def canMulVV[K1, K2, V](implicit semiring: Semiring[V]): OpMulScalar.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]
-
implicit
def
canMultiplyC2C1[K1, K2, V](implicit semiring: Semiring[V]): OpMulMatrix.Impl2[Counter2[K1, K2, V], Counter[K2, V], Counter[K1, V]]
Returns the k-norm of this Vector.
Returns the k-norm of this Vector. implicit def canNorm[K1, K2, V:Ring]:CanNorm[Counter2[K1, K2, V]] = new CanNorm[Counter2[K1, K2, V]] { val field = implicitly[Ring[V]] def apply(c: Counter2[K1, K2, V], n: Double): Double = { import c._
if (n == 1) { var sum = 0.0 activeValuesIterator foreach (v => sum += field.norm(v)) sum } else if (n == 2) { var sum = 0.0 activeValuesIterator foreach (v => { val nn = field.norm(v); sum += nn * nn }) math.sqrt(sum) } else if (n == Double.PositiveInfinity) { var max = Double.NegativeInfinity activeValuesIterator foreach (v => { val nn = field.norm(v); if (nn > max) max = nn }) max } else { var sum = 0.0 activeValuesIterator foreach (v => { val nn = field.norm(v); sum += math.pow(nn,n) }) math.pow(sum, 1.0 / n) } } }
- implicit def canMultiplyC2C2[K1, K2, K3, V](implicit semiring: Semiring[V]): OpMulMatrix.Impl2[Counter2[K1, K2, V], Counter2[K2, K3, V], Counter2[K1, K3, V]]
- implicit def canNegate[K1, K2, V](implicit ring: Ring[V]): OpNeg.Impl[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def canSetIntoVS[K1, K2, V]: OpSet.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def canSetIntoVV[K1, K2, V]: OpSet.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- implicit def subIntoVS[K1, K2, V](implicit arg0: Ring[V]): OpSub.InPlaceImpl2[Counter2[K1, K2, V], V]
- implicit def subIntoVV[K1, K2, V](implicit arg0: Ring[V]): OpSub.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- implicit def subVS[K1, K2, V](implicit arg0: Ring[V], arg1: Zero[V]): OpSub.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]
- implicit def subVV[K1, K2, V](implicit arg0: Ring[V], arg1: Zero[V]): OpSub.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- implicit def zipMap[K1, K2, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanZipMapValuesCounter2[K1, K2, V, R]