cc.factorie.la

SparseIndexedTensor1

class SparseIndexedTensor1 extends Tensor1 with ArraySparseIndexedTensor

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SparseIndexedTensor1
  2. ArraySparseIndexedTensor
  3. SparseIndexedTensor
  4. SparseTensor
  5. SparseDoubleSeq
  6. Tensor1
  7. Tensor
  8. Serializable
  9. Serializable
  10. MutableDoubleSeq
  11. IncrementableDoubleSeq
  12. DoubleSeq
  13. AnyRef
  14. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SparseIndexedTensor1(dim1: Int)

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. def *(t: Tensor2): Tensor1

    Definition Classes
    Tensor1
  4. def *(f: Double): Tensor1

    Definition Classes
    Tensor1Tensor
  5. def *=(other: Double): Unit

  6. def *=(ds: DoubleSeq): Unit

    Definition Classes
    MutableDoubleSeq
  7. def *=(i: Int, incr: Double): Unit

    Definition Classes
    MutableDoubleSeq
  8. def +(t: Tensor1): Tensor1

    Definition Classes
    Tensor1
  9. def +(that: Tensor): Tensor

    Definition Classes
    Tensor
  10. def ++=(tensors: Iterable[Tensor]): SparseIndexedTensor1.this.type

    Definition Classes
    Tensor
  11. def +=(t: DoubleSeq, f: Double): Unit

  12. def +=(s: Double): Unit

  13. def +=(index: Int, incr: Double): Unit

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

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

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

    Definition Classes
    IncrementableDoubleSeq
  15. def +=(a: Array[Double], factor: Double): Unit

    Definition Classes
    IncrementableDoubleSeq
  16. def +=(a: Array[Double]): Unit

    Definition Classes
    IncrementableDoubleSeq
  17. final def +=(ds: DoubleSeq): Unit

    Definition Classes
    IncrementableDoubleSeq
  18. def -(t: Tensor1): Tensor1

    Definition Classes
    Tensor1
  19. def -(that: Tensor): Tensor

    Definition Classes
    Tensor
  20. def -=(ds: DoubleSeq): Unit

    Definition Classes
    IncrementableDoubleSeq
  21. final def -=(d: Double): Unit

    Definition Classes
    IncrementableDoubleSeq
  22. def -=(i: Int, incr: Double): Unit

    Definition Classes
    IncrementableDoubleSeq
  23. def /(f: Double): Tensor1

    Definition Classes
    Tensor1Tensor
  24. def /=(ds: DoubleSeq): Unit

    Definition Classes
    MutableDoubleSeq
  25. final def /=(d: Double): Unit

    Definition Classes
    MutableDoubleSeq
  26. final def /=(i: Int, incr: Double): Unit

    Definition Classes
    MutableDoubleSeq
  27. def :=(a: Array[Double], offset: Int): Unit

    Definition Classes
    MutableDoubleSeq
  28. def :=(a: Array[Double]): Unit

    Definition Classes
    MutableDoubleSeq
  29. def :=(ds: DoubleSeq): Unit

    Definition Classes
    MutableDoubleSeq
  30. def :=(d: Double): Unit

    Definition Classes
    MutableDoubleSeq
  31. def =+(a: Array[Double], offset: Int, f: Double): Unit

    Increment Array "a" with the contents of this Tensor, but do so at "offset" into array and multiplied by factor "f".

    Increment Array "a" with the contents of this Tensor, but do so at "offset" into array and multiplied by factor "f".

    Definition Classes
    ArraySparseIndexedTensorSparseDoubleSeqDoubleSeq
  32. final def =+(a: Array[Double], f: Double): Unit

    Definition Classes
    DoubleSeq
  33. final def =+(a: Array[Double], offset: Int): Unit

    Definition Classes
    DoubleSeq
  34. final def =+(a: Array[Double]): Unit

    Definition Classes
    DoubleSeq
  35. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  36. def _indices: Array[Int]

    Definition Classes
    ArraySparseIndexedTensorSparseTensor
  37. def _makeReadable(): Unit

    Definition Classes
    ArraySparseIndexedTensorSparseTensor
  38. def _rawArray: Array[Double]

    Return the values as an Array[Double] whose length may be longer than this.length.

    Return the values as an Array[Double] whose length may be longer than this.length.

    Definition Classes
    DoubleSeq
  39. def _unsafeActiveDomainSize: Int

    Definition Classes
    ArraySparseIndexedTensorSparseTensor
  40. def _values: Array[Double]

  41. def _valuesSeq: ArrayDoubleSeq

    Definition Classes
    SparseIndexedTensorSparseTensor
  42. def abs(): Unit

    Definition Classes
    MutableDoubleSeq
  43. def activeDomain: IntSeq

  44. def activeDomain1: IntSeq

    Definition Classes
    Tensor1
  45. def activeDomainSize: Int

  46. def activeDomains: Array[IntSeq]

    Definition Classes
    Tensor1Tensor
  47. def activeElements: Iterator[(Int, Double)]

    Definition Classes
    ArraySparseIndexedTensorTensor
  48. def activeElements1: Tensor1ElementIterator

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

    Append a string representation of this DoubleSeq to the StringBuilder.

    Append a string representation of this DoubleSeq to the StringBuilder.

    Definition Classes
    DoubleSeq
  50. def apply(index: Int): Double

    Definition Classes
    ArraySparseIndexedTensorDoubleSeq
  51. def asArray: Array[Double]

    Return the values as an Array[Double].

    Return the values as an Array[Double]. Not guaranteed to be a copy; in fact if it is possible to return a pointer to an internal array, it will simply return this.

    Definition Classes
    DoubleSeq
  52. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  53. def asSeq: Seq[Double]

    With uncopied contents

    With uncopied contents

    Definition Classes
    DoubleSeq
  54. def blankCopy: SparseIndexedTensor1

    Definition Classes
    SparseIndexedTensor1Tensor1Tensor
  55. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. def contains(d: Double): Boolean

    Definition Classes
    SparseDoubleSeqDoubleSeq
  57. def containsNaN: Boolean

    Definition Classes
    SparseDoubleSeqDoubleSeq
  58. def copy: SparseIndexedTensor1

    Definition Classes
    SparseIndexedTensor1Tensor1Tensor
  59. def copyInto(t: SparseIndexedTensor): Unit

    Definition Classes
    ArraySparseIndexedTensor
  60. def cosineSimilarity(t: DoubleSeq): Double

    Definition Classes
    Tensor
  61. def defaultValue: Double

    The default value at indices not covered by activeDomain.

    The default value at indices not covered by activeDomain. Subclasses may override this

    Definition Classes
    Tensor
  62. def different(t: DoubleSeq, threshold: Double): Boolean

    Definition Classes
    SparseDoubleSeqDoubleSeq
  63. val dim1: Int

    Definition Classes
    SparseIndexedTensor1Tensor1
  64. def dimensions: Array[Int]

    Definition Classes
    Tensor1Tensor
  65. def dimensionsMatch(t: Tensor): Boolean

    Definition Classes
    Tensor1Tensor
  66. def dot(v: DoubleSeq): Double

    Definition Classes
    ArraySparseIndexedTensorTensor
  67. def ensureCapacity(cap: Int): Unit

    Definition Classes
    ArraySparseIndexedTensor
  68. def ensureDimensionsMatch(t: Tensor): Unit

    Definition Classes
    Tensor1Tensor
  69. def entropy: Double

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

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  70. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  71. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  72. def exists(f: (Double) ⇒ Boolean): Boolean

    Definition Classes
    Tensor
  73. def expNormalize(): Double

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

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

    Definition Classes
    ArraySparseIndexedTensorMutableDoubleSeq
  74. 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.

    Exponential the elements of the array such that they are normalized to sum to one, but do so efficiently by providing logZ. Note that to maximize efficiency, this method does not verify that the logZ value was the correct one to cause proper normalization.

    Definition Classes
    MutableDoubleSeq
  75. def expNormalized: Tensor

    Definition Classes
    Tensor
  76. def exponentiate(): Unit

  77. def filter(f: (Double) ⇒ Boolean): DoubleSeq

    Definition Classes
    DoubleSeq
  78. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  79. def foldActiveElements(seed: Double, f: (Int, Double, Double) ⇒ Double): Double

    Definition Classes
    ArraySparseIndexedTensorTensor
  80. def foldLeft[B](z: B)(f: (B, Double) ⇒ B): B

    Definition Classes
    DoubleSeq
  81. def forall(f: (Double) ⇒ Boolean): Boolean

    Definition Classes
    DoubleSeq
  82. def forallActiveElements(f: (Int, Double) ⇒ Boolean): Boolean

    Definition Classes
    SparseDoubleSeq
  83. def forallElements(f: (Int, Double) ⇒ Boolean): Boolean

    Definition Classes
    DoubleSeq
  84. def foreach(f: (Double) ⇒ Unit): Unit

    Definition Classes
    DoubleSeq
  85. def foreachActiveElement(f: (Int, Double) ⇒ Unit): Unit

    Definition Classes
    ArraySparseIndexedTensorDoubleSeq
  86. def foreachElement(f: (Int, Double) ⇒ Unit): Unit

    Definition Classes
    DoubleSeq
  87. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  89. def indexOf(d: Double): Int

    Definition Classes
    SparseDoubleSeqDoubleSeq
  90. def infinityNorm: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  91. def isDense: Boolean

    Definition Classes
    SparseTensorTensor
  92. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  93. def isUniform: Boolean

    Definition Classes
    Tensor
  94. def jsDivergence(p: DoubleSeq): Double

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

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  95. def klDivergence(p: DoubleSeq): Double

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

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  96. def l2Similarity(t: DoubleSeq): Double

    Definition Classes
    DoubleSeq
  97. final def length: Int

    Definition Classes
    Tensor1DoubleSeq
    Annotations
    @inline()
  98. def map(f: (Double) ⇒ Double): DoubleSeq

    Definition Classes
    DoubleSeq
  99. def max: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  100. def maxIndex: Int

    Definition Classes
    SparseDoubleSeqDoubleSeq
  101. def maxIndex2: (Int, Int)

    Definition Classes
    SparseDoubleSeqDoubleSeq
  102. def maxNormalize(): Unit

  103. def min: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  104. def mkString: String

    Definition Classes
    DoubleSeq
  105. def mkString(sep: String): String

    Definition Classes
    DoubleSeq
  106. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    DoubleSeq
  107. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  108. def normalize(): Double

    Definition Classes
    MutableDoubleSeq
  109. def normalizeLogProb(): Double

    expNormalize, then put back into log-space.

    expNormalize, then put back into log-space.

    Definition Classes
    MutableDoubleSeq
  110. def normalized: Tensor

    Definition Classes
    Tensor
  111. final def notify(): Unit

    Definition Classes
    AnyRef
  112. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  113. def numDimensions: Int

    Definition Classes
    Tensor1Tensor
  114. def oneNorm: Double

  115. def oneNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  116. def outer(t: Tensor): Tensor

    Definition Classes
    Tensor
  117. def position(index: Int, start: Int): Int

    Definition Classes
    ArraySparseIndexedTensor
  118. def position(index: Int): Int

    Return the position at which index occurs, or -1 if index does not occur.

    Return the position at which index occurs, or -1 if index does not occur.

    Definition Classes
    ArraySparseIndexedTensor
  119. def printLength: Int

    Definition Classes
    Tensor
  120. def project(maxNorm: Double): Double

    Definition Classes
    MutableDoubleSeq
  121. def projected(maxNorm: Double): Tensor

    Definition Classes
    Tensor
  122. def reshape(dim: Array[Int]): Tensor

    Definition Classes
    Tensor1
  123. def sampleIndex(normalizer: Double)(implicit r: Random): Int

    Definition Classes
    SparseDoubleSeqDoubleSeq
  124. def sampleIndex(implicit r: Random): Int

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

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

    Definition Classes
    DoubleSeq
  125. final def size: Int

    Definition Classes
    DoubleSeq
  126. def sizeHint(size: Int): Unit

    Definition Classes
    ArraySparseIndexedTensorSparseTensor
  127. def stringPrefix: String

    Definition Classes
    Tensor1Tensor
  128. def substitute(f: (Double) ⇒ Double): SparseIndexedTensor1.this.type

    Like map, but it changes in place.

    Like map, but it changes in place.

    Definition Classes
    MutableDoubleSeq
  129. def substitute(oldValue: Double, newValue: Double): SparseIndexedTensor1.this.type

    Change all occurrences of oldValue to newValue.

    Change all occurrences of oldValue to newValue.

    Definition Classes
    MutableDoubleSeq
  130. def sum: Double

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

    Definition Classes
    AnyRef
  132. def toArray: Array[Double]

    Return the values as an Array[Double].

    Return the values as an Array[Double]. Guaranteed to be a copy, not just a pointer to an internal array that would change with changes to the DoubleSeq

    Definition Classes
    ArraySparseIndexedTensorSparseDoubleSeqDoubleSeq
  133. def toSeq: Seq[Double]

    With copied contents

    With copied contents

    Definition Classes
    DoubleSeq
  134. def toString(): String

    Definition Classes
    ArraySparseIndexedTensorTensor → AnyRef → Any
  135. def top(n: Int): TopN[String]

    Return records for the n elements with the largest values.

    Return records for the n elements with the largest values.

    Definition Classes
    DoubleSeq
  136. def trim(): Unit

    Definition Classes
    ArraySparseIndexedTensor
  137. final def twoNorm: Double

    Definition Classes
    DoubleSeq
  138. def twoNormSquared: Double

  139. def twoNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  140. def twoSquaredNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  141. def update(index: Int, value: Double): Unit

  142. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  145. def zero(): Unit

Inherited from ArraySparseIndexedTensor

Inherited from SparseIndexedTensor

Inherited from SparseTensor

Inherited from SparseDoubleSeq

Inherited from Tensor1

Inherited from Tensor

Inherited from Serializable

Inherited from Serializable

Inherited from MutableDoubleSeq

Inherited from IncrementableDoubleSeq

Inherited from DoubleSeq

Inherited from AnyRef

Inherited from Any

Ungrouped