SparseVectorD

Companion object SparseVectorD

class SparseVectorD extends VectoD

The SparseVectorD class stores and operates on Numeric Vectors of base type Double. It follows the framework of gen.VectorN [T] and is provided for performance.

Linear Supertypes

VectoD, Serializable, Error, Vec, PartiallyOrdered[VectoD], Iterable[Double], IterableFactoryDefaults[Double, Iterable], IterableOps[Double, Iterable, Iterable[Double]], IterableOnceOps[Double, Iterable, Iterable[Double]], IterableOnce[Double], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

SparseVectorD
VectoD
Serializable
Error
Vec
PartiallyOrdered
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

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

Packages

SparseVectorD

Companion object SparseVectorD

class SparseVectorD extends VectoD

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from VectoD

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoD]

Inherited from Iterable[Double]

Inherited from IterableFactoryDefaults[Double, Iterable]

Inherited from IterableOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnceOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnce[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

SparseVectorD

Companion object SparseVectorD

class SparseVectorD extends VectoD

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from VectoD

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoD]

Inherited from Iterable[Double]

Inherited from IterableFactoryDefaults[Double, Iterable]

Inherited from IterableOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnceOps[Double, Iterable, Iterable[Double]]

Inherited from IterableOnce[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped

SparseVectorD