cc.factorie.la

SparseBinaryTensorLike4

trait SparseBinaryTensorLike4 extends Tensor4 with ArraySparseBinaryTensor

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

Abstract Value Members

  1. abstract def dim1: Int

    Definition Classes
    Tensor4
  2. abstract def dim2: Int

    Definition Classes
    Tensor4
  3. abstract def dim3: Int

    Definition Classes
    Tensor4
  4. abstract def dim4: Int

    Definition Classes
    Tensor4

Concrete 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 *(v: Double): Tensor

    Definition Classes
    Tensor
  5. def *=(ds: DoubleSeq): Unit

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

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

    Definition Classes
    MutableDoubleSeq
  8. def +(that: Tensor): Tensor

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

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

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

    Definition Classes
    Tensor
  12. 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
  13. def +=(i: Int): Unit

    Definition Classes
    ArraySparseBinaryTensor
  14. def +=(i: Int, j: Int, k: Int, l: Int, v: Double): Unit

    Definition Classes
    Tensor4
  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 +=(ds: DoubleSeq, factor: Double): Unit

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

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

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

    Definition Classes
    IncrementableDoubleSeq
  21. def -(that: Tensor): Tensor

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

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

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

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

    Definition Classes
    IncrementableDoubleSeq
  26. def /(v: Double): Tensor

    Definition Classes
    Tensor
  27. def /=(ds: DoubleSeq): Unit

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  40. final def _append(elem: Int): SparseBinaryTensorLike4.this.type

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  49. def _capacityGrowthFactor: Double

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
    Annotations
    @inline()
  58. 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
  59. def _indexForInsertSortedLinear(i: Int): Int

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  60. 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
  61. 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
  62. 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
  63. def _initialCapacity: Int

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  81. def _sum: Int

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

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

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

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

    Attributes
    protected
    Definition Classes
    ProtectedIntArrayBuffer
  86. def _unsafeActiveDomainSize: Int

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

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

    Definition Classes
    SparseBinaryTensorSparseTensor
  89. def abs(): Unit

    Definition Classes
    MutableDoubleSeq
  90. def activeDomain: TruncatedArrayIntSeq

  91. def activeDomain1: Nothing

    Definition Classes
    SparseBinaryTensorLike4Tensor4
  92. def activeDomain2: Nothing

    Definition Classes
    SparseBinaryTensorLike4Tensor4
  93. def activeDomain3: Nothing

    Definition Classes
    SparseBinaryTensorLike4Tensor4
  94. def activeDomain4: Nothing

    Definition Classes
    SparseBinaryTensorLike4Tensor4
  95. def activeDomainSize: Int

  96. def activeDomains: Array[IntSeq]

    Definition Classes
    Tensor4Tensor
  97. def activeElements: Iterator[(Int, Double)]

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

    Definition Classes
    ArraySparseBinaryTensorDoubleSeq
    Annotations
    @inline()
  100. def apply(i: Int, j: Int, k: Int, l: Int): Double

    Definition Classes
    Tensor4
  101. 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
  102. final def asInstanceOf[T0]: T0

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

    With uncopied contents

    With uncopied contents

    Definition Classes
    DoubleSeq
  104. def blankCopy: Tensor4

    Definition Classes
    Tensor4Tensor
  105. def clone(): AnyRef

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

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  108. def containsNaN: Boolean

  109. def copy: Tensor4

    Definition Classes
    Tensor4Tensor
  110. def cosineSimilarity(t: DoubleSeq): Double

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  113. def dimensions: Array[Int]

    Definition Classes
    Tensor4Tensor
  114. def dimensionsMatch(t: Tensor): Boolean

    Definition Classes
    Tensor4Tensor
  115. def dot(v: DoubleSeq): Double

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

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

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

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

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

    Definition Classes
    Tensor
  124. def exponentiate(): Unit

    Definition Classes
    MutableDoubleSeq
  125. def finalize(): Unit

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Tensor4
    Annotations
    @inline()
  137. final def index2(i: Int): Int

    Definition Classes
    Tensor4
    Annotations
    @inline()
  138. final def index3(i: Int): Int

    Definition Classes
    Tensor4
    Annotations
    @inline()
  139. final def index4(i: Int): Int

    Definition Classes
    Tensor4
    Annotations
    @inline()
  140. def indexOf(d: Double): Int

  141. def infinityNorm: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  142. def isDense: Boolean

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

    Definition Classes
    Any
  144. def isUniform: Boolean

    Definition Classes
    Tensor
  145. 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
  146. 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
  147. def l2Similarity(t: DoubleSeq): Double

    Definition Classes
    DoubleSeq
  148. final def length: Int

    Definition Classes
    Tensor4DoubleSeq
    Annotations
    @inline()
  149. def map(f: (Double) ⇒ Double): DoubleSeq

    Definition Classes
    DoubleSeq
  150. def max: Double

  151. def maxIndex: Int

  152. def maxIndex2: (Int, Int)

    Definition Classes
    SparseDoubleSeqDoubleSeq
  153. def maxNormalize(): Unit

    Definition Classes
    MutableDoubleSeq
  154. def min: Double

  155. def mkString: String

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

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

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

    Definition Classes
    Tensor4
    Annotations
    @inline()
  159. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  160. def normalize(): Double

    Definition Classes
    MutableDoubleSeq
  161. def normalizeLogProb(): Double

    expNormalize, then put back into log-space.

    expNormalize, then put back into log-space.

    Definition Classes
    MutableDoubleSeq
  162. def normalized: Tensor

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

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

    Definition Classes
    AnyRef
  165. def numDimensions: Int

    Definition Classes
    Tensor4Tensor
  166. def oneNorm: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  167. def oneNormalize(): Double

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

    Definition Classes
    Tensor
  169. def printLength: Int

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

    Definition Classes
    SparseDoubleSeqDoubleSeq
  171. 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
  172. final def singleIndex(i: Int, j: Int, k: Int, l: Int): Int

    Definition Classes
    Tensor4
    Annotations
    @inline()
  173. final def size: Int

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

    Definition Classes
    ArraySparseBinaryTensorSparseTensor
  175. def stringPrefix: String

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

    Definition Classes
    MutableDoubleSeq
  177. def sum: Double

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

    Definition Classes
    AnyRef
  179. 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
  180. def toIntArray: Array[Int]

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

    With copied contents

    With copied contents

    Definition Classes
    DoubleSeq
  182. def toString(): String

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

    Definition Classes
    DoubleSeq
  185. def twoNormSquared: Double

    Definition Classes
    SparseDoubleSeqDoubleSeq
  186. def twoNormalize(): Double

    Definition Classes
    MutableDoubleSeq
  187. def twoSquaredNormalize(): Double

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

  189. def update(i: Int, j: Int, k: Int, l: Int, v: Double): Unit

    Definition Classes
    Tensor4
  190. final def wait(): Unit

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

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

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

Inherited from ArraySparseBinaryTensor

Inherited from ProtectedIntArrayBuffer

Inherited from SparseBinaryTensor

Inherited from SparseTensor

Inherited from SparseDoubleSeq

Inherited from Tensor4

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