# SingletonBinaryTensor2

#### class SingletonBinaryTensor2 extends SingletonBinaryTensorLike2

Linear Supertypes
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. SingletonBinaryTensor2
2. SingletonBinaryTensorLike2
3. SingletonBinaryTensor
4. SingletonTensor
6. SparseBinaryTensor
7. SparseTensor
8. SparseDoubleSeq
9. Tensor2
10. Tensor
11. Serializable
12. Serializable
13. MutableDoubleSeq
14. IncrementableDoubleSeq
15. DoubleSeq
16. AnyRef
17. 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
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 +(that: Tensor): Tensor

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

Definition Classes
Tensor

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

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

Definition Classes
IncrementableDoubleSeq
15. #### def +=(ds: DoubleSeq, 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 +=(d: Double): 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 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
SingletonBinaryTensorSparseDoubleSeqDoubleSeq
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
SingletonTensorSparseTensor

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

Definition Classes
SingletonTensorSparseTensor
40. #### def _valuesSeq: DoubleSeq

Definition Classes
SparseBinaryTensorSparseTensor
41. #### def abs(): Unit

Definition Classes
MutableDoubleSeq

43. #### def activeDomain1: SingletonIntSeq

Definition Classes
SingletonBinaryTensorLike2Tensor2
44. #### def activeDomain2: SingletonIntSeq

Definition Classes
SingletonBinaryTensorLike2Tensor2
45. #### val activeDomainSize: Int

Definition Classes
SingletonTensorTensorSparseDoubleSeq
46. #### def activeDomains: Array[IntSeq]

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

Definition Classes
SingletonBinaryTensorTensor
48. #### def activeElements2: Tensor2ElementIterator

Definition Classes
SingletonBinaryTensorLike2
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(i: Int): Double

Definition Classes
SingletonBinaryTensorDoubleSeq
51. #### def apply(i: Int, j: Int): Double

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

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

With uncopied contents

With uncopied contents

Definition Classes
DoubleSeq
55. #### def blankCopy: Tensor2

Definition Classes
Tensor2Tensor
56. #### def clone(): AnyRef

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

Definition Classes
SparseDoubleSeqDoubleSeq

59. #### def copy: SingletonBinaryTensor2

Definition Classes
SingletonBinaryTensor2Tensor2Tensor
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 diag: Tensor1

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

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

Definition Classes
SingletonBinaryTensor2Tensor2
65. #### val dim2: Int

Definition Classes
SingletonBinaryTensor2Tensor2
66. #### def dimensions: Array[Int]

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

Definition Classes
Tensor2Tensor
68. #### def dot(t: DoubleSeq): Double

Definition Classes
SingletonBinaryTensorTensor
69. #### def ensureDimensionsMatch(t: Tensor): Unit

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

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

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

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

Definition Classes
Tensor
77. #### def exponentiate(): Unit

Definition Classes
MutableDoubleSeq
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
Tensor
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
SingletonBinaryTensorTensorSparseDoubleSeq
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
SingletonBinaryTensorDoubleSeq
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. #### final def index1(i: Int): Int

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

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

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

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

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

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

Definition Classes
Tensor
96. #### 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
97. #### 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
98. #### def l2Similarity(t: DoubleSeq): Double

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

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

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

Definition Classes
DoubleSeq

104. #### def maxIndex2: (Int, Int)

Definition Classes
SparseDoubleSeqDoubleSeq
105. #### def maxNormalize(): Unit

Definition Classes
MutableDoubleSeq

107. #### def mkString: String

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

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

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

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

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

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

expNormalize, then put back into log-space.

expNormalize, then put back into log-space.

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

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

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

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

Definition Classes
Tensor2Tensor
118. #### def oneNorm: Double

Definition Classes
SparseDoubleSeqDoubleSeq
119. #### def oneNormalize(): Double

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

Definition Classes
Tensor
121. #### def printLength: Int

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

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

Definition Classes
Tensor2
Annotations
@inline()

128. #### def singleValue: Double

Definition Classes
SingletonBinaryTensorSingletonTensor
129. #### final def size: Int

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

Definition Classes
SingletonTensorSparseTensor
131. #### def stringPrefix: String

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

Definition Classes
MutableDoubleSeq

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

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

With copied contents

With copied contents

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

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

Definition Classes
Tensor2
140. #### final def twoNorm: Double

Definition Classes
DoubleSeq
141. #### def twoNormSquared: Double

Definition Classes
SparseDoubleSeqDoubleSeq
142. #### def twoNormalize(): Double

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

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

Definition Classes
145. #### def update(i: Int, j: Int, v: Double): Unit

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

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )