class VectorN[T] extends Traversable[T] with PartiallyOrdered[VectorN[T]] with Error with Serializable
The VectorN
class stores and operates on Numeric Vectors of various sizes
and types. The element type may be any subtype of Numeric. Some methods
only work for Fractional types. When/if Scala adds 'sqrt' and 'pow' to
Fractional
types the following methods will be implemented: ~, ~=, 'normalizeU'.
- Alphabetic
- By Inheritance
- VectorN
- Serializable
- Serializable
- Error
- PartiallyOrdered
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
VectorN(u: VectorN[T])(implicit arg0: (T) ⇒ Ordered[T], arg1: ClassTag[T], arg2: Numeric[T])
Construct a vector and assign values from vector 'u'.
Construct a vector and assign values from vector 'u'.
- u
the other vector
-
new
VectorN(u: Array[T])(implicit arg0: (T) ⇒ Ordered[T], arg1: ClassTag[T], arg2: Numeric[T])
Construct a vector from an array of values.
Construct a vector from an array of values.
- u
the array of values
-
new
VectorN(dim: Int, v: Array[T] = null)(implicit arg0: (T) ⇒ Ordered[T], arg1: ClassTag[T], arg2: Numeric[T])
- 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
*(m: Matrix[T]): VectorN[T]
Multiply this 'row' vector by matrix 'm'.
Multiply this 'row' vector by matrix 'm'.
- m
the matrix to multiply by
-
def
*(b: VectorN[T]): VectorN[T]
Multiply this vector by vector 'b'.
Multiply this vector by vector 'b'.
- b
the vector to multiply by
-
def
*(s: T): VectorN[T]
Multiply this vector by scalar 's'.
Multiply this vector by scalar 's'.
- s
the scalar to multiply by
-
def
*=(s: T): VectorN[T]
Multiply in-place this vector and scalar 's'.
Multiply in-place this vector and scalar 's'.
- s
the scalar to add
-
def
*=(b: VectorN[T]): VectorN[T]
Multiply in-place this vector and vector 'b'.
Multiply in-place this vector and vector 'b'.
- b
the vector to add
-
def
+(s: (T, Int)): VectorN[T]
Add this vector and scalar 's._1' only at position 's._2'.
Add this vector and scalar 's._1' only at position 's._2'.
- s
the (scalar, position) to add
-
def
+(s: T): VectorN[T]
Add this vector and scalar 's'.
Add this vector and scalar 's'.
- s
the scalar to add
-
def
+(b: VectorN[T]): VectorN[T]
Add this vector and vector 'b'.
Add this vector and vector 'b'.
- b
the vector to add
-
def
++(b: VectorN[T]): VectorN[T]
Concatenate this vector and vector 'b'.
Concatenate this vector and vector 'b'.
- b
the vector to be concatenated
-
def
++(b: T): VectorN[T]
Concatenate this vector and scalar 'b'.
Concatenate this vector and scalar 'b'.
- b
the vector to be concatenated
-
def
++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
+=(s: T): VectorN[T]
Add in-place this vector and scalar 's'.
Add in-place this vector and scalar 's'.
- s
the scalar to add
-
def
+=(b: VectorN[T]): VectorN[T]
Add in-place this vector and vector 'b'.
Add in-place this vector and vector 'b'.
- b
the vector to add
-
def
-(s: (T, Int)): VectorN[T]
From this vector subtract scalar 's._1' only at position 's._2'.
From this vector subtract scalar 's._1' only at position 's._2'.
- s
the (scalar, position) to subtract
-
def
-(s: T): VectorN[T]
From this vector subtract scalar 's'.
From this vector subtract scalar 's'.
- s
the scalar to subtract
-
def
-(b: VectorN[T]): VectorN[T]
From this vector subtract vector 'b'.
From this vector subtract vector 'b'.
- b
the vector to subtract
-
def
-=(s: T): VectorN[T]
From this vector subtract in-place scalar 's'.
From this vector subtract in-place scalar 's'.
- s
the scalar to add
-
def
-=(b: VectorN[T]): VectorN[T]
From this vector subtract in-place vector 'b'.
From this vector subtract in-place vector 'b'.
- b
the vector to add
-
def
/(s: T)(implicit fr: Fractional[T]): VectorN[T]
Divide this vector by scalar 's'.
Divide this vector by scalar 's'.
- s
the scalar to divide by
-
def
/(b: VectorN[T])(implicit fr: Fractional[T]): VectorN[T]
Divide this vector by vector 'b' (element-by-element).
Divide this vector by vector 'b' (element-by-element).
- b
the vector to divide by
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
/=(s: T)(implicit fr: Fractional[T]): VectorN[T]
Divide in-place this vector and scalar 's'.
Divide in-place this vector and scalar 's'.
- s
the scalar to add
-
def
/=(b: VectorN[T])(implicit fr: Fractional[T]): VectorN[T]
Divide in-place this vector and vector 'b'.
Divide in-place this vector and vector 'b'.
- b
the vector to add
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
<[B >: VectorN[T]](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
<=[B >: VectorN[T]](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
>[B >: VectorN[T]](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
def
>=[B >: VectorN[T]](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
-
val
_0: T
Numeric zero (0)
-
val
_1: T
Numeric one (1)
-
val
_1n: T
Numeric minus one (-1)
-
def
_oneAt(j: Int, size: Int = dim): VectorN[T]
Create a vector of the form (0, ...
Create a vector of the form (0, ... -1, ... 0) where the -1 is at position 'j'.
- j
the position to place the 1
- size
the size of the vector (upper bound = size - 1)
-
def
abs: VectorN[T]
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, T) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
apply(): Array[T]
Get this vector's entire array.
-
def
apply(r: Range): VectorN[T]
Get this vector's elements within the given range (vector slicing).
Get this vector's elements within the given range (vector slicing).
- r
the given range
-
def
apply(i: Int): T
Get this vector's element at the 'i'th index position.
Get this vector's element at the 'i'th index position.
- i
the given index
-
def
argmax(e: Int = dim): Int
Find the argument maximum of this vector (index of maximum element).
Find the argument maximum of this vector (index of maximum element).
- e
the ending index (exclusive) for the search
-
def
argmaxPos(e: Int = dim): Int
Return the argument maximum of this vector (-1 if its not positive).
Return the argument maximum of this vector (-1 if its not positive).
- e
the ending index (exclusive) for the search
-
def
argmin(e: Int = dim): Int
Find the argument minimum of this vector (index of minimum element).
Find the argument minimum of this vector (index of minimum element).
- e
the ending index (exclusive) for the search
-
def
argminNeg(e: Int = dim): Int
Return the argument minimum of this vector (-1 if its not negative).
Return the argument minimum of this vector (-1 if its not negative).
- e
the ending index (exclusive) for the search
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
def
contains(x: T): Boolean
Determine whether x is contained in this vector.
Determine whether x is contained in this vector.
- x
the element to be checked
-
def
copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (T) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
countNeg: Int
Count the number of strictly negative entries in this vector.
-
def
countPos: Int
Count the number of strictly positive entries in this vector.
-
def
cumulate: VectorN[T]
Cumulate the values of this vector from left to right (e.g., create a cdf from a pmf).
Cumulate the values of this vector from left to right (e.g., create a cdf from a pmf). Example: (4, 2, 3, 1) --> (4, 6, 9, 10)
- val dim: Int
-
def
dot(b: VectorN[T]): T
Compute the dot product (or inner product) of this vector with vector 'b'.
Compute the dot product (or inner product) of this vector with vector 'b'.
- b
the other vector
-
def
drop(n: Int): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(b: Any): Boolean
Override equals to determine whether vector this equals vector 'b'.
Override equals to determine whether vector this equals vector 'b'.
- b
the vector to compare with this
- Definition Classes
- VectorN → AnyRef → Any
-
def
exists(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
expand(more: Int = dim): VectorN[T]
Expand the size 'dim' of this vector by 'more' elements.
-
def
filter(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (T) ⇒ Boolean): Option[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
firstNeg(e: Int = dim): Int
Return the index of the first negative element in this vector (-1 otherwise).
Return the index of the first negative element in this vector (-1 otherwise).
- e
the ending index (exclusive) for the search
-
def
firstPos(e: Int = dim): Int
Return the index of the first positive element in this vector (-1 otherwise).
Return the index of the first positive element in this vector (-1 otherwise).
- e
the ending index (exclusive) for the search
-
def
flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (T) ⇒ 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 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (T) ⇒ U): Unit
Iterate over the vector element by element.
Iterate over the vector element by element.
- f
the function to apply
- Definition Classes
- VectorN → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
Must also override hashCode to be be compatible with equals.
Must also override hashCode to be be compatible with equals.
- Definition Classes
- VectorN → AnyRef → Any
-
def
head: T
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[T]]
- Definition Classes
- TraversableLike
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNonnegative: Boolean
Check whether this vector is nonnegative (has no negative elements).
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
last: T
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
mag: T
Find the element with the greatest magnitude in this vector.
-
def
map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max(b: VectorN[T]): VectorN[T]
Take the maximum of this vector with vector 'b' (element-by element).
Take the maximum of this vector with vector 'b' (element-by element).
- b
the other vector
-
def
max(e: Int = dim): T
Find the maximum element in this vector.
Find the maximum element in this vector.
- e
the ending index (exclusive) for the search
-
def
max[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min(b: VectorN[T]): VectorN[T]
Take the minimum of this vector with vector 'b' (element-by element).
Take the minimum of this vector with vector 'b' (element-by element).
- b
the other vector
-
def
min(e: Int = dim): T
Find the minimum element in this vector.
Find the minimum element in this vector.
- e
the ending index (exclusive) for the search
-
def
min[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- 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
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[T, Traversable[T]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
norm(implicit fr: Fractional[T]): Double
Compute the Euclidean norm (2-norm) of this vector (requires
Fractional
type). -
def
norm1: T
Compute the Manhattan norm (1-norm) of this vector.
-
def
normSq: T
Compute the Euclidean norm (2-norm) squared of this vector.
-
def
normalize(implicit fr: Fractional[T]): VectorN[T]
Normalize this vector so that it sums to one (like a probability vector).
-
def
normalize1(implicit fr: Fractional[T]): VectorN[T]
Normalize this vector to have a maximum of one.
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
oneAt(j: Int, size: Int = dim): VectorN[T]
Create a vector of the form (0, ...
Create a vector of the form (0, ... 1, ... 0) where the 1 is at position 'j'.
- j
the position to place the 1
- size
the size of the vector (upper bound = size - 1)
-
def
par: ParIterable[T]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[T, ParIterable[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameDimensions(b: VectorN[T]): Boolean
Check whether the other vector is at least as long as this vector.
Check whether the other vector is at least as long as this vector.
- b
the other vector
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
select(index: Array[Int]): VectorN[T]
Select a subset of elements of this vector corresponding to a index/basis.
Select a subset of elements of this vector corresponding to a index/basis.
- index
the set of index positions (e.g., 0, 2, 5)
-
def
seq: Traversable[T]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
set(x: T): Unit
Set each value in this vector to 'x'.
Set each value in this vector to 'x'.
- x
the value to be assigned
-
def
setAll(u: Array[T]): Unit
Set the values in this vector to the values in array 'u'.
Set the values in this vector to the values in array 'u'.
- u
the array of values to be assigned
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, till: Int): VectorN[T]
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
- VectorN → TraversableLike → GenTraversableLike
-
def
sort(): Unit
Sort this vector in-place in non-decreasing order.
-
def
span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sq: VectorN[T]
Square each element of this vector.
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum: T
Sum the elements of this vector.
-
def
sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sum_ne(i: Int): T
Sum the elements of this vector skipping the 'i'th element.
Sum the elements of this vector skipping the 'i'th element.
- i
the index of the element to skip
-
def
sum_pos: T
Sum the positive (> 0) elements of this vector.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[T]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: T]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[T]): Traversable[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toDouble: VectorD
Convert a
VectorN [T]
into aVectorN [Double]
, i.e.,VectorD
. -
def
toIndexedSeq: IndexedSeq[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toInt: Vectors.VectorI
Convert a
VectorN [T]
into aVectorN [Int]
, i.e.,VectorI
. -
def
toIterable: Iterable[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[T]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: T]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[T]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
Convert this vector to a string.
Convert this vector to a string.
- Definition Classes
- VectorN → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (T) ⇒ 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
tryCompareTo[B >: VectorN[T]](b: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Option[Int]
Compare this vector with vector 'b'.
-
def
unary_-(): VectorN[T]
Return the negative of this vector (unary minus).
-
def
unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(r: Range, u: VectorN[T]): Unit
Set this vector's elements over the given range (vector slicing).
Set this vector's elements over the given range (vector slicing).
- r
the given range
- u
the vector to assign
-
def
update(r: Range, x: T): Unit
Set this vector's elements over the given range (vector slicing).
Set this vector's elements over the given range (vector slicing).
- r
the given range
- x
the value to assign
-
def
update(i: Int, x: T): 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
-
def
view(from: Int, until: Int): TraversableView[T, Traversable[T]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[T, Traversable[T]]
- 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: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]
- Definition Classes
- TraversableLike → FilterMonadic