Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
-
-
-
def
apply[K, V](values: TraversableOnce[(K, V)])(implicit arg0: Zero[V], arg1: Semiring[V]): Counter[K, V]
-
def
apply[K, V](values: (K, V)*)(implicit arg0: Zero[V], arg1: Semiring[V]): Counter[K, V]
-
def
apply[K, V]()(implicit arg0: Zero[V]): Counter[K, V]
-
final
def
asInstanceOf[T0]: T0
-
def
binaryOpFromBinaryUpdateOp[K, V, Other, Op <: OpType](implicit copy: CanCopy[Counter[K, V]], op: InPlaceImpl2[Op, Counter[K, V], Other]): UImpl2[Op, Counter[K, V], Other, Counter[K, V]]
-
-
implicit
def
canCopy[K1, V](implicit arg0: Zero[V], arg1: Semiring[V]): CanCopy[Counter[K1, V]]
-
implicit
def
canCreateZeros[K, V](implicit arg0: Zero[V], arg1: Semiring[V]): CanCreateZeros[Counter[K, V], K]
-
-
-
-
-
-
-
implicit
def
canMapActiveValues[K, V, RV](implicit arg0: Zero[RV]): CanMapActiveValues[Counter[K, V], V, RV, Counter[K, RV]]
-
implicit
def
canMapValues[K, V, RV](implicit arg0: Zero[RV]): CanMapValues[Counter[K, V], V, RV, Counter[K, RV]]
-
-
-
-
-
-
-
-
-
-
-
-
-
-
def
clone(): AnyRef
-
def
count[K](items: K*): Counter[K, Int]
-
def
countTraversable[K](items: TraversableOnce[K]): Counter[K, Int]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
scalarOf[K, V]: ScalarOf[Counter[K, V], V]
-
-
-
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
implicit
def
zipMap[K, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanZipMapValuesCounter[K, V, R]
-
implicit
def
zipMapKeyValues[K, V, R](implicit arg0: Zero[R], arg1: Semiring[R]): CanZipMapKeyValuesCounter[K, V, R]