# Counter

#### trait Counter[K, V] extends Tensor[K, V] with CounterLike[K, V, Map[K, V], Counter[K, V]]

Linear Supertypes
CounterLike[K, V, Map[K, V], Counter[K, V]], Serializable, Serializable, Tensor[K, V], TensorLike[K, V, Counter[K, V]], NumericOps[Counter[K, V]], QuasiTensor[K, V], AnyRef, Any
Known Subclasses
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. Counter
2. CounterLike
3. Serializable
4. Serializable
5. Tensor
6. TensorLike
7. NumericOps
8. QuasiTensor
9. AnyRef
10. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Abstract Value Members

1. #### abstract def data: Map[K, V]

Definition Classes
CounterLike
2. #### abstract def default: V

Definition Classes
CounterLike

### Concrete Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Definition Classes
Any
3. #### final def ##(): Int

Definition Classes
AnyRef → Any
4. #### final def %[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That

Alias for :%(b) when b is a scalar.

Alias for :%(b) when b is a scalar.

Definition Classes
NumericOps
5. #### final def %=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): Counter[K, V]

Alias for :%=(b) when b is a scalar.

Alias for :%=(b) when b is a scalar.

Definition Classes
NumericOps
6. #### final def &[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That

Alias for :&&(b) for all b.

Alias for :&&(b) for all b.

Definition Classes
NumericOps
7. #### final def &=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise and of this and b.

Mutates this by element-wise and of this and b.

Definition Classes
NumericOps
8. #### final def *[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpMulMatrix.Impl2[TT, B, That]): That

Matrix multiplication

Matrix multiplication

Definition Classes
NumericOps
9. #### final def *=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): Counter[K, V]

Alias for :*=(b) when b is a scalar.

Alias for :*=(b) when b is a scalar.

Definition Classes
NumericOps
10. #### final def +[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That

Alias for :+(b) for all b.

Alias for :+(b) for all b.

Definition Classes
NumericOps
11. #### final def +=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): Counter[K, V]

Alias for :+=(b) for all b.

Alias for :+=(b) for all b.

Definition Classes
NumericOps
12. #### final def -[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That

Alias for :-(b) for all b.

Alias for :-(b) for all b.

Definition Classes
NumericOps
13. #### final def -=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): Counter[K, V]

Alias for :-=(b) for all b.

Alias for :-=(b) for all b.

Definition Classes
NumericOps
14. #### final def /[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That

Alias for :/(b) when b is a scalar.

Alias for :/(b) when b is a scalar.

Definition Classes
NumericOps
15. #### final def /=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): Counter[K, V]

Alias for :/=(b) when b is a scalar.

Alias for :/=(b) when b is a scalar.

Definition Classes
NumericOps
16. #### final def :!=[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpNe.Impl2[TT, B, That]): That

Element-wise inequality comparator of this and b.

Element-wise inequality comparator of this and b.

Definition Classes
NumericOps
17. #### final def :%[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That

Element-wise modulo of this and b.

Element-wise modulo of this and b.

Definition Classes
NumericOps
18. #### final def :%=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise modulo of b into this.

Mutates this by element-wise modulo of b into this.

Definition Classes
NumericOps
19. #### final def :&[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That

Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.

Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.

Definition Classes
NumericOps
20. #### final def :&=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise and of this and b.

Mutates this by element-wise and of this and b.

Definition Classes
NumericOps
21. #### final def :*[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpMulScalar.Impl2[TT, B, That]): That

Element-wise product of this and b.

Element-wise product of this and b.

Definition Classes
NumericOps
22. #### final def :*=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise multiplication of b into this.

Mutates this by element-wise multiplication of b into this.

Definition Classes
NumericOps
23. #### final def :+[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That

Element-wise sum of this and b.

Element-wise sum of this and b.

Definition Classes
NumericOps
24. #### final def :+=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise addition of b into this.

Mutates this by element-wise addition of b into this.

Definition Classes
NumericOps
25. #### final def :-[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That

Element-wise difference of this and b.

Element-wise difference of this and b.

Definition Classes
NumericOps
26. #### final def :-=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise subtraction of b from this

Mutates this by element-wise subtraction of b from this

Definition Classes
NumericOps
27. #### final def :/[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That

Element-wise quotient of this and b.

Element-wise quotient of this and b.

Definition Classes
NumericOps
28. #### final def :/=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise division of b into this

Mutates this by element-wise division of b into this

Definition Classes
NumericOps
29. #### final def :<[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpLT.Impl2[TT, B, That]): That

Element-wise less=than comparator of this and b.

Element-wise less=than comparator of this and b.

Definition Classes
NumericOps
30. #### final def :<=[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpLTE.Impl2[TT, B, That]): That

Element-wise less-than-or-equal-to comparator of this and b.

Element-wise less-than-or-equal-to comparator of this and b.

Definition Classes
NumericOps
31. #### final def :=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpSet.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise assignment of b into this.

Mutates this by element-wise assignment of b into this.

Definition Classes
NumericOps
32. #### final def :==[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpEq.Impl2[TT, B, That]): That

Element-wise equality comparator of this and b.

Element-wise equality comparator of this and b.

Definition Classes
NumericOps
33. #### final def :>[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpGT.Impl2[TT, B, That]): That

Element-wise greater-than comparator of this and b.

Element-wise greater-than comparator of this and b.

Definition Classes
NumericOps
34. #### final def :>=[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpGTE.Impl2[TT, B, That]): That

Element-wise greater-than-or-equal-to comparator of this and b.

Element-wise greater-than-or-equal-to comparator of this and b.

Definition Classes
NumericOps
35. #### final def :^[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpPow.Impl2[TT, B, That]): That

Element-wise exponentiation of this and b.

Element-wise exponentiation of this and b.

Definition Classes
NumericOps
36. #### final def :^=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpPow.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise exponentiation of this by b.

Mutates this by element-wise exponentiation of this by b.

Definition Classes
NumericOps
37. #### final def :^^[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That

Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.

Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.

Definition Classes
NumericOps
38. #### final def :^^=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise xor of this and b.

Mutates this by element-wise xor of this and b.

Definition Classes
NumericOps
39. #### final def :|[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That

Element-wise logical "or" operator -- returns true if either element is non-zero.

Element-wise logical "or" operator -- returns true if either element is non-zero.

Definition Classes
NumericOps
40. #### final def :|=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise or of this and b.

Mutates this by element-wise or of this and b.

Definition Classes
NumericOps
41. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
42. #### final def ==(arg0: Any): Boolean

Definition Classes
Any
43. #### def \[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpSolveMatrixBy.Impl2[TT, B, That]): That

Shaped solve of this by b.

Shaped solve of this by b.

Definition Classes
NumericOps
44. #### final def ^^[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That

Alias for :^^(b) for all b.

Alias for :^^(b) for all b.

Definition Classes
NumericOps
45. #### final def ^^=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise xor of this and b.

Mutates this by element-wise xor of this and b.

Definition Classes
NumericOps
46. #### def active: TensorActive[K, V, Counter[K, V]]

Definition Classes
TensorLike
47. #### def activeIterator: Iterator[(K, V)]

Definition Classes
CounterLikeQuasiTensor
48. #### def activeKeysIterator: Iterator[K]

Definition Classes
CounterLikeQuasiTensor
49. #### def activeSize: Int

Definition Classes
CounterLikeTensorLike
50. #### def activeValuesIterator: Iterator[V]

Definition Classes
CounterLikeQuasiTensor
51. #### def apply(k: K): V

Definition Classes
CounterLikeTensorLikeQuasiTensor
52. #### def apply[Slice1, Slice2, Result](slice1: Slice1, slice2: Slice2)(implicit canSlice: CanSlice2[Counter[K, V], Slice1, Slice2, Result]): Result

Method for slicing that is tuned for Matrices.

Method for slicing that is tuned for Matrices.

returns

Definition Classes
TensorLike
53. #### def apply[Result](a: K, slice: K*)(implicit canSlice: CanSlice[Counter[K, V], Seq[K], Result]): Result

Slice a sequence of elements.

Slice a sequence of elements. Must be at least 2.

Result
a
slice
canSlice
returns

Definition Classes
TensorLike
54. #### def apply[Slice, Result](slice: Slice)(implicit canSlice: CanSlice[Counter[K, V], Slice, Result]): Result

method for slicing a tensor.

method for slicing a tensor. For instance, DenseVectors support efficient slicing by a Range object.

returns

Definition Classes
TensorLike
55. #### def argmax(implicit ord: Ordering[V]): K

Definition Classes
QuasiTensor
56. #### def argmin(implicit ord: Ordering[V]): K

Definition Classes
QuasiTensor
57. #### def argsort(implicit ord: Ordering[V]): IndexedSeq[K]

Definition Classes
QuasiTensor
58. #### def argtopk(k: Int)(implicit ordering: Ordering[V]): IndexedSeq[K]

Returns the k indices with maximum value.

Returns the k indices with maximum value. (NOT absolute value.)

k

how many to return

ordering
returns

Definition Classes
QuasiTensor
59. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
60. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
61. #### def contains(k: K): Boolean

Definition Classes
CounterLike
62. #### final def dot[TT >: Counter[K, V], B, BB >: B, That](b: B)(implicit op: operators.OpMulInner.Impl2[TT, BB, That]): That

Inner product of this and b.

Inner product of this and b.

Definition Classes
NumericOps
63. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
64. #### def equals(p1: Any): Boolean

Definition Classes
CounterLike → AnyRef → Any
65. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
66. #### def findAll(f: (V) ⇒ Boolean): IndexedSeq[K]

Returns all indices k whose value satisfies a predicate.

Returns all indices k whose value satisfies a predicate.

Definition Classes
QuasiTensor
67. #### def forall(fn: (K, V) ⇒ Boolean): Boolean

Returns true if and only if the given predicate is true for all elements.

Returns true if and only if the given predicate is true for all elements.

Definition Classes
TensorLike
68. #### def forallValues(fn: (V) ⇒ Boolean): Boolean

Returns true if and only if the given predicate is true for all elements.

Returns true if and only if the given predicate is true for all elements.

Definition Classes
TensorLike
69. #### def foreachKey[U](fn: (K) ⇒ U): Unit

Applies the given function to each key in the tensor.

Applies the given function to each key in the tensor.

Definition Classes
TensorLike
70. #### def foreachPair[U](fn: (K, V) ⇒ U): Unit

Applies the given function to each key and its corresponding value.

Applies the given function to each key and its corresponding value.

Definition Classes
TensorLike
71. #### def foreachValue[U](fn: (V) ⇒ U): Unit

Applies the given function to each value in the map (one for each element of the domain, including zeros).

Applies the given function to each value in the map (one for each element of the domain, including zeros).

Definition Classes
TensorLike
72. #### def get(k: K): Option[V]

Definition Classes
CounterLike
73. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
74. #### def hashCode(): Int

Definition Classes
CounterLike → AnyRef → Any
75. #### def isEmpty: Boolean

Definition Classes
CounterLike
76. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
77. #### def iterator: Iterator[(K, V)]

Definition Classes
CounterLikeQuasiTensor
78. #### def keySet: Set[K]

Definition Classes
CounterLikeQuasiTensor
79. #### def keys: TensorKeys[K, V, Counter[K, V]]

Definition Classes
TensorLike
80. #### def keysIterator: Iterator[K]

Definition Classes
CounterLikeQuasiTensor
81. #### def mapActivePairs[TT >: Counter[K, V], O, That](f: (K, V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, K, V, O, That]): That

Maps all active key-value pairs values.

Maps all active key-value pairs values.

Definition Classes
TensorLike
82. #### def mapActiveValues[TT >: Counter[K, V], O, That](f: (V) ⇒ O)(implicit bf: CanMapValues[TT, V, O, That]): That

Maps all non-zero values.

Maps all non-zero values.

Definition Classes
TensorLike
83. #### def mapPairs[TT >: Counter[K, V], O, That](f: (K, V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, K, V, O, That]): That

Creates a new map containing a transformed copy of this map.

Creates a new map containing a transformed copy of this map.

Definition Classes
TensorLike
84. #### def mapValues[TT >: Counter[K, V], O, That](f: (V) ⇒ O)(implicit bf: CanMapValues[TT, V, O, That]): That

Creates a new map containing a transformed copy of this map.

Creates a new map containing a transformed copy of this map.

Definition Classes
TensorLike
85. #### def max(implicit ord: Ordering[V]): V

Definition Classes
QuasiTensor
86. #### def min(implicit ord: Ordering[V]): V

Definition Classes
QuasiTensor
87. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
88. #### final def norm[TT >: Counter[K, V], B, R](b: B)(implicit op: norm.Impl2[TT, B, R]): R

Represents the norm of this vector

Represents the norm of this vector

Definition Classes
NumericOps
89. #### final def norm[TT >: Counter[K, V], R]()(implicit op: norm.Impl[TT, R]): R

Represents the "natural" norm of this vector, for types that don't support arbitrary norms

Represents the "natural" norm of this vector, for types that don't support arbitrary norms

Definition Classes
NumericOps
90. #### final def notify(): Unit

Definition Classes
AnyRef
91. #### final def notifyAll(): Unit

Definition Classes
AnyRef
92. #### def pairs: TensorPairs[K, V, Counter[K, V]]

Definition Classes
TensorLike
93. #### def repr: Counter[K, V]

Definition Classes
CounterLikeNumericOps
94. #### def size: Int

Definition Classes
CounterLikeTensorLike
95. #### def sum(implicit num: Numeric[V]): V

Definition Classes
QuasiTensor
96. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
97. #### final def t[TT >: Counter[K, V], That, Slice1, Slice2, Result](a: Slice1, b: Slice2)(implicit op: CanTranspose[TT, That], canSlice: CanSlice2[That, Slice1, Slice2, Result]): Result

A transposed view of this object, followed by a slice.

A transposed view of this object, followed by a slice. Sadly frequently necessary.

Definition Classes
NumericOps
98. #### final def t[TT >: Counter[K, V], That](implicit op: CanTranspose[TT, That]): That

A transposed view of this object.

A transposed view of this object.

Definition Classes
NumericOps
99. #### def toMap: Map[K, V]

Definition Classes
CounterLike
100. #### def toString(): String

Definition Classes
CounterLike → AnyRef → Any
101. #### final def unary_![TT >: Counter[K, V], That](implicit op: operators.OpNot.Impl[TT, That]): That

Definition Classes
NumericOps
102. #### final def unary_-[TT >: Counter[K, V], That](implicit op: operators.OpNeg.Impl[TT, That]): That

Definition Classes
NumericOps
103. #### def update(k: K, v: V): Unit

Definition Classes
CounterLikeTensorLikeQuasiTensor
104. #### def values: TensorValues[K, V, Counter[K, V]]

Definition Classes
TensorLike
105. #### def valuesIterator: Iterator[V]

Definition Classes
CounterLikeQuasiTensor
106. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
107. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
108. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
109. #### final def |[TT >: Counter[K, V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That

Alias for :||(b) for all b.

Alias for :||(b) for all b.

Definition Classes
NumericOps
110. #### final def |=[TT >: Counter[K, V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): Counter[K, V]

Mutates this by element-wise or of this and b.

Mutates this by element-wise or of this and b.

Definition Classes
NumericOps

### Deprecated Value Members

1. #### def all(implicit semi: Semiring[V]): Boolean

Returns true if all elements are non-zero

Returns true if all elements are non-zero

Definition Classes
QuasiTensor
Annotations
@deprecated
Deprecated

(Since version 0.6) Use breeze.linalg.all instead

2. #### def any(implicit semi: Semiring[V]): Boolean

Returns true if some element is non-zero

Returns true if some element is non-zero

Definition Classes
QuasiTensor
Annotations
@deprecated
Deprecated

(Since version 0.6) Use breeze.linalg.any instead