class SparseVectorC extends VectoC
The SparseVectorC 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
- SparseVectorC
- 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
SparseVectorC(iv: (Int, Complex), dm: Int)
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- iv
the tuple containing (index, value)
- dm
the dimension for the new vector
-
new
SparseVectorC(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
SparseVectorC(dim_: Int, v: RowMap = null)
- dim_
the dimension/size of the vector
- v
the
SortedLinkedHashMapused 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): SparseVectorC
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
- s
the scalar to multiply by
- Definition Classes
- SparseVectorC → VectoC
-
def
*(b: VectoC): SparseVectorC
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
- b
the vector to multiply by
- Definition Classes
- SparseVectorC → VectoC
-
def
*=(s: Complex): SparseVectorC
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
- s
the scalar to add
- Definition Classes
- SparseVectorC → VectoC
-
def
*=(b: VectoC): SparseVectorC
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
- b
the vector to add
- Definition Classes
- SparseVectorC → VectoC
-
def
+(s: (Int, Complex)): SparseVectorC
Add 'this' vector and scalar 's._2' only at position 's._1'.
Add 'this' vector and scalar 's._2' only at position 's._1'.
- s
the (scalar, position) to add
- Definition Classes
- SparseVectorC → VectoC
-
def
+(s: Complex): SparseVectorC
Add 'this' vector and scalar 's'.
-
def
+(b: VectoC): SparseVectorC
Add 'this' vector and vector 'b'.
-
def
++(s: Complex): SparseVectorC
Concatenate 'this' vector and scalar 's'.
Concatenate 'this' vector and scalar 's'.
- s
the scalar to be concatenated
- Definition Classes
- SparseVectorC → VectoC
-
def
++(b: VectoC): SparseVectorC
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
- b
the vector to be concatenated
- Definition Classes
- SparseVectorC → VectoC
-
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): SparseVectorC
Add in-place 'this' vector and scalar 's'.
Add in-place 'this' vector and scalar 's'.
- s
the scalar to add
- Definition Classes
- SparseVectorC → VectoC
-
def
+=(b: VectoC): SparseVectorC
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
- b
the vector to add
- Definition Classes
- SparseVectorC → VectoC
-
def
-(s: (Int, Complex)): SparseVectorC
From 'this' vector subtract scalar 's._2' only at position 's._1'.
From 'this' vector subtract scalar 's._2' only at position 's._1'.
- s
the (scalar, position) to subtract
- Definition Classes
- SparseVectorC → VectoC
-
def
-(s: Complex): SparseVectorC
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
- s
the scalar to subtract
- Definition Classes
- SparseVectorC → VectoC
-
def
-(b: VectoC): SparseVectorC
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
- b
the vector to subtract
- Definition Classes
- SparseVectorC → VectoC
-
def
-=(s: Complex): SparseVectorC
From 'this' vector subtract in-place scalar 's'.
From 'this' vector subtract in-place scalar 's'.
- s
the scalar to add
- Definition Classes
- SparseVectorC → VectoC
-
def
-=(b: VectoC): SparseVectorC
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
- b
the vector to add
- Definition Classes
- SparseVectorC → VectoC
-
def
/(s: Complex): SparseVectorC
Divide 'this' vector by scalar 's'.
Divide 'this' vector by scalar 's'.
- s
the scalar to divide by
- Definition Classes
- SparseVectorC → VectoC
-
def
/(b: VectoC): SparseVectorC
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
- b
the vector to divide by
- Definition Classes
- SparseVectorC → VectoC
-
def
/:[B](z: B)(op: (B, Complex) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
/=(s: Complex): SparseVectorC
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
- s
the scalar to add
- Definition Classes
- SparseVectorC → VectoC
-
def
/=(b: VectoC): SparseVectorC
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
- b
the vector to add
- Definition Classes
- SparseVectorC → VectoC
-
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): SparseVectorC
Create a vector of the form (0, ...
Create a vector of the form (0, ... -1, ... 0) where the -1 is at position j.
- j
the position to place the -1
- size
the size of the vector (upper bound = size - 1)
- Definition Classes
- SparseVectorC → VectoC
-
def
abs: SparseVectorC
Return the vector that is the element-wise absolute value of 'this' vector.
Return the vector that is the element-wise absolute value of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
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(): IndexedSeq[Complex]
Get 'this' vector's entire array.
Get 'this' vector's entire array.
- Definition Classes
- SparseVectorC → VectoC
-
def
apply(r: Range): SparseVectorC
Get 'this' vector's elements within the given range (vector slicing).
Get 'this' vector's elements within the given range (vector slicing).
- r
the given range
- Definition Classes
- SparseVectorC → VectoC
-
def
apply(i: Int): Complex
Get 'this' vector's element at the 'i'-th index position.
Get 'this' vector's element at the 'i'-th index position.
- i
the given index
- Definition Classes
- SparseVectorC → VectoC
-
def
argmax(s: Int, e: Int): Int
Find the argument maximum of 'this' vector (index of maximum element).
Find the argument maximum of 'this' vector (index of maximum element).
- s
the starting index (inclusive) for the search
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
argmax(e: Int = dim): Int
Find the argument maximum of 'this' vector (index of maximum element).
Find the argument maximum of 'this' vector (index of maximum element).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
argmaxPos(e: Int = dim): Int
Return the argument maximum of 'this' vector (-1 if its not positive).
Return the argument maximum of 'this' vector (-1 if its not positive).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
argmin(s: Int, e: Int): Int
Find the argument minimum of 'this' vector (index of minimum element).
Find the argument minimum of 'this' vector (index of minimum element).
- s
the starting index (inclusive) for the search
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
argmin(e: Int = dim): Int
Find the argument minimum of 'this' vector (index of minimum element).
Find the argument minimum of 'this' vector (index of minimum element).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
argminNeg(e: Int = dim): Int
Return the argument minimum of 'this' vector (-1 if its not negative).
Return the argument minimum of 'this' vector (-1 if its not negative).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
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.
Determine whether 'x' is contained in 'this' vector.
- x
the element to be checked
- Definition Classes
- SparseVectorC → VectoC
-
def
copy: SparseVectorC
Create an exact copy of 'this' vector.
Create an exact copy of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
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.
Count the number of strictly negative elements in 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
countPos: Int
Count the number of strictly positive elements in 'this' vector.
Count the number of strictly positive elements in 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
countZero: Int
Count the number of zero elements in 'this' vector.
Count the number of zero elements in 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
countinct: Int
Count the number of distinct elements in 'this' vector.
Count the number of distinct elements in 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
cumulate: SparseVectorC
Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf).
Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf). Example: (4, 2, 3, 1) --> (4, 6, 9, 10)
- Definition Classes
- SparseVectorC → VectoC
-
lazy val
dim: Int
Dimension
Dimension
- Definition Classes
- SparseVectorC → VectoC
- val dim_: Int
-
def
distinct: SparseVectorC
Return a new vector consisting of the distinct elements from 'this' vector.
Return a new vector consisting of the distinct elements from 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
dot(b: SparseVectorC): 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
-
def
dot(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
- SparseVectorC → VectoC
-
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..
Override equals to determine whether 'this' vector equals vector 'b..
- b
the vector to compare with this
- Definition Classes
- SparseVectorC → VectoC → AnyRef → Any
-
def
exists(p: (Complex) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
expand(more: Int = dim): SparseVectorC
Expand the size (dim) of 'this' vector by 'more' elements.
Expand the size (dim) of 'this' vector by 'more' elements.
- more
the number of new elements to add
- Definition Classes
- SparseVectorC → VectoC
-
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): SparseVectorC
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
- SparseVectorC → 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.
Filter the elements of 'this' vector based on the predicate 'p', returning the index positions.
- p
the predicate (
Booleanfunction) to apply
- Definition Classes
- SparseVectorC → VectoC
-
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).
Return the index of the first negative element in 'this' vector (-1 otherwise).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
firstPos(e: Int = dim): Int
Return the index of the first positive element in 'this' vector (-1 otherwise).
Return the index of the first positive element in 'this' vector (-1 otherwise).
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
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.
Iterate over 'this' vector element by element.
- f
the function to apply
- Definition Classes
- SparseVectorC → VectoC → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
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.
Must also override hashCode for 'this' vector to be compatible with equals.
- Definition Classes
- SparseVectorC → VectoC → AnyRef → Any
-
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.
Return the index of the first occurrence of element 'x' in 'this' vector, or -1 if not found.
- x
the given element
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
def
indexWhere(p: (Complex) ⇒ Boolean): Int
Find and return index of first element satisfying predicate 'p', or -1 if not found.
Find and return index of first element satisfying predicate 'p', or -1 if not found.
- p
the predicate to check
- Definition Classes
- SparseVectorC → VectoC
-
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
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).
Check whether 'this' vector is nonnegative (has no negative elements).
- Definition Classes
- SparseVectorC → VectoC
-
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): SparseVectorC
Map the elements of 'this' vector by applying the mapping function 'f'.
Map the elements of 'this' vector by applying the mapping function 'f'.
- f
the function to apply
- Definition Classes
- SparseVectorC → VectoC
-
def
map[B, That](f: (Complex) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Complex], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max(b: VectoC): SparseVectorC
Take the maximum of 'this' vector with vector 'b' (element-by element).
Take the maximum of 'this' vector with vector 'b' (element-by element).
- b
the other vector
- Definition Classes
- SparseVectorC → VectoC
-
def
max(e: Int = dim): Complex
Find the maximum element in 'this' vector.
Find the maximum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
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: VectoC): SparseVectorC
Take the minimum of 'this' vector with vector 'b' (element-by element).
Take the minimum of 'this' vector with vector 'b' (element-by element).
- b
the other vector
- Definition Classes
- SparseVectorC → VectoC
-
def
min(e: Int = dim): Complex
Find the minimum element in 'this' vector.
Find the minimum element in 'this' vector.
- e
the ending index (exclusive) for the search
- Definition Classes
- SparseVectorC → VectoC
-
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.
Compute the Manhattan norm (1-norm) of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
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: SparseVectorC
Normalize 'this' vector so that it sums to one (like a probability vector).
Normalize 'this' vector so that it sums to one (like a probability vector).
- Definition Classes
- SparseVectorC → VectoC
-
def
normalize1: SparseVectorC
Normalize 'this' vector to have a maximum of one.
Normalize 'this' vector to have a maximum of one.
- Definition Classes
- SparseVectorC → VectoC
-
def
normalizeU: SparseVectorC
Normalize 'this' vector so its length is one (unit vector).
Normalize 'this' vector so its length is one (unit vector).
- Definition Classes
- SparseVectorC → VectoC
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
one(size: Int = dim): SparseVectorC
Create a one vector (all elements are one) of length 'size'.
Create a one vector (all elements are one) of length 'size'.
- size
the number of elements in the vector
- Definition Classes
- SparseVectorC → VectoC
-
def
oneAt(j: Int, size: Int = dim): SparseVectorC
Create a vector of the form (0, ...
Create a vector of the form (0, ... 1, ... 0) where the 1 is at position j.
- j
the position to place the 1
- size
the size of the vector (upper bound = size - 1)
- Definition Classes
- SparseVectorC → VectoC
-
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).
Establish the rank order of the elements in 'self' vector, e.g., (8.0, 2.0, 4.0, 6.0) is (3, 0, 1, 2).
- Definition Classes
- SparseVectorC → VectoC
-
def
recip: SparseVectorC
Return the vector containing the reciprocal of each element of 'this' vector.
Return the vector containing the reciprocal of each element of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
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(): SparseVectorC
Reverse the order of the elements in 'this' vector.
-
def
reversed: List[Complex]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameDimensions(b: SparseVectorC): Boolean
Check whether the other vector 'b' is at least as long as 'this' vector.
Check whether the other vector 'b' is at least as long as 'this' vector.
- b
the other vector
-
def
sameDimensions(b: 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: Array[Int]): SparseVectorC
Select a subset of elements of 'this' vector corresponding to a 'basis'.
Select a subset of elements of 'this' vector corresponding to a 'basis'.
- basis
the set of index positions (e.g., 0, 2, 5)
- Definition Classes
- SparseVectorC → VectoC
-
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 array 'u'.
Set the values in 'this' vector to the values in array 'u'.
- u
the array of values to be assigned
- Definition Classes
- SparseVectorC → VectoC
-
def
set(x: Complex): Unit
Set each value in 'this' vector to 'x'.
Set each value in 'this' vector to 'x'.
- x
the value to be assigned
- Definition Classes
- SparseVectorC → VectoC
-
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): SparseVectorC
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
- SparseVectorC → VectoC → TraversableLike → GenTraversableLike
-
def
sort(): Unit
Sort 'this' vector in-place in ascending (non-decreasing) order.
Sort 'this' vector in-place in ascending (non-decreasing) order.
- Definition Classes
- SparseVectorC → VectoC
-
def
sort2(): Unit
Sort 'this' vector in-place in descending (non-increasing) order.
Sort 'this' vector in-place in descending (non-increasing) order.
- Definition Classes
- SparseVectorC → VectoC
-
def
span(p: (Complex) ⇒ Boolean): (Traversable[Complex], Traversable[Complex])
- Definition Classes
- TraversableLike → GenTraversableLike
-
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.
Sum the elements of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
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').
Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').
- i
the index of the element to skip
- Definition Classes
- SparseVectorC → VectoC
-
def
sumPos: Complex
Sum the positive (> 0) elements of 'this' vector.
Sum the positive (> 0) elements of 'this' vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
swap(i: Int, j: Int): Unit
Swap elements 'i' and 'j' in 'this' vector.
Swap elements 'i' and 'j' in 'this' vector.
- i
the first element in the swap
- j
the second element in the swap
- Definition Classes
- SparseVectorC → VectoC
-
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' sparse vector to a dense vector.
Convert 'this' sparse vector to a dense vector.
- Definition Classes
- SparseVectorC → VectoC
-
def
toDouble: VectorD
Convert 'this'
SparseVectorCinto aVectorD.Convert 'this'
SparseVectorCinto aVectorD.- Definition Classes
- SparseVectorC → VectoC
-
def
toIndexedSeq: IndexedSeq[Complex]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toInt: VectorI
Convert 'this'
SparseVectorCinto aVectorI.Convert 'this'
SparseVectorCinto aVectorI.- Definition Classes
- SparseVectorC → VectoC
-
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'
SparseVectorCinto aVectorL.Convert 'this'
SparseVectorCinto aVectorL.- Definition Classes
- SparseVectorC → VectoC
-
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.Convert 'this' vector to a
String.- Definition Classes
- SparseVectorC → VectoC → TraversableLike → AnyRef → Any
-
def
toString2: String
Convert 'this' vector to a
String, showing the zero elements as well, -
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 >: SparseVectorC](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
- SparseVectorC → PartiallyOrdered
-
def
unary_-(): SparseVectorC
Return the negative of 'this' vector (unary minus).
Return the negative of 'this' vector (unary minus).
- Definition Classes
- SparseVectorC → VectoC
-
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).
Set 'this' vector's elements over the given range (vector slicing).
- r
the given range
- u
the vector to assign
- Definition Classes
- SparseVectorC → VectoC
-
def
update(r: Range, x: Complex): Unit
Set 'this' vector's elements over the given range (vector slicing).
Set 'this' vector's elements over the given range (vector slicing).
- r
the given range
- x
the value to assign
- Definition Classes
- SparseVectorC → VectoC
-
def
update(i: Int, x: Complex): Unit
Set 'this' vector's element at the 'i'-th index position.
Set 'this' vector's element at the 'i'-th index position.
- i
the given index
- x
the value to assign
- Definition Classes
- SparseVectorC → VectoC
-
var
v: RowMap
- 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): SparseVectorC
Create a zero vector (all elements are zero) of length 'size'.
Create a zero vector (all elements are zero) of length 'size'.
- size
the number of elements in the vector
- Definition Classes
- SparseVectorC → VectoC
-
def
~^(s: Double): SparseVectorC
Return the vector containing each element of 'this' vector raised to the s-th power.
Return the vector containing each element of 'this' vector raised to the s-th power.
- s
the scalar exponent
- Definition Classes
- SparseVectorC → VectoC
-
def
~^=(s: Double): SparseVectorC
Raise each element of 'this' vector to the 's'-th power.
Raise each element of 'this' vector to the 's'-th power.
- s
the scalar exponent
- Definition Classes
- SparseVectorC → VectoC
-
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
-
def
⦁(b: SparseVectorC): 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
-
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