final def !=(arg0: Any): Boolean

Definition Classes: AnyRef → Any

final def ##(): Int

Definition Classes: AnyRef → Any

def *(s: (Int, Real)): 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: RleVectorR → VectoR

def *(s: Real): RleVectorR

Multiply 'this' vector by scalar 's'.

s: the scalar to multiply by

Definition Classes: RleVectorR → VectoR

def *(x: RleVectorR): VectoR

Multiply 'this' vector by vector 'x'.

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

def *(b: VectoR): VectoR

Multiply 'this' vector by vector 'b'.

b: the vector to multiply by (any kind)

Definition Classes: RleVectorR → VectoR

def *=(s: Real): RleVectorR

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

s: the scalar to multiply by

Definition Classes: RleVectorR → VectoR

def *=(b: VectoR): RleVectorR

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

b: the vector to multiply by

Definition Classes: RleVectorR → VectoR

def +(s: (Int, Real)): 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: RleVectorR → VectoR

def +(s: Real): RleVectorR

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

s: the scalar to add

Definition Classes: RleVectorR → VectoR

def +(x: RleVectorR): VectoR

Add 'this' vector and vector 'b'.

def +(b: VectoR): VectoR

Add 'this' vector and vector 'b'.

b: the vector to add (any kind)

Definition Classes: RleVectorR → VectoR

def ++(s: Real): RleVectorR

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

s: the scalar to be concatenated

Definition Classes: RleVectorR → VectoR

def ++(b: VectoR): VectoR

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

b: the vector to be concatenated

Definition Classes: RleVectorR → VectoR

def ++[B >: Real, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike

def ++:[B >: Real, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike

def ++:[B >: Real, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike

def +=(s: Real): RleVectorR

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

s: the scalar to add

Definition Classes: RleVectorR → VectoR

def +=(x: RleVectorR): RleVectorR

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

x: the vector to add

def +=(b: VectoR): VectoR

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

b: the vector to add

Definition Classes: RleVectorR → VectoR

def -(s: (Int, Real)): 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: RleVectorR → VectoR

def -(s: Real): RleVectorR

From 'this' vector subtract scalar 's'.

s: the scalar to subtract

Definition Classes: RleVectorR → VectoR

def -(x: RleVectorR): VectoR

From 'this' vector subtract vector 'b'.

def -(b: VectoR): VectoR

From 'this' vector subtract vector 'b'.

b: the vector to subtract (any kind)

Definition Classes: RleVectorR → VectoR

def -=(s: Real): RleVectorR

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

s: the scalar to subtract

Definition Classes: RleVectorR → VectoR

def -=(b: VectoR): RleVectorR

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

b: the vector to subtract

Definition Classes: RleVectorR → VectoR

def /(s: (Int, Real)): 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: RleVectorR → VectoR

def /(s: Real): RleVectorR

Divide 'this' vector by scalar 's'.

s: the scalar to divide by

Definition Classes: RleVectorR → VectoR

def /(x: RleVectorR): VectoR

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

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

def /(b: VectoR): VectoR

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

b: the vector to divide by (any kind)

Definition Classes: RleVectorR → VectoR

def /=(s: Real): RleVectorR

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

s: the scalar to divide by

Definition Classes: RleVectorR → VectoR

def /=(b: VectoR): RleVectorR

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

b: the vector to divide by

Definition Classes: RleVectorR → VectoR

def <[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes: PartiallyOrdered

def <=[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes: PartiallyOrdered

final def ==(arg0: Any): Boolean

Definition Classes: AnyRef → Any

def >[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes: PartiallyOrdered

def >=[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes: PartiallyOrdered

def _oneAt(j: Int, size: Int = dim): RleVectorR

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: RleVectorR → VectoR

def abs: RleVectorR

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

Definition Classes: RleVectorR → VectoR

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, Real) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes: TraversableOnce → GenTraversableOnce

def apply(): IndexedSeq[Real]

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

Definition Classes: RleVectorR → VectoR

def apply(r: Range): VectorR

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

r: the given range

Definition Classes: RleVectorR → VectoR

def apply(i: Int): Real

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

i: the given index

Definition Classes: RleVectorR → VectoR

def apply(iv: VectoI): VectoR

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

iv: the index vector

Definition Classes: VectoR

def argmax(s: Int, e: Int): Int

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: RleVectorR → VectoR

def argmax(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def argmaxPos(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def argmin(s: Int, e: Int): Int

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: RleVectorR → VectoR

def argmin(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def argminNeg(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

final def asInstanceOf[T0]: T0

Definition Classes: Any

def clone(): AnyRef

Attributes: protected[lang]
Definition Classes: AnyRef
Annotations: @throws( ... ) @native() @HotSpotIntrinsicCandidate()

def cnd: Double

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

def collect[B, That](pf: PartialFunction[Real, B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike

def collectFirst[B](pf: PartialFunction[Real, B]): Option[B]

Definition Classes: TraversableOnce

def companion: GenericCompanion[Traversable]

Definition Classes: Traversable → GenTraversable → GenericTraversableTemplate

def contains(x: Real): Boolean

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

x: the element to be checked

Definition Classes: RleVectorR → VectoR

def copy: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def copyToArray[B >: Real](xs: Array[B], start: Int, len: Int): Unit

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def copyToArray[B >: Real](xs: Array[B]): Unit

Definition Classes: TraversableOnce → GenTraversableOnce

def copyToArray[B >: Real](xs: Array[B], start: Int): Unit

Definition Classes: TraversableOnce → GenTraversableOnce

def copyToBuffer[B >: Real](dest: Buffer[B]): Unit

Definition Classes: TraversableOnce

def count(p: (Real) ⇒ Boolean): Int

Definition Classes: TraversableOnce → GenTraversableOnce

def countNeg: Int

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

Definition Classes: RleVectorR → VectoR

def countPos: Int

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

Definition Classes: RleVectorR → VectoR

def countZero: Int

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

Definition Classes: RleVectorR → VectoR

def countinct: Int

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

Definition Classes: RleVectorR → VectoR

def crange: Range

Range for the compressed storage array.

def csize: Int

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

def cumulate: VectoR

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: RleVectorR → VectoR

val dim: Int

Vector dimension

Definition Classes: RleVectorR → VectoR

def distinct: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def dot(x: RleVectorR): Real

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

def dot(b: VectoR): Real

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

b: the other vector

Definition Classes: RleVectorR → VectoR

def drop(n: Int): Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def dropWhile(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

final def eq(arg0: AnyRef): Boolean

Definition Classes: AnyRef

def equals(b: Any): Boolean

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

b: the vector to compare with this

Definition Classes: RleVectorR → VectoR → AnyRef → Any

def exists(p: (Real) ⇒ Boolean): Boolean

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def expand(more: Int = dim): VectoR

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

more: the number of new elements to add

Definition Classes: RleVectorR → VectoR

val fString: String

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

Attributes: protected
Definition Classes: VectoR

def filter(p: (Real) ⇒ Boolean): RleVectorR

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

p: the predicate (Boolean function) to apply

Definition Classes: RleVectorR → VectoR → TraversableLike → GenTraversableLike

def filterMissing: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def filterNot(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def filterPos(p: (Real) ⇒ Boolean): IndexedSeq[Int]

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

p: the predicate (Boolean function) to apply

Definition Classes: RleVectorR → VectoR

def filterPos2(v2: VectoR, p: (Real, Real) ⇒ 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: RleVectorR → VectoR

def find(p: (Real) ⇒ Boolean): Option[Real]

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def firstNeg(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def firstPos(e: Int = dim): Int

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

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def flatMap[B, That](f: (Real) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike → FilterMonadic

def flatten[B](implicit asTraversable: (Real) ⇒ GenTraversableOnce[B]): Traversable[B]

Definition Classes: GenericTraversableTemplate

final def flaw(method: String, message: String): Unit

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 >: Real](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes: TraversableOnce → GenTraversableOnce

def foldLeft[B](z: B)(op: (B, Real) ⇒ B): B

Definition Classes: TraversableOnce → GenTraversableOnce

def foldRight[B](z: B)(op: (Real, B) ⇒ B): B

Definition Classes: TraversableOnce → GenTraversableOnce

def forall(p: (Real) ⇒ Boolean): Boolean

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def foreach[U](f: (Real) ⇒ U): Unit

Iterate over 'this' vector element by element.

f: the function to apply

Definition Classes: RleVectorR → VectoR → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

def genericBuilder[B]: Builder[B, Traversable[B]]

Definition Classes: GenericTraversableTemplate

final def getClass(): Class[_]

Definition Classes: AnyRef → Any
Annotations: @native() @HotSpotIntrinsicCandidate()

def getTriplet(i: Int): Int

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

i: the given index

def groupBy[K](f: (Real) ⇒ K): Map[K, Traversable[Real]]

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.

Definition Classes: RleVectorR → VectoR → AnyRef → Any

def head: Real

Definition Classes: TraversableLike → GenTraversableLike

def headOption: Option[Real]

Definition Classes: TraversableLike → GenTraversableLike

def indexOf(x: Real, e: Int = dim): Int

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: RleVectorR → VectoR

def indexWhere(p: (Real) ⇒ Boolean): Int

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

p: the predicate to check

Definition Classes: RleVectorR → VectoR

def indices: Range

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

Definition Classes: VectoR → Vec

def init: Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def inits: Iterator[Traversable[Real]]

Definition Classes: TraversableLike

def isEmpty: Boolean

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

final def isInstanceOf[T0]: Boolean

Definition Classes: Any

def isNonnegative: Boolean

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

Definition Classes: RleVectorR → VectoR

def isSorted: Boolean

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

Definition Classes: RleVectorR → VectoR

final def isTraversableAgain: Boolean

Definition Classes: TraversableLike → GenTraversableLike → GenTraversableOnce

def last: Real

Definition Classes: TraversableLike → GenTraversableLike

def lastOption: Option[Real]

Definition Classes: TraversableLike → GenTraversableLike

def mag: Real

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

Definition Classes: VectoR

def map(f: (Real) ⇒ Real): RleVectorR

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

f: the function to apply

Definition Classes: RleVectorR → VectoR

def map[B, That](f: (Real) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike → FilterMonadic

def max(b: VectoR): VectoR

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: RleVectorR → VectoR

def max(e: Int = dim): Real

Find the maximum element in 'this' compressed vector.

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def max[B >: Real](implicit cmp: Ordering[B]): Real

Definition Classes: TraversableOnce → GenTraversableOnce

def maxBy[B](f: (Real) ⇒ B)(implicit cmp: Ordering[B]): Real

Definition Classes: TraversableOnce → GenTraversableOnce

def mean: Real

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

Definition Classes: VectoR

def min(b: VectoR): VectoR

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

b: the other vector

Definition Classes: RleVectorR → VectoR

def min(e: Int = dim): Real

Find the minimum element in 'this' vector.

e: the ending index (exclusive) for the search

Definition Classes: RleVectorR → VectoR

def min[B >: Real](implicit cmp: Ordering[B]): Real

Definition Classes: TraversableOnce → GenTraversableOnce

def minBy[B](f: (Real) ⇒ B)(implicit cmp: Ordering[B]): Real

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 Real

Definition Classes: VectoR

final def ne(arg0: AnyRef): Boolean

Definition Classes: AnyRef

def newBuilder: Builder[Real, Traversable[Real]]

Attributes: protected[this]
Definition Classes: GenericTraversableTemplate → HasNewBuilder

def nonEmpty: Boolean

Definition Classes: TraversableOnce → GenTraversableOnce

def norm: Real

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

Definition Classes: VectoR

def norm1: Real

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

Definition Classes: RleVectorR → VectoR

def normSq: Real

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

Definition Classes: RleVectorR → VectoR

def normalize: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def normalize1: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def normalizeU: RleVectorR

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

Definition Classes: RleVectorR → VectoR

final def notify(): Unit

Definition Classes: AnyRef
Annotations: @native() @HotSpotIntrinsicCandidate()

final def notifyAll(): Unit

Definition Classes: AnyRef
Annotations: @native() @HotSpotIntrinsicCandidate()

def one(size: Int): RleVectorR

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

size: the size of the new vector

Definition Classes: RleVectorR → VectoR

def oneAt(j: Int, size: Int = dim): RleVectorR

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: RleVectorR → VectoR

def par: ParIterable[Real]

Definition Classes: Parallelizable

def parCombiner: Combiner[Real, ParIterable[Real]]

Attributes: protected[this]
Definition Classes: TraversableLike → Parallelizable

def partition(p: (Real) ⇒ Boolean): (Traversable[Real], Traversable[Real])

Definition Classes: TraversableLike → GenTraversableLike

def pot(b: VectoR): Real

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

b: the other vector

Definition Classes: VectoR

def product[B >: Real](implicit num: Numeric[B]): B

Definition Classes: TraversableOnce → GenTraversableOnce

def pvariance: Real

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: VectoR

def qspartition(l: Int, h: Int, asc: Boolean = true): Int

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

Definition Classes: VectoR

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

Definition Classes: RleVectorR → VectoR

def recip: RleVectorR

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

Definition Classes: RleVectorR → VectoR

def reduce[A1 >: Real](op: (A1, A1) ⇒ A1): A1

Definition Classes: TraversableOnce → GenTraversableOnce

def reduceLeft[B >: Real](op: (B, Real) ⇒ B): B

Definition Classes: TraversableOnce

def reduceLeftOption[B >: Real](op: (B, Real) ⇒ B): Option[B]

Definition Classes: TraversableOnce → GenTraversableOnce

def reduceOption[A1 >: Real](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes: TraversableOnce → GenTraversableOnce

def reduceRight[B >: Real](op: (Real, B) ⇒ B): B

Definition Classes: TraversableOnce → GenTraversableOnce

def reduceRightOption[B >: Real](op: (Real, B) ⇒ B): Option[B]

Definition Classes: TraversableOnce → GenTraversableOnce

def reorder(rnk: VectoI): VectoR

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

rnk: the given rank order

Definition Classes: VectoR

def repr: Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def reverse(): RleVectorR

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

Definition Classes: RleVectorR → VectoR

def reversed: List[Real]

Attributes: protected[this]
Definition Classes: TraversableOnce

def rle_quicksort(l: Int, h: Int, asc: Boolean = true): Unit

Quicksort implementation for rle vectors.

l: the low index
h: the high index
asc: whether to sort in ascending order

def rot(b: VectoR): Real

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: VectoR

def sameDimensions(b: VectoR): Boolean

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

b: the other vector

Definition Classes: VectoR

def scan[B >: Real, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike

def scanLeft[B, That](z: B)(op: (B, Real) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike

def scanRight[B, That](z: B)(op: (Real, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], 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.

def select(basis: Array[Int]): VectoR

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: RleVectorR → VectoR

def select(basis: VectoI): VectoR

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: VectoR

def selectEx(basis: VectoI): VectoR

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

basis: the index positions to be excluded

Definition Classes: VectoR

def selectEx(basis: Array[Int]): VectoR

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

basis: the index positions to be excluded

Definition Classes: VectoR

def seq: Traversable[Real]

Definition Classes: Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

def set(u: Seq[Real]): Unit

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

u: the array of values to be assigned

Definition Classes: RleVectorR → VectoR

def set(x: Real): Unit

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

x: the value to be assigned

Definition Classes: RleVectorR → VectoR

def setFormat(newFormat: String): Unit

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

newFormat: the new format String

Definition Classes: VectoR

def size: Int

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

Definition Classes: VectoR → Vec → GenTraversableLike → TraversableOnce → GenTraversableOnce

def sizeHintIfCheap: Int

Attributes: protected[collection]
Definition Classes: GenTraversableOnce

def slice(from: Int, till: Int): VectorR

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

from: the start of the slice (included)
till: the end of the slice (excluded)

Definition Classes: RleVectorR → VectoR → TraversableLike → GenTraversableLike

def slice(rg: Range): VectoR

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

rg: the range specifying the slice

Definition Classes: VectoR

def sliceEx(rg: Range): VectoR

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

rg: the excluded range of the slice

Definition Classes: VectoR

def sort(): Unit

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

Definition Classes: RleVectorR → VectoR

def sort2(): Unit

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

Definition Classes: RleVectorR → VectoR

def span(p: (Real) ⇒ Boolean): (Traversable[Real], Traversable[Real])

Definition Classes: TraversableLike → GenTraversableLike

def split(basis: VectoI): (VectoR, VectoR)

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: VectoR

def split(basis: Array[Int]): (VectoR, VectoR)

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: VectoR

def split(k: Int): Array[VectoR]

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: VectoR

def splitAt(n: Int): (Traversable[Real], Traversable[Real])

Definition Classes: TraversableLike → GenTraversableLike

def sq: VectoR

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

Definition Classes: VectoR

def stringPrefix: String

Definition Classes: TraversableLike → GenTraversableLike

def sum: Real

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

Definition Classes: RleVectorR → VectoR

def sum[B >: Real](implicit num: Numeric[B]): B

Definition Classes: TraversableOnce → GenTraversableOnce

def sumNE(i: Int): Real

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

i: the index of the element to skip

Definition Classes: RleVectorR → VectoR

def sumPos: Real

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

Definition Classes: RleVectorR → VectoR

def swap(i: Int, j: Int): Unit

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

i: the first element in the swap
j: the second element in the swap

Definition Classes: RleVectorR → VectoR

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

final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes: AnyRef

def tail: Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def tails: Iterator[Traversable[Real]]

Definition Classes: TraversableLike

def take(n: Int): Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def takeWhile(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes: TraversableLike → GenTraversableLike

def thisCollection: Traversable[Real]

Attributes: protected[this]
Definition Classes: TraversableLike

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Real, Col[Real]]): Col[Real]

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def toArray[B >: Real](implicit arg0: ClassTag[B]): Array[B]

Definition Classes: TraversableOnce → GenTraversableOnce

def toBuffer[B >: Real]: Buffer[B]

Definition Classes: TraversableOnce → GenTraversableOnce

def toCollection(repr: Traversable[Real]): Traversable[Real]

Attributes: protected[this]
Definition Classes: TraversableLike

def toDense: VectorR

Converts the compressed vector to a dense vector.

returns: Vector of base type Real containing uncompressed data

Definition Classes: RleVectorR → VectoR

def toDouble: VectorD

Convert 'this' RleVectorR into a VectorD.

Definition Classes: RleVectorR → VectoR

def toIndexedSeq: IndexedSeq[Real]

Definition Classes: TraversableOnce → GenTraversableOnce

def toInt: VectorI

Convert 'this' RleVectorR into a VectorI.

Definition Classes: RleVectorR → VectoR

def toIterable: Iterable[Real]

Definition Classes: TraversableOnce → GenTraversableOnce

def toIterator: Iterator[Real]

Definition Classes: TraversableLike → GenTraversableOnce

def toList: List[Real]

Definition Classes: TraversableOnce → GenTraversableOnce

def toLong: VectorL

Convert 'this' RleVectorR into a VectorL.

Definition Classes: RleVectorR → VectoR

def toMap[T, U](implicit ev: <:<[Real, (T, U)]): Map[T, U]

Definition Classes: TraversableOnce → GenTraversableOnce

def toSeq: Seq[Real]

Definition Classes: TraversableOnce → GenTraversableOnce

def toSet[B >: Real]: Set[B]

Definition Classes: TraversableOnce → GenTraversableOnce

def toStream: Stream[Real]

Definition Classes: TraversableLike → GenTraversableOnce

def toString: String

Convert 'this' vector to a string.

Definition Classes: RleVectorR → VectoR → TraversableLike → AnyRef → Any

def toTraversable: Traversable[Real]

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce
Annotations: @deprecatedOverriding( ... , "2.11.0" )

def toVector: Vector[Real]

Definition Classes: TraversableOnce → GenTraversableOnce

def transpose[B](implicit asTraversable: (Real) ⇒ 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.

def tryCompareTo[B >: RleVectorR](b: B)(implicit view_1: (B) ⇒ PartiallyOrdered[B]): Option[Int]

Compare 'this' vector with vector 'b'.

b: the other vector

Definition Classes: RleVectorR → PartiallyOrdered

def unary_-(): RleVectorR

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

Definition Classes: RleVectorR → VectoR

def unzip[A1, A2](implicit asPair: (Real) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

Definition Classes: GenericTraversableTemplate

def unzip3[A1, A2, A3](implicit asTriple: (Real) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

Definition Classes: GenericTraversableTemplate

def update(r: Range, u: VectoR): Unit

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

r: the given range
u: the vector to assign

Definition Classes: RleVectorR → VectoR

def update(r: Range, x: Real): Unit

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

r: the given range
x: the value to assign

Definition Classes: RleVectorR → VectoR

def update(i: Int, x: Real): Unit

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

i: the given index
x: the value to assign

Definition Classes: RleVectorR → VectoR

var v: ReArray[TripletR]

Attributes: protected

def variance: Real

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

Definition Classes: VectoR

def view(from: Int, until: Int): TraversableView[Real, Traversable[Real]]

Definition Classes: TraversableLike

def view: TraversableView[Real, Traversable[Real]]

Definition Classes: TraversableLike

final def wait(arg0: Long, arg1: Int): Unit

Definition Classes: AnyRef
Annotations: @throws( ... )

final def wait(arg0: Long): Unit

Definition Classes: AnyRef
Annotations: @throws( ... ) @native()

final def wait(): Unit

Definition Classes: AnyRef
Annotations: @throws( ... )

def withFilter(p: (Real) ⇒ Boolean): FilterMonadic[Real, Traversable[Real]]

Definition Classes: TraversableLike → FilterMonadic

def zero(size: Int): RleVectorR

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

size: the size of the new vector

Definition Classes: RleVectorR → VectoR

def ~^(s: Double): RleVectorR

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

s: the scalar exponent

Definition Classes: RleVectorR → VectoR

def ~^=(s: Double): RleVectorR

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

s: the scalar exponent

Definition Classes: RleVectorR → VectoR

def ∙(b: VectoR): Real

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: VectoR

def ≠(b: VectoR): Boolean

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

b: that vector

Definition Classes: VectoR

def ≤(b: VectoR): Boolean

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

b: that vector

Definition Classes: VectoR

def ≥(b: VectoR): Boolean

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

b: that vector

Definition Classes: VectoR

Packages

RleVectorR

Companion object RleVectorR

class RleVectorR extends VectoR

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from VectoR

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoR]

Inherited from Traversable[Real]

Inherited from GenTraversable[Real]

Inherited from GenericTraversableTemplate[Real, Traversable]

Inherited from TraversableLike[Real, Traversable[Real]]

Inherited from GenTraversableLike[Real, Traversable[Real]]

Inherited from Parallelizable[Real, ParIterable[Real]]

Inherited from TraversableOnce[Real]

Inherited from GenTraversableOnce[Real]

Inherited from FilterMonadic[Real, Traversable[Real]]

Inherited from HasNewBuilder[Real, Traversable[Real]]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

RleVectorR 

Companion object RleVectorR

class RleVectorR extends VectoR

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from VectoR

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoR]

Inherited from Traversable[Real]

Inherited from GenTraversable[Real]

Inherited from GenericTraversableTemplate[Real, Traversable]

Inherited from TraversableLike[Real, Traversable[Real]]

Inherited from GenTraversableLike[Real, Traversable[Real]]

Inherited from Parallelizable[Real, ParIterable[Real]]

Inherited from TraversableOnce[Real]

Inherited from GenTraversableOnce[Real]

Inherited from FilterMonadic[Real, Traversable[Real]]

Inherited from HasNewBuilder[Real, Traversable[Real]]

Inherited from AnyRef

Inherited from Any

Ungrouped

RleVectorR