Packages

class RleVectorQ extends VectoQ

The RleVectorQ class stores and operates on compressed Numeric Vectors of base type Rational.

Linear Supertypes
VectoQ, Serializable, Serializable, Error, Vec, PartiallyOrdered[VectoQ], Traversable[Rational], GenTraversable[Rational], GenericTraversableTemplate[Rational, Traversable], TraversableLike[Rational, Traversable[Rational]], GenTraversableLike[Rational, Traversable[Rational]], Parallelizable[Rational, ParIterable[Rational]], TraversableOnce[Rational], GenTraversableOnce[Rational], FilterMonadic[Rational, Traversable[Rational]], HasNewBuilder[Rational, Traversable[Rational]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RleVectorQ
  2. VectoQ
  3. Serializable
  4. Serializable
  5. Error
  6. Vec
  7. PartiallyOrdered
  8. Traversable
  9. GenTraversable
  10. GenericTraversableTemplate
  11. TraversableLike
  12. GenTraversableLike
  13. Parallelizable
  14. TraversableOnce
  15. GenTraversableOnce
  16. FilterMonadic
  17. HasNewBuilder
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RleVectorQ(u: VectoQ)

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

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

    u

    the other vector

  2. new RleVectorQ(dim: Int, v: ReArray[TripletQ] = null)

    dim

    the dimension/size of the vector (uncompressed data)

    v

    the 1D array used to store vector elements

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def *(s: Rational): RleVectorQ

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

    Definition Classes
    RleVectorQVectoQ
  2. def *(x: RleVectorQ): VectoQ

    Multiply 'this' vector by vector 'x'.

    Multiply 'this' vector by vector 'x'.

    x

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

  3. def *(b: VectoQ): VectoQ

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by (any kind)

    Definition Classes
    RleVectorQVectoQ
  4. def *=(s: Rational): RleVectorQ

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

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

    s

    the scalar to add

    Definition Classes
    RleVectorQVectoQ
  5. def *=(b: VectoQ): RleVectorQ

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

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

    b

    the vector to add

    Definition Classes
    RleVectorQVectoQ
  6. def +(s: (Int, Rational)): VectoQ

    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 subtract

    Definition Classes
    RleVectorQVectoQ
  7. def +(s: Rational): RleVectorQ

    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
    RleVectorQVectoQ
  8. def +(x: RleVectorQ): VectoQ

    Add 'this' vector and vector 'b'.

  9. def +(b: VectoQ): VectoQ

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add (any kind)

    Definition Classes
    RleVectorQVectoQ
  10. def ++(s: Rational): RleVectorQ

    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
    RleVectorQVectoQ
  11. def ++(b: VectoQ): VectoQ

    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
    RleVectorQVectoQ
  12. def ++[B >: Rational, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  13. def ++:[B >: Rational, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike
  14. def ++:[B >: Rational, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike
  15. def +=(s: Rational): RleVectorQ

    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
    RleVectorQVectoQ
  16. def +=(x: RleVectorQ): RleVectorQ

    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

  17. def +=(b: VectoQ): VectoQ

    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
    RleVectorQVectoQ
  18. def -(s: (Int, Rational)): VectoQ

    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
    RleVectorQVectoQ
  19. def -(s: Rational): RleVectorQ

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

    Definition Classes
    RleVectorQVectoQ
  20. def -(x: RleVectorQ): VectoQ

    From 'this' vector subtract vector 'b'.

  21. def -(b: VectoQ): VectoQ

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract (any kind)

    Definition Classes
    RleVectorQVectoQ
  22. def -=(s: Rational): RleVectorQ

    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 add

    Definition Classes
    RleVectorQVectoQ
  23. def -=(b: VectoQ): RleVectorQ

    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 add

    Definition Classes
    RleVectorQVectoQ
  24. def /(s: Rational): RleVectorQ

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

    Definition Classes
    RleVectorQVectoQ
  25. def /(x: RleVectorQ): VectoQ

    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)

  26. def /(b: VectoQ): VectoQ

    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
    RleVectorQVectoQ
  27. def /:[B](z: B)(op: (B, Rational) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def /=(s: Rational): RleVectorQ

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

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

    s

    the scalar to add

    Definition Classes
    RleVectorQVectoQ
  29. def /=(b: VectoQ): RleVectorQ

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

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

    b

    the vector to add

    Definition Classes
    RleVectorQVectoQ
  30. def :\[B](z: B)(op: (Rational, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def <[B >: VectoQ](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  32. def <=[B >: VectoQ](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  33. def >[B >: VectoQ](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  34. def >=[B >: VectoQ](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  35. def _oneAt(j: Int, size: Int = dim): RleVectorQ

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

    Create an compressed 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)

    Definition Classes
    RleVectorQVectoQ
  36. def abs: RleVectorQ

    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
    RleVectorQVectoQ
  37. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  38. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  39. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  40. def aggregate[B](z: ⇒ B)(seqop: (B, Rational) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def apply(): IndexedSeq[Rational]

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

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

    Definition Classes
    RleVectorQVectoQ
  42. def apply(r: Range): VectorQ

    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
    RleVectorQVectoQ
  43. def apply(i: Int): Rational

    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
    RleVectorQVectoQ
  44. 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
    RleVectorQVectoQ
  45. 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
    RleVectorQVectoQ
  46. 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
    RleVectorQVectoQ
  47. 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
    RleVectorQVectoQ
  48. 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
    RleVectorQVectoQ
  49. 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
    RleVectorQVectoQ
  50. def cnd: Double

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

  51. def collect[B, That](pf: PartialFunction[Rational, B])(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def collectFirst[B](pf: PartialFunction[Rational, B]): Option[B]
    Definition Classes
    TraversableOnce
  53. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  54. def contains(x: Rational): 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
    RleVectorQVectoQ
  55. def copy: RleVectorQ

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

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

    Definition Classes
    RleVectorQVectoQ
  56. def copyToArray[B >: Rational](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  57. def copyToArray[B >: Rational](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def copyToArray[B >: Rational](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def copyToBuffer[B >: Rational](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  60. def count(p: (Rational) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. 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
    RleVectorQVectoQ
  62. 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
    RleVectorQVectoQ
  63. 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
    RleVectorQVectoQ
  64. def countinct: Int

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

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

    Definition Classes
    RleVectorQVectoQ
  65. def crange: Range

    Range for the compressed storage array.

  66. def csize: Int

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

  67. def cumulate: VectoQ

    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
    RleVectorQVectoQ
  68. val dim: Int
    Definition Classes
    RleVectorQVectoQ
  69. def distinct: RleVectorQ

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

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

    Definition Classes
    RleVectorQVectoQ
  70. def dot(x: RleVectorQ): Rational

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

  71. def dot(b: VectoQ): Rational

    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
    RleVectorQVectoQ
  72. def drop(n: Int): Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def dropWhile(p: (Rational) ⇒ Boolean): Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  74. 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
    RleVectorQVectoQ → AnyRef → Any
  75. def exists(p: (Rational) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  76. def expand(more: Int = dim): VectoQ

    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
    RleVectorQVectoQ
  77. def filter(p: (Rational) ⇒ Boolean): RleVectorQ

    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
    RleVectorQ → TraversableLike → GenTraversableLike
  78. def filterNot(p: (Rational) ⇒ Boolean): Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def filterPos(p: (Rational) ⇒ 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
    RleVectorQVectoQ
  80. def find(p: (Rational) ⇒ Boolean): Option[Rational]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  81. 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
    RleVectorQVectoQ
  82. 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
    RleVectorQVectoQ
  83. def flatMap[B, That](f: (Rational) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  84. def flatten[B](implicit asTraversable: (Rational) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  85. 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
  86. def fold[A1 >: Rational](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def foldLeft[B](z: B)(op: (B, Rational) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def foldRight[B](z: B)(op: (Rational, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def forall(p: (Rational) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  90. def foreach[U](f: (Rational) ⇒ U): Unit

    Iterate over 'this' vector element by element.

    Iterate over 'this' vector element by element.

    f

    the function to apply

    Definition Classes
    RleVectorQVectoQ → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  91. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  92. 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

  93. def groupBy[K](f: (Rational) ⇒ K): Map[K, Traversable[Rational]]
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  95. 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
    RleVectorQVectoQ → AnyRef → Any
  96. def head: Rational
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def headOption: Option[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def indexOf(x: Rational, 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
    RleVectorQVectoQ
  99. def indexWhere(p: (Rational) ⇒ 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
    RleVectorQVectoQ
  100. 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
    VectoQ
  101. def init: Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def inits: Iterator[Traversable[Rational]]
    Definition Classes
    TraversableLike
  103. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  104. 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
    RleVectorQVectoQ
  105. def isSorted: Boolean

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

  106. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  107. def last: Rational
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def lastOption: Option[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def mag: Rational

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

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

    Definition Classes
    VectoQ
  110. def map(f: (Rational) ⇒ Rational): RleVectorQ

    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
    RleVectorQVectoQ
  111. def map[B, That](f: (Rational) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  112. def max(b: VectoQ): VectoQ

    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
    RleVectorQVectoQ
  113. def max(e: Int = dim): Rational

    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
    RleVectorQVectoQ
  114. def max[B >: Rational](implicit cmp: Ordering[B]): Rational
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def maxBy[B](f: (Rational) ⇒ B)(implicit cmp: Ordering[B]): Rational
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mean: Rational

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

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

    Definition Classes
    VectoQ
  117. def min(b: VectoQ): VectoQ

    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
    RleVectorQVectoQ
  118. def min(e: Int = dim): Rational

    Find the minimum element in 'this' vector.

    Find the minimum element in 'this' vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    RleVectorQVectoQ
  119. def min[B >: Rational](implicit cmp: Ordering[B]): Rational
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def minBy[B](f: (Rational) ⇒ B)(implicit cmp: Ordering[B]): Rational
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. val nd: Double

    Number of elements in the vector as a Rational

    Number of elements in the vector as a Rational

    Definition Classes
    VectoQ
  125. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def norm: Rational

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

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

    Definition Classes
    VectoQ
  127. def norm1: Rational

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

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

    Definition Classes
    RleVectorQVectoQ
  128. def normSq: Rational

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

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

    Definition Classes
    RleVectorQVectoQ
  129. def normalize: RleVectorQ

    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
    RleVectorQVectoQ
  130. def normalize1: RleVectorQ

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

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

    Definition Classes
    RleVectorQVectoQ
  131. def normalizeU: RleVectorQ

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

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

    Definition Classes
    RleVectorQVectoQ
  132. def one(size: Int): RleVectorQ

    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
    RleVectorQVectoQ
  133. def oneAt(j: Int, size: Int = dim): RleVectorQ

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

    Create an compressed 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)

    Definition Classes
    RleVectorQVectoQ
  134. def par: ParIterable[Rational]
    Definition Classes
    Parallelizable
  135. def partition(p: (Rational) ⇒ Boolean): (Traversable[Rational], Traversable[Rational])
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def product[B >: Rational](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def pvariance: Rational

    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
    VectoQ
  138. 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

  139. val range: Range

    Range for the storage array

    Range for the storage array

    Definition Classes
    VectoQ
  140. 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
    RleVectorQVectoQ
  141. def recip: RleVectorQ

    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
    RleVectorQVectoQ
  142. def reduce[A1 >: Rational](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def reduceLeft[B >: Rational](op: (B, Rational) ⇒ B): B
    Definition Classes
    TraversableOnce
  144. def reduceLeftOption[B >: Rational](op: (B, Rational) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def reduceOption[A1 >: Rational](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def reduceRight[B >: Rational](op: (Rational, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def reduceRightOption[B >: Rational](op: (Rational, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def repr: Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def reverse(): RleVectorQ

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

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

  151. def sameDimensions(b: VectoQ): 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
    VectoQ
  152. def scan[B >: Rational, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def scanLeft[B, That](z: B)(op: (B, Rational) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def scanRight[B, That](z: B)(op: (Rational, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Rational], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  155. def select(basis: Array[Int]): VectoQ

    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
    RleVectorQVectoQ
  156. def seq: Traversable[Rational]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  157. def set(u: Seq[Rational]): 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
    RleVectorQVectoQ
  158. def set(x: Rational): 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
    RleVectorQVectoQ
  159. 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
    VectoQ
  160. def size: Int

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

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

    Definition Classes
    VectoQVec → GenTraversableLike → TraversableOnce → GenTraversableOnce
  161. def slice(from: Int, till: Int): VectorQ

    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
    RleVectorQVectoQ → TraversableLike → GenTraversableLike
  162. 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
    RleVectorQVectoQ
  163. 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
    RleVectorQVectoQ
  164. def span(p: (Rational) ⇒ Boolean): (Traversable[Rational], Traversable[Rational])
    Definition Classes
    TraversableLike → GenTraversableLike
  165. def splitAt(n: Int): (Traversable[Rational], Traversable[Rational])
    Definition Classes
    TraversableLike → GenTraversableLike
  166. def sq: VectoQ

    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
    VectoQ
  167. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  168. def sum: Rational

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

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

    Definition Classes
    RleVectorQVectoQ
  169. def sum[B >: Rational](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def sumNE(i: Int): Rational

    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
    RleVectorQVectoQ
  171. def sumPos: Rational

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

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

    Definition Classes
    RleVectorQVectoQ
  172. 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
    RleVectorQVectoQ
  173. 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

  174. def tail: Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  175. def tails: Iterator[Traversable[Rational]]
    Definition Classes
    TraversableLike
  176. def take(n: Int): Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  177. def takeWhile(p: (Rational) ⇒ Boolean): Traversable[Rational]
    Definition Classes
    TraversableLike → GenTraversableLike
  178. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Rational, Col[Rational]]): Col[Rational]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  179. def toArray[B >: Rational](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def toBuffer[B >: Rational]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toDense: VectorQ

    Converts the compressed vector to a dense vector.

    Converts the compressed vector to a dense vector.

    returns

    Vector of base type Rational containing uncompressed data

    Definition Classes
    RleVectorQVectoQ
  182. def toDouble: VectorD

    Convert 'this' RleVectorQ into a VectorD.

    Convert 'this' RleVectorQ into a VectorD.

    Definition Classes
    RleVectorQVectoQ
  183. def toIndexedSeq: IndexedSeq[Rational]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toInt: VectorI

    Convert 'this' RleVectorQ into a VectorI.

    Convert 'this' RleVectorQ into a VectorI.

    Definition Classes
    RleVectorQVectoQ
  185. def toIterable: Iterable[Rational]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  186. def toIterator: Iterator[Rational]
    Definition Classes
    TraversableLike → GenTraversableOnce
  187. def toList: List[Rational]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def toLong: VectorL

    Convert 'this' RleVectorQ into a VectorL.

    Convert 'this' RleVectorQ into a VectorL.

    Definition Classes
    RleVectorQVectoQ
  189. def toMap[T, U](implicit ev: <:<[Rational, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toSeq: Seq[Rational]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def toSet[B >: Rational]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  192. def toStream: Stream[Rational]
    Definition Classes
    TraversableLike → GenTraversableOnce
  193. def toString: String

    Convert 'this' vector to a string.

    Convert 'this' vector to a string.

    Definition Classes
    RleVectorQVectoQ → TraversableLike → AnyRef → Any
  194. def toTraversable: Traversable[Rational]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  195. def toVector: Vector[Rational]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  196. def transpose[B](implicit asTraversable: (Rational) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  197. def tryCompareTo[B >: RleVectorQ](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
    RleVectorQ → PartiallyOrdered
  198. def unary_-(): RleVectorQ

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

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

    Definition Classes
    RleVectorQVectoQ
  199. def unzip[A1, A2](implicit asPair: (Rational) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  200. def unzip3[A1, A2, A3](implicit asTriple: (Rational) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  201. def update(r: Range, u: VectoQ): 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
    RleVectorQVectoQ
  202. def update(r: Range, x: Rational): 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
    RleVectorQVectoQ
  203. def update(i: Int, x: Rational): 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
    RleVectorQVectoQ
  204. def variance: Rational

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

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

    Definition Classes
    VectoQ
  205. def view(from: Int, until: Int): TraversableView[Rational, Traversable[Rational]]
    Definition Classes
    TraversableLike
  206. def view: TraversableView[Rational, Traversable[Rational]]
    Definition Classes
    TraversableLike
  207. def withFilter(p: (Rational) ⇒ Boolean): FilterMonadic[Rational, Traversable[Rational]]
    Definition Classes
    TraversableLike → FilterMonadic
  208. def zero(size: Int): RleVectorQ

    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
    RleVectorQVectoQ
  209. def ~^(s: Rational): RleVectorQ

    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
    RleVectorQVectoQ
  210. def ~^=(s: Rational): RleVectorQ

    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
    RleVectorQVectoQ
  211. def (b: VectoQ): Rational

    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
    VectoQ
  212. def (b: VectoQ): Boolean

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

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

    b

    that vector

    Definition Classes
    VectoQ
  213. def (b: VectoQ): 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
    VectoQ
  214. def (b: VectoQ): 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
    VectoQ