class VectorC extends VectoC
The VectorC class stores and operates on Numeric Vectors of base type Complex.
It follows the framework of gen.VectorN [T] and is provided for performance.
- Alphabetic
- By Inheritance
- VectorC
- VectoC
- Serializable
- Serializable
- Error
- Vec
- PartiallyOrdered
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
VectorC(iv: (Int, Complex), dm: Int)
Construct a vector and assign 'value' at 'index' position.
Construct a vector and assign 'value' at 'index' position.
- iv
the tuple containing (index, value)
- dm
the dimension for the new vector
-
new
VectorC(u: VectoC)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- u
the other vector
-
new
VectorC(dim: Int, v: Array[Complex] = null)
- dim
the dimension/size of the vector
- v
the 1D array used to store vector elements
Type Members
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*(s: Complex): VectorC
Multiply 'this' vector by scalar 's'.
-
def
*(b: VectorC): VectorC
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by (same kind, more efficient)
-
def
*(b: VectoC): VectorC
Multiply 'this' vector by vector 'b'.
-
def
*=(s: Complex): VectorC
Multiply in-place 'this' vector and scalar 's'.
-
def
*=(b: VectorC): VectorC
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to add (same kind, more efficient)
-
def
*=(b: VectoC): VectorC
Multiply in-place 'this' vector and vector 'b'.
-
def
+(s: (Int, Complex)): VectorC
Add 'this' vector and scalar 's._2' only at position 's._1'.
-
def
+(s: Complex): VectorC
Add 'this' vector and scalar 's'.
-
def
+(b: VectorC): VectorC
Add 'this' vector and vector 'b'.
Add 'this' vector and vector 'b'.
- b
the vector to add (same kind, more efficient)
-
def
+(b: VectoC): VectorC
Add 'this' vector and vector 'b'.
-
def
++(s: Complex): VectorC
Concatenate 'this' vector and scalar 's'.
-
def
++(b: VectorC): VectorC
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
- b
the vector to be concatenated (same kind, more efficient)
-
def
++(b: VectoC): VectorC
Concatenate 'this' vector and vector' b'.
-
def
++[B >: Complex, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Complex, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Complex, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike
-
def
+=(s: Complex): VectorC
Add in-place 'this' vector and scalar 's'.
-
def
+=(b: VectorC): VectorC
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
- b
the vector to add (same kind, more efficient)
-
def
+=(b: VectoC): VectorC
Add in-place 'this' vector and vector 'b'.
-
def
-(s: (Int, Complex)): VectorC
From 'this' vector subtract scalar 's._2' only at position 's._1'.
-
def
-(s: Complex): VectorC
From 'this' vector subtract scalar 's'.
-
def
-(b: VectorC): VectorC
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract (same kind, more efficient)
-
def
-(b: VectoC): VectorC
From 'this' vector subtract vector 'b'.
-
def
-=(s: Complex): VectorC
From 'this' vector subtract in-place scalar 's'.
-
def
-=(b: VectorC): VectorC
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
- b
the vector to add (same kind, more efficient)
-
def
-=(b: VectoC): VectorC
From 'this' vector subtract in-place vector 'b'.
-
def
/(s: Complex): VectorC
Divide 'this' vector by scalar 's'.
-
def
/(b: VectorC): VectorC
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
- b
the vector to divide by (same kind, more efficient)
-
def
/(b: VectoC): VectorC
Divide 'this' vector by vector 'b' (element-by-element).
-
def
/:[B](z: B)(op: (B, Complex) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
/=(s: Complex): VectorC
Divide in-place 'this' vector and scalar 's'.
-
def
/=(b: VectorC): VectorC
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to add (same kind, more efficient)
-
def
/=(b: VectoC): VectorC
Divide in-place 'this' vector and vector 'b'.
-
def
:\[B](z: B)(op: (Complex, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
<[B >: VectoC](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
<=[B >: VectoC](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
>[B >: VectoC](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
>=[B >: VectoC](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
_oneAt(j: Int, size: Int = dim): VectorC
Create a vector of the form (0, ...
-
def
abs: VectorC
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, Complex) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
apply(): WrappedArray[Complex]
Get 'this' vector's entire array.
-
def
apply(r: Range): VectorC
Get 'this' vector's elements within the given range (vector slicing).
-
def
apply(i: Int): Complex
Get 'this' vector's element at the 'i'-th index position.
-
def
argmax(s: Int, e: Int): Int
Find the argument maximum of 'this' vector (index of maximum element).
-
def
argmax(e: Int = dim): Int
Find the argument maximum of 'this' vector (index of maximum element).
-
def
argmaxPos(e: Int = dim): Int
Return the argument maximum of 'this' vector (-1 if it's not positive).
-
def
argmin(s: Int, e: Int): Int
Find the argument minimum of 'this' vector (index of minimum element).
-
def
argmin(e: Int = dim): Int
Find the argument minimum of 'this' vector (index of minimum element).
-
def
argminNeg(e: Int = dim): Int
Return the argument minimum of 'this' vector (-1 if it's not negative).
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clean(thres: Double = TOL, relative: Boolean = true): VectorC
Clean values in 'this' vector at or below the threshold 'thres' by setting them to zero.
Clean values in 'this' vector at or below the threshold 'thres' by setting them to zero. Iterative algorithms give approximate values and if very close to zero, may throw off other calculations, e.g., in computing eigenvectors.
- thres
the cutoff threshold (a small value)
- relative
whether to use relative or absolute cutoff
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
collect[B, That](pf: PartialFunction[Complex, B])(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Complex, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
def
contains(x: Complex): Boolean
Determine whether 'x' is contained in 'this' vector.
-
def
containsAny(x: VectorC): Boolean
Determine whether any of the elements in 'x' are contained in 'this' vector.
Determine whether any of the elements in 'x' are contained in 'this' vector.
- x
the vector of elements to be checked
-
def
copy(): VectorC
Create an exact copy of 'this' vector.
-
def
copyToArray[B >: Complex](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Complex](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Complex](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Complex](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (Complex) ⇒ 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
countZero: Int
Count the number of zero elements in the 'this' vector.
-
def
countinct: Int
Count the number of distinct elements in 'this' vector.
-
def
cumulate: VectorC
Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf).
- val dim: Int
-
def
distinct: VectorC
Return a new vector consisting of the distinct elements from 'this' vector.
-
def
dot(b: VectorC): Complex
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 (same kind, more efficient)
-
def
dot(b: VectoC): Complex
Compute the dot product (or inner product) of 'this' vector with vector 'b'.
-
def
drop(n: Int): Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (Complex) ⇒ Boolean): Traversable[Complex]
- 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'.
-
def
exists(p: (Complex) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
expand(more: Int = dim): VectorC
Expand the size (dim) of 'this' vector by 'more' elements.
-
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
- VectoC
-
def
filter(p: (Complex) ⇒ Boolean): VectorC
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 (
Booleanfunction) to apply
- Definition Classes
- VectorC → TraversableLike → GenTraversableLike
-
def
filterNot(p: (Complex) ⇒ Boolean): Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterPos(p: (Complex) ⇒ Boolean): IndexedSeq[Int]
Filter the elements of 'this' vector based on the predicate 'p', returning the index positions.
-
def
filterPos2(v2: VectoC, p: (Complex, Complex) ⇒ Boolean): IndexedSeq[(Int, Int)]
Filter the elements of 'this' vector based on the binary predicate 'p', returning the index positions.
Filter the elements of 'this' vector based on the binary predicate 'p', returning the index positions.
- v2
the other vector to compare with
- p
the binary predicate (Boolean function, between two elements) to apply
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (Complex) ⇒ Boolean): Option[Complex]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
firstNeg(e: Int = dim): Int
Return the index of the first negative element in 'this' vector (-1 otherwise).
-
def
firstPos(e: Int = dim): Int
Return the index of the first positive element in 'this' vector (-1 otherwise).
-
def
flatMap[B, That](f: (Complex) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (Complex) ⇒ 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 >: Complex](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Complex) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Complex, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (Complex) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Complex) ⇒ U): Unit
Iterate over 'this' vector element by element.
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
groupBy[K](f: (Complex) ⇒ K): Map[K, Traversable[Complex]]
- 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.
-
def
head: Complex
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf(x: Complex, e: Int = dim): Int
Return the index of the first occurrence of element 'x' in 'this' vector, or -1 if not found.
-
def
indexWhere(p: (Complex) ⇒ Boolean): Int
Find and return index of first element satisfying predicate 'p', or -1 if not found.
-
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
- VectoC
-
def
init: Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[Complex]]
- Definition Classes
- TraversableLike
-
def
intersect(x: VectorC): VectorC
Return the intersection of vectors 'this' and 'x'.
Return the intersection of vectors 'this' and 'x'.
- x
the other vector
-
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).
-
def
isSorted: Boolean
Determine whether 'this' vector is in sorted (ascending) order.
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: Complex
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
mag: Complex
Find the element with the greatest magnitude in 'this' vector.
Find the element with the greatest magnitude in 'this' vector.
- Definition Classes
- VectoC
-
def
map(f: (Complex) ⇒ Complex): VectorC
Map the elements of 'this' vector by applying the mapping function 'f'.
-
def
map[B, That](f: (Complex) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max(b: VectorC): VectorC
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 (same kind, more efficient)
-
def
max(b: VectoC): VectorC
Take the maximum of 'this' vector with vector 'b' (element-by element).
-
def
max(e: Int = dim): Complex
Find the maximum element in 'this' vector.
-
def
max[B >: Complex](implicit cmp: Ordering[B]): Complex
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Complex) ⇒ B)(implicit cmp: Ordering[B]): Complex
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mean: Complex
Compute the mean of the elements of 'this' vector.
Compute the mean of the elements of 'this' vector.
- Definition Classes
- VectoC
-
def
min(b: VectorC): VectorC
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 (same kind, more efficient)
-
def
min(b: VectoC): VectorC
Take the minimum of 'this' vector with vector 'b' (element-by element).
-
def
min(e: Int = dim): Complex
Find the minimum element in 'this' vector.
-
def
min[B >: Complex](implicit cmp: Ordering[B]): Complex
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Complex) ⇒ B)(implicit cmp: Ordering[B]): Complex
- 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 Complex
Number of elements in the vector as a Complex
- Definition Classes
- VectoC
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[Complex, Traversable[Complex]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
norm: Complex
Compute the Euclidean norm (2-norm) of 'this' vector.
Compute the Euclidean norm (2-norm) of 'this' vector.
- Definition Classes
- VectoC
-
def
norm1: Complex
Compute the Manhattan norm (1-norm) of 'this' vector, i.e., the sum of the absolute values of the elements.
-
def
normSq: Complex
Compute the Euclidean norm (2-norm) squared of 'this' vector.
Compute the Euclidean norm (2-norm) squared of 'this' vector.
- Definition Classes
- VectoC
-
def
normalize: VectorC
Normalize 'this' vector so that it sums to one (like a probability vector).
-
def
normalize1: VectorC
Normalize 'this' vector to have a maximum of one.
-
def
normalizeU: VectorC
Normalize 'this' vector so its length is one (unit vector).
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
one(size: Int = dim): VectorC
Create a one vector (all elements are one) of length 'size'.
-
def
oneAt(j: Int, size: Int = dim): VectorC
Create a vector of the form (0, ...
-
def
par: ParIterable[Complex]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Complex, ParIterable[Complex]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: (Complex) ⇒ Boolean): (Traversable[Complex], Traversable[Complex])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: Complex](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
pvariance: Complex
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
- VectoC
-
val
range: Range
Range for the storage array
Range for the storage array
- Definition Classes
- VectoC
-
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).
-
def
recip: VectorC
Return the vector containing the reciprocal of each element of 'this' vector.
-
def
reduce[A1 >: Complex](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Complex](op: (B, Complex) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Complex](op: (B, Complex) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Complex](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Complex](op: (Complex, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Complex](op: (Complex, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse(): VectorC
Reverse the order of the elements in 'this' vector.
-
def
reversed: List[Complex]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameDimensions(b: VectoC): 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
- VectoC
-
def
scan[B >: Complex, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Complex) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Complex, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
select(basis: VectoI): VectorC
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/vector of index positions (e.g., 0, 2, 5)
-
def
select(basis: Array[Int]): VectorC
Select a subset of elements of 'this' vector corresponding to a 'basis'.
-
def
seq: Traversable[Complex]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
set(u: Seq[Complex]): Unit
Set the values in 'this' vector to the values in sequence/array 'u'.
-
def
set(x: Complex): Unit
Set each value in 'this' vector to 'x'.
-
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
- VectoC
-
def
size: Int
Return the size (number of elements) of 'this' vector.
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, till: Int = dim): VectorC
Slice 'this' vector 'from' to 'end'.
-
def
sort(): Unit
Sort 'this' vector in-place in ascending (non-decreasing) order.
-
def
sort2(): Unit
Sort 'this' vector in-place in descending (non-increasing) order.
-
def
span(p: (Complex) ⇒ Boolean): (Traversable[Complex], Traversable[Complex])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
split(k: Int): Array[VectorC]
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 splitted
-
def
splitAt(n: Int): (Traversable[Complex], Traversable[Complex])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sq: VectoC
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
- VectoC
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum: Complex
Sum the elements of 'this' vector.
-
def
sum[B >: Complex](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sumNE(i: Int): Complex
Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').
-
def
sumPos: Complex
Sum the positive (> 0) elements of 'this' vector.
-
def
swap(i: Int, j: Int): Unit
Swap elements 'i' and 'j' in 'this' vector.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[Complex]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (Complex) ⇒ Boolean): Traversable[Complex]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[Complex]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Complex, Col[Complex]]): Col[Complex]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Complex](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: Complex]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[Complex]): Traversable[Complex]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toDense: VectorC
Convert 'this'
VectorCinto a denseVectorC. -
def
toDouble: VectorD
Convert 'this'
VectorCinto aVectorD. -
def
toIndexedSeq: IndexedSeq[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toInt: VectorI
Convert 'this'
VectorCinto aVectorI. -
def
toIterable: Iterable[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Complex]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toLong: VectorL
Convert 'this'
VectorCinto aVectorL. -
def
toMap[T, U](implicit ev: <:<[Complex, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Complex]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[Complex]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString: String
Convert 'this' vector to a String.
-
def
toTraversable: Traversable[Complex]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (Complex) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
tryCompareTo[B >: VectorC](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
- VectorC → PartiallyOrdered
-
def
unary_-(): VectorC
Return the negative of 'this' vector (unary minus).
-
def
unzip[A1, A2](implicit asPair: (Complex) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (Complex) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(r: Range, u: VectoC): Unit
Set 'this' vector's elements over the given range (vector slicing).
-
def
update(r: Range, x: Complex): Unit
Set 'this' vector's elements over the given range (vector slicing).
-
def
update(i: Int, x: Complex): Unit
Set 'this' vector's element at the 'i'-th index position.
-
var
v: Array[Complex]
- Attributes
- protected
-
def
variance: Complex
Compute the (unbiased) sample variance of the elements of 'this' vector.
Compute the (unbiased) sample variance of the elements of 'this' vector.
- Definition Classes
- VectoC
-
def
view(from: Int, until: Int): TraversableView[Complex, Traversable[Complex]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[Complex, Traversable[Complex]]
- 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
- @throws( ... )
-
def
withFilter(p: (Complex) ⇒ Boolean): FilterMonadic[Complex, Traversable[Complex]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zero(size: Int = dim): VectorC
Create a zero vector (all elements are zero) of length 'size'.
-
def
~^(s: Double): VectorC
Return the vector containing each element of 'this' vector raised to the s-th power.
-
def
~^=(s: Double): VectorC
Raise in-place each element of 'this' vector to the 's'-th power.
-
def
∙(b: VectoC): Complex
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
- VectoC
-
def
≠(b: VectoC): Boolean
Compare 'this' vector with that vector 'b' for inequality.
-
def
≤(b: VectoC): 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
- VectoC
-
def
≥(b: VectoC): 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
- VectoC