# SortedSparseCountsProportions1

#### class SortedSparseCountsProportions1 extends SparseDoubleSeq with Proportions1

Linear Supertypes
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. SortedSparseCountsProportions1
2. Proportions1
3. Proportions
5. Masses1
6. Masses
7. Tensor1
8. Tensor
9. Serializable
10. Serializable
11. MutableDoubleSeq
12. IncrementableDoubleSeq
13. SparseDoubleSeq
14. DoubleSeq
15. AnyRef
16. 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: la.Tensor2): la.Tensor1

Definition Classes
Tensor1
5. #### def *(f: Double): la.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: la.Tensor1): la.Tensor1

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

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

Definition Classes
Tensor

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 -(t: la.Tensor1): la.Tensor1

Definition Classes
Tensor1
20. #### def -(that: Tensor): Tensor

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

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

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

Definition Classes
IncrementableDoubleSeq
24. #### def /(f: Double): la.Tensor1

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

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

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

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

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

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

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

Definition Classes
MutableDoubleSeq
32. #### 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
SparseDoubleSeqDoubleSeq
33. #### final def =+(a: Array[Double], f: Double): Unit

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

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

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

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

Definition Classes
Any
38. #### def abs(): Unit

Definition Classes
MutableDoubleSeq

40. #### def activeDomain1: IntSeq

Definition Classes
Tensor1

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

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

Definition Classes
Tensor
44. #### 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

46. #### 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
47. #### final def asInstanceOf[T0]: T0

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

With uncopied contents

With uncopied contents

Definition Classes
DoubleSeq
49. #### def blankCopy: la.Tensor1

Definition Classes
Tensor1Tensor
50. #### def clone(): AnyRef

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

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

Definition Classes
SparseDoubleSeqDoubleSeq
53. #### def copy: la.Tensor1

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

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

Definition Classes
SparseDoubleSeqDoubleSeq

58. #### def dimensions: Array[Int]

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

Definition Classes
Tensor1Tensor
60. #### def dot(t: DoubleSeq): Double

Definition Classes
SortedSparseCountsProportions1Tensor
61. #### def ensureDimensionsMatch(t: Tensor): Unit

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

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

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

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

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

Definition Classes
MutableDoubleSeq
70. #### def finalize(): Unit

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

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

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

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

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

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

Definition Classes
DoubleSeq

78. #### def foreachElement(f: (Int, Double) ⇒ Unit): Unit

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

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

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

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

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

Definition Classes
SortedSparseCountsProportions1Tensor
84. #### final def isInstanceOf[T0]: Boolean

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

Definition Classes
Tensor
86. #### 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
87. #### 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
88. #### def l2Similarity(t: DoubleSeq): Double

Definition Classes
DoubleSeq
89. #### final def length: Int

Definition Classes
Tensor1DoubleSeq
Annotations
@inline()
90. #### def logpr(index: Int): Double

Definition Classes
Masses
91. #### def map(f: (Double) ⇒ Double): DoubleSeq

Definition Classes
DoubleSeq
92. #### def massTotal: Double

Definition Classes
SortedSparseCountsProportions1Masses

94. #### def max: Double

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

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

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

Definition Classes
MutableDoubleSeq
98. #### def maxToStringLength: Int

Definition Classes
Masses
99. #### def min: Double

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

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

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

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

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

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

expNormalize, then put back into log-space.

expNormalize, then put back into log-space.

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

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

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

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

Definition Classes
Tensor1Tensor
110. #### def oneNorm: Double

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

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

Definition Classes
Tensor
113. #### final def pr(i: Int): Double

Get a normalized entry in this Masses, which can be interpreted as a probability.

Get a normalized entry in this Masses, which can be interpreted as a probability.

Definition Classes
ProportionsMasses
Annotations
@inline()
114. #### def printLength: Int

Definition Classes
Tensor

116. #### def reshape(dim: Array[Int]): Tensor

Definition Classes
Tensor1

118. #### 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
MassesDoubleSeq
119. #### final def size: Int

Definition Classes
DoubleSeq
120. #### def stringPrefix: String

Definition Classes
ProportionsMassesTensor
121. #### def substitute(oldValue: Double, newValue: Double): Unit

Definition Classes
MutableDoubleSeq
122. #### def sum: Double

Definition Classes
MassesDoubleSeq
123. #### final def synchronized[T0](arg0: ⇒ T0): T0

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

With copied contents

With copied contents

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

Definition Classes
ProportionsMassesTensor → AnyRef → Any
127. #### 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
SortedSparseCountsProportions1DoubleSeq
128. #### final def twoNorm: Double

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

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

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

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

Definition Classes
133. #### final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )