class SparseVectorR extends VectoR
The SparseVectorR
class stores and operates on Numeric Vectors of base type Real
.
It follows the framework of gen.VectorN [T]
and is provided for performance.
- Alphabetic
- By Inheritance
- SparseVectorR
- VectoR
- Serializable
- Error
- Vec
- PartiallyOrdered
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new SparseVectorR(iv: (Int, Real), dm: Int)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- iv
the tuple containing (index, value)
- dm
the dimension for the new vector
- new SparseVectorR(u: VectoR)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- u
the other vector
- new SparseVectorR(dim_: Int, v: RowMap = null)
- dim_
the dimension/size of the vector
- v
the
SortedLinkedHashMap
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, Real)): SparseVectorR
Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5).
Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5).
- s
the (scalar, position) to multiply by
- Definition Classes
- SparseVectorR → VectoR
- def *(s: Real): SparseVectorR
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- SparseVectorR → VectoR
- def *(b: VectoR): SparseVectorR
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by
- Definition Classes
- SparseVectorR → VectoR
- def *=(s: Real): SparseVectorR
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- SparseVectorR → VectoR
- def *=(b: VectoR): SparseVectorR
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to multiply by
- Definition Classes
- SparseVectorR → VectoR
- def +(s: (Int, Real)): SparseVectorR
Add 'this' vector and scalar 's._2' only at position 's._1' e.g., 'x + (3, 5.5).
Add 'this' vector and scalar 's._2' only at position 's._1' e.g., 'x + (3, 5.5).
- s
the (scalar, position) to add
- Definition Classes
- SparseVectorR → VectoR
- def +(s: Real): SparseVectorR
Add 'this' vector and scalar 's'.
- def +(b: VectoR): SparseVectorR
Add 'this' vector and vector 'b'.
- def ++(s: Real): SparseVectorR
Concatenate 'this' vector and scalar 's'.
Concatenate 'this' vector and scalar 's'.
- s
the scalar to be concatenated
- Definition Classes
- SparseVectorR → VectoR
- def ++(b: VectoR): SparseVectorR
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
- b
the vector to be concatenated
- Definition Classes
- SparseVectorR → VectoR
- final def ++[B >: Real](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def +=(s: Real): SparseVectorR
Add in-place 'this' vector and scalar 's'.
Add in-place 'this' vector and scalar 's'.
- s
the scalar to add
- Definition Classes
- SparseVectorR → VectoR
- def +=(b: VectoR): SparseVectorR
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
- b
the vector to add
- Definition Classes
- SparseVectorR → VectoR
- def -(s: (Int, Real)): SparseVectorR
From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5).
From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5).
- s
the (scalar, position) to subtract
- Definition Classes
- SparseVectorR → VectoR
- def -(s: Real): SparseVectorR
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
- s
the scalar to subtract
- Definition Classes
- SparseVectorR → VectoR
- def -(b: VectoR): SparseVectorR
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract
- Definition Classes
- SparseVectorR → VectoR
- def -=(s: Real): SparseVectorR
From 'this' vector subtract in-place scalar 's'.
From 'this' vector subtract in-place scalar 's'.
- s
the scalar to subtract
- Definition Classes
- SparseVectorR → VectoR
- def -=(b: VectoR): SparseVectorR
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
- b
the vector to subtract
- Definition Classes
- SparseVectorR → VectoR
- def /(s: (Int, Real)): SparseVectorR
Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5).
Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5).
- s
the (scalar, position) to divide by
- Definition Classes
- SparseVectorR → VectoR
- def /(s: Real): SparseVectorR
Divide 'this' vector by scalar 's'.
- def /(b: VectoR): SparseVectorR
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
- b
the vector to divide by
- Definition Classes
- SparseVectorR → VectoR
- def /=(s: Real): SparseVectorR
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
- s
the scalar to divide by
- Definition Classes
- SparseVectorR → VectoR
- def /=(b: VectoR): SparseVectorR
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to divide by
- Definition Classes
- SparseVectorR → VectoR
- def <[B >: VectoR](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def <=[B >: VectoR](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def >[B >: VectoR](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def >=[B >: VectoR](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def _oneAt(j: Int, size: Int = dim): SparseVectorR
Create a vector of the form (0, ...
Create a 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
- SparseVectorR → VectoR
- def abs: SparseVectorR
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
- SparseVectorR → VectoR
- 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[Real]
Get 'this' vector's entire array.
Get 'this' vector's entire array.
- Definition Classes
- SparseVectorR → VectoR
- def apply(r: Range): SparseVectorR
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
- SparseVectorR → VectoR
- def apply(i: Int): Real
Get 'this' vector's element at the 'i'-th index position.
Get 'this' vector's element at the 'i'-th index position.
- i
the given index
- Definition Classes
- SparseVectorR → VectoR
- def apply(iv: VectoI): VectoR
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
- VectoR
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- 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()
- final def coll: SparseVectorR.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Real, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Real, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: Real](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def contains(x: Real): 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
- SparseVectorR → VectoR
- def copy: SparseVectorR
Create an exact copy of 'this' vector.
Create an exact copy of 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def copyToArray[B >: Real](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Real](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: Real](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (Real, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Real) => 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- def countZero: Int
Count the number of zero elements in 'this' vector.
Count the number of zero elements in 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def countinct: Int
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def cumulate: SparseVectorR
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
- SparseVectorR → VectoR
- lazy val dim: Int
Dimension
Dimension
- Definition Classes
- SparseVectorR → VectoR
- val dim_: Int
- def distinct: SparseVectorR
Return a new vector consisting of the distinct elements from 'this' vector.
Return a new vector consisting of the distinct elements from 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def dot(b: SparseVectorR): 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'.
- b
the other vector
- def dot(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'.
- b
the other vector
- Definition Classes
- SparseVectorR → VectoR
- def drop(n: Int): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[Real]
- Definition Classes
- IterableOps
- def dropWhile(p: (Real) => Boolean): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[Real]
- 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
- SparseVectorR → VectoR → AnyRef → Any
- def exists(p: (Real) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def expand(more: Int = dim): SparseVectorR
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
- SparseVectorR → VectoR
- 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
- VectoR
- def filter(p: (Real) => Boolean): SparseVectorR
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
- SparseVectorR → VectoR → IterableOps → IterableOnceOps
- def filterMissing: SparseVectorR
Filter out the missing elements of 'this' vector based on the predicate that 'e != noReal'.
Filter out the missing elements of 'this' vector based on the predicate that 'e != noReal'.
- Definition Classes
- SparseVectorR → VectoR
- def filterNot(pred: (Real) => Boolean): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterPos(p: (Real) => 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
- SparseVectorR → VectoR
- def filterPos2(v2: VectoR, p: (Real, Real) => Boolean): IndexedSeq[(Int, Int)]
Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.
Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.
- v2
the other vector to compare with
- p
the binary predicate (
Boolean
function) to apply
- Definition Classes
- SparseVectorR → VectoR
- def find(p: (Real) => Boolean): Option[Real]
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- def flatMap[B](f: (Real) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Real) => 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 >: Real](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Real) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Real, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Real) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Real) => U): Unit
Iterate over 'this' vector element by element.
Iterate over 'this' vector element by element.
- f
the function to apply
- Definition Classes
- SparseVectorR → VectoR → IterableOnceOps
- def fromSpecific(coll: IterableOnce[Real]): Iterable[Real]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (Real) => K): Map[K, Iterable[Real]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Real) => K)(f: (Real) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Real) => K)(f: (Real) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[Real]]
- 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
- SparseVectorR → VectoR → AnyRef → Any
- def head: Real
- Definition Classes
- IterableOps
- def headOption: Option[Real]
- Definition Classes
- IterableOps
- 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.
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
- SparseVectorR → VectoR
- def indexWhere(p: (Real) => 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
- SparseVectorR → VectoR
- def indices: Range
Produce the range of all indices (0 to one less than dim).
- def init: Iterable[Real]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[Real]]
- 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
- SparseVectorR → VectoR
- def isSorted: Boolean
Determine whether 'this' vector is in sorted (ascending) order.
Determine whether 'this' vector is in sorted (ascending) order.
- Definition Classes
- SparseVectorR → VectoR
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator: Iterator[Real]
Return an iterator which yields all the elements.
Return an iterator which yields all the elements.
- Definition Classes
- SparseVectorR → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: Real
- Definition Classes
- IterableOps
- def lastOption: Option[Real]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Real, B, SparseVectorR.this.type]
- Definition Classes
- Iterable
- def mag: Real
Find the element with the greatest magnitude in 'this' vector.
Find the element with the greatest magnitude in 'this' vector.
- Definition Classes
- VectoR
- def map(f: (Real) => Real): SparseVectorR
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
- SparseVectorR → VectoR
- def map[B](f: (Real) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max(b: VectoR): SparseVectorR
Take the maximum of 'this' vector with vector 'b' (element-by element).
Take the maximum of 'this' vector with vector 'b' (element-by element).
- b
the other vector
- Definition Classes
- SparseVectorR → VectoR
- def max(e: Int = dim): Real
Find the maximum element in 'this' vector.
Find the maximum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorR → VectoR
- def max[B >: Real](implicit ord: Ordering[B]): Real
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Real) => B)(implicit cmp: Ordering[B]): Real
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Real) => B)(implicit cmp: Ordering[B]): Option[Real]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Real](implicit ord: Ordering[B]): Option[Real]
- Definition Classes
- IterableOnceOps
- def mean: Real
Compute the mean of the elements of 'this' vector.
Compute the mean of the elements of 'this' vector.
- Definition Classes
- VectoR
- def min(b: VectoR): SparseVectorR
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
- SparseVectorR → VectoR
- def min(e: Int = dim): Real
Find the minimum element in 'this' vector.
Find the minimum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorR → VectoR
- def min[B >: Real](implicit ord: Ordering[B]): Real
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Real) => B)(implicit cmp: Ordering[B]): Real
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Real) => B)(implicit cmp: Ordering[B]): Option[Real]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Real](implicit ord: Ordering[B]): Option[Real]
- 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 Real
Number of elements in the vector as a Real
- Definition Classes
- VectoR
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Real, Iterable[Real]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def norm: Real
Compute the Euclidean norm (2-norm) of 'this' vector.
Compute the Euclidean norm (2-norm) of 'this' vector.
- Definition Classes
- VectoR
- def norm1: Real
Compute the Manhattan norm (1-norm) of 'this' vector.
Compute the Manhattan norm (1-norm) of 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def normSq: Real
Compute the Euclidean norm (2-norm) squared of 'this' vector.
Compute the Euclidean norm (2-norm) squared of 'this' vector.
- Definition Classes
- VectoR
- def normalize: SparseVectorR
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
- SparseVectorR → VectoR
- def normalize1: SparseVectorR
Normalize 'this' vector to have a maximum of one.
Normalize 'this' vector to have a maximum of one.
- Definition Classes
- SparseVectorR → VectoR
- def normalizeU: SparseVectorR
Normalize 'this' vector so its length is one (unit vector).
Normalize 'this' vector so its length is one (unit vector).
- Definition Classes
- SparseVectorR → 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 = dim): SparseVectorR
Create a one vector (all elements are one) of length 'size'.
Create a one vector (all elements are one) of length 'size'.
- size
the number of elements in the vector
- Definition Classes
- SparseVectorR → VectoR
- def oneAt(j: Int, size: Int = dim): SparseVectorR
Create a vector of the form (0, ...
Create a 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
- SparseVectorR → VectoR
- def partition(p: (Real) => Boolean): (Iterable[Real], Iterable[Real])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Real) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def pot(b: VectoR): Real
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
- VectoR
- def product[B >: Real](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- 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
- val range: Range
Range for the storage array
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).
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
- SparseVectorR → VectoR
- def recip: SparseVectorR
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
- SparseVectorR → VectoR
- def reduce[B >: Real](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Real](op: (B, Real) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Real](op: (B, Real) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Real](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Real](op: (Real, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Real](op: (Real, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reorder(rnk: VectoI): VectoR
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
- VectoR
- def reverse(): SparseVectorR
Reverse the order of the elements in 'this' vector.
Reverse the order of the elements in 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def reversed: Iterable[Real]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def rot(b: VectoR)(from: Int = b.dim - 1): 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: SparseVectorR): 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
- def sameDimensions(b: VectoR): 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
- VectoR
- def scan[B >: Real](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Real) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Real, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def select(basis: Array[Int]): SparseVectorR
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
- SparseVectorR → VectoR
- def select(basis: VectoI): VectoR
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
- VectoR
- def selectEx(basis: VectoI): VectoR
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
- VectoR
- def selectEx(basis: Array[Int]): VectoR
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
- VectoR
- def set(u: Seq[Real]): 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
- SparseVectorR → VectoR
- def set(x: Real): 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
- SparseVectorR → VectoR
- 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
- VectoR
- 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): SparseVectorR
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
- SparseVectorR → VectoR → IterableOps → IterableOnceOps
- def slice(rg: Range): VectoR
Slice 'this' vector over the given range 'rg'.
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'.
Slice 'this' vector excluding the given range 'rg'.
- rg
the excluded range of the slice
- Definition Classes
- VectoR
- def sliding(size: Int, step: Int): Iterator[Iterable[Real]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[Real]]
- 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
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- def span(p: (Real) => Boolean): (Iterable[Real], Iterable[Real])
- Definition Classes
- IterableOps → IterableOnceOps
- 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'.
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'.
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).
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): (Iterable[Real], Iterable[Real])
- Definition Classes
- IterableOps → IterableOnceOps
- def sq: VectoR
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
- VectoR
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Real, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum: Real
Sum the elements of 'this' vector.
Sum the elements of 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- def sum[B >: Real](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def sumNE(i: Int): Real
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
- SparseVectorR → VectoR
- def sumPos: Real
Sum the positive (> 0) elements of 'this' vector.
Sum the positive (> 0) elements of 'this' vector.
- Definition Classes
- SparseVectorR → VectoR
- 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
- SparseVectorR → VectoR
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Iterable[Real]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[Real]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[Real]
- Definition Classes
- IterableOps
- def takeWhile(p: (Real) => Boolean): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Real) => U): Iterable[Real]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Real, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Real](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Real]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toDense: VectorR
Convert 'this' sparse vector to a dense vector.
Convert 'this' sparse vector to a dense vector.
- Definition Classes
- SparseVectorR → VectoR
- def toDouble: VectorD
Convert 'this'
SparseVectorR
into aVectorD
.Convert 'this'
SparseVectorR
into aVectorD
.- Definition Classes
- SparseVectorR → VectoR
- def toIndexedSeq: IndexedSeq[Real]
- Definition Classes
- IterableOnceOps
- def toInt: VectorI
Convert 'this'
SparseVectorR
into aVectorI
.Convert 'this'
SparseVectorR
into aVectorI
.- Definition Classes
- SparseVectorR → VectoR
- final def toIterable: SparseVectorR.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[Real]
- Definition Classes
- IterableOnceOps
- def toLong: VectorL
Convert 'this'
SparseVectorR
into aVectorL
.Convert 'this'
SparseVectorR
into aVectorL
.- Definition Classes
- SparseVectorR → VectoR
- def toMap[K, V](implicit ev: <:<[Real, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Real]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Real]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString: String
Convert 'this' vector to a
String
.Convert 'this' vector to a
String
.- Definition Classes
- SparseVectorR → VectoR → Iterable → AnyRef → Any
- def toString2: String
Convert 'this' vector to a
String
, showing the zero elements as well, - def toVector: Vector[Real]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Real) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def tryCompareTo[B >: SparseVectorR](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
- SparseVectorR → PartiallyOrdered
- def unary_-: SparseVectorR
Return the negative of 'this' vector (unary minus).
Return the negative of 'this' vector (unary minus).
- Definition Classes
- SparseVectorR → VectoR
- def unzip[A1, A2](implicit asPair: (Real) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Real) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def update(r: Range, u: VectoR): 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
- SparseVectorR → VectoR
- def update(r: Range, x: Real): 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
- SparseVectorR → VectoR
- def update(i: Int, x: Real): 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
- SparseVectorR → VectoR
- var v: RowMap
- Attributes
- protected
- def variance: Real
Compute the (unbiased) sample variance of the elements of 'this' vector.
Compute the (unbiased) sample variance of the elements of 'this' vector.
- Definition Classes
- VectoR
- def view: View[Real]
- 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: (Real) => Boolean): WithFilter[Real, Iterable]
- Definition Classes
- IterableOps
- def zero(size: Int = dim): SparseVectorR
Create a zero vector (all elements are zero) of length 'size'.
Create a zero vector (all elements are zero) of length 'size'.
- size
the number of elements in the vector
- Definition Classes
- SparseVectorR → VectoR
- def zip[B](that: IterableOnce[B]): Iterable[(Real, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Real, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[(Real, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- def ~^(s: Double): SparseVectorR
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
- SparseVectorR → VectoR
- def ~^=(s: Double): SparseVectorR
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
- SparseVectorR → 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.
- def ≤(b: VectoR): 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
- VectoR
- def ≥(b: VectoR): 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
- VectoR
- def ⦁(b: SparseVectorR): 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'.
- b
the other 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'.
- b
the other vector
Deprecated Value Members
- def ++:[B >: Real](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, Real) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (Real, 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, Real) => 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 >: Real](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[Real]
- 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: SparseVectorR.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[Real]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[Real]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Real]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def view(from: Int, until: Int): View[Real]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)