VectorR

Companion object VectorR

class VectorR extends Traversable[Real] with PartiallyOrdered[VectorR] with Vec with Error with Serializable

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

Linear Supertypes

Serializable, Serializable, Error, Vec, PartiallyOrdered[VectorR], Traversable[Real], GenTraversable[Real], GenericTraversableTemplate[Real, Traversable], TraversableLike[Real, Traversable[Real]], GenTraversableLike[Real, Traversable[Real]], Parallelizable[Real, ParIterable[Real]], TraversableOnce[Real], GenTraversableOnce[Real], FilterMonadic[Real, Traversable[Real]], HasNewBuilder[Real, Traversable[Real]], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

VectorR
Serializable
Serializable
Error
Vec
PartiallyOrdered
Traversable
GenTraversable
GenericTraversableTemplate
TraversableLike
GenTraversableLike
Parallelizable
TraversableOnce
GenTraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new VectorR(u: VectorR)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
u
the other vector
new VectorR(u: MM_ArrayR)
Construct a vector from an array of values.
Construct a vector from an array of values.
u
the array of values
new VectorR(dim: Int, v: MM_ArrayR = null)
dim
the dimension/size of the vector
v
the 1D memory mapped array used to store vector elements

Type Members

type Self = Traversable[Real]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def *(m: MatriR): VectorR
Multiply 'this' (row) vector by matrix 'm'.
Multiply 'this' (row) vector by matrix 'm'.
m
the matrix to multiply by
def *(s: Real): VectorR
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
s
the scalar to multiply by
def *(b: VectorR): VectorR
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
b
the vector to multiply by
def *=(s: Real): VectorR
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
s
the scalar to add
def *=(b: VectorR): VectorR
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
b
the vector to add
def +(s: (Real, Int)): VectorR
Add 'this' vector and scalar 's._1' only at position 's._2'.
Add 'this' vector and scalar 's._1' only at position 's._2'.
s
the (scalar, position) to add
def +(s: Real): VectorR
Add 'this' vector and scalar 's'.
Add 'this' vector and scalar 's'.
s
the scalar to add
def +(b: VectorR): VectorR
Add 'this' vector and vector 'b'.
Add 'this' vector and vector 'b'.
b
the vector to add
def ++(s: Real): VectorR
Concatenate 'this' vector and scalar 's'.
Concatenate 'this' vector and scalar 's'.
s
the scalar to be concatenated
def ++(b: VectorR): VectorR
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
b
the vector to be concatenated
def ++[B >: Real, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: Real, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

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

Definition Classes
TraversableLike
def +=(s: Real): VectorR
Add in-place 'this' vector and scalar 's'.
Add in-place 'this' vector and scalar 's'.
s
the scalar to add
def +=(b: VectorR): VectorR
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
b
the vector to add
def -(s: (Real, Int)): VectorR
From 'this' vector subtract scalar 's._1' only at position 's._2'.
From 'this' vector subtract scalar 's._1' only at position 's._2'.
s
the (scalar, position) to subtract
def -(s: Real): VectorR
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
s
the scalar to subtract
def -(b: VectorR): VectorR
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
b
the vector to subtract
def -=(s: Real): VectorR
From 'this' vector subtract in-place scalar 's'.
From 'this' vector subtract in-place scalar 's'.
s
the scalar to add
def -=(b: VectorR): VectorR
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
b
the vector to add
def /(s: Real): VectorR
Divide 'this' vector by scalar 's'.
Divide 'this' vector by scalar 's'.
s
the scalar to divide by
def /(b: VectorR): VectorR
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
b
the vector to divide by
def /=(s: Real): VectorR
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
s
the scalar to add
def /=(b: VectorR): VectorR
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
b
the vector to add
def <[B >: VectorR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

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

Definition Classes
PartiallyOrdered
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def >[B >: VectorR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
def >=[B >: VectorR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
def _oneAt(j: Int, size: Int = dim): VectorR
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)
def abs: VectorR
Return the vector that is the element-wise absolute value of 'this' vector.
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, Real) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def apply(): MM_ArrayR
Get 'this' vector's entire array.
def apply(r: Range): VectorR
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
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
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
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
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
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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( ... ) @native() @HotSpotIntrinsicCandidate()
def collect[B, That](pf: PartialFunction[Real, B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[Real, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[Traversable]

Definition Classes
Traversable → GenTraversable → GenericTraversableTemplate
def contains(x: Real): Boolean
Determine whether 'x' is contained in 'this' vector.
Determine whether 'x' is contained in 'this' vector.
x
the element to be checked
def copyToArray[B >: Real](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: Real](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: Real](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: Real](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (Real) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def countNeg: Int
Count the number of strictly negative elements in 'this' vector.
def countPos: Int
Count the number of strictly positive elements in 'this' vector.
def cumulate: VectorR
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)
val dim: Int
def distinct: Int
Count the number of distinct elements in 'this' vector.
def dot(b: VectorR): 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 drop(n: Int): Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def dropWhile(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(b: Any): Boolean
Override equals to determine whether 'this' vector equals vector 'b..
Override equals to determine whether 'this' vector equals vector 'b..
b
the vector to compare with this

Definition Classes
VectorR → AnyRef → Any
def exists(p: (Real) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def expand(more: Int = dim): VectorR
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
def filter(p: (Real) ⇒ Boolean): VectorR
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
VectorR → TraversableLike → GenTraversableLike
def filterNot(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def filterPos(p: (Real) ⇒ Boolean): Array[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
def find(p: (Real) ⇒ Boolean): Option[Real]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def firstNeg(e: Int = dim): Int
Return the index of the first negative element in 'this' vector (-1 otherwise).
Return the index of the first negative element in 'this' vector (-1 otherwise).
e
the ending index (exclusive) for the search
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
def flatMap[B, That](f: (Real) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (Real) ⇒ GenTraversableOnce[B]): Traversable[B]

Definition Classes
GenericTraversableTemplate
final def flaw(method: String, message: String): Unit
Show the flaw by printing the error message.
Show the flaw by printing the error message.
method
the method where the error occurred
message
the error message

Definition Classes
Error
def fold[A1 >: Real](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, Real) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (Real, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def forall(p: (Real) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (Real) ⇒ U): Unit
Iterate over 'this' vector element by element.
Iterate over 'this' vector element by element.
f
the function to apply

Definition Classes
VectorR → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def genericBuilder[B]: Builder[B, Traversable[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def groupBy[K](f: (Real) ⇒ K): Map[K, Traversable[Real]]

Definition Classes
TraversableLike → GenTraversableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int
Must also override hashCode for 'this' vector to be compatible with equals.
Must also override hashCode for 'this' vector to be compatible with equals.

Definition Classes
VectorR → AnyRef → Any
def head: Real

Definition Classes
TraversableLike → GenTraversableLike
def headOption: Option[Real]

Definition Classes
TraversableLike → GenTraversableLike
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
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
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
VectorR → Vec
def init: Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Traversable[Real]]

Definition Classes
TraversableLike
def isEmpty: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isNonnegative: Boolean
Check whether 'this' vector is nonnegative (has no negative elements).
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def last: Real

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[Real]

Definition Classes
TraversableLike → GenTraversableLike
def mag: Real
Find the element with the greatest magnitude in 'this' vector.
def map(f: (Real) ⇒ Real): VectorR
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
def map[B, That](f: (Real) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max(b: VectorR): VectorR
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
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
def max[B >: Real](implicit cmp: Ordering[B]): Real

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (Real) ⇒ B)(implicit cmp: Ordering[B]): Real

Definition Classes
TraversableOnce → GenTraversableOnce
def mean: Real
Compute the mean of the elements of 'this' vector.
def min(b: VectorR): VectorR
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
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
def min[B >: Real](implicit cmp: Ordering[B]): Real

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (Real) ⇒ B)(implicit cmp: Ordering[B]): Real

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
val nd: Real
Number of elements in the vector as a Real
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[Real, Traversable[Real]]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
def norm: Real
Compute the Euclidean norm (2-norm) of 'this' vector.
def norm1: Real
Compute the Manhattan norm (1-norm) of 'this' vector.
def normSq: Real
Compute the Euclidean norm (2-norm) squared of 'this' vector.
def normalize: VectorR
Normalize 'this' vector so that it sums to one (like a probability vector).
def normalize1: VectorR
Normalize 'this' vector to have a maximum of one.
def normalizeU: VectorR
Normalize 'this' vector so its length is one (unit vector).
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
def oneAt(j: Int, size: Int = dim): VectorR
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)
def par: ParIterable[Real]

Definition Classes
Parallelizable
def parCombiner: Combiner[Real, ParIterable[Real]]

Attributes
protected[this]
Definition Classes
TraversableLike → Parallelizable
def partition(p: (Real) ⇒ Boolean): (Traversable[Real], Traversable[Real])

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: Real](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def pvariance: Real
Compute the population variance of the elements of 'this' vector.
Compute the population variance of the elements of 'this' vector. This is also the (biased) MLE estimator for sample variance.
def rank: linalgebra.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).
def recip: VectorR
Return the vector containing the reciprocal of each element of 'this' vector.
def reduce[A1 >: Real](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: Real](op: (B, Real) ⇒ B): B

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

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: Real](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: Real](op: (Real, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: Real](op: (Real, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[Real]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameDimensions(b: VectorR): 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 scan[B >: Real, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, Real) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (Real, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def select(basis: Array[Int]): VectorR
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)
def seq: Traversable[Real]

Definition Classes
Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
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
def setAll(u: MM_ArrayR): 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
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
def size: Int
Return the size (number of elements) of 'this' vector.
Return the size (number of elements) of 'this' vector.

Definition Classes
VectorR → Vec → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHintIfCheap: Int

Attributes
protected[collection]
Definition Classes
GenTraversableOnce
def slice(from: Int, till: Int): VectorR
Slice 'this' vector 'from' to 'end'.
Slice 'this' vector 'from' to 'end'.
from
the start of the slice (included)
till
the end of the slice (excluded)

Definition Classes
VectorR → TraversableLike → GenTraversableLike
def sort2(): Unit
Sort 'this' vector in-place in descending (non-increasing) order.
def span(p: (Real) ⇒ Boolean): (Traversable[Real], Traversable[Real])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Traversable[Real], Traversable[Real])

Definition Classes
TraversableLike → GenTraversableLike
def sq: VectorR
Return the vector containing the square of each element of 'this' vector.
def stringPrefix: String

Definition Classes
TraversableLike → GenTraversableLike
def sum: Real
Sum the elements of 'this' vector.
def sum[B >: Real](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def sumAbs: Real
Sum the absolute value of the elements of 'this' vector.
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
def sumPos: Real
Sum the positive (> 0) elements of 'this' 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
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Traversable[Real]]

Definition Classes
TraversableLike
def take(n: Int): Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def takeWhile(p: (Real) ⇒ Boolean): Traversable[Real]

Definition Classes
TraversableLike → GenTraversableLike
def thisCollection: Traversable[Real]

Attributes
protected[this]
Definition Classes
TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Real, Col[Real]]): Col[Real]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: Real](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: Real]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Traversable[Real]): Traversable[Real]

Attributes
protected[this]
Definition Classes
TraversableLike
def toDouble: VectorD
Convert 'this' VectorR into a VectorD.
def toIndexedSeq: IndexedSeq[Real]

Definition Classes
TraversableOnce → GenTraversableOnce
def toInt: VectorI
Convert 'this' VectorR into a VectorI.
def toIterable: Iterable[Real]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterator: Iterator[Real]

Definition Classes
TraversableLike → GenTraversableOnce
def toList: List[Real]

Definition Classes
TraversableOnce → GenTraversableOnce
def toLong: VectorL
Convert 'this' VectorR into a VectorL.
def toMap[T, U](implicit ev: <:<[Real, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[Real]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: Real]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[Real]

Definition Classes
TraversableLike → GenTraversableOnce
def toString(): String
Convert 'this' vector to a String.
Convert 'this' vector to a String.

Definition Classes
VectorR → TraversableLike → AnyRef → Any
def toTraversable: Traversable[Real]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[Real]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (Real) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def tryCompareTo[B >: VectorR](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
VectorR → PartiallyOrdered
def unary_-(): VectorR
Return the negative of 'this' vector (unary minus).
def unzip[A1, A2](implicit asPair: (Real) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

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

Definition Classes
GenericTraversableTemplate
def update(r: Range, u: VectorR): 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
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
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
var v: MM_ArrayR

Attributes
protected
def variance: Real
Compute the (unbiased) sample variance of the elements of 'this' vector.
def view(from: Int, until: Int): TraversableView[Real, Traversable[Real]]

Definition Classes
TraversableLike
def view: TraversableView[Real, Traversable[Real]]

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

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (Real) ⇒ Boolean): FilterMonadic[Real, Traversable[Real]]

Definition Classes
TraversableLike → FilterMonadic
def ~^(s: Double): VectorR
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
def ~^=(s: Double): Unit
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
def ∙(b: VectorR): 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: VectorR): Boolean
Compare 'this' vector with that vector 'b' for inequality.
Compare 'this' vector with that vector 'b' for inequality.
b
that vector
def ≤(b: VectorR): 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
def ≥(b: VectorR): 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

Deprecated Value Members

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

Definition Classes
TraversableOnce → GenTraversableOnce
Annotations
@deprecated
Deprecated
(Since version 2.12.10) Use foldLeft instead of /:
def :\[B](z: B)(op: (Real, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
Annotations
@deprecated
Deprecated
(Since version 2.12.10) Use foldRight instead of :\
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] ) @Deprecated
Deprecated

Packages

VectorR

Companion object VectorR

class VectorR extends Traversable[Real] with PartiallyOrdered[VectorR] with Vec with Error with Serializable

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectorR]

Inherited from Traversable[Real]

Inherited from GenTraversable[Real]

Inherited from GenericTraversableTemplate[Real, Traversable]

Inherited from TraversableLike[Real, Traversable[Real]]

Inherited from GenTraversableLike[Real, Traversable[Real]]

Inherited from Parallelizable[Real, ParIterable[Real]]

Inherited from TraversableOnce[Real]

Inherited from GenTraversableOnce[Real]

Inherited from FilterMonadic[Real, Traversable[Real]]

Inherited from HasNewBuilder[Real, Traversable[Real]]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

VectorR 

Companion object VectorR

class VectorR extends Traversable[Real] with PartiallyOrdered[VectorR] with Vec with Error with Serializable

Instance Constructors

Type Members

Value Members

Deprecated Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectorR]

Inherited from Traversable[Real]

Inherited from GenTraversable[Real]

Inherited from GenericTraversableTemplate[Real, Traversable]

Inherited from TraversableLike[Real, Traversable[Real]]

Inherited from GenTraversableLike[Real, Traversable[Real]]

Inherited from Parallelizable[Real, ParIterable[Real]]

Inherited from TraversableOnce[Real]

Inherited from GenTraversableOnce[Real]

Inherited from FilterMonadic[Real, Traversable[Real]]

Inherited from HasNewBuilder[Real, Traversable[Real]]

Inherited from AnyRef

Inherited from Any

Ungrouped

VectorR