class RleVectorI extends VectoI
The RleVectorI
class stores and operates on compressed Numeric Vectors
of base type Int
.
- Alphabetic
- By Inheritance
- RleVectorI
- VectoI
- Serializable
- Error
- Vec
- PartiallyOrdered
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new RleVectorI(u: VectoI)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- u
the other vector
- new RleVectorI(dim: Int, v: ReArray[TripletI] = null)
- dim
the dimension/size of the vector (uncompressed data)
- v
the 1D array used to store vector elements
Type Members
- type AsPartiallyOrdered[B] = (B) => PartiallyOrdered[B]
- Definition Classes
- PartiallyOrdered
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def *(s: (Int, Int)): VectoI
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
- RleVectorI → VectoI
- def *(s: Int): RleVectorI
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- RleVectorI → VectoI
- def *(x: RleVectorI): VectoI
Multiply 'this' vector by vector 'x'.
Multiply 'this' vector by vector 'x'.
- x
the vector to multiply by (same kind, more efficient)
- def *(b: VectoI): VectoI
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by (any kind)
- Definition Classes
- RleVectorI → VectoI
- def *=(s: Int): RleVectorI
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- RleVectorI → VectoI
- def *=(b: VectoI): RleVectorI
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to multiply by
- Definition Classes
- RleVectorI → VectoI
- def +(s: (Int, Int)): VectoI
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
- RleVectorI → VectoI
- def +(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def +(x: RleVectorI): VectoI
Add 'this' vector and vector 'b'.
- def +(b: VectoI): VectoI
Add 'this' vector and vector 'b'.
- def ++(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def ++(b: VectoI): VectoI
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
- RleVectorI → VectoI
- final def ++[B >: Int](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def +=(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def +=(x: RleVectorI): RleVectorI
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: VectoI): VectoI
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
- RleVectorI → VectoI
- def -(s: (Int, Int)): VectoI
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
- RleVectorI → VectoI
- def -(s: Int): RleVectorI
From 'this' vector subtract scalar 's'.
- def -(x: RleVectorI): VectoI
From 'this' vector subtract vector 'b'.
- def -(b: VectoI): VectoI
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract (any kind)
- Definition Classes
- RleVectorI → VectoI
- def -=(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def -=(b: VectoI): RleVectorI
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
- RleVectorI → VectoI
- def /(s: (Int, Int)): VectoI
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
- RleVectorI → VectoI
- def /(s: Int): RleVectorI
Divide 'this' vector by scalar 's'.
- def /(x: RleVectorI): VectoI
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: VectoI): VectoI
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
- RleVectorI → VectoI
- def /=(s: Int): RleVectorI
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
- s
the scalar to divide by
- Definition Classes
- RleVectorI → VectoI
- def /=(b: VectoI): RleVectorI
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to divide by
- Definition Classes
- RleVectorI → VectoI
- def <[B >: VectoI](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def <=[B >: VectoI](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def >[B >: VectoI](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def >=[B >: VectoI](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def _oneAt(j: Int, size: Int = dim): RleVectorI
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
- RleVectorI → VectoI
- def abs: RleVectorI
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
- RleVectorI → VectoI
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def apply(): IndexedSeq[Int]
Get 'this' vector's entire data as an array.
Get 'this' vector's entire data as an array.
- Definition Classes
- RleVectorI → VectoI
- def apply(r: Range): VectorI
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
- RleVectorI → VectoI
- def apply(i: Int): Int
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
- RleVectorI → VectoI
- def apply(iv: VectoI): VectoI
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
- VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def cnd: Double
Number of elements in the compressed vector
RleVectorI
as a double. - final def coll: RleVectorI.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Int, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: Int](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def contains(x: Int): 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
- RleVectorI → VectoI
- def copy: RleVectorI
Clone (make a copy) a vector from this vector.
Clone (make a copy) a vector from this vector.
- Definition Classes
- RleVectorI → VectoI
- def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Int](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: Int](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Int) => Boolean): Int
- Definition Classes
- IterableOnceOps
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- def countinct: Int
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def crange: Range
Range for the compressed storage array.
- def csize: Int
Return the size (number of elements) of compressed vector
RleVectorI
. - def cumulate: VectoI
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
- RleVectorI → VectoI
- val dim: Int
Vector dimension
Vector dimension
- Definition Classes
- RleVectorI → VectoI
- def distinct: RleVectorI
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def dot(x: RleVectorI): Int
Compute the dot product (or inner product) of 'this' compressed vector with compressed vector 'b'.
- def dot(b: VectoI): Int
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
- RleVectorI → VectoI
- def drop(n: Int): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[Int]
- Definition Classes
- IterableOps
- def dropWhile(p: (Int) => Boolean): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[Int]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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
- RleVectorI → VectoI → AnyRef → Any
- def exists(p: (Int) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def expand(more: Int = dim): VectoI
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
- RleVectorI → VectoI
- val fString: String
Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"
Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"
- Attributes
- protected
- Definition Classes
- VectoI
- def filter(p: (Int) => Boolean): RleVectorI
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
- RleVectorI → VectoI → IterableOps → IterableOnceOps
- def filterMissing: RleVectorI
Filter out the missing elements of 'this' vector based on the predicate that 'e != noInt'.
Filter out the missing elements of 'this' vector based on the predicate that 'e != noInt'.
- Definition Classes
- RleVectorI → VectoI
- def filterNot(pred: (Int) => Boolean): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterPos(p: (Int) => 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
- RleVectorI → VectoI
- def filterPos2(v2: VectoI, p: (Int, Int) => 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
- RleVectorI → VectoI
- def find(p: (Int) => Boolean): Option[Int]
- Definition Classes
- IterableOnceOps
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- def flatMap[B](f: (Int) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Int) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- 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 >: Int](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Int) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Int, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Int) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Int) => U): Unit
Iterate over 'this' vector element by element.
Iterate over 'this' vector element by element.
- f
the function to apply
- Definition Classes
- RleVectorI → VectoI → IterableOnceOps
- def fromSpecific(coll: IterableOnce[Int]): Iterable[Int]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- 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.
Get the triplet corresponding to the element at the 'i'-th index position.
- i
the given index
- def groupBy[K](f: (Int) => K): Map[K, Iterable[Int]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[Int]]
- Definition Classes
- IterableOps
- 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
- RleVectorI → VectoI → AnyRef → Any
- def head: Int
- Definition Classes
- IterableOps
- def headOption: Option[Int]
- Definition Classes
- IterableOps
- def indexOf(x: Int, 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
- RleVectorI → VectoI
- def indexWhere(p: (Int) => 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
- RleVectorI → VectoI
- def indices: Range
Produce the range of all indices (0 to one less than dim).
- def init: Iterable[Int]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[Int]]
- Definition Classes
- IterableOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- RleVectorI → VectoI
- def isSorted: Boolean
Determine whether 'this' vector is in sorted (ascending) order.
Determine whether 'this' vector is in sorted (ascending) order.
- Definition Classes
- RleVectorI → VectoI
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator: Iterator[Int]
Return an iterator which yields all the elements.
Return an iterator which yields all the elements.
- Definition Classes
- RleVectorI → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: Int
- Definition Classes
- IterableOps
- def lastOption: Option[Int]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, RleVectorI.this.type]
- Definition Classes
- Iterable
- def mag: Int
Find the element with the greatest magnitude in 'this' vector.
Find the element with the greatest magnitude in 'this' vector.
- Definition Classes
- VectoI
- def map(f: (Int) => Int): RleVectorI
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
- RleVectorI → VectoI
- def map[B](f: (Int) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max(b: VectoI): VectoI
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
- RleVectorI → VectoI
- def max(e: Int = dim): Int
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
- RleVectorI → VectoI
- def max[B >: Int](implicit ord: Ordering[B]): Int
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
- Definition Classes
- IterableOnceOps
- def mean: Double
Compute the mean of the elements of 'this' vector.
Compute the mean of the elements of 'this' vector.
- Definition Classes
- VectoI
- def min(b: VectoI): VectoI
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
- RleVectorI → VectoI
- def min(e: Int = dim): Int
Find the minimum element in 'this' vector.
Find the minimum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- RleVectorI → VectoI
- def min[B >: Int](implicit ord: Ordering[B]): Int
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- val nd: Double
Number of elements in the vector as a Int
Number of elements in the vector as a Int
- Definition Classes
- VectoI
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Int, Iterable[Int]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def norm: Int
Compute the Euclidean norm (2-norm) of 'this' vector.
Compute the Euclidean norm (2-norm) of 'this' vector.
- Definition Classes
- VectoI
- def norm1: Int
Compute the Manhattan norm (1-norm) of 'this' vector.
Compute the Manhattan norm (1-norm) of 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def normSq: Int
Compute the Euclidean norm (2-norm) squared of 'this' vector.
Compute the Euclidean norm (2-norm) squared of 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def normalize: RleVectorI
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
- RleVectorI → VectoI
- def normalize1: RleVectorI
Normalize 'this' vector to have a maximum of one.
Normalize 'this' vector to have a maximum of one.
- Definition Classes
- RleVectorI → VectoI
- def normalizeU: RleVectorI
Normalize 'this' vector so its length is one (unit vector).
Normalize 'this' vector so its length is one (unit vector).
- Definition Classes
- RleVectorI → VectoI
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def one(size: Int): RleVectorI
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
- RleVectorI → VectoI
- def oneAt(j: Int, size: Int = dim): RleVectorI
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
- RleVectorI → VectoI
- def partition(p: (Int) => Boolean): (Iterable[Int], Iterable[Int])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def pot(b: VectoI): Int
Compute the dot product (or inner product) of 'this' vector with vector 'b' zero-padded.
Compute the dot product (or inner product) of 'this' vector with vector 'b' zero-padded.
- b
the other vector
- Definition Classes
- VectoI
- def product[B >: Int](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def pvariance: Double
Compute the population variance of the elements of 'this' vector.
Compute the population variance of the elements of 'this' vector. This is also the (biased) MLE estimator for sample variance.
- Definition Classes
- VectoI
- 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
- VectoI
- 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
- RleVectorI → VectoI
- def recip: RleVectorI
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
- RleVectorI → VectoI
- def reduce[B >: Int](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Int](op: (B, Int) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Int](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Int](op: (Int, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reorder(rnk: VectoI): VectoI
Return the elements in 'this' vector in the given rank order 'rnk'.
Return the elements in 'this' vector in the given rank order 'rnk'.
- rnk
the given rank order
- Definition Classes
- VectoI
- def reverse(): RleVectorI
Reverse the order of the elements in 'this' vector.
Reverse the order of the elements in 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def reversed: Iterable[Int]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- 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 rot(b: VectoI)(from: Int = b.dim - 1): Int
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
- VectoI
- def sameDimensions(b: VectoI): 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
- VectoI
- def scan[B >: Int](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Int) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Int, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def select(basis: Array[Int]): VectoI
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
- RleVectorI → VectoI
- def select(basis: VectoI): VectoI
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
- VectoI
- def selectEx(basis: VectoI): VectoI
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
- VectoI
- def selectEx(basis: Array[Int]): VectoI
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
- VectoI
- def set(u: Seq[Int]): 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
- RleVectorI → VectoI
- def set(x: Int): 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
- RleVectorI → VectoI
- 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
- VectoI
- def size: Int
Return the size (number of elements) of 'this' vector.
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, till: Int): VectorI
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
- RleVectorI → VectoI → IterableOps → IterableOnceOps
- def slice(rg: Range): VectoI
Slice 'this' vector over the given range 'rg'.
Slice 'this' vector over the given range 'rg'.
- rg
the range specifying the slice
- Definition Classes
- VectoI
- def sliceEx(rg: Range): VectoI
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
- VectoI
- def sliding(size: Int, step: Int): Iterator[Iterable[Int]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[Int]]
- Definition Classes
- IterableOps
- 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
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- def span(p: (Int) => Boolean): (Iterable[Int], Iterable[Int])
- Definition Classes
- IterableOps → IterableOnceOps
- def split(basis: VectoI): (VectoI, VectoI)
Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.
Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.
- basis
the index positions to be included/excluded
- Definition Classes
- VectoI
- def split(basis: Array[Int]): (VectoI, VectoI)
Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.
Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.
- basis
the index positions to be included/excluded
- Definition Classes
- VectoI
- def split(k: Int): Array[VectoI]
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
- VectoI
- def splitAt(n: Int): (Iterable[Int], Iterable[Int])
- Definition Classes
- IterableOps → IterableOnceOps
- def sq: VectoI
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
- VectoI
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum: Int
Get the sum of the elements of 'this' vector.
Get the sum of the elements of 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- def sum[B >: Int](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def sumNE(i: Int): Int
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
- RleVectorI → VectoI
- def sumPos: Int
Sum the positive (> 0) elements of 'this' vector.
Sum the positive (> 0) elements of 'this' vector.
- Definition Classes
- RleVectorI → VectoI
- 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
- RleVectorI → VectoI
- 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: Iterable[Int]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[Int]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[Int]
- Definition Classes
- IterableOps
- def takeWhile(p: (Int) => Boolean): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Int) => U): Iterable[Int]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Int, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Int]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toDense: VectorI
Converts the compressed vector to a dense vector.
Converts the compressed vector to a dense vector.
- returns
Vector of base type
Int
containing uncompressed data
- Definition Classes
- RleVectorI → VectoI
- def toDouble: VectorD
Convert 'this'
RleVectorI
into aVectorD
.Convert 'this'
RleVectorI
into aVectorD
.- Definition Classes
- RleVectorI → VectoI
- def toIndexedSeq: IndexedSeq[Int]
- Definition Classes
- IterableOnceOps
- def toInt: VectorI
Convert 'this'
RleVectorI
into aVectorI
.Convert 'this'
RleVectorI
into aVectorI
.- Definition Classes
- RleVectorI → VectoI
- final def toIterable: RleVectorI.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[Int]
- Definition Classes
- IterableOnceOps
- def toLong: VectorL
Convert 'this'
RleVectorI
into aVectorL
.Convert 'this'
RleVectorI
into aVectorL
.- Definition Classes
- RleVectorI → VectoI
- def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Int]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Int]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString: String
Convert 'this' vector to a string.
Convert 'this' vector to a string.
- Definition Classes
- RleVectorI → VectoI → Iterable → AnyRef → Any
- def toVector: Vector[Int]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Int) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def tryCompareTo[B >: RleVectorI](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
- RleVectorI → PartiallyOrdered
- def unary_-: RleVectorI
Return the negative of 'this' vector (unary minus).
Return the negative of 'this' vector (unary minus).
- Definition Classes
- RleVectorI → VectoI
- def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def update(r: Range, u: VectoI): 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
- RleVectorI → VectoI
- def update(r: Range, x: Int): 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
- RleVectorI → VectoI
- def update(i: Int, x: Int): 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
- RleVectorI → VectoI
- var v: ReArray[TripletI]
- Attributes
- protected
- def variance: Double
Compute the (unbiased) sample variance of the elements of 'this' vector.
Compute the (unbiased) sample variance of the elements of 'this' vector.
- Definition Classes
- VectoI
- def view: View[Int]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (Int) => Boolean): WithFilter[Int, Iterable]
- Definition Classes
- IterableOps
- def zero(size: Int): RleVectorI
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
- RleVectorI → VectoI
- def zip[B](that: IterableOnce[B]): Iterable[(Int, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Int, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[(Int, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- def ~^(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def ~^=(s: Int): RleVectorI
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
- RleVectorI → VectoI
- def ∙(b: VectoI): Int
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
- VectoI
- def ≠(b: VectoI): Boolean
Compare 'this' vector with that vector 'b' for inequality.
- def ≤(b: VectoI): 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
- VectoI
- def ≥(b: VectoI): 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
- VectoI
Deprecated Value Members
- def ++:[B >: Int](that: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def /:[B](z: B)(op: (B, Int) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (Int, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[Iterable]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def repr: Iterable[Int]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def seq: RleVectorI.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[Int]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[Int]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Int]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def view(from: Int, until: Int): View[Int]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)