trait VectoR extends Traversable[Real] with PartiallyOrdered[VectoR] with Vec with Error with Serializable
The VectoR
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
- VectoR
- Serializable
- Serializable
- Error
- Vec
- PartiallyOrdered
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
Abstract Value Members
-
abstract
def
*(s: (Int, Real)): VectoR
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 (position, scalar) to multiply
-
abstract
def
*(s: Real): VectoR
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
- s
the scalar to multiply by
-
abstract
def
*(b: VectoR): VectoR
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by
-
abstract
def
*=(s: Real): VectoR
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
- s
the scalar to multiply by
-
abstract
def
*=(b: VectoR): VectoR
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to multiply by
-
abstract
def
+(s: (Int, Real)): VectoR
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 (position, scalar) to add
-
abstract
def
+(s: Real): VectoR
Add 'this' vector and scalar 's'.
Add 'this' vector and scalar 's'.
- s
the scalar to add
-
abstract
def
+(b: VectoR): VectoR
Add 'this' vector and vector 'b'.
Add 'this' vector and vector 'b'.
- b
the vector to add
-
abstract
def
++(s: Real): VectoR
Concatenate 'this' vector and scalar 's'.
Concatenate 'this' vector and scalar 's'.
- s
the scalar to be concatenated
-
abstract
def
++(b: VectoR): VectoR
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
- b
the vector to be concatenated
-
abstract
def
+=(s: Real): VectoR
Add in-place 'this' vector and scalar 's'.
Add in-place 'this' vector and scalar 's'.
- s
the scalar to add
-
abstract
def
+=(b: VectoR): VectoR
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
- b
the vector to add
-
abstract
def
-(s: (Int, Real)): VectoR
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 (position, scalar) to subtract
-
abstract
def
-(s: Real): VectoR
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
- s
the scalar to subtract
-
abstract
def
-(b: VectoR): VectoR
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract
-
abstract
def
-=(s: Real): VectoR
From 'this' vector subtract in-place scalar 's'.
From 'this' vector subtract in-place scalar 's'.
- s
the scalar to substract
-
abstract
def
-=(b: VectoR): VectoR
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
- b
the vector to subtract
-
abstract
def
/(s: (Int, Real)): VectoR
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 (position, scalar) to divide
-
abstract
def
/(s: Real): VectoR
Divide 'this' vector by scalar 's'.
Divide 'this' vector by scalar 's'.
- s
the scalar to divide by
-
abstract
def
/(b: VectoR): VectoR
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
- b
the vector to divide by
-
abstract
def
/=(s: Real): VectoR
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
- s
the scalar to divide by
-
abstract
def
/=(b: VectoR): VectoR
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to divide by
-
abstract
def
_oneAt(j: Int, size: Int = dim): VectoR
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)
-
abstract
def
abs: VectoR
Return the vector that is the element-wise absolute value of 'this' vector.
-
abstract
def
apply(): IndexedSeq[Real]
Get 'this' vector's entire sequence/array.
-
abstract
def
apply(r: Range): VectoR
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
-
abstract
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
-
abstract
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
-
abstract
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
-
abstract
def
argmaxPos(e: Int = dim): Int
Return the argument maximum of 'this' vector (-1 if it's not positive).
Return the argument maximum of 'this' vector (-1 if it's not positive).
- e
the ending index (exclusive) for the search
-
abstract
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
-
abstract
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
-
abstract
def
argminNeg(e: Int = dim): Int
Return the argument minimum of 'this' vector (-1 if it's not negative).
Return the argument minimum of 'this' vector (-1 if it's not negative).
- e
the ending index (exclusive) for the search
-
abstract
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
-
abstract
def
copy: VectoR
Create a copy of this Vector.
-
abstract
def
countNeg: Int
Count the number of strictly negative elements in 'this' vector.
-
abstract
def
countPos: Int
Count the number of strictly positive elements in 'this' vector.
-
abstract
def
countZero: Int
Count the number of zero elements in the 'this' vector.
-
abstract
def
countinct: Int
Count the number of distinct elements in 'this' vector.
-
abstract
def
cumulate: VectoR
Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf).
Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf). Example: (4, 2, 3, 1) --> (4, 6, 9, 10)
-
abstract
val
dim: Int
Vector dimension
-
abstract
def
distinct: VectoR
Create a vector consisting of the distinct elements in 'this' vector.
-
abstract
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
-
abstract
def
expand(more: Int = dim): VectoR
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
-
abstract
def
filterMissing: VectoR
Filter out the missing elements of 'this' vector based on the predicate that 'e != noReal'.
-
abstract
def
filterPos(p: (Real) ⇒ Boolean): IndexedSeq[Int]
Filter the elements of 'this' vector based on the unary predicate 'p', returning the index positions.
Filter the elements of 'this' vector based on the unary predicate 'p', returning the index positions.
- p
the unary predicate (
Boolean
function) to apply
-
abstract
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
-
abstract
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
-
abstract
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
-
abstract
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
- VectoR → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
abstract
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
-
abstract
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
-
abstract
def
isNonnegative: Boolean
Check whether 'this' vector is nonnegative (has no negative elements).
-
abstract
def
isSorted: Boolean
Determine whether 'this' vector is in sorted (ascending) order.
-
abstract
def
map(f: (Real) ⇒ Real): VectoR
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
-
abstract
def
max(b: VectoR): VectoR
Take the maximum of 'this' vector with vector 'b' (element-by element).
Take the maximum of 'this' vector with vector 'b' (element-by element).
- b
the other vector
-
abstract
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
-
abstract
def
min(b: VectoR): VectoR
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
-
abstract
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
-
abstract
def
norm1: Real
Compute the Manhattan norm (1-norm) of 'this' vector.
-
abstract
def
normalize: VectoR
Normalize 'this' vector so that it sums to one (like a probability vector).
-
abstract
def
normalize1: VectoR
Normalize 'this' vector to have a maximum of one.
-
abstract
def
normalizeU: VectoR
Normalize 'this' vector so its length is one (unit vector).
-
abstract
def
one(size: Int): VectoR
Create a one vector (all elements are one) of length 'size'.
Create a one vector (all elements are one) of length 'size'.
- size
the size of the new vector
-
abstract
def
oneAt(j: Int, size: Int = dim): VectoR
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)
-
abstract
def
rank: VectoI
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).
-
abstract
def
recip: VectoR
Return the vector containing the reciprocal of each element of 'this' vector.
-
abstract
def
reverse(): VectoR
Reverse the order of the elements in 'this' vector.
-
abstract
def
select(basis: Array[Int]): 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)
-
abstract
def
set(u: Seq[Real]): Unit
Set the values in 'this' vector to the values in sequence 'u'.
Set the values in 'this' vector to the values in sequence 'u'.
- u
the sequence of values to be assigned
-
abstract
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
-
abstract
def
sort(): Unit
Sort 'this' vector in-place in ascending (non-decreasing) order.
-
abstract
def
sort2(): Unit
Sort 'this' vector in-place in descending (non-increasing) order.
-
abstract
def
sum: Real
Sum the elements of 'this' vector.
-
abstract
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
-
abstract
def
sumPos: Real
Sum the positive (> 0) elements of 'this' vector.
-
abstract
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
-
abstract
def
toDense: VectorR
Convert 'this'
VectoR
into a dense version. -
abstract
def
toDouble: VectoD
Convert 'this'
VectoR
into aVectoD
. -
abstract
def
toInt: VectoI
Convert 'this'
VectoR
into aVectoI
. -
abstract
def
toLong: VectoL
Convert 'this'
VectoR
into aVectoL
. -
abstract
def
tryCompareTo[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Option[Int]
- Definition Classes
- PartiallyOrdered
-
abstract
def
unary_-(): VectoR
Return the negative of 'this' vector (unary minus).
-
abstract
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
-
abstract
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
-
abstract
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
-
abstract
def
zero(size: Int): VectoR
Create a zero vector (all elements are zero) of length 'size'.
Create a zero vector (all elements are zero) of length 'size'.
- size
the size of the new vector
-
abstract
def
~^(s: Double): VectoR
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
-
abstract
def
~^=(s: Double): VectoR
Raise in-place each element of 'this' vector to the 's'-th power.
Raise in-place each element of 'this' vector to the 's'-th power.
- s
the scalar exponent
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
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
/:[B](z: B)(op: (B, Real) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (Real, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
<[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
<=[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
>[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
>=[B >: VectoR](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
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(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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
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
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
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(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: (Real) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
-
def
filter(p: (Real) ⇒ Boolean): Traversable[Real]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Real) ⇒ Boolean): Traversable[Real]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (Real) ⇒ Boolean): Option[Real]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
head: Real
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[Real]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indices: Range
Produce the range of all indices (0 to one less than dim).
-
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
-
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[B, That](f: (Real) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Real], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
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 >: Real](implicit cmp: Ordering[B]): Real
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Real) ⇒ B)(implicit cmp: Ordering[B]): Real
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
val
nd: Double
Number of elements in the vector as a Real
-
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
normSq: Real
Compute the Euclidean norm (2-norm) squared of 'this' vector.
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
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.
-
val
range: Range
Range for the storage array
-
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: 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
-
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
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
-
def
seq: Traversable[Real]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
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.
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
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
-
def
slice(from: Int, till: Int = dim): VectoR
Slice 'this' vector 'from' to 'end'.
Slice 'this' vector 'from' to 'end'. Override in implementing classes.
- from
the start of the slice (included)
- till
the end of the slice (excluded)
- Definition Classes
- VectoR → TraversableLike → GenTraversableLike
-
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
-
def
span(p: (Real) ⇒ Boolean): (Traversable[Real], Traversable[Real])
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
-
def
splitAt(n: Int): (Traversable[Real], Traversable[Real])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sq: VectoR
Return the vector containing the square of each element of 'this' vector.
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: Real](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
toIndexedSeq: IndexedSeq[Real]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
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
- Definition Classes
- TraversableLike → 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 anIllegalArgumentException
if collections are not uniformly sized.
-
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
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(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (Real) ⇒ Boolean): FilterMonadic[Real, Traversable[Real]]
- Definition Classes
- TraversableLike → FilterMonadic
-
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
-
def
≠(b: VectoR): Boolean
Compare 'this' vector with that vector 'b' for inequality.
Compare 'this' vector with that vector 'b' for inequality.
- b
that vector
-
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
-
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