class RleVectorT extends VectoT
The RleVectorT class stores and operates on compressed Numeric Vectors
of base type TimeNum.
- Alphabetic
- By Inheritance
- RleVectorT
- VectoT
- Serializable
- Serializable
- Error
- Vec
- PartiallyOrdered
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
RleVectorT(u: VectoT)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- u
the other vector
-
new
RleVectorT(dim: Int, v: ReArray[TripletT] = null)
- dim
the dimension/size of the vector (uncompressed data)
- v
the 1D array used to store vector elements
Type Members
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
def
*(s: (Int, TimeNum)): VectoT
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
- RleVectorT → VectoT
-
def
*(s: TimeNum): RleVectorT
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- RleVectorT → VectoT
-
def
*(x: RleVectorT): VectoT
Multiply 'this' vector by vector 'x'.
Multiply 'this' vector by vector 'x'.
- x
the vector to multiply by (same kind, more efficient)
-
def
*(b: VectoT): VectoT
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by (any kind)
- Definition Classes
- RleVectorT → VectoT
-
def
*=(s: TimeNum): RleVectorT
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- RleVectorT → VectoT
-
def
*=(b: VectoT): RleVectorT
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to multiply by
- Definition Classes
- RleVectorT → VectoT
-
def
+(s: (Int, TimeNum)): VectoT
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
- RleVectorT → VectoT
-
def
+(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
+(x: RleVectorT): VectoT
Add 'this' vector and vector 'b'.
-
def
+(b: VectoT): VectoT
Add 'this' vector and vector 'b'.
Add 'this' vector and vector 'b'.
- b
the vector to add (any kind)
- Definition Classes
- RleVectorT → VectoT
-
def
++(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
++(b: VectoT): VectoT
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
- RleVectorT → VectoT
-
def
++[B >: TimeNum, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: TimeNum, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: TimeNum, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike
-
def
+=(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
+=(x: RleVectorT): RleVectorT
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
-
def
+=(b: VectoT): VectoT
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
- RleVectorT → VectoT
-
def
-(s: (Int, TimeNum)): VectoT
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
- RleVectorT → VectoT
-
def
-(s: TimeNum): RleVectorT
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
- s
the scalar to subtract
- Definition Classes
- RleVectorT → VectoT
-
def
-(x: RleVectorT): VectoT
From 'this' vector subtract vector 'b'.
-
def
-(b: VectoT): VectoT
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract (any kind)
- Definition Classes
- RleVectorT → VectoT
-
def
-=(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
-=(b: VectoT): RleVectorT
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
- RleVectorT → VectoT
-
def
/(s: (Int, TimeNum)): VectoT
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
- RleVectorT → VectoT
-
def
/(s: TimeNum): RleVectorT
Divide 'this' vector by scalar 's'.
-
def
/(x: RleVectorT): VectoT
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)
-
def
/(b: VectoT): VectoT
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
- RleVectorT → VectoT
-
def
/:[B](z: B)(op: (B, TimeNum) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
/=(s: TimeNum): RleVectorT
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
- s
the scalar to divide by
- Definition Classes
- RleVectorT → VectoT
-
def
/=(b: VectoT): RleVectorT
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to divide by
- Definition Classes
- RleVectorT → VectoT
-
def
:\[B](z: B)(op: (TimeNum, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
<[B >: VectoT](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
<=[B >: VectoT](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
>[B >: VectoT](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
>=[B >: VectoT](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
_oneAt(j: Int, size: Int = dim): RleVectorT
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
- RleVectorT → VectoT
-
def
abs: RleVectorT
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
- RleVectorT → VectoT
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, TimeNum) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
apply(): IndexedSeq[TimeNum]
Get 'this' vector's entire data as an array.
Get 'this' vector's entire data as an array.
- Definition Classes
- RleVectorT → VectoT
-
def
apply(r: Range): VectorT
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
- RleVectorT → VectoT
-
def
apply(i: Int): TimeNum
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
- RleVectorT → VectoT
-
def
apply(iv: VectoI): VectoT
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
- VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
def
cnd: Double
Number of elements in the compressed vector
RleVectorTas a double. -
def
collect[B, That](pf: PartialFunction[TimeNum, B])(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[TimeNum, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
def
contains(x: TimeNum): 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
- RleVectorT → VectoT
-
def
copy: RleVectorT
Clone (make a copy) a vector from this vector.
Clone (make a copy) a vector from this vector.
- Definition Classes
- RleVectorT → VectoT
-
def
copyToArray[B >: TimeNum](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: TimeNum](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: TimeNum](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: TimeNum](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (TimeNum) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
def
countinct: Int
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
def
crange: Range
Range for the compressed storage array.
-
def
csize: Int
Return the size (number of elements) of compressed vector
RleVectorT. -
def
cumulate: VectoT
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
- RleVectorT → VectoT
-
val
dim: Int
- Definition Classes
- RleVectorT → VectoT
-
def
distinct: RleVectorT
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
def
dot(x: RleVectorT): TimeNum
Compute the dot product (or inner product) of 'this' compressed vector with compressed vector 'b'.
-
def
dot(b: VectoT): TimeNum
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
- RleVectorT → VectoT
-
def
drop(n: Int): Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (TimeNum) ⇒ Boolean): Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
- RleVectorT → VectoT → AnyRef → Any
-
def
exists(p: (TimeNum) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
expand(more: Int = dim): VectoT
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
- RleVectorT → VectoT
-
def
filter(p: (TimeNum) ⇒ Boolean): RleVectorT
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 (
Booleanfunction) to apply
- Definition Classes
- RleVectorT → TraversableLike → GenTraversableLike
-
def
filterMissing: RleVectorT
Filter out the missing elements of 'this' vector based on the predicate that 'e != noTimeNum'.
Filter out the missing elements of 'this' vector based on the predicate that 'e != noTimeNum'.
- Definition Classes
- RleVectorT → VectoT
-
def
filterNot(p: (TimeNum) ⇒ Boolean): Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterPos(p: (TimeNum) ⇒ 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 (
Booleanfunction) to apply
- Definition Classes
- RleVectorT → VectoT
-
def
filterPos2(v2: VectoT, p: (TimeNum, TimeNum) ⇒ 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
- RleVectorT → VectoT
-
def
find(p: (TimeNum) ⇒ Boolean): Option[TimeNum]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
def
flatMap[B, That](f: (TimeNum) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (TimeNum) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
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
-
def
fold[A1 >: TimeNum](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, TimeNum) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (TimeNum, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (TimeNum) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (TimeNum) ⇒ U): Unit
Iterate over 'this' vector element by element.
Iterate over 'this' vector element by element.
- f
the function to apply
- Definition Classes
- RleVectorT → VectoT → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
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
-
def
groupBy[K](f: (TimeNum) ⇒ K): Map[K, Traversable[TimeNum]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
- RleVectorT → VectoT → AnyRef → Any
-
def
head: TimeNum
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf(x: TimeNum, 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
- RleVectorT → VectoT
-
def
indexWhere(p: (TimeNum) ⇒ 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
- RleVectorT → VectoT
-
def
indices: Range
Produce the range of all indices (0 to one less than dim).
-
def
init: Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[TimeNum]]
- Definition Classes
- TraversableLike
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
- RleVectorT → VectoT
-
def
isSorted: Boolean
Determine whether 'this' vector is in sorted (ascending) order.
Determine whether 'this' vector is in sorted (ascending) order.
- Definition Classes
- RleVectorT → VectoT
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: TimeNum
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
mag: TimeNum
Find the element with the greatest magnitude in 'this' vector.
Find the element with the greatest magnitude in 'this' vector.
- Definition Classes
- VectoT
-
def
map(f: (TimeNum) ⇒ TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
map[B, That](f: (TimeNum) ⇒ B)(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max(b: VectoT): VectoT
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
- RleVectorT → VectoT
-
def
max(e: Int = dim): TimeNum
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
- RleVectorT → VectoT
-
def
max[B >: TimeNum](implicit cmp: Ordering[B]): TimeNum
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (TimeNum) ⇒ B)(implicit cmp: Ordering[B]): TimeNum
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mean: TimeNum
Compute the mean of the elements of 'this' vector.
Compute the mean of the elements of 'this' vector.
- Definition Classes
- VectoT
-
def
min(b: VectoT): VectoT
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
- RleVectorT → VectoT
-
def
min(e: Int = dim): TimeNum
Find the minimum element in 'this' vector.
Find the minimum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- RleVectorT → VectoT
-
def
min[B >: TimeNum](implicit cmp: Ordering[B]): TimeNum
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (TimeNum) ⇒ B)(implicit cmp: Ordering[B]): TimeNum
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
nd: Double
Number of elements in the vector as a TimeNum
Number of elements in the vector as a TimeNum
- Definition Classes
- VectoT
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
norm: TimeNum
Compute the Euclidean norm (2-norm) of 'this' vector.
Compute the Euclidean norm (2-norm) of 'this' vector.
- Definition Classes
- VectoT
-
def
norm1: TimeNum
Compute the Manhattan norm (1-norm) of 'this' vector.
Compute the Manhattan norm (1-norm) of 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
def
normSq: TimeNum
Compute the Euclidean norm (2-norm) squared of 'this' vector.
Compute the Euclidean norm (2-norm) squared of 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
def
normalize: RleVectorT
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
- RleVectorT → VectoT
-
def
normalize1: RleVectorT
Normalize 'this' vector to have a maximum of one.
Normalize 'this' vector to have a maximum of one.
- Definition Classes
- RleVectorT → VectoT
-
def
normalizeU: RleVectorT
Normalize 'this' vector so its length is one (unit vector).
Normalize 'this' vector so its length is one (unit vector).
- Definition Classes
- RleVectorT → VectoT
-
def
one(size: Int): RleVectorT
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
- RleVectorT → VectoT
-
def
oneAt(j: Int, size: Int = dim): RleVectorT
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
- RleVectorT → VectoT
-
def
par: ParIterable[TimeNum]
- Definition Classes
- Parallelizable
-
def
partition(p: (TimeNum) ⇒ Boolean): (Traversable[TimeNum], Traversable[TimeNum])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: TimeNum](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
pvariance: TimeNum
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
- VectoT
-
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
-
val
range: Range
Range for the storage array
Range for the storage array
- Definition Classes
- VectoT
-
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
- RleVectorT → VectoT
-
def
recip: RleVectorT
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
- RleVectorT → VectoT
-
def
reduce[A1 >: TimeNum](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: TimeNum](op: (B, TimeNum) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: TimeNum](op: (B, TimeNum) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: TimeNum](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: TimeNum](op: (TimeNum, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: TimeNum](op: (TimeNum, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse(): RleVectorT
Reverse the order of the elements in 'this' vector.
Reverse the order of the elements in 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
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
-
def
sameDimensions(b: VectoT): 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
- VectoT
-
def
scan[B >: TimeNum, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, TimeNum) ⇒ B)(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (TimeNum, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[TimeNum], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
select(basis: Array[Int]): VectoT
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
- RleVectorT → VectoT
-
def
selectEx(basis: Array[Int]): VectoT
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
- VectoT
-
def
seq: Traversable[TimeNum]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
set(u: Seq[TimeNum]): 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
- RleVectorT → VectoT
-
def
set(x: TimeNum): 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
- RleVectorT → VectoT
-
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
- VectoT
-
def
size: Int
Return the size (number of elements) of 'this' vector.
-
def
slice(from: Int, till: Int): VectorT
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
- RleVectorT → VectoT → TraversableLike → GenTraversableLike
-
def
slice(rg: Range): VectoT
Slice 'this' vector over the given range 'rg'.
Slice 'this' vector over the given range 'rg'.
- rg
the range specifying the slice
- Definition Classes
- VectoT
-
def
sliceEx(rg: Range): VectoT
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
- VectoT
-
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
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
def
span(p: (TimeNum) ⇒ Boolean): (Traversable[TimeNum], Traversable[TimeNum])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
split(k: Int): Array[VectoT]
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
- VectoT
-
def
splitAt(n: Int): (Traversable[TimeNum], Traversable[TimeNum])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sq: VectoT
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
- VectoT
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum: TimeNum
Get the sum of the elements of 'this' vector.
Get the sum of the elements of 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
def
sum[B >: TimeNum](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sumNE(i: Int): TimeNum
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
- RleVectorT → VectoT
-
def
sumPos: TimeNum
Sum the positive (> 0) elements of 'this' vector.
Sum the positive (> 0) elements of 'this' vector.
- Definition Classes
- RleVectorT → VectoT
-
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
- RleVectorT → VectoT
-
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
-
def
tail: Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[TimeNum]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (TimeNum) ⇒ Boolean): Traversable[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, TimeNum, Col[TimeNum]]): Col[TimeNum]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: TimeNum](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: TimeNum]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toDense: VectorT
Converts the compressed vector to a dense vector.
Converts the compressed vector to a dense vector.
- returns
Vector of base type
TimeNumcontaining uncompressed data
- Definition Classes
- RleVectorT → VectoT
-
def
toDouble: VectorD
Convert 'this'
RleVectorTinto aVectorD.Convert 'this'
RleVectorTinto aVectorD.- Definition Classes
- RleVectorT → VectoT
-
def
toIndexedSeq: IndexedSeq[TimeNum]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toInt: VectorI
Convert 'this'
RleVectorTinto aVectorI.Convert 'this'
RleVectorTinto aVectorI.- Definition Classes
- RleVectorT → VectoT
-
def
toIterable: Iterable[TimeNum]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[TimeNum]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toLong: VectorL
Convert 'this'
RleVectorTinto aVectorL.Convert 'this'
RleVectorTinto aVectorL.- Definition Classes
- RleVectorT → VectoT
-
def
toMap[T, U](implicit ev: <:<[TimeNum, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[TimeNum]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: TimeNum]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[TimeNum]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString: String
Convert 'this' vector to a string.
Convert 'this' vector to a string.
- Definition Classes
- RleVectorT → VectoT → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[TimeNum]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[TimeNum]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (TimeNum) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
tryCompareTo[B >: RleVectorT](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
- RleVectorT → PartiallyOrdered
-
def
unary_-(): RleVectorT
Return the negative of 'this' vector (unary minus).
Return the negative of 'this' vector (unary minus).
- Definition Classes
- RleVectorT → VectoT
-
def
unzip[A1, A2](implicit asPair: (TimeNum) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (TimeNum) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(r: Range, u: VectoT): 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
- RleVectorT → VectoT
-
def
update(r: Range, x: TimeNum): 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
- RleVectorT → VectoT
-
def
update(i: Int, x: TimeNum): 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
- RleVectorT → VectoT
-
def
variance: TimeNum
Compute the (unbiased) sample variance of the elements of 'this' vector.
Compute the (unbiased) sample variance of the elements of 'this' vector.
- Definition Classes
- VectoT
-
def
view(from: Int, until: Int): TraversableView[TimeNum, Traversable[TimeNum]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[TimeNum, Traversable[TimeNum]]
- Definition Classes
- TraversableLike
-
def
withFilter(p: (TimeNum) ⇒ Boolean): FilterMonadic[TimeNum, Traversable[TimeNum]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zero(size: Int): RleVectorT
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
- RleVectorT → VectoT
-
def
~^(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
~^=(s: TimeNum): RleVectorT
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
- RleVectorT → VectoT
-
def
∙(b: VectoT): TimeNum
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
- VectoT
-
def
≠(b: VectoT): Boolean
Compare 'this' vector with that vector 'b' for inequality.
-
def
≤(b: VectoT): 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
- VectoT
-
def
≥(b: VectoT): 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
- VectoT