object Counter2 extends LowPriorityCounter2 with Counter2Ops
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Counter2
- Counter2Ops
- LowPriorityCounter2
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- trait Curried[M[_, _], K] extends AnyRef
This is just a curried version of scala.collection.Map.
This is just a curried version of scala.collection.Map. Used to get around Scala's lack of partially applied types.
- class Impl[K1, K2, V] extends Counter2[K1, K2, V] with Serializable
- Annotations
- @SerialVersionUID()
- class CanZipMapValuesCounter2[K1, K2, V, RV] extends CanZipMapValues[Counter2[K1, K2, V], V, RV, Counter2[K1, K2, RV]]
- Definition Classes
- Counter2Ops
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 CanMapValuesCounter[K1, K2, V, RV](implicit arg0: Semiring[RV], arg1: Zero[RV]): CanMapValues[Counter2[K1, K2, V], V, RV, Counter2[K1, K2, RV]]
- implicit def addIntoVS[K1, K2, V](implicit arg0: Semiring[V]): operators.OpAdd.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def addIntoVV[K1, K2, V](implicit arg0: Semiring[V]): operators.OpAdd.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- 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
- 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
- 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.
- 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.
- def apply[K1, K2, V]()(implicit arg0: Zero[V]): Counter2[K1, K2, V]
Returns a new empty counter.
- 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]]
- Definition Classes
- Counter2Ops
- 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
- 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
- implicit def canCopy[K1, K2, V](implicit arg0: Zero[V], arg1: Semiring[V]): CanCopy[Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- implicit def canDivIntoVS[K1, K2, V](implicit arg0: Field[V]): operators.OpDiv.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def canDivIntoVV[K1, K2, V](implicit arg0: Field[V]): operators.OpDiv.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- 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
- 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
- implicit def canIterateValues[K1, K2, V]: CanTraverseValues[Counter2[K1, K2, V], V]
- 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]
- 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]
- implicit def canMulIntoVS[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def canMulIntoVS_M[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulMatrix.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def canMulIntoVV[K1, K2, V](implicit arg0: Semiring[V]): operators.OpMulScalar.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- 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
- 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
- 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
- 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
- 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
- implicit def canNegate[K1, K2, V](implicit ring: Ring[V]): operators.OpNeg.Impl[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- implicit def canSetIntoVS[K1, K2, V]: operators.OpSet.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def canSetIntoVV[K1, K2, V]: operators.OpSet.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- implicit def canSliceCol[K1, K2, V]: CanSlice2[Counter2[K1, K2, V], ::.type, K2, Counter[K1, V]]
- implicit def canSliceRow[K1, K2, V]: CanSlice2[Counter2[K1, K2, V], K1, ::.type, Counter[K2, V]]
- implicit def canTraverseKeyValuePairs[K1, K2, V]: CanTraverseKeyValuePairs[Counter2[K1, K2, V], (K1, K2), V]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def count[K1, K2](values: TraversableOnce[(K1, K2)]): Counter2[K1, K2, Int]
Counts the given elements.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- implicit def handholdCanMapCols[K1, K2, V]: HandHold[Counter2[K1, K2, V], _1.type, Counter[K2, V]]
- implicit def handholdCanMapRows[K1, K2, V]: HandHold[Counter2[K1, K2, V], _0.type, Counter[K1, V]]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- 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() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- implicit def scalarOf[K1, K2, V]: ScalarOf[Counter2[K1, K2, V], V]
- implicit def subIntoVS[K1, K2, V](implicit arg0: Ring[V]): operators.OpSub.InPlaceImpl2[Counter2[K1, K2, V], V]
- Definition Classes
- Counter2Ops
- implicit def subIntoVV[K1, K2, V](implicit arg0: Ring[V]): operators.OpSub.InPlaceImpl2[Counter2[K1, K2, V], Counter2[K1, K2, V]]
- Definition Classes
- Counter2Ops
- 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
- 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
- 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(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- implicit def zipMap[K1, K2, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanZipMapValuesCounter2[K1, K2, V, R]
- Definition Classes
- Counter2Ops