Packages

class RleVectorD extends VectoD

The RleVectorD class stores and operates on compressed Numeric Vectors of base type Double.

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

Instance Constructors

  1. new RleVectorD(u: VectoD)

    Construct a vector and assign values from vector 'u'.

    Construct a vector and assign values from vector 'u'.

    u

    the other vector

  2. new RleVectorD(dim: Int, v: ReArray[TripletD] = null)

    dim

    the dimension/size of the vector (uncompressed data)

    v

    the 1D array used to store vector elements

Type Members

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def *(s: (Int, Double)): VectoD

    Multiply 'this' vector by scalar 's._2' only at position 's._1' and return the uncompressed vector

    Multiply 'this' vector by scalar 's._2' only at position 's._1' and return the uncompressed vector

    s

    the (scalar, position) to multiply by

    Definition Classes
    RleVectorDVectoD
  4. def *(s: Double): RleVectorD

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

    Definition Classes
    RleVectorDVectoD
  5. def *(x: RleVectorD): VectoD

    Multiply 'this' vector by vector 'x'.

    Multiply 'this' vector by vector 'x'.

    x

    the vector to multiply by (same kind, more efficient)

  6. def *(b: VectoD): VectoD

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by (any kind)

    Definition Classes
    RleVectorDVectoD
  7. def *=(s: Double): RleVectorD

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

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

    s

    the scalar to multiply by

    Definition Classes
    RleVectorDVectoD
  8. def *=(b: VectoD): RleVectorD

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

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

    b

    the vector to multiply by

    Definition Classes
    RleVectorDVectoD
  9. def +(s: (Int, Double)): VectoD

    From 'this' vector add scalar 's._2' only at position 's._1' and return the uncompressed vector

    From 'this' vector add scalar 's._2' only at position 's._1' and return the uncompressed vector

    s

    the (scalar, position) to add

    Definition Classes
    RleVectorDVectoD
  10. def +(s: Double): RleVectorD

    Add 'this' vector and scalar 's' and return the compressed vector

    Add 'this' vector and scalar 's' and return the compressed vector

    s

    the scalar to add

    Definition Classes
    RleVectorDVectoD
  11. def +(x: RleVectorD): VectoD

    Add 'this' vector and vector 'b'.

  12. def +(b: VectoD): VectoD

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add (any kind)

    Definition Classes
    RleVectorDVectoD
  13. def ++(s: Double): RleVectorD

    Concatenate 'this' vector and scalar 's' and return the compressed vector

    Concatenate 'this' vector and scalar 's' and return the compressed vector

    s

    the scalar to be concatenated

    Definition Classes
    RleVectorDVectoD
  14. def ++(b: VectoD): VectoD

    Concatenate 'this' vector and vector' b' and return the uncompressed vector

    Concatenate 'this' vector and vector' b' and return the uncompressed vector

    b

    the vector to be concatenated

    Definition Classes
    RleVectorDVectoD
  15. final def ++[B >: Double](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  16. def +=(s: Double): RleVectorD

    Add in-place 'this' vector and scalar 's' and return the compressed vector

    Add in-place 'this' vector and scalar 's' and return the compressed vector

    s

    the scalar to add

    Definition Classes
    RleVectorDVectoD
  17. def +=(x: RleVectorD): RleVectorD

    Add in-place 'this' vector and vector 'b' and return the compressed vector.

    Add in-place 'this' vector and vector 'b' and return the compressed vector.

    x

    the vector to add

  18. def +=(b: VectoD): VectoD

    Add in-place 'this' vector and vector 'b' and return the compressed vector.

    Add in-place 'this' vector and vector 'b' and return the compressed vector.

    b

    the vector to add

    Definition Classes
    RleVectorDVectoD
  19. def -(s: (Int, Double)): VectoD

    From 'this' vector subtract scalar 's._2' only at position 's._1' and return the uncompressed vector

    From 'this' vector subtract scalar 's._2' only at position 's._1' and return the uncompressed vector

    s

    the (scalar, position) to subtract

    Definition Classes
    RleVectorDVectoD
  20. def -(s: Double): RleVectorD

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

    Definition Classes
    RleVectorDVectoD
  21. def -(x: RleVectorD): VectoD

    From 'this' vector subtract vector 'b'.

  22. def -(b: VectoD): VectoD

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract (any kind)

    Definition Classes
    RleVectorDVectoD
  23. def -=(s: Double): RleVectorD

    Subtract in-place 'this' vector and scalar 's' and return the compressed vector

    Subtract in-place 'this' vector and scalar 's' and return the compressed vector

    s

    the scalar to subtract

    Definition Classes
    RleVectorDVectoD
  24. def -=(b: VectoD): RleVectorD

    Subtract in-place 'this' vector and vector 'b' and return the compressed vector.

    Subtract in-place 'this' vector and vector 'b' and return the compressed vector.

    b

    the vector to subtract

    Definition Classes
    RleVectorDVectoD
  25. def /(s: (Int, Double)): VectoD

    Divide 'this' vector by scalar 's._2' only at position 's._1' and return the uncompressed vector

    Divide 'this' vector by scalar 's._2' only at position 's._1' and return the uncompressed vector

    s

    the (scalar, position) to divide by

    Definition Classes
    RleVectorDVectoD
  26. def /(s: Double): RleVectorD

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

    Definition Classes
    RleVectorDVectoD
  27. def /(x: RleVectorD): VectoD

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

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

    x

    the vector to divide by (same kind, more efficient)

  28. 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 (any kind)

    Definition Classes
    RleVectorDVectoD
  29. def /=(s: Double): RleVectorD

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

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

    s

    the scalar to divide by

    Definition Classes
    RleVectorDVectoD
  30. def /=(b: VectoD): RleVectorD

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

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

    b

    the vector to divide by

    Definition Classes
    RleVectorDVectoD
  31. def <[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  32. def <=[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  33. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  34. def >[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  35. def >=[B >: VectoD](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  36. def _oneAt(j: Int, size: Int = dim): RleVectorD

    Create an compressed vector of the form (0, ...

    Create an compressed vector of the form (0, ... -1.0, ... 0) where the -1.0 is at position j.

    j

    the position to place the -1.0

    size

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

    Definition Classes
    RleVectorDVectoD
  37. def abs: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  38. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  39. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  40. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  41. def apply(): IndexedSeq[Double]

    Get 'this' vector's entire data as an array.

    Get 'this' vector's entire data as an array.

    Definition Classes
    RleVectorDVectoD
  42. def apply(r: Range): VectorD

    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

    Definition Classes
    RleVectorDVectoD
  43. def apply(i: Int): Double

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

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

    i

    the given index

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

    Definition Classes
    VectoD
  45. 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

    Definition Classes
    RleVectorDVectoD
  46. 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

    Definition Classes
    RleVectorDVectoD
  47. def argmaxPos(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

    Definition Classes
    RleVectorDVectoD
  48. 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

    Definition Classes
    RleVectorDVectoD
  49. 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

    Definition Classes
    RleVectorDVectoD
  50. def argminNeg(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

    Definition Classes
    RleVectorDVectoD
  51. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  52. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  53. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  54. def cnd: Double

    Number of elements in the compressed vector RleVectorD as a double.

  55. final def coll: RleVectorD.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  56. def collect[B](pf: PartialFunction[Double, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  57. def collectFirst[B](pf: PartialFunction[Double, B]): Option[B]
    Definition Classes
    IterableOnceOps
  58. def concat[B >: Double](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  59. 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

    Definition Classes
    RleVectorDVectoD
  60. def copy: RleVectorD

    Clone (make a copy) a vector from this vector.

    Clone (make a copy) a vector from this vector.

    Definition Classes
    RleVectorDVectoD
  61. def copyToArray[B >: Double](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  62. def copyToArray[B >: Double](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  63. def copyToArray[B >: Double](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  64. def corresponds[B](that: IterableOnce[B])(p: (Double, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  65. def count(p: (Double) => Boolean): Int
    Definition Classes
    IterableOnceOps
  66. def countNeg: Int

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

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

    Definition Classes
    RleVectorDVectoD
  67. def countPos: Int

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

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

    Definition Classes
    RleVectorDVectoD
  68. def countZero: Int

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

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

    Definition Classes
    RleVectorDVectoD
  69. def countinct: Int

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

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

    Definition Classes
    RleVectorDVectoD
  70. def crange: Range

    Range for the compressed storage array.

  71. def csize: Int

    Return the size (number of elements) of compressed vector RleVectorD.

  72. 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)

    Definition Classes
    RleVectorDVectoD
  73. val dim: Int

    Vector dimension

    Vector dimension

    Definition Classes
    RleVectorDVectoD
  74. def distinct: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  75. def dot(x: RleVectorD): Double

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

  76. 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'.

    b

    the other vector

    Definition Classes
    RleVectorDVectoD
  77. def drop(n: Int): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  78. def dropRight(n: Int): Iterable[Double]
    Definition Classes
    IterableOps
  79. def dropWhile(p: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  80. def empty: Iterable[Double]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  81. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  82. def equals(b: Any): Boolean

    Override equals to determine whether 'this' vector equals vector 'b.

    Override equals to determine whether 'this' vector equals vector 'b.

    b

    the vector to compare with this

    Definition Classes
    RleVectorDVectoD → AnyRef → Any
  83. def exists(p: (Double) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  84. 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

    Definition Classes
    RleVectorDVectoD
  85. 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
    Definition Classes
    VectoD
  86. def filter(p: (Double) => Boolean): RleVectorD

    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
    RleVectorDVectoD → IterableOps → IterableOnceOps
  87. def filterMissing: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  88. def filterNot(pred: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  89. def filterPos(p: (Double) => Boolean): IndexedSeq[Int]

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

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

    p

    the predicate (Boolean function) to apply

    Definition Classes
    RleVectorDVectoD
  90. def filterPos2(v2: VectoD, p: (Double, Double) => Boolean): IndexedSeq[(Int, Int)]

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

    Filter the elements of 'this' vector based on the predicate 'p', returning the index positions. (for thetajoin, return first vector index combine second vector index)

    v2

    the vector to compare with

    p

    the predicate (Boolean function, between two elements) to apply

    Definition Classes
    RleVectorDVectoD
  91. def find(p: (Double) => Boolean): Option[Double]
    Definition Classes
    IterableOnceOps
  92. 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

    Definition Classes
    RleVectorDVectoD
  93. 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

    Definition Classes
    RleVectorDVectoD
  94. def flatMap[B](f: (Double) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  95. def flatten[B](implicit asIterable: (Double) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  96. 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
  97. def fold[A1 >: Double](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  98. def foldLeft[B](z: B)(op: (B, Double) => B): B
    Definition Classes
    IterableOnceOps
  99. def foldRight[B](z: B)(op: (Double, B) => B): B
    Definition Classes
    IterableOnceOps
  100. def forall(p: (Double) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  101. def foreach[U](f: (Double) => U): Unit

    Iterate over 'this' vector element by element.

    Iterate over 'this' vector element by element.

    f

    the function to apply

    Definition Classes
    RleVectorDVectoD → IterableOnceOps
  102. def fromSpecific(coll: IterableOnce[Double]): Iterable[Double]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  103. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  104. def getTriplet(i: Int): Int

    Get the triplet corresponding to the element at the 'i'-th index position.

    Get the triplet corresponding to the element at the 'i'-th index position.

    i

    the given index

  105. def groupBy[K](f: (Double) => K): Map[K, Iterable[Double]]
    Definition Classes
    IterableOps
  106. def groupMap[K, B](key: (Double) => K)(f: (Double) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  107. def groupMapReduce[K, B](key: (Double) => K)(f: (Double) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  108. def grouped(size: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  109. def hashCode(): Int

    Must also override hashCode for 'this' vector to be compatible with equals.

    Must also override hashCode for 'this' vector to be compatible with equals.

    Definition Classes
    RleVectorDVectoD → AnyRef → Any
  110. def head: Double
    Definition Classes
    IterableOps
  111. def headOption: Option[Double]
    Definition Classes
    IterableOps
  112. 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

    Definition Classes
    RleVectorDVectoD
  113. 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

    Definition Classes
    RleVectorDVectoD
  114. 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
    VectoDVec
  115. def init: Iterable[Double]
    Definition Classes
    IterableOps
  116. def inits: Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  117. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  118. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  119. def isNonnegative: Boolean

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

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

    Definition Classes
    RleVectorDVectoD
  120. def isSorted: Boolean

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

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

    Definition Classes
    RleVectorDVectoD
  121. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  122. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  123. def iterator: Iterator[Double]

    Return an iterator which yields all the elements.

    Return an iterator which yields all the elements.

    Definition Classes
    RleVectorD → IterableOnce
  124. def knownSize: Int
    Definition Classes
    IterableOnce
  125. def last: Double
    Definition Classes
    IterableOps
  126. def lastOption: Option[Double]
    Definition Classes
    IterableOps
  127. def lazyZip[B](that: Iterable[B]): LazyZip2[Double, B, RleVectorD.this.type]
    Definition Classes
    Iterable
  128. def mag: Double

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

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

    Definition Classes
    VectoD
  129. def map(f: (Double) => Double): RleVectorD

    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

    Definition Classes
    RleVectorDVectoD
  130. def map[B](f: (Double) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  131. 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). I.e., the 'dim' of this Vector and 'b' should be same.

    b

    the other vector

    Definition Classes
    RleVectorDVectoD
  132. def max(e: Int = dim): Double

    Find the maximum element in 'this' compressed vector.

    Find the maximum element in 'this' compressed vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    RleVectorDVectoD
  133. def max[B >: Double](implicit ord: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  134. def maxBy[B](f: (Double) => B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  135. def maxByOption[B](f: (Double) => B)(implicit cmp: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  136. def maxOption[B >: Double](implicit ord: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  137. def mean: Double

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

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

    Definition Classes
    VectoD
  138. 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

    Definition Classes
    RleVectorDVectoD
  139. 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

    Definition Classes
    RleVectorDVectoD
  140. def min[B >: Double](implicit ord: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  141. def minBy[B](f: (Double) => B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    IterableOnceOps
  142. def minByOption[B](f: (Double) => B)(implicit cmp: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  143. def minOption[B >: Double](implicit ord: Ordering[B]): Option[Double]
    Definition Classes
    IterableOnceOps
  144. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  145. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  146. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  147. val nd: Double

    Number of elements in the vector as a Double

    Number of elements in the vector as a Double

    Definition Classes
    VectoD
  148. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  149. def newSpecificBuilder: Builder[Double, Iterable[Double]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  150. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  151. def norm: Double

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

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

    Definition Classes
    VectoD
  152. def norm1: Double

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

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

    Definition Classes
    RleVectorDVectoD
  153. def normSq: Double

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

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

    Definition Classes
    RleVectorDVectoD
  154. def normalize: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  155. def normalize1: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  156. def normalizeU: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  157. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  158. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  159. def one(size: Int): RleVectorD

    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

    Definition Classes
    RleVectorDVectoD
  160. def oneAt(j: Int, size: Int = dim): RleVectorD

    Create an compressed vector of the form (0, ...

    Create an compressed vector of the form (0, ... 1.0, ... 0) where the 1.0 is at position j.

    j

    the position to place the 1.0

    size

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

    Definition Classes
    RleVectorDVectoD
  161. def partition(p: (Double) => Boolean): (Iterable[Double], Iterable[Double])
    Definition Classes
    IterableOps
  162. def partitionMap[A1, A2](f: (Double) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  163. 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

    Definition Classes
    VectoD
  164. def product[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  165. 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.

    Definition Classes
    VectoD
  166. def qspartition(l: Int, h: Int, asc: Boolean = true): Int

    Partition function of quicksort.

    Partition function of quicksort.

    l

    the low index

    h

    the high index

    asc

    whether to sort in ascending order

  167. val range: Range

    Range for the storage array

    Range for the storage array

    Definition Classes
    VectoD
  168. def rank: VectorI

    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).

    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).

    Definition Classes
    RleVectorDVectoD
  169. def recip: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  170. def reduce[B >: Double](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  171. def reduceLeft[B >: Double](op: (B, Double) => B): B
    Definition Classes
    IterableOnceOps
  172. def reduceLeftOption[B >: Double](op: (B, Double) => B): Option[B]
    Definition Classes
    IterableOnceOps
  173. def reduceOption[B >: Double](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  174. def reduceRight[B >: Double](op: (Double, B) => B): B
    Definition Classes
    IterableOnceOps
  175. def reduceRightOption[B >: Double](op: (Double, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  176. 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

    Definition Classes
    VectoD
  177. def reverse(): RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  178. def reversed: Iterable[Double]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  179. def rle_quicksort(l: Int, h: Int, asc: Boolean = true): Unit

    Quicksort implementation for rle vectors.

    Quicksort implementation for rle vectors.

    l

    the low index

    h

    the high index

    asc

    whether to sort in ascending order

  180. 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

    Definition Classes
    VectoD
  181. 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

    Definition Classes
    VectoD
  182. def scan[B >: Double](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  183. def scanLeft[B](z: B)(op: (B, Double) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  184. def scanRight[B](z: B)(op: (Double, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  185. 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)

    Definition Classes
    RleVectorDVectoD
  186. 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)

    Definition Classes
    VectoD
  187. 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

    Definition Classes
    VectoD
  188. 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

    Definition Classes
    VectoD
  189. def set(u: IndexedSeq[Double]): Unit

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

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

    u

    the array of values to be assigned

    Definition Classes
    RleVectorDVectoD
  190. 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

    Definition Classes
    RleVectorDVectoD
  191. 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

    Definition Classes
    VectoD
  192. def size: Int

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

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

    Definition Classes
    VectoDVec → IterableOnceOps
  193. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  194. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  195. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  196. def slice(from: Int, till: Int): VectorD

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

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

    from

    the start of the slice (included)

    till

    the end of the slice (excluded)

    Definition Classes
    RleVectorDVectoD → IterableOps → IterableOnceOps
  197. 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

    Definition Classes
    VectoD
  198. 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

    Definition Classes
    VectoD
  199. def sliding(size: Int, step: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  200. def sliding(size: Int): Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  201. def sort(): Unit

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

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

    Definition Classes
    RleVectorDVectoD
  202. def sort2(): Unit

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

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

    Definition Classes
    RleVectorDVectoD
  203. def span(p: (Double) => Boolean): (Iterable[Double], Iterable[Double])
    Definition Classes
    IterableOps → IterableOnceOps
  204. 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

    Definition Classes
    VectoD
  205. 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

    Definition Classes
    VectoD
  206. 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

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

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

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

    Definition Classes
    VectoD
  209. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Double, S]): S
    Definition Classes
    IterableOnce
  210. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  211. def sum: Double

    Get the sum of the elements of 'this' vector.

    Get the sum of the elements of 'this' vector.

    Definition Classes
    RleVectorDVectoD
  212. def sum[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  213. 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

    Definition Classes
    RleVectorDVectoD
  214. def sumPos: Double

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

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

    Definition Classes
    RleVectorDVectoD
  215. 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

    Definition Classes
    RleVectorDVectoD
  216. def swap2(i: Int, j: Int): Unit

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

    Swap elements 'i' and 'j' in 'this' vector. (2nd implementation)

    i

    the first element in the swap

    j

    the second element in the swap

  217. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  218. def tail: Iterable[Double]
    Definition Classes
    IterableOps
  219. def tails: Iterator[Iterable[Double]]
    Definition Classes
    IterableOps
  220. def take(n: Int): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  221. def takeRight(n: Int): Iterable[Double]
    Definition Classes
    IterableOps
  222. def takeWhile(p: (Double) => Boolean): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  223. def tapEach[U](f: (Double) => U): Iterable[Double]
    Definition Classes
    IterableOps → IterableOnceOps
  224. def to[C1](factory: Factory[Double, C1]): C1
    Definition Classes
    IterableOnceOps
  225. def toArray[B >: Double](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  226. final def toBuffer[B >: Double]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  227. def toDense: VectorD

    Converts the compressed vector to a dense vector.

    Converts the compressed vector to a dense vector.

    returns

    Vector of base type Double containing uncompressed data

    Definition Classes
    RleVectorDVectoD
  228. def toDouble: VectorD

    Convert 'this' RleVectorD into a VectorD.

    Convert 'this' RleVectorD into a VectorD.

    Definition Classes
    RleVectorDVectoD
  229. def toIndexedSeq: IndexedSeq[Double]
    Definition Classes
    IterableOnceOps
  230. def toInt: VectorI

    Convert 'this' RleVectorD into a VectorI.

    Convert 'this' RleVectorD into a VectorI.

    Definition Classes
    RleVectorDVectoD
  231. final def toIterable: RleVectorD.this.type
    Definition Classes
    Iterable → IterableOps
  232. def toList: List[Double]
    Definition Classes
    IterableOnceOps
  233. def toLong: VectorL

    Convert 'this' RleVectorD into a VectorL.

    Convert 'this' RleVectorD into a VectorL.

    Definition Classes
    RleVectorDVectoD
  234. def toMap[K, V](implicit ev: <:<[Double, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  235. def toSeq: Seq[Double]
    Definition Classes
    IterableOnceOps
  236. def toSet[B >: Double]: Set[B]
    Definition Classes
    IterableOnceOps
  237. def toString: String

    Convert 'this' vector to a string.

    Convert 'this' vector to a string.

    Definition Classes
    RleVectorDVectoD → Iterable → AnyRef → Any
  238. def toVector: Vector[Double]
    Definition Classes
    IterableOnceOps
  239. def transpose[B](implicit asIterable: (Double) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  240. def tryCompareTo[B >: RleVectorD](b: B)(implicit view_1: (B) => PartiallyOrdered[B]): Option[Int]

    Compare 'this' vector with vector 'b'.

    Compare 'this' vector with vector 'b'.

    b

    the other vector

    Definition Classes
    RleVectorD → PartiallyOrdered
  241. def unary_-: RleVectorD

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

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

    Definition Classes
    RleVectorDVectoD
  242. def unzip[A1, A2](implicit asPair: (Double) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  243. def unzip3[A1, A2, A3](implicit asTriple: (Double) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  244. 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

    Definition Classes
    RleVectorDVectoD
  245. 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

    Definition Classes
    RleVectorDVectoD
  246. 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

    Definition Classes
    RleVectorDVectoD
  247. var v: ReArray[TripletD]
    Attributes
    protected
  248. def variance: Double

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

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

    Definition Classes
    VectoD
  249. def view: View[Double]
    Definition Classes
    IterableOps
  250. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  251. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  252. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  253. def withFilter(p: (Double) => Boolean): WithFilter[Double, Iterable]
    Definition Classes
    IterableOps
  254. def zero(size: Int): RleVectorD

    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

    Definition Classes
    RleVectorDVectoD
  255. def zip[B](that: IterableOnce[B]): Iterable[(Double, B)]
    Definition Classes
    IterableOps
  256. def zipAll[A1 >: Double, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  257. def zipWithIndex: Iterable[(Double, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  258. def ~^(s: Double): RleVectorD

    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

    Definition Classes
    RleVectorDVectoD
  259. def ~^=(s: Double): RleVectorD

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

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

    s

    the scalar exponent

    Definition Classes
    RleVectorDVectoD
  260. 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

    Definition Classes
    VectoD
  261. 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

    Definition Classes
    VectoD
  262. 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

    Definition Classes
    VectoD
  263. 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

    Definition Classes
    VectoD

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: RleVectorD.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 VectoD

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