Counter

abstract def data: Map[K, V]

abstract def default: V

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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.

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.

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.

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.

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

Matrix multiplication

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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.

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

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

Shaped solve of this by b.

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.

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.

def active: TensorActive[K, V, Counter[K, V]]

def activeIterator: Iterator[(K, V)]

def activeKeysIterator: Iterator[K]

def activeSize: Int

def activeValuesIterator: Iterator[V]

def apply(k: K): V

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.

def apply[Result](a: K, slice: K*)(implicit canSlice: CanSlice[Counter[K, V], Seq[K], Result]): Result

Slice a sequence of elements.

def apply[Slice, Result](slice: Slice)(implicit canSlice: CanSlice[Counter[K, V], Slice, Result]): Result

method for slicing a tensor.

def argmax(implicit ord: Ordering[V]): K

def argmin(implicit ord: Ordering[V]): K

def argsort(implicit ord: Ordering[V]): IndexedSeq[K]

def argtopk(k: Int)(implicit ordering: Ordering[V]): IndexedSeq[K]

Returns the k indices with maximum value.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(k: K): Boolean

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.

final def eq(arg0: AnyRef): Boolean

def equals(p1: Any): Boolean

def finalize(): Unit

def findAll(f: (V) ⇒ Boolean): IndexedSeq[K]

Returns all indices k whose value satisfies a predicate.

def forall(fn: (K, V) ⇒ Boolean): Boolean

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

def forallValues(fn: (V) ⇒ Boolean): Boolean

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

def foreachKey[U](fn: (K) ⇒ U): Unit

Applies the given function to each key in the tensor.

def foreachPair[U](fn: (K, V) ⇒ U): Unit

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

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).

def get(k: K): Option[V]

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[(K, V)]

def keySet: Set[K]

def keys: TensorKeys[K, V, Counter[K, V]]

def keysIterator: Iterator[K]

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.

def mapActiveValues[TT >: Counter[K, V], O, That](f: (V) ⇒ O)(implicit bf: CanMapValues[TT, V, O, That]): That

Maps all non-zero values.

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.

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.

def max(implicit ord: Ordering[V]): V

def min(implicit ord: Ordering[V]): V

final def ne(arg0: AnyRef): Boolean

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

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

final def notify(): Unit

final def notifyAll(): Unit

def pairs: TensorPairs[K, V, Counter[K, V]]

def repr: Counter[K, V]

def size: Int

def sum(implicit num: Numeric[V]): V

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

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.

final def t[TT >: Counter[K, V], That](implicit op: CanTranspose[TT, That]): That

A transposed view of this object.

def toMap: Map[K, V]

def toString(): String

final def unary_![TT >: Counter[K, V], That](implicit op: operators.OpNot.Impl[TT, That]): That

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

def update(k: K, v: V): Unit

def values: TensorValues[K, V, Counter[K, V]]

def valuesIterator: Iterator[V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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.

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.

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

Returns true if all elements are non-zero

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

Returns true if some element is non-zero