QuasiTensor

abstract def activeIterator: Iterator[(K, V)]

abstract def activeKeysIterator: Iterator[K]

abstract def activeValuesIterator: Iterator[V]

abstract def apply(i: K): V

abstract def iterator: Iterator[(K, V)]

abstract def keySet: Set[K]

abstract def keysIterator: Iterator[K]

abstract def update(i: K, v: V): Unit

abstract def valuesIterator: Iterator[V]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

Returns all indices k whose value satisfies a predicate.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

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.

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

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

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