cc.factorie.la

SparseBinaryTensor1

class SparseBinaryTensor1 extends SparseBinaryTensorLike1

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SparseBinaryTensor1
  2. SparseBinaryTensorLike1
  3. ArraySparseBinaryTensor
  4. ProtectedIntArrayBuffer
  5. SparseBinaryTensor
  6. SparseTensor
  7. SparseDoubleSeq
  8. Tensor1
  9. Tensor
  10. Serializable
  11. Serializable
  12. MutableDoubleSeq
  13. IncrementableDoubleSeq
  14. DoubleSeq
  15. AnyRef
  16. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SparseBinaryTensor1(t: Tensor)

  2. new SparseBinaryTensor1(dim1: Int)

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. def *(t: Tensor2): Tensor1

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

    Definition Classes
    Tensor1Tensor
  6. def *=(ds: DoubleSeq): Unit

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

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

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

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

    Definition Classes
    Tensor
  11. def ++=(is: Iterable[Int]): Unit

    Definition Classes
    ArraySparseBinaryTensor
  12. def ++=(is: Array[Int]): Unit

    Definition Classes
    ArraySparseBinaryTensor
  13. def ++=(tensors: Iterable[Tensor]): SparseBinaryTensor1.this.type

    Definition Classes
    Tensor
  14. def +=(i: Int, v: Double): Unit

    In SparseBinary, this is equivalent to update(i,v)

    In SparseBinary, this is equivalent to update(i,v)

    Definition Classes
    ArraySparseBinaryTensorTensorMutableDoubleSeqIncrementableDoubleSeq
  15. def +=(i: Int): Unit

    Definition Classes
    ArraySparseBinaryTensor
  16. 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
  17. def +=(a: Array[Double], factor: Double): Unit

    Definition Classes
    IncrementableDoubleSeq
  18. def +=(ds: DoubleSeq, factor: Double): Unit

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

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

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

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

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

    Definition Classes
    Tensor
  24. def -=(i: Int): Unit

    Definition Classes
    ArraySparseBinaryTensor
  25. def -=(ds: DoubleSeq): Unit

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    MutableDoubleSeq
  36. 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.

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

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

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

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

    Definition Classes
    DoubleSeq
  40. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  42. final def _append(elem: Int): SparseBinaryTensor1.this.type

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  43. def _appendAll(elts: TraversableOnce[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  44. def _appendAll(elts: Array[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  45. def _appendUnsafe(i: Int): ArraySparseBinaryTensor

    Definition Classes
    ArraySparseBinaryTensor
  46. final def _apply(index: Int): Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  47. def _array: Array[Int]

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  48. final def _asArray: Array[Int]

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  49. def _asIntSeq: IntSeq

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  50. def _asSeq: IndexedSeq[Int]

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  51. def _capacityGrowthFactor: Double

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  52. def _clear(): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  53. def _considerShrinkingCapacity(): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  54. def _containsSorted(x: Int): Boolean

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  55. def _copyToArray(a: Array[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  56. final def _ensureCapacity(cap: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  57. def _fill(elt: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  58. def _foreach[U](f: (Int) ⇒ U): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  59. final def _increment(index: Int, incr: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  60. def _indexForInsertSorted(i: Int): Int

    Return the index at which value i should be inserted in order to maintain sorted order.

    Return the index at which value i should be inserted in order to maintain sorted order. This assumes that the existing elements already already sorted. If value i is already present, return its index.

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  61. def _indexForInsertSortedLinear(i: Int): Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  62. def _indexOf(i: Int): Int

    Return the index containing the value i, or -1 if i is not found.

    Return the index containing the value i, or -1 if i is not found.

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  63. def _indexOfSorted(i: Int): Int

    Return the index containing the value i, or -1 if i is not found.

    Return the index containing the value i, or -1 if i is not found. Do so more efficiently by assuming that the contents are sorted in ascending order. Look by starting near the last index as which a search was successful.

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  64. def _indices: Array[Int]

    Efficient (but dangerous) direct access to underlying array of indices.

    Efficient (but dangerous) direct access to underlying array of indices. Note that the array.length may be larger than the number of indices.

    Definition Classes
    ArraySparseBinaryTensorSparseTensor
  65. def _initialCapacity: Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  66. def _insert(index: Int, elt: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  67. def _insertAll(index: Int, seq: Traversable[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  68. def _insertAllSorted(seq: Traversable[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  69. def _insertSorted(elt: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  70. def _insertSortedNoDuplicates(elt: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  71. final def _length: Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  72. def _makeReadable(): Unit

    Definition Classes
    ArraySparseBinaryTensorSparseTensor
  73. def _mapToArray[A](a: Array[A], f: (Int) ⇒ A): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  74. def _prepend(elt: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  75. def _prependAll(elts: TraversableOnce[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  76. def _reduceToSize(newSize: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  77. def _remove(index: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  78. def _remove(index: Int, count: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  79. def _set(elts: Seq[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  80. def _set(elts: Array[Int]): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  81. final def _setCapacity(cap: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  82. def _sizeHint(len: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  83. def _sum: Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  84. def _takeAsIntSeq(len: Int): IntSeq

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  85. def _toArray: Array[Int]

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  86. def _toSeq: IndexedSeq[Int]

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  87. def _trimCapacity(): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  88. def _unsafeActiveDomainSize: Int

    Definition Classes
    ArraySparseBinaryTensorSparseTensor
  89. final def _update(index: Int, value: Int): Unit

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  90. def _valuesSeq: DoubleSeq

    Definition Classes
    SparseBinaryTensorSparseTensor
  91. def abs(): Unit

    Definition Classes
    MutableDoubleSeq
  92. def activeDomain: TruncatedArrayIntSeq

  93. def activeDomain1: IntSeq

    Definition Classes
    Tensor1
  94. def activeDomainSize: Int

  95. def activeDomains: Array[IntSeq]

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

    Definition Classes
    ArraySparseBinaryTensorTensor
  97. 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
  98. final def apply(index: Int): Double

    Definition Classes
    ArraySparseBinaryTensorDoubleSeq
    Annotations
    @inline()
  99. 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
  100. final def asInstanceOf[T0]: T0

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

    With uncopied contents

    With uncopied contents

    Definition Classes
    DoubleSeq
  102. def blankCopy: SparseBinaryTensor1

    Definition Classes
    SparseBinaryTensor1Tensor1Tensor
  103. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. final def contains(index: Int): Boolean

    Definition Classes
    ArraySparseBinaryTensor
    Annotations
    @inline()
  105. def contains(d: Double): Boolean

    Definition Classes
    SparseDoubleSeqDoubleSeq
  106. def containsNaN: Boolean

  107. def copy: Tensor1

    Definition Classes
    Tensor1Tensor
  108. def cosineSimilarity(t: DoubleSeq): Double

    Definition Classes
    Tensor
  109. 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
  110. def different(t: DoubleSeq, threshold: Double): Boolean

    Definition Classes
    SparseDoubleSeqDoubleSeq
  111. val dim1: Int

    Definition Classes
    SparseBinaryTensor1Tensor1
  112. def dimensions: Array[Int]

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

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

    Definition Classes
    ArraySparseBinaryTensorTensor
  115. def ensureDimensionsMatch(t: Tensor): Unit

    Definition Classes
    Tensor1Tensor
  116. 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
  117. final def eq(arg0: AnyRef): Boolean

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

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

    Definition Classes
    Tensor
  120. 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
  121. 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
    MutableDoubleSeq
  122. def expNormalized: Tensor

    Definition Classes
    Tensor
  123. def exponentiate(): Unit

    Definition Classes
    MutableDoubleSeq
  124. def finalize(): Unit

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

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

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

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

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

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

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

    Definition Classes
    ArraySparseBinaryTensorDoubleSeq
  132. def foreachElement(f: (Int, Double) ⇒ Unit): Unit

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

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

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

  136. def infinityNorm: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  137. def isDense: Boolean

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

    Definition Classes
    Any
  139. def isUniform: Boolean

    Definition Classes
    Tensor
  140. 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
  141. 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
  142. def l2Similarity(t: DoubleSeq): Double

    Definition Classes
    DoubleSeq
  143. final def length: Int

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

    Definition Classes
    DoubleSeq
  145. def max: Double

  146. def maxIndex: Int

  147. def maxIndex2: (Int, Int)

    Definition Classes
    SparseDoubleSeqDoubleSeq
  148. def maxNormalize(): Unit

    Definition Classes
    MutableDoubleSeq
  149. def min: Double

  150. def mkString: String

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

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

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

    Definition Classes
    AnyRef
  154. def normalize(): Double

    Definition Classes
    MutableDoubleSeq
  155. def normalizeLogProb(): Double

    expNormalize, then put back into log-space.

    expNormalize, then put back into log-space.

    Definition Classes
    MutableDoubleSeq
  156. def normalized: Tensor

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

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

    Definition Classes
    AnyRef
  159. def numDimensions: Int

    Definition Classes
    Tensor1Tensor
  160. def oneNorm: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  161. def oneNormalize(): Double

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

    Definition Classes
    Tensor
  163. def printLength: Int

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

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  166. 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
  167. final def size: Int

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

    Definition Classes
    ArraySparseBinaryTensorSparseTensor
  169. def stringPrefix: String

    Definition Classes
    Tensor1Tensor
  170. def substitute(oldValue: Double, newValue: Double): Unit

    Definition Classes
    MutableDoubleSeq
  171. def sum: Double

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

    Definition Classes
    AnyRef
  173. 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
    SparseDoubleSeqDoubleSeq
  174. def toIntArray: Array[Int]

    Definition Classes
    ArraySparseBinaryTensor
  175. def toSeq: Seq[Double]

    With copied contents

    With copied contents

    Definition Classes
    DoubleSeq
  176. def toString(): String

    Definition Classes
    Tensor → AnyRef → Any
  177. 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
  178. final def twoNorm: Double

    Definition Classes
    DoubleSeq
  179. def twoNormSquared: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  180. def twoNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  181. def twoSquaredNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  182. def update(i: Int, v: Double): Unit

  183. final def wait(): Unit

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

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

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

Inherited from SparseBinaryTensorLike1

Inherited from ArraySparseBinaryTensor

Inherited from ProtectedIntArrayBuffer

Inherited from SparseBinaryTensor

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