SparseIndexedTensor

abstract def +=(i: Int, incr: Double): Unit

abstract def _indices: Array[Int]

abstract def _makeReadable(): Unit

abstract def _unsafeActiveDomainSize: Int

abstract def _values: Array[Double]

abstract def activeDomain: IntSeq

abstract def activeDomainSize: Int

abstract def activeDomains: Array[IntSeq]

abstract def apply(i: Int): Double

abstract def blankCopy: Tensor

abstract def copy: Tensor

abstract def dimensions: Array[Int]

abstract def dot(ds: DoubleSeq): Double

abstract def foreachActiveElement(f: (Int, Double) ⇒ Unit): Unit

abstract def length: Int

abstract def numDimensions: Int

abstract def sizeHint(size: Int): Unit

abstract def update(i: Int, v: Double): Unit

abstract def zero(): Unit

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(v: Double): Tensor

def *=(ds: DoubleSeq): Unit

def *=(d: Double): Unit

def *=(i: Int, incr: Double): Unit

def +(that: Tensor): Tensor

def ++=(tensors: Iterable[Tensor]): SparseIndexedTensor.this.type

def +=(ds: DoubleSeq, factor: DoubleSeq): Unit

Increment by the element-wise product of ds and factor.

def +=(a: Array[Double], factor: Double): Unit

def +=(ds: DoubleSeq, factor: Double): Unit

def +=(a: Array[Double]): Unit

final def +=(ds: DoubleSeq): Unit

def +=(d: Double): Unit

def -(that: Tensor): Tensor

def -=(ds: DoubleSeq): Unit

final def -=(d: Double): Unit

def -=(i: Int, incr: Double): Unit

def /(v: Double): Tensor

def /=(ds: DoubleSeq): Unit

final def /=(d: Double): Unit

final def /=(i: Int, incr: Double): Unit

def :=(a: Array[Double], offset: Int): Unit

def :=(a: Array[Double]): Unit

def :=(ds: DoubleSeq): Unit

def :=(d: Double): Unit

def =+(a: Array[Double], offset: Int, f: Double): Unit

Increment given array (starting at offset index) with contents of this DoubleSeq, multiplied by factor f.

final def =+(a: Array[Double], f: Double): Unit

final def =+(a: Array[Double], offset: Int): Unit

final def =+(a: Array[Double]): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def _valuesSeq: ArrayDoubleSeq

def abs(): Unit

def activeElements: Iterator[(Int, Double)]

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Append a string representation of this DoubleSeq to the StringBuilder.

def asArray: Array[Double]

Return the values as an Array[Double].

final def asInstanceOf[T0]: T0

def asSeq: Seq[Double]

With uncopied contents

def clone(): AnyRef

def contains(d: Double): Boolean

def containsNaN: Boolean

def cosineSimilarity(t: DoubleSeq): Double

def defaultValue: Double

The default value at indices not covered by activeDomain.

def different(t: DoubleSeq, threshold: Double): Boolean

def dimensionsMatch(t: Tensor): Boolean

def ensureDimensionsMatch(t: Tensor): Unit

def entropy: Double

Assumes that the values are already normalized to sum to 1.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(f: (Double) ⇒ Boolean): Boolean

def expNormalize(logZ: Double): Unit

Exponential the elements of the array such that they are normalized to sum to one, but do so efficiently by providing logZ.

def expNormalize(): Double

Exponentiate the elements of the array, and then normalize them to sum to one.

def expNormalized: Tensor

def exponentiate(): Unit

def finalize(): Unit

def foldActiveElements(seed: Double, f: (Int, Double, Double) ⇒ Double): Double

def foldLeft[B](z: B)(f: (B, Double) ⇒ B): B

def forall(f: (Double) ⇒ Boolean): Boolean

def forallActiveElements(f: (Int, Double) ⇒ Boolean): Boolean

def forallElements(f: (Int, Double) ⇒ Boolean): Boolean

def foreach(f: (Double) ⇒ Unit): Unit

def foreachElement(f: (Int, Double) ⇒ Unit): Unit

final def getClass(): Class[_]

def hashCode(): Int

def indexOf(d: Double): Int

def infinityNorm: Double

def isDense: Boolean

final def isInstanceOf[T0]: Boolean

def isUniform: Boolean

def jsDivergence(p: DoubleSeq): Double

Assumes that the values are already normalized to sum to 1.

def klDivergence(p: DoubleSeq): Double

Assumes that the values in both DoubleSeq are already normalized to sum to 1.

def l2Similarity(t: DoubleSeq): Double

def map(f: (Double) ⇒ Double): DoubleSeq

def max: Double

def maxIndex: Int

def maxIndex2: (Int, Int)

def maxNormalize(): Unit

def min: Double

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def normalize(): Double

def normalizeLogProb(): Double

expNormalize, then put back into log-space.

def normalized: Tensor

final def notify(): Unit

final def notifyAll(): Unit

def oneNorm: Double

def oneNormalize(): Double

def outer(t: Tensor): Tensor

def printLength: Int

def sampleIndex(normalizer: Double)(implicit r: Random): Int

def sampleIndex(implicit r: Random): Int

Careful, for many subclasses this is inefficient because it calls the method "sum" to get the normalizer.

final def size: Int

def stringPrefix: String

def substitute(oldValue: Double, newValue: Double): Unit

def sum: Double

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

def toArray: Array[Double]

Return the values as an Array[Double].

def toSeq: Seq[Double]

With copied contents

def toString(): String

def top(n: Int): TopN[String]

Return records for the n elements with the largest values.

final def twoNorm: Double

def twoNormSquared: Double

def twoNormalize(): Double

def twoSquaredNormalize(): Double

final def wait(): Unit

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

final def wait(arg0: Long): Unit