Counter2

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. implicit def CanMapActiveValuesCounter[K1, K2, V, RV](implicit arg0: Semiring[RV], arg1: Zero[RV]): CanMapActiveValues[Counter2[K1, K2, V], V, RV, Counter2[K1, K2, RV]]

   

5. implicit def CanMapValuesCounter[K1, K2, V, RV](implicit arg0: Semiring[RV], arg1: Zero[RV]): CanMapValues[Counter2[K1, K2, V], V, RV, Counter2[K1, K2, RV]]

   

6. implicit def addIntoVS[K1, K2, V](implicit arg0: Semiring[V]): operators.OpAdd.InPlaceImpl2[Counter2[K1, K2, V], V]

   

   Definition Classes

   Counter2Ops

7. implicit def addIntoVV[K1, K2, V](implicit arg0: Semiring[V]): operators.OpAdd.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]

   

   Definition Classes

   Counter2Ops

8. implicit def addVS[K1, K2, V](implicit arg0: Semiring[V], arg1: Zero[V]): operators.OpAdd.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

   

   Definition Classes

   Counter2Ops

9. implicit def addVV[K1, K2, V](implicit arg0: Semiring[V], arg1: Zero[V]): operators.OpAdd.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]

   

   Definition Classes

   Counter2Ops

10. def apply[K1, K2, V](values: TraversableOnce[(K1, K2, V)])(implicit arg0: Semiring[V], arg1: Zero[V]): Counter2[K1, K2, V]

    

    Aggregates the counts in the given items.

11. def apply[K1, K2, V](values: (K1, K2, V)*)(implicit arg0: Semiring[V], arg1: Zero[V]): Counter2[K1, K2, V]

    

    Aggregates the counts in the given items.

12. def apply[K1, K2, V]()(implicit arg0: Zero[V]): Counter2[K1, K2, V]

    

    Returns a new empty counter.

13. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

14. implicit def canAxpy[K1, K2, V](implicit arg0: Semiring[V]): scaleAdd.InPlaceImpl3[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

15. implicit def canCollapseCols[K1, K2, V, R](implicit arg0: ClassTag[R], arg1: Zero[R], arg2: Semiring[R]): CanCollapseAxis[Counter2[K1, K2, V], _1.type, Counter[K2, V], R, Counter[K1, R]]

    

    Returns a Counter[K1, V]

    Returns a Counter[K1, V]

    Definition Classes

    LowPriorityCounter2

16. implicit def canCollapseRows[K1, K2, V, R](implicit arg0: ClassTag[R], arg1: Zero[R], arg2: Semiring[R]): CanCollapseAxis[Counter2[K1, K2, V], _0.type, Counter[K1, V], R, Counter[K2, R]]

    

    Returns a Counter[K2, V]

    Returns a Counter[K2, V]

    Definition Classes

    LowPriorityCounter2

17. implicit def canCopy[K1, K2, V](implicit arg0: Zero[V], arg1: Semiring[V]): CanCopy[Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

18. implicit def canDivIntoVS[K1, K2, V](implicit arg0: Field[V]): operators.OpDiv.InPlaceImpl2[Counter2[K1, K2, V], V]

    

    Definition Classes

    Counter2Ops

19. implicit def canDivIntoVV[K1, K2, V](implicit arg0: Field[V]): operators.OpDiv.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

20. implicit def canDivVS[K1, K2, V](implicit copy: CanCopy[Counter2[K1, K2, V]], semiring: Field[V]): operators.OpDiv.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

21. implicit def canDivVV[K1, K2, V](implicit copy: CanCopy[Counter2[K1, K2, V]], semiring: Field[V]): operators.OpDiv.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

22. implicit def canIterateValues[K1, K2, V]: CanTraverseValues[Counter2[K1, K2, V], V]

    

23. implicit def canMapCols[K1, K2, V, R](implicit arg0: ClassTag[R], arg1: Zero[R], arg2: Semiring[R]): CanCollapseAxis[Counter2[K1, K2, V], _1.type, Counter[K2, V], Counter[K2, R], Counter2[K1, K2, R]]

    

    Returns a Counter[K1, V]

24. implicit def canMapRows[K1, K2, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanCollapseAxis[Counter2[K1, K2, V], _0.type, Counter[K1, V], Counter[K1, R], Counter2[K1, K2, R]]

    

    Returns a Counter[K2, V]

25. implicit def canMulIntoVS[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], V]

    

    Definition Classes

    Counter2Ops

26. implicit def canMulIntoVS_M[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulMatrix.InPlaceImpl2[Counter2[K1, K2, V], V]

    

    Definition Classes

    Counter2Ops

27. implicit def canMulIntoVV[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

28. implicit def canMulVS[K1, K2, V](implicit semiring: Semiring[V]): operators.OpMulScalar.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

29. implicit def canMulVS_M[K1, K2, V](implicit semiring: Semiring[V]): operators.OpMulMatrix.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

30. implicit def canMulVV[K1, K2, V](implicit semiring: Semiring[V]): operators.OpMulScalar.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

31. implicit def canMultiplyC2C1[K1, K2, V](implicit semiring: Semiring[V]): operators.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) } } }

    Definition Classes

    Counter2Ops

32. implicit def canMultiplyC2C2[K1, K2, K3, V](implicit semiring: Semiring[V]): operators.OpMulMatrix.Impl2[Counter2[K1, K2, V], Counter2[K2, K3, V], Counter2[K1, K3, V]]

    

    Definition Classes

    Counter2Ops

33. implicit def canNegate[K1, K2, V](implicit ring: Ring[V]): operators.OpNeg.Impl[Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

34. implicit def canSetIntoVS[K1, K2, V]: operators.OpSet.InPlaceImpl2[Counter2[K1, K2, V], V]

    

    Definition Classes

    Counter2Ops

35. implicit def canSetIntoVV[K1, K2, V]: operators.OpSet.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

36. implicit def canSliceCol[K1, K2, V]: CanSlice2[Counter2[K1, K2, V], ::.type, K2, Counter[K1, V]]

    

37. implicit def canSliceRow[K1, K2, V]: CanSlice2[Counter2[K1, K2, V], K1, ::.type, Counter[K2, V]]

    

38. implicit def canTraverseKeyValuePairs[K1, K2, V]: CanTraverseKeyValuePairs[Counter2[K1, K2, V], (K1, K2), V]

    

39. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40. def count[K1, K2](values: TraversableOnce[(K1, K2)]): Counter2[K1, K2, Int]

    

    Counts the given elements.

41. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

42. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

43. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

44. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

45. implicit def handholdCanMapCols[K1, K2, V]: HandHold[Counter2[K1, K2, V], _1.type, Counter[K2, V]]

    

46. implicit def handholdCanMapRows[K1, K2, V]: HandHold[Counter2[K1, K2, V], _0.type, Counter[K1, V]]

    

47. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

48. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

49. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

50. final def notify(): Unit

    

    Definition Classes

    AnyRef

51. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

52. implicit def scalarOf[K1, K2, V]: ScalarOf[Counter2[K1, K2, V], V]

    

53. implicit def subIntoVS[K1, K2, V](implicit arg0: Ring[V]): operators.OpSub.InPlaceImpl2[Counter2[K1, K2, V], V]

    

    Definition Classes

    Counter2Ops

54. implicit def subIntoVV[K1, K2, V](implicit arg0: Ring[V]): operators.OpSub.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

55. implicit def subVS[K1, K2, V](implicit arg0: Ring[V], arg1: Zero[V]): operators.OpSub.Impl2[Counter2[K1, K2, V], V, Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

56. implicit def subVV[K1, K2, V](implicit arg0: Ring[V], arg1: Zero[V]): operators.OpSub.Impl2[Counter2[K1, K2, V], Counter2[K1, K2, V], Counter2[K1, K2, V]]

    

    Definition Classes

    Counter2Ops

57. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

58. def toString(): String

    

    Definition Classes

    AnyRef → Any

59. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

60. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

61. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

62. implicit def zipMap[K1, K2, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanZipMapValuesCounter2[K1, K2, V, R]

    

    Definition Classes

    Counter2Ops