# SparseIndexedTensor2

#### class SparseIndexedTensor2 extends Tensor2 with ArraySparseIndexedTensor

Linear Supertypes
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. SparseIndexedTensor2
2. ArraySparseIndexedTensor
3. SparseIndexedTensor
4. SparseTensor
5. SparseDoubleSeq
6. Tensor2
7. Tensor
8. Serializable
9. Serializable
10. MutableDoubleSeq
11. IncrementableDoubleSeq
12. DoubleSeq
13. AnyRef
14. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### 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: Tensor1): Tensor1

Definition Classes
Tensor2
5. #### def *(v: Double): Tensor

Definition Classes
Tensor

7. #### def *=(ds: DoubleSeq): Unit

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

Definition Classes
MutableDoubleSeq
9. #### def +(that: Tensor): Tensor

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

Definition Classes
Tensor

14. #### def +=(i: Int, j: Int, v: Double): Unit

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

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

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

Definition Classes
IncrementableDoubleSeq
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 /(v: Double): Tensor

Definition Classes
Tensor
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: AnyRef): Boolean

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

Definition Classes
Any
37. #### def _indices: Array[Int]

Definition Classes
ArraySparseIndexedTensorSparseTensor

Definition Classes
ArraySparseIndexedTensorSparseTensor
39. #### def _unsafeActiveDomainSize: Int

Definition Classes
ArraySparseIndexedTensorSparseTensor

41. #### def _valuesSeq: ArrayDoubleSeq

Definition Classes
SparseIndexedTensorSparseTensor
42. #### def abs(): Unit

Definition Classes
MutableDoubleSeq

44. #### def activeDomain1: IntSeq

Definition Classes
SparseIndexedTensor2Tensor2
45. #### def activeDomain2: IntSeq

Definition Classes
SparseIndexedTensor2Tensor2

47. #### def activeDomains: Array[IntSeq]

Definition Classes
Tensor2Tensor
48. #### def activeElements: Iterator[(Int, Double)]

Definition Classes
ArraySparseIndexedTensorTensor

50. #### 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
51. #### def apply(index: Int): Double

Definition Classes
ArraySparseIndexedTensorDoubleSeq
52. #### def apply(i: Int, j: Int): Double

Definition Classes
Tensor2
53. #### 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
54. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
55. #### def asSeq: Seq[Double]

With uncopied contents

With uncopied contents

Definition Classes
DoubleSeq
56. #### def blankCopy: SparseIndexedTensor2

Definition Classes
SparseIndexedTensor2Tensor2Tensor
57. #### def clone(): AnyRef

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

Definition Classes
SparseDoubleSeqDoubleSeq
59. #### def containsNaN: Boolean

Definition Classes
SparseDoubleSeqDoubleSeq
60. #### def copy: SparseIndexedTensor2

Definition Classes
SparseIndexedTensor2Tensor2Tensor
61. #### def copyInto(t: SparseIndexedTensor): Unit

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

Definition Classes
Tensor
63. #### 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
64. #### def diag: Tensor1

Definition Classes
Tensor2
65. #### def different(t: DoubleSeq, threshold: Double): Boolean

Definition Classes
SparseDoubleSeqDoubleSeq
66. #### val dim1: Int

Definition Classes
SparseIndexedTensor2Tensor2
67. #### val dim2: Int

Definition Classes
SparseIndexedTensor2Tensor2
68. #### def dimensions: Array[Int]

Definition Classes
Tensor2Tensor
69. #### def dimensionsMatch(t: Tensor): Boolean

Definition Classes
Tensor2Tensor
70. #### def dot(v: DoubleSeq): Double

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

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

Definition Classes
Tensor2Tensor
73. #### 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
74. #### final def eq(arg0: AnyRef): Boolean

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

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

Definition Classes
Tensor
77. #### 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
78. #### 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
79. #### def expNormalized: Tensor

Definition Classes
Tensor

81. #### def finalize(): Unit

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

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

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

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

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

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

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

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

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

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

Definition Classes
AnyRef → Any
92. #### final def index1(i: Int): Int

Definition Classes
Tensor2
Annotations
@inline()
93. #### final def index2(i: Int): Int

Definition Classes
Tensor2
Annotations
@inline()
94. #### def indexOf(d: Double): Int

Definition Classes
SparseDoubleSeqDoubleSeq
95. #### def infinityNorm: Double

Definition Classes
SparseDoubleSeqDoubleSeq
96. #### def isDense: Boolean

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

Definition Classes
Any
98. #### def isUniform: Boolean

Definition Classes
Tensor
99. #### 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
100. #### 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
101. #### def l2Similarity(t: DoubleSeq): Double

Definition Classes
DoubleSeq
102. #### def leftMultiply(t: Tensor1): Tensor1

Definition Classes
Tensor2
103. #### final def length: Int

Definition Classes
Tensor2DoubleSeq
Annotations
@inline()
104. #### def map(f: (Double) ⇒ Double): DoubleSeq

Definition Classes
DoubleSeq
105. #### def max: Double

Definition Classes
SparseDoubleSeqDoubleSeq
106. #### def maxIndex: Int

Definition Classes
SparseDoubleSeqDoubleSeq
107. #### def maxIndex2: (Int, Int)

Definition Classes
SparseDoubleSeqDoubleSeq

109. #### def min: Double

Definition Classes
SparseDoubleSeqDoubleSeq
110. #### def mkString: String

Definition Classes
DoubleSeq
111. #### def mkString(sep: String): String

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

Definition Classes
DoubleSeq
113. #### final def multiIndex(i: Int): (Int, Int)

Definition Classes
Tensor2
Annotations
@inline()
114. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
115. #### def normalize(): Double

Definition Classes
MutableDoubleSeq
116. #### def normalizeLogProb(): Double

expNormalize, then put back into log-space.

expNormalize, then put back into log-space.

Definition Classes
MutableDoubleSeq
117. #### def normalized: Tensor

Definition Classes
Tensor
118. #### final def notify(): Unit

Definition Classes
AnyRef
119. #### final def notifyAll(): Unit

Definition Classes
AnyRef
120. #### def numDimensions: Int

Definition Classes
Tensor2Tensor

122. #### def oneNormalize(): Double

Definition Classes
MutableDoubleSeq
123. #### def outer(t: Tensor): Tensor

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

Definition Classes
ArraySparseIndexedTensor
125. #### 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
126. #### def printLength: Int

Definition Classes
Tensor
127. #### def sampleIndex(normalizer: Double)(implicit r: Random): Int

Definition Classes
SparseDoubleSeqDoubleSeq
128. #### 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
129. #### final def singleIndex(i: Int, j: Int): Int

Definition Classes
Tensor2
Annotations
@inline()
130. #### final def size: Int

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

Definition Classes
ArraySparseIndexedTensorSparseTensor
132. #### def stringPrefix: String

Definition Classes
Tensor
133. #### def substitute(oldValue: Double, newValue: Double): Unit

Definition Classes
MutableDoubleSeq

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

Definition Classes
AnyRef
136. #### 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
137. #### def toSeq: Seq[Double]

With copied contents

With copied contents

Definition Classes
DoubleSeq
138. #### def toString(): String

Definition Classes
ArraySparseIndexedTensorTensor → AnyRef → Any
139. #### 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
140. #### def trace: Double

Definition Classes
Tensor2
141. #### def trim(): Unit

Definition Classes
ArraySparseIndexedTensor
142. #### final def twoNorm: Double

Definition Classes
DoubleSeq

144. #### def twoNormalize(): Double

Definition Classes
MutableDoubleSeq
145. #### def twoSquaredNormalize(): Double

Definition Classes
MutableDoubleSeq

147. #### def update(i: Int, j: Int, v: Double): Unit

Definition Classes
Tensor2
148. #### final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )