Packages

trait VectoD extends Iterable[Double] with PartiallyOrdered[VectoD] with Vec with Error with Serializable

The VectoD class stores and operates on Numeric Vectors of base type Double. It follows the framework of gen.VectorN [T] and is provided for performance.

Linear Supertypes
Serializable, Error, Vec, PartiallyOrdered[VectoD], Iterable[Double], IterableFactoryDefaults[Double, Iterable], IterableOps[Double, Iterable, Iterable[Double]], IterableOnceOps[Double, Iterable, Iterable[Double]], IterableOnce[Double], AnyRef, Any
Known Subclasses
RleVectorD, SparseVectorD, VectorD
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. VectoD
  2. Serializable
  3. Error
  4. Vec
  5. PartiallyOrdered
  6. Iterable
  7. IterableFactoryDefaults
  8. IterableOps
  9. IterableOnceOps
  10. IterableOnce
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type AsPartiallyOrdered[B] = (B) => PartiallyOrdered[B]
    Definition Classes
    PartiallyOrdered

Abstract Value Members

  1. abstract def *(s: (Int, Double)): VectoD

    Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.

    Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.

    s

    the (position, scalar) to multiply

  2. abstract def *(s: Double): VectoD

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

  3. abstract def *(b: VectoD): VectoD

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by

  4. abstract def *=(s: Double): VectoD

    Multiply in-place 'this' vector and scalar 's'.

    Multiply in-place 'this' vector and scalar 's'.

    s

    the scalar to multiply by

  5. abstract def *=(b: VectoD): VectoD

    Multiply in-place 'this' vector and vector 'b'.

    Multiply in-place 'this' vector and vector 'b'.

    b

    the vector to multiply by

  6. abstract def +(s: (Int, Double)): VectoD

    Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.

    Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.

    s

    the (position, scalar) to add

  7. abstract def +(s: Double): VectoD

    Add 'this' vector and scalar 's'.

    Add 'this' vector and scalar 's'.

    s

    the scalar to add

  8. abstract def +(b: VectoD): VectoD

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add

  9. abstract def ++(s: Double): VectoD

    Concatenate 'this' vector and scalar 's'.

    Concatenate 'this' vector and scalar 's'.

    s

    the scalar to be concatenated

  10. abstract def ++(b: VectoD): VectoD

    Concatenate 'this' vector and vector' b'.

    Concatenate 'this' vector and vector' b'.

    b

    the vector to be concatenated

  11. abstract def +=(s: Double): VectoD

    Add in-place 'this' vector and scalar 's'.

    Add in-place 'this' vector and scalar 's'.

    s

    the scalar to add

  12. abstract def +=(b: VectoD): VectoD

    Add in-place 'this' vector and vector 'b'.

    Add in-place 'this' vector and vector 'b'.

    b

    the vector to add

  13. abstract def -(s: (Int, Double)): VectoD

    From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.

    From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.

    s

    the (position, scalar) to subtract

  14. abstract def -(s: Double): VectoD

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

  15. abstract def -(b: VectoD): VectoD

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract

  16. abstract def -=(s: Double): VectoD

    From 'this' vector subtract in-place scalar 's'.

    From 'this' vector subtract in-place scalar 's'.

    s

    the scalar to substract

  17. abstract def -=(b: VectoD): VectoD

    From 'this' vector subtract in-place vector 'b'.

    From 'this' vector subtract in-place vector 'b'.

    b

    the vector to subtract

  18. abstract def /(s: (Int, Double)): VectoD

    Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.

    Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.

    s

    the (position, scalar) to divide

  19. abstract def /(s: Double): VectoD

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

  20. abstract def /(b: VectoD): VectoD

    Divide 'this' vector by vector 'b' (element-by-element).

    Divide 'this' vector by vector 'b' (element-by-element).

    b

    the vector to divide by

  21. abstract def /=(s: Double): VectoD

    Divide in-place 'this' vector and scalar 's'.

    Divide in-place 'this' vector and scalar 's'.

    s

    the scalar to divide by

  22. abstract def /=(b: VectoD): VectoD

    Divide in-place 'this' vector and vector 'b'.

    Divide in-place 'this' vector and vector 'b'.

    b

    the vector to divide by

  23. abstract def _oneAt(j: Int, size: Int = dim): VectoD

    Create a vector of the form (0, ...

    Create a vector of the form (0, ... -1, ... 0) where the -1 is at position j.

    j

    the position to place the -1

    size

    the size of the vector (upper bound = size - 1)

  24. abstract def abs: VectoD

    Return the vector that is the element-wise absolute value of 'this' vector.

  25. abstract def apply(): IndexedSeq[Double]

    Get 'this' vector's entire sequence/array.

  26. abstract def apply(r: Range): VectoD

    Get 'this' vector's elements within the given range (vector slicing).

    Get 'this' vector's elements within the given range (vector slicing).

    r

    the given range

  27. abstract def apply(i: Int): Double

    Get 'this' vector's element at the 'i'-th index position.

    Get 'this' vector's element at the 'i'-th index position.

    i

    the given index

  28. abstract def argmax(s: Int, e: Int): Int

    Find the argument maximum of 'this' vector (index of maximum element).

    Find the argument maximum of 'this' vector (index of maximum element).

    s

    the starting index (inclusive) for the search

    e

    the ending index (exclusive) for the search

  29. abstract def argmax(e: Int = dim): Int

    Find the argument maximum of 'this' vector (index of maximum element).

    Find the argument maximum of 'this' vector (index of maximum element).

    e

    the ending index (exclusive) for the search

  30. abstract def argmaxPos(e: Int = dim): Int

    Return the argument maximum of 'this' vector (-1 if it's not positive).

    Return the argument maximum of 'this' vector (-1 if it's not positive).

    e

    the ending index (exclusive) for the search

  31. abstract def argmin(s: Int, e: Int): Int

    Find the argument minimum of 'this' vector (index of minimum element).

    Find the argument minimum of 'this' vector (index of minimum element).

    s

    the starting index (inclusive) for the search

    e

    the ending index (exclusive) for the search

  32. abstract def argmin(e: Int = dim): Int

    Find the argument minimum of 'this' vector (index of minimum element).

    Find the argument minimum of 'this' vector (index of minimum element).

    e

    the ending index (exclusive) for the search

  33. abstract def argminNeg(e: Int = dim): Int

    Return the argument minimum of 'this' vector (-1 if it's not negative).

    Return the argument minimum of 'this' vector (-1 if it's not negative).

    e

    the ending index (exclusive) for the search

  34. abstract def contains(x: Double): Boolean

    Determine whether 'x' is contained in 'this' vector.

    Determine whether 'x' is contained in 'this' vector.

    x

    the element to be checked

  35. abstract def copy: VectoD

    Create a copy of this Vector.

  36. abstract def countNeg: Int

    Count the number of strictly negative elements in 'this' vector.

  37. abstract def countPos: Int

    Count the number of strictly positive elements in 'this' vector.

  38. abstract def countZero: Int

    Count the number of zero elements in the 'this' vector.

  39. abstract def countinct: Int

    Count the number of distinct elements in 'this' vector.

  40. abstract def cumulate: VectoD

    Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf).

    Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf). Example: (4, 2, 3, 1) --> (4, 6, 9, 10)

  41. abstract val dim: Int

    Vector dimension

  42. abstract def distinct: VectoD

    Create a vector consisting of the distinct elements in 'this' vector.

  43. abstract def dot(b: VectoD): Double

    Compute the dot product (or inner product) of 'this' vector with vector 'b'.

    Compute the dot product (or inner product) of 'this' vector with vector 'b'. When b.dim > dim, the remaining elements in b are skipped. When b.dim < dim, an index out of bound exception is thrown.

    b

    the other vector

  44. abstract def expand(more: Int = dim): VectoD

    Expand the size (dim) of 'this' vector by 'more' elements.

    Expand the size (dim) of 'this' vector by 'more' elements.

    more

    the number of new elements to add

  45. abstract def filterMissing: VectoD

    Filter out the missing elements of 'this' vector based on the predicate that 'e != noDouble'.

  46. abstract def filterPos(p: (Double) => Boolean): IndexedSeq[Int]

    Filter the elements of 'this' vector based on the unary predicate 'p', returning the index positions.

    Filter the elements of 'this' vector based on the unary predicate 'p', returning the index positions.

    p

    the unary predicate (Boolean function) to apply

  47. abstract def filterPos2(v2: VectoD, p: (Double, Double) => Boolean): IndexedSeq[(Int, Int)]

    Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.

    Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.

    v2

    the other vector to compare with

    p

    the binary predicate (Boolean function) to apply

  48. abstract def firstNeg(e: Int = dim): Int

    Return the index of the first negative element in 'this' vector (-1 otherwise).

    Return the index of the first negative element in 'this' vector (-1 otherwise).

    e

    the ending index (exclusive) for the search

  49. abstract def firstPos(e: Int = dim): Int

    Return the index of the first positive element in 'this' vector (-1 otherwise).

    Return the index of the first positive element in 'this' vector (-1 otherwise).

    e

    the ending index (exclusive) for the search

  50. abstract def indexOf(x: Double, e: Int = dim): Int

    Return the index of the first occurrence of element 'x' in 'this' vector, or -1 if not found.

    Return the index of the first occurrence of element 'x' in 'this' vector, or -1 if not found.

    x

    the given element

    e

    the ending index (exclusive) for the search

  51. abstract def indexWhere(p: (Double) => Boolean): Int

    Find and return index of first element satisfying predicate 'p', or -1 if not found.

    Find and return index of first element satisfying predicate 'p', or -1 if not found.

    p

    the predicate to check

  52. abstract def isNonnegative: Boolean

    Check whether 'this' vector is nonnegative (has no negative elements).

  53. abstract def isSorted: Boolean

    Determine whether 'this' vector is in sorted (ascending) order.

  54. abstract def iterator: Iterator[Double]
    Definition Classes
    IterableOnce
  55. abstract def map(f: (Double) => Double): VectoD

    Map the elements of 'this' vector by applying the mapping function 'f'.

    Map the elements of 'this' vector by applying the mapping function 'f'.

    f

    the function to apply

  56. abstract def max(b: VectoD): VectoD

    Take the maximum of 'this' vector with vector 'b' (element-by element).

    Take the maximum of 'this' vector with vector 'b' (element-by element).

    b

    the other vector

  57. abstract def max(e: Int = dim): Double

    Find the maximum element in 'this' vector.

    Find the maximum element in 'this' vector.

    e

    the ending index (exclusive) for the search

  58. abstract def min(b: VectoD): VectoD

    Take the minimum of 'this' vector with vector 'b' (element-by element).

    Take the minimum of 'this' vector with vector 'b' (element-by element).

    b

    the other vector

  59. abstract def min(e: Int = dim): Double

    Find the minimum element in 'this' vector.

    Find the minimum element in 'this' vector.

    e

    the ending index (exclusive) for the search

  60. abstract def norm1: Double

    Compute the Manhattan norm (1-norm) of 'this' vector.

  61. abstract def normalize: VectoD

    Normalize 'this' vector so that it sums to one (like a probability vector).

  62. abstract def normalize1: VectoD

    Normalize 'this' vector to have a maximum of one.

  63. abstract def normalizeU: VectoD

    Normalize 'this' vector so its length is one (unit vector).

  64. abstract def one(size: Int): VectoD

    Create a one vector (all elements are one) of length 'size'.

    Create a one vector (all elements are one) of length 'size'.

    size

    the size of the new vector

  65. abstract def oneAt(j: Int, size: Int = dim): VectoD

    Create a vector of the form (0, ...

    Create a vector of the form (0, ... 1, ... 0) where the 1 is at position j.

    j

    the position to place the 1

    size

    the size of the vector (upper bound = size - 1)

  66. abstract def rank: VectoI

    Establish the rank order of the elements in 'self' vector, e.g., (8.0, 2.0, 4.0, 6.0) is (3, 0, 1, 2).

  67. abstract def recip: VectoD

    Return the vector containing the reciprocal of each element of 'this' vector.

  68. abstract def reverse(): VectoD

    Reverse the order of the elements in 'this' vector.

  69. abstract def select(basis: Array[Int]): VectoD

    Select a subset of elements of 'this' vector corresponding to a 'basis'.

    Select a subset of elements of 'this' vector corresponding to a 'basis'.

    basis

    the set of index positions (e.g., 0, 2, 5)

  70. abstract def set(u: IndexedSeq[Double]): Unit

    Set the values in 'this' vector to the values in sequence 'u'.

    Set the values in 'this' vector to the values in sequence 'u'.

    u

    the sequence of values to be assigned

  71. abstract def set(x: Double): Unit

    Set each value in 'this' vector to 'x'.

    Set each value in 'this' vector to 'x'.

    x

    the value to be assigned

  72. abstract def sort(): Unit

    Sort 'this' vector in-place in ascending (non-decreasing) order.

  73. abstract def sort2(): Unit

    Sort 'this' vector in-place in descending (non-increasing) order.

  74. abstract def sum: Double

    Sum the elements of 'this' vector.

  75. abstract def sumNE(i: Int): Double

    Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').

    Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').

    i

    the index of the element to skip

  76. abstract def sumPos: Double

    Sum the positive (> 0) elements of 'this' vector.

  77. abstract def swap(i: Int, j: Int): Unit

    Swap elements 'i' and 'j' in 'this' vector.

    Swap elements 'i' and 'j' in 'this' vector.

    i

    the first element in the swap

    j

    the second element in the swap

  78. abstract def toDense: VectorD

    Convert 'this' VectoD into a dense version.

  79. abstract def toDouble: VectoD

    Convert 'this' VectoD into a VectoD.

  80. abstract def toInt: VectoI

    Convert 'this' VectoD into a VectoI.

  81. abstract def toLong: VectoL

    Convert 'this' VectoD into a VectoL.

  82. abstract def tryCompareTo[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Option[Int]
    Definition Classes
    PartiallyOrdered
  83. abstract def unary_-: VectoD

    Return the negative of 'this' vector (unary minus).

  84. abstract def update(r: Range, u: VectoD): Unit

    Set 'this' vector's elements over the given range (vector slicing).

    Set 'this' vector's elements over the given range (vector slicing).

    r

    the given range

    u

    the vector to assign

  85. abstract def update(r: Range, x: Double): Unit

    Set 'this' vector's elements over the given range (vector slicing).

    Set 'this' vector's elements over the given range (vector slicing).

    r

    the given range

    x

    the value to assign

  86. abstract def update(i: Int, x: Double): Unit

    Set 'this' vector's element at the 'i'-th index position.

    Set 'this' vector's element at the 'i'-th index position.

    i

    the given index

    x

    the value to assign

  87. abstract def zero(size: Int): VectoD

    Create a zero vector (all elements are zero) of length 'size'.

    Create a zero vector (all elements are zero) of length 'size'.

    size

    the size of the new vector

  88. abstract def ~^(s: Double): VectoD

    Return the vector containing each element of 'this' vector raised to the s-th power.

    Return the vector containing each element of 'this' vector raised to the s-th power.

    s

    the scalar exponent

  89. abstract def ~^=(s: Double): VectoD

    Raise in-place each element of 'this' vector to the 's'-th power.

    Raise in-place each element of 'this' vector to the 's'-th power.

    s

    the scalar exponent

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: Double](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. def <[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  5. def <=[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def >[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  8. def >=[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  9. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  10. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  12. def apply(iv: VectoI): VectoD

    Get 'this' vector's elements that are given in the index vector.

    Get 'this' vector's elements that are given in the index vector.

    iv

    the index vector

  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  16. final def coll: VectoD.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  17. def collect[B](pf: PartialFunction[Double, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  18. def collectFirst[B](pf: PartialFunction[Double, B]): Option[B]
    Definition Classes
    IterableOnceOps
  19. def concat[B >: Double](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  20. def copyToArray[B >: Double](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  21. def copyToArray[B >: Double](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  22. def copyToArray[B >: Double](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  23. def corresponds[B](that: IterableOnce[B])(p: (Double, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  24. def count(p: (Double) => Boolean): Int
    Definition Classes
    IterableOnceOps
  25. def drop(n: Int): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  26. def dropRight(n: Int): Iterable[Double]
    Definition Classes
    IterableOps
  27. def dropWhile(p: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  28. def empty: Iterable[Double]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  29. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  31. def exists(p: (Double) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  32. val fString: String

    Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"

    Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"

    Attributes
    protected
  33. def filter(p: (Double) => Boolean): VectoD

    Filter the elements of 'this' vector based on the predicate 'p', returning a new vector.

    Filter the elements of 'this' vector based on the predicate 'p', returning a new vector.

    p

    the predicate (Boolean function) to apply

    Definition Classes
    VectoD → IterableOps → IterableOnceOps
  34. def filterNot(pred: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  35. def find(p: (Double) => Boolean): Option[Double]
    Definition Classes
    IterableOnceOps
  36. def flatMap[B](f: (Double) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  37. def flatten[B](implicit asIterable: (Double) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  38. final def flaw(method: String, message: String): Unit

    Show the flaw by printing the error message.

    Show the flaw by printing the error message.

    method

    the method where the error occurred

    message

    the error message

    Definition Classes
    Error
  39. def fold[A1 >: Double](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  40. def foldLeft[B](z: B)(op: (B, Double) => B): B
    Definition Classes
    IterableOnceOps
  41. def foldRight[B](z: B)(op: (Double, B) => B): B
    Definition Classes
    IterableOnceOps
  42. def forall(p: (Double) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  43. def foreach[U](f: (Double) => U): Unit
    Definition Classes
    IterableOnceOps
  44. def fromSpecific(coll: IterableOnce[Double]): Iterable[Double]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  45. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  46. def groupBy[K](f: (Double) => K): Map[K, Iterable[Double]]
    Definition Classes
    IterableOps
  47. def groupMap[K, B](key: (Double) => K)(f: (Double) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  48. def groupMapReduce[K, B](key: (Double) => K)(f: (Double) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  49. def grouped(size: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  50. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  51. def head: Double
    Definition Classes
    IterableOps
  52. def headOption: Option[Double]
    Definition Classes
    IterableOps
  53. def indices: Range

    Produce the range of all indices (0 to one less than dim).

    Produce the range of all indices (0 to one less than dim).

    Definition Classes
    VectoD → Vec
  54. def init: Iterable[Double]
    Definition Classes
    IterableOps
  55. def inits: Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  56. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  57. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  58. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  59. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  60. def knownSize: Int
    Definition Classes
    IterableOnce
  61. def last: Double
    Definition Classes
    IterableOps
  62. def lastOption: Option[Double]
    Definition Classes
    IterableOps
  63. def lazyZip[B](that: Iterable[B]): LazyZip2[Double, B, VectoD.this.type]
    Definition Classes
    Iterable
  64. def mag: Double

    Find the element with the greatest magnitude in 'this' vector.

  65. def map[B](f: (Double) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  66. def max[B >: Double](implicit ord: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  67. def maxBy[B](f: (Double) => B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  68. def maxByOption[B](f: (Double) => B)(implicit cmp: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  69. def maxOption[B >: Double](implicit ord: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  70. def mean: Double

    Compute the mean of the elements of 'this' vector.

  71. def min[B >: Double](implicit ord: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  72. def minBy[B](f: (Double) => B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  73. def minByOption[B](f: (Double) => B)(implicit cmp: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  74. def minOption[B >: Double](implicit ord: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  75. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  76. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  77. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  78. val nd: Double

    Number of elements in the vector as a Double

  79. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  80. def newSpecificBuilder: Builder[Double, Iterable[Double]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  81. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  82. def norm: Double

    Compute the Euclidean norm (2-norm) of 'this' vector.

  83. def normSq: Double

    Compute the Euclidean norm (2-norm) squared of 'this' vector.

  84. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  86. def partition(p: (Double) => Boolean): (Iterable[Double], Iterable[Double])
    Definition Classes
    IterableOps
  87. def partitionMap[A1, A2](f: (Double) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  88. def pot(b: VectoD): Double

    Compute the dot product (or inner product) of 'this' vector with vector 'b' zero-padded.

    Compute the dot product (or inner product) of 'this' vector with vector 'b' zero-padded.

    b

    the other vector

  89. def product[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  90. def pvariance: Double

    Compute the population variance of the elements of 'this' vector.

    Compute the population variance of the elements of 'this' vector. This is also the (biased) MLE estimator for sample variance.

  91. val range: Range

    Range for the storage array

  92. def reduce[B >: Double](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  93. def reduceLeft[B >: Double](op: (B, Double) => B): B
    Definition Classes
    IterableOnceOps
  94. def reduceLeftOption[B >: Double](op: (B, Double) => B): Option[B]
    Definition Classes
    IterableOnceOps
  95. def reduceOption[B >: Double](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  96. def reduceRight[B >: Double](op: (Double, B) => B): B
    Definition Classes
    IterableOnceOps
  97. def reduceRightOption[B >: Double](op: (Double, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  98. def reorder(rnk: VectoI): VectoD

    Return the elements in 'this' vector in the given rank order 'rnk'.

    Return the elements in 'this' vector in the given rank order 'rnk'.

    rnk

    the given rank order

  99. def reversed: Iterable[Double]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  100. def rot(b: VectoD)(from: Int = b.dim - 1): Double

    Compute the dot product (or inner product) of 'this' vector with vector 'b' reversed.

    Compute the dot product (or inner product) of 'this' vector with vector 'b' reversed. zero-padded and reversed.

    b

    the other vector

  101. def sameDimensions(b: VectoD): Boolean

    Check whether the other vector 'b' is at least as long as 'this' vector.

    Check whether the other vector 'b' is at least as long as 'this' vector.

    b

    the other vector

  102. def scan[B >: Double](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  103. def scanLeft[B](z: B)(op: (B, Double) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  104. def scanRight[B](z: B)(op: (Double, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  105. def select(basis: VectoI): VectoD

    Select a subset of elements of 'this' vector corresponding to a 'basis'.

    Select a subset of elements of 'this' vector corresponding to a 'basis'.

    basis

    the set of index positions (e.g., 0, 2, 5)

  106. def selectEx(basis: VectoI): VectoD

    Select all elements of 'this' vector excluding ones in the 'basis'.

    Select all elements of 'this' vector excluding ones in the 'basis'.

    basis

    the index positions to be excluded

  107. def selectEx(basis: Array[Int]): VectoD

    Select all elements of 'this' vector excluding ones in the 'basis'.

    Select all elements of 'this' vector excluding ones in the 'basis'.

    basis

    the index positions to be excluded

  108. def setFormat(newFormat: String): Unit

    Set the format to the 'newFormat' (e.g., "%.6g,\t" or "%12.6g,\t").

    Set the format to the 'newFormat' (e.g., "%.6g,\t" or "%12.6g,\t").

    newFormat

    the new format String

  109. def size: Int

    Return the size (number of elements) of 'this' vector.

    Return the size (number of elements) of 'this' vector.

    Definition Classes
    VectoD → Vec → IterableOnceOps
  110. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  111. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  112. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  113. def slice(rg: Range): VectoD

    Slice 'this' vector over the given range 'rg'.

    Slice 'this' vector over the given range 'rg'.

    rg

    the range specifying the slice

  114. def slice(from: Int, till: Int = dim): VectoD

    Slice 'this' vector 'from' to 'end'.

    Slice 'this' vector 'from' to 'end'. Override in implementing classes.

    from

    the start of the slice (included)

    till

    the end of the slice (excluded)

    Definition Classes
    VectoD → IterableOps → IterableOnceOps
  115. def sliceEx(rg: Range): VectoD

    Slice 'this' vector excluding the given range 'rg'.

    Slice 'this' vector excluding the given range 'rg'.

    rg

    the excluded range of the slice

  116. def sliding(size: Int, step: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  117. def sliding(size: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  118. def span(p: (Double) => Boolean): (Iterable[Double], Iterable[Double])
    Definition Classes
    IterableOps → IterableOnceOps
  119. def split(basis: VectoI): (VectoD, VectoD)

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    basis

    the index positions to be included/excluded

  120. def split(basis: Array[Int]): (VectoD, VectoD)

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    basis

    the index positions to be included/excluded

  121. def split(k: Int): Array[VectoD]

    Split 'this' vector into 'k' arrays of equal sizes (perhaps except for the last one).

    Split 'this' vector into 'k' arrays of equal sizes (perhaps except for the last one).

    k

    the number of pieces the vector is to be split into

  122. def splitAt(n: Int): (Iterable[Double], Iterable[Double])
    Definition Classes
    IterableOps → IterableOnceOps
  123. def sq: VectoD

    Return the vector containing the square of each element of 'this' vector.

  124. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Double, S]): S
    Definition Classes
    IterableOnce
  125. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  126. def sum[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  127. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  128. def tail: Iterable[Double]
    Definition Classes
    IterableOps
  129. def tails: Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  130. def take(n: Int): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  131. def takeRight(n: Int): Iterable[Double]
    Definition Classes
    IterableOps
  132. def takeWhile(p: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  133. def tapEach[U](f: (Double) => U): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def to[C1](factory: Factory[Double, C1]): C1
    Definition Classes
    IterableOnceOps
  135. def toArray[B >: Double](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  136. final def toBuffer[B >: Double]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  137. def toIndexedSeq: IndexedSeq[Double]
    Definition Classes
    IterableOnceOps
  138. final def toIterable: VectoD.this.type
    Definition Classes
    Iterable → IterableOps
  139. def toList: List[Double]
    Definition Classes
    IterableOnceOps
  140. def toMap[K, V](implicit ev: <:<[Double, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  141. def toSeq: Seq[Double]
    Definition Classes
    IterableOnceOps
  142. def toSet[B >: Double]: Set[B]
    Definition Classes
    IterableOnceOps
  143. def toString(): String
    Definition Classes
    Iterable → AnyRef → Any
  144. def toVector: Vector[Double]
    Definition Classes
    IterableOnceOps
  145. def transpose[B](implicit asIterable: (Double) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  146. def unzip[A1, A2](implicit asPair: (Double) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  147. def unzip3[A1, A2, A3](implicit asTriple: (Double) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  148. def variance: Double

    Compute the (unbiased) sample variance of the elements of 'this' vector.

  149. def view: View[Double]
    Definition Classes
    IterableOps
  150. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  151. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  153. def withFilter(p: (Double) => Boolean): WithFilter[Double, Iterable]
    Definition Classes
    IterableOps
  154. def zip[B](that: IterableOnce[B]): Iterable[(Double, B)]
    Definition Classes
    IterableOps
  155. def zipAll[A1 >: Double, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  156. def zipWithIndex: Iterable[(Double, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  157. def ∙(b: VectoD): Double

    Compute the dot product (or inner product) of 'this' vector with vector 'b'.

    Compute the dot product (or inner product) of 'this' vector with vector 'b'. When b.dim > dim, the remaining elements in b are skipped. When b.dim < dim, an index out of bound exception is thrown.

    b

    the other vector

  158. def ≠(b: VectoD): Boolean

    Compare 'this' vector with that vector 'b' for inequality.

    Compare 'this' vector with that vector 'b' for inequality.

    b

    that vector

  159. def ≤(b: VectoD): Boolean

    Compare 'this' vector with that vector 'b' for less than or equal to.

    Compare 'this' vector with that vector 'b' for less than or equal to.

    b

    that vector

  160. def ≥(b: VectoD): Boolean

    Compare 'this' vector with that vector 'b' for greater than or equal to.

    Compare 'this' vector with that vector 'b' for greater than or equal to.

    b

    that vector

Deprecated Value Members

  1. def ++:[B >: Double](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. final def /:[B](z: B)(op: (B, Double) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. final def :\[B](z: B)(op: (Double, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  4. def aggregate[B](z: => B)(seqop: (B, Double) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  5. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  6. final def copyToBuffer[B >: Double](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  7. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  8. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  9. final def repr: Iterable[Double]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  10. def seq: VectoD.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterator: Iterator[Double]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  12. final def toStream: Stream[Double]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  13. final def toTraversable: Traversable[Double]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  14. def view(from: Int, until: Int): View[Double]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoD]

Inherited from Iterable[Double]

Inherited from IterableFactoryDefaults[Double, Iterable]

Inherited from IterableOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnceOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnce[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped