DoubleArrayBuffer

Instance Constructors

new DoubleArrayBuffer(initialCapacity: Int)
new DoubleArrayBuffer()

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++=(is: Seq[Double]): Unit
def ++=(is: Array[Double]): Unit
def +=(i: Double): Unit
def +=:(i: Double): Unit
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
DenseDoubleSeq → DoubleSeq
final def =+(a: Array[Double], f: Double): Unit

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

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

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

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

Definition Classes
Any
final def _append(elem: Double): DoubleArrayBuffer.this.type

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _appendAll(elts: TraversableOnce[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _appendAll(elts: Array[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _apply(index: Int): Double

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _array: Array[Double]

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _asArray: Array[Double]

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _asDoubleSeq: DoubleSeq

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _asSeq: IndexedSeq[Double]

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _capacityGrowthFactor: Double

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _clear(): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _considerShrinkingCapacity(): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _containsSorted(x: Double): Boolean

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _copyToArray(a: Array[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _ensureCapacity(cap: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _fill(elt: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _increment(index: Int, incr: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _indexForInsertSorted(i: Double): 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
ProtectedDoubleArrayBuffer
def _indexForInsertSortedLinear(i: Double): Int

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _indexOf(i: Double): 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
ProtectedDoubleArrayBuffer
def _indexOfSorted(i: Double): 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
ProtectedDoubleArrayBuffer
def _initialCapacity: Int

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _insert(index: Int, elt: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _insertAll(index: Int, seq: Traversable[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _insertAllSorted(seq: Traversable[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _insertSorted(elt: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _insertSortedNoDuplicates(elt: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _length: Int

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _mapToArray[A](a: Array[A], f: (Double) ⇒ A): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _prepend(elt: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _prependAll(elts: TraversableOnce[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _reduceToSize(newSize: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _remove(index: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _remove(index: Int, count: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _set(elts: Seq[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _set(elts: Array[Double]): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _setCapacity(cap: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
def _sizeHint(len: Int): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _sum: Double

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _takeAsIntSeq(len: Int): DoubleSeq

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _toArray: Array[Double]

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _toSeq: IndexedSeq[Double]

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
def _trimCapacity(): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
final def _update(index: Int, value: Double): Unit

Attributes
protected
Definition Classes
ProtectedDoubleArrayBuffer
Annotations
@inline()
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
def apply(index: Int): Double

Definition Classes
DoubleArrayBuffer → DoubleSeq
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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def asSeq: Seq[Double]

With uncopied contents
With uncopied contents

Definition Classes
DoubleSeq
def clone(): AnyRef

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

Definition Classes
DenseDoubleSeq → DoubleSeq
def containsNaN: Boolean

Definition Classes
DenseDoubleSeq → DoubleSeq
def different(t: DoubleSeq, threshold: Double): Boolean

Definition Classes
DoubleSeq
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
DoubleSeq
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def foldLeft[B](z: B)(f: (B, Double) ⇒ B): B

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

Definition Classes
DoubleSeq
def forallElements(f: (Int, Double) ⇒ Boolean): Boolean

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

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

Definition Classes
DenseDoubleSeq → DoubleSeq
def foreachElement(f: (Int, Double) ⇒ Unit): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
DenseDoubleSeq → DoubleSeq
def infinityNorm: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
def insert(index: Int, elt: Double): Unit
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
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
DoubleSeq
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
DoubleSeq
def l2Similarity(t: DoubleSeq): Double

Definition Classes
DoubleSeq
def length: Int

Definition Classes
DoubleArrayBuffer → DoubleSeq
def map(f: (Double) ⇒ Double): DoubleSeq

Definition Classes
DoubleSeq
def max: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
def maxIndex: Int

Definition Classes
DenseDoubleSeq → DoubleSeq
def maxIndex2: (Int, Int)

Definition Classes
DenseDoubleSeq → DoubleSeq
def min: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
def mkString: String

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

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def oneNorm: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
def sampleIndex(normalizer: Double)(implicit r: Random): Int

Definition Classes
DenseDoubleSeq → DoubleSeq
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
final def size: Int

Definition Classes
DoubleSeq
def sum: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
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
DoubleArrayBuffer → DenseDoubleSeq → DoubleSeq
def toSeq: IndexedSeq[Double]

With copied contents
With copied contents

Definition Classes
DoubleArrayBuffer → DoubleSeq
def toString(): String

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

Definition Classes
DoubleSeq
def twoNormSquared: Double

Definition Classes
DenseDoubleSeq → DoubleSeq
def update(index: Int, value: Double): Unit
final def wait(): Unit

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

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

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

class DoubleArrayBuffer extends ProtectedDoubleArrayBuffer with DenseDoubleSeq

Instance Constructors

new DoubleArrayBuffer(initialCapacity: Int)

new DoubleArrayBuffer()

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++=(is: Seq[Double]): Unit

def ++=(is: Array[Double]): Unit

def +=(i: Double): Unit

def +=:(i: Double): Unit

def =+(a: Array[Double], offset: Int, f: Double): Unit

final def =+(a: Array[Double], f: Double): Unit

final def =+(a: Array[Double], offset: Int): Unit

final def =+(a: Array[Double]): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def _append(elem: Double): DoubleArrayBuffer.this.type

def _appendAll(elts: TraversableOnce[Double]): Unit

def _appendAll(elts: Array[Double]): Unit

final def _apply(index: Int): Double

def _array: Array[Double]

final def _asArray: Array[Double]

def _asDoubleSeq: DoubleSeq

def _asSeq: IndexedSeq[Double]

def _capacityGrowthFactor: Double

def _clear(): Unit

def _considerShrinkingCapacity(): Unit

def _containsSorted(x: Double): Boolean

def _copyToArray(a: Array[Double]): Unit

final def _ensureCapacity(cap: Int): Unit

def _fill(elt: Double): Unit

final def _increment(index: Int, incr: Double): Unit

def _indexForInsertSorted(i: Double): Int

def _indexForInsertSortedLinear(i: Double): Int

def _indexOf(i: Double): Int

def _indexOfSorted(i: Double): Int

def _initialCapacity: Int

def _insert(index: Int, elt: Double): Unit

def _insertAll(index: Int, seq: Traversable[Double]): Unit

def _insertAllSorted(seq: Traversable[Double]): Unit

def _insertSorted(elt: Double): Unit

def _insertSortedNoDuplicates(elt: Double): Unit

final def _length: Int

def _mapToArray[A](a: Array[A], f: (Double) ⇒ A): Unit

def _prepend(elt: Double): Unit

def _prependAll(elts: TraversableOnce[Double]): Unit

def _reduceToSize(newSize: Int): Unit

def _remove(index: Int): Unit

def _remove(index: Int, count: Int): Unit

def _set(elts: Seq[Double]): Unit

def _set(elts: Array[Double]): Unit

final def _setCapacity(cap: Int): Unit

def _sizeHint(len: Int): Unit

def _sum: Double

def _takeAsIntSeq(len: Int): DoubleSeq

def _toArray: Array[Double]

def _toSeq: IndexedSeq[Double]

def _trimCapacity(): Unit

final def _update(index: Int, value: Double): Unit

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def apply(index: Int): Double

def asArray: Array[Double]

final def asInstanceOf[T0]: T0

def asSeq: Seq[Double]

def clone(): AnyRef

def contains(d: Double): Boolean

def containsNaN: Boolean

def different(t: DoubleSeq, threshold: Double): Boolean

def entropy: Double

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foldLeft[B](z: B)(f: (B, Double) ⇒ B): B

def forall(f: (Double) ⇒ Boolean): Boolean

def forallElements(f: (Int, Double) ⇒ Boolean): Boolean

def foreach(f: (Double) ⇒ Unit): Unit

def foreachActiveElement(f: (Int, Double) ⇒ Unit): Unit