class VectorN[T] extends Iterable[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
- Error
- PartiallyOrdered
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new VectorN(u: VectorN[T])(implicit arg0: ClassTag[T], arg1: 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: ClassTag[T], arg1: 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: ClassTag[T], arg1: Numeric[T], ev: (T) => Ordered[T])
- dim
the dimension/size of the vector
- v
the 1D array used to store vector elements
Type Members
- type AsPartiallyOrdered[B] = (B) => PartiallyOrdered[B]
- Definition Classes
- PartiallyOrdered
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
- final def ++[B >: T](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- 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 /=(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 >: VectorN[T]](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def <=[B >: VectorN[T]](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def >[B >: VectorN[T]](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
- Definition Classes
- PartiallyOrdered
- def >=[B >: VectorN[T]](that: B)(implicit arg0: AsPartiallyOrdered[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.
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- 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 className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coll: VectorN.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[T, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: T](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- 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): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: T](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: T](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (T) => Boolean): Int
- Definition Classes
- IterableOnceOps
- 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): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[T]
- Definition Classes
- IterableOps
- def dropWhile(p: (T) => Boolean): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[T]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- 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
- IterableOnceOps
- def expand(more: Int = dim): VectorN[T]
Expand the size 'dim' of this vector by 'more' elements.
- def filter(pred: (T) => Boolean): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (T) => Boolean): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: (T) => Boolean): Option[T]
- Definition Classes
- IterableOnceOps
- 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](f: (T) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (T) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- 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
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- 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 → IterableOnceOps
- def fromSpecific(coll: IterableOnce[T]): Iterable[T]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (T) => K): Map[K, Iterable[T]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[T]]
- Definition Classes
- IterableOps
- 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
- IterableOps
- def headOption: Option[T]
- Definition Classes
- IterableOps
- def init: Iterable[T]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[T]]
- Definition Classes
- IterableOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNonnegative: Boolean
Check whether this vector is nonnegative (has no negative elements).
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator: Iterator[T]
Return an iterator which yields all the elements.
Return an iterator which yields all the elements.
- Definition Classes
- VectorN → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: T
- Definition Classes
- IterableOps
- def lastOption: Option[T]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, VectorN.this.type]
- Definition Classes
- Iterable
- def mag: T
Find the element with the greatest magnitude in this vector.
- def map[B](f: (T) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- 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 ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- 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 ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[T, Iterable[T]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- 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() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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 partition(p: (T) => Boolean): (Iterable[T], Iterable[T])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: T](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: T](op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: T](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: T](op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[T]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- 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](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, T) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (T, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- 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 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
- IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- 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 → IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[T]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[T]]
- Definition Classes
- IterableOps
- def sort(): Unit
Sort this vector in-place in non-decreasing order.
- def span(p: (T) => Boolean): (Iterable[T], Iterable[T])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Iterable[T], Iterable[T])
- Definition Classes
- IterableOps → IterableOnceOps
- def sq: VectorN[T]
Square each element of this vector.
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum: T
Sum the elements of this vector.
- def sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- 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: Iterable[T]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[T]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[T]
- Definition Classes
- IterableOps
- def takeWhile(p: (T) => Boolean): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (T) => U): Iterable[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[T, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: T]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toDouble: VectorD
Convert a
VectorN [T]
into aVectorN [Double]
, i.e.,VectorD
. - def toIndexedSeq: IndexedSeq[T]
- Definition Classes
- IterableOnceOps
- def toInt: Vectors.VectorI
Convert a
VectorN [T]
into aVectorN [Int]
, i.e.,VectorI
. - final def toIterable: VectorN.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[T]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[T]
- Definition Classes
- IterableOnceOps
- def toSet[B >: T]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
Convert this vector to a string.
Convert this vector to a string.
- Definition Classes
- VectorN → Iterable → AnyRef → Any
- def toVector: Vector[T]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (T) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- 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)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- 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: View[T]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (T) => Boolean): WithFilter[T, Iterable]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Iterable[(T, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[(T, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- def ++:[B >: T](that: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def /:[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[Iterable]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def repr: Iterable[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def seq: VectorN.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def view(from: Int, until: Int): View[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)