VectorI

Instance Constructors

new VectorI(u: VectorI)

Construct a vector and assign values from vector u.
Construct a vector and assign values from vector u.
u
the other vector
new VectorI(u: Array[Int])

Construct a vector from an array of values.
Construct a vector from an array of values.
u
the array of values
new VectorI(dim: Int, v: Array[Int] = null)

dim
the dimension/size of the vector
v
the 1D array used to store vector elements

Type Members

type Self = Traversable[Int]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def *(m: Matrii): VectorI

Multiply this 'row' vector by matrix m.
Multiply this 'row' vector by matrix m.
m
the matrix to multiply by
def *(s: Int): VectorI

Multiply this vector by scalar s.
Multiply this vector by scalar s.
s
the scalar to multiply by
def *(b: VectorI): VectorI

Multiply this vector by vector b.
Multiply this vector by vector b.
b
the vector to multiply by
def *=(s: Int): VectorI

Multiply in-place this vector and scalar s.
Multiply in-place this vector and scalar s.
s
the scalar to add
def *=(b: VectorI): VectorI

Multiply in-place this vector and vector b.
Multiply in-place this vector and vector b.
b
the vector to add
def +(s: (Int, Int)): VectorI

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: Int): VectorI

Add this vector and scalar s.
Add this vector and scalar s.
s
the scalar to add
def +(b: VectorI): VectorI

Add this vector and vector b.
Add this vector and vector b.
b
the vector to add
def ++(b: Int): VectorI

Concatenate this vector and scalar b.
Concatenate this vector and scalar b.
b
the scalar to be concatenated
def ++(b: VectorI): VectorI

Concatenate this vector and vector b.
Concatenate this vector and vector b.
b
the vector to be concatenated
def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike
def +=(s: Int): VectorI

Add in-place this vector and scalar s.
Add in-place this vector and scalar s.
s
the scalar to add
def +=(b: VectorI): VectorI

Add in-place this vector and vector b.
Add in-place this vector and vector b.
b
the vector to add
def -(s: (Int, Int)): VectorI

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: Int): VectorI

From this vector subtract scalar s.
From this vector subtract scalar s.
s
the scalar to subtract
def -(b: VectorI): VectorI

From this vector subtract vector b.
From this vector subtract vector b.
b
the vector to subtract
def -=(s: Int): VectorI

From this vector subtract in-place scalar s.
From this vector subtract in-place scalar s.
s
the scalar to add
def -=(b: VectorI): VectorI

From this vector subtract in-place vector b.
From this vector subtract in-place vector b.
b
the vector to add
def /(s: Int): VectorI

Divide this vector by scalar s.
Divide this vector by scalar s.
s
the scalar to divide by
def /(b: VectorI): VectorI

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, Int) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def /=(s: Int): VectorI

Divide in-place this vector and scalar s.
Divide in-place this vector and scalar s.
s
the scalar to add
def /=(b: VectorI): VectorI

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: (Int, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def <[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
def <=[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def >[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
def >=[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

Definition Classes
PartiallyOrdered
def _oneAt(j: Int, size: Int = dim): VectorI

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: VectorI

Return the vector that is the element-wise absolute value of this matrix.
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, Int) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def apply(): Array[Int]

Get this vector's entire array.
def apply(r: Range): VectorI

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): Int

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
@throws( ... )
def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[Traversable]

Definition Classes
Traversable → GenTraversable → GenericTraversableTemplate
def contains(x: Int): 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 >: Int](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: Int](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (Int) ⇒ 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: VectorI

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

the dimension/size of the vector
def dot(b: VectorI): Int

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[Int]

Definition Classes
TraversableLike → GenTraversableLike
def dropWhile(p: (Int) ⇒ Boolean): Traversable[Int]

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
VectorI → AnyRef → Any
def exists(p: (Int) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def expand(more: Int = dim): VectorI

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
def filter(p: (Int) ⇒ Boolean): Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (Int) ⇒ Boolean): Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (Int) ⇒ Boolean): Option[Int]

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: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Traversable[B]

Definition Classes
GenericTraversableTemplate
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 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def forall(p: (Int) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (Int) ⇒ U): Unit

Iterate over this vector element by element.
Iterate over this vector element by element.
f
the function to apply

Definition Classes
VectorI → 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: (Int) ⇒ K): Map[K, Traversable[Int]]

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
VectorI → AnyRef → Any
def head: Int

Definition Classes
TraversableLike → GenTraversableLike
def headOption: Option[Int]

Definition Classes
TraversableLike → GenTraversableLike
def indices: Range

Produce the range of all indices (0 to one less than dim).
def init: Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Traversable[Int]]

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: Int

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[Int]

Definition Classes
TraversableLike → GenTraversableLike
def mag: Int

Find the element with the greatest magnitude in this vector.
def map(f: (Int) ⇒ Int): VectorI

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
def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max(b: VectorI): VectorI

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): Int

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 >: Int](implicit cmp: Ordering[B]): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def min(b: VectorI): VectorI

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): Int

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 >: Int](implicit cmp: Ordering[B]): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

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[Int, Traversable[Int]]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
def norm: Double

Compute the Euclidean norm (2-norm) of this vector.
def norm1: Int

Compute the Manhattan norm (1-norm) of this vector.
def normSq: Int

Compute the Euclidean norm (2-norm) squared of this vector.
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def oneAt(j: Int, size: Int = dim): VectorI

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[Int]

Definition Classes
Parallelizable
def parCombiner: Combiner[Int, ParIterable[Int]]

Attributes
protected[this]
Definition Classes
TraversableLike → Parallelizable
def partition(p: (Int) ⇒ Boolean): (Traversable[Int], Traversable[Int])

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: Int](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: Int](op: (Int, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[Int]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameDimensions(b: VectorI): 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 >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], 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(basis: Array[Int]): VectorI

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)
def seq: Traversable[Int]

Definition Classes
Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def set(x: Int): 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[Int]): 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 setFormat(newFormat: String): Unit

Set the format to the newFormat (e.g., "%.6g,\t" or "%12.6g,\t").
Set the format to the newFormat (e.g., "%.6g,\t" or "%12.6g,\t").
newFormat
the new format String
def size: Int

Definition Classes
TraversableOnce → GenTraversableOnce
def slice(from: Int, till: Int): VectorI

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
VectorI → TraversableLike → GenTraversableLike
def sort(): Unit

Sort this vector in-place in ascending (non-decreasing) order.
def span(p: (Int) ⇒ Boolean): (Traversable[Int], Traversable[Int])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Traversable[Int], Traversable[Int])

Definition Classes
TraversableLike → GenTraversableLike
def sq: VectorI

Return the vector containing the square each element of this vector.
def stringPrefix: String

Definition Classes
TraversableLike → GenTraversableLike
def sum: Int

Sum the elements of this vector.
def sum[B >: Int](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def sum_ne(i: Int): Int

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: Int

Sum the positive (> 0) elements of this vector.
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
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Traversable[Int]]

Definition Classes
TraversableLike
def take(n: Int): Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def takeWhile(p: (Int) ⇒ Boolean): Traversable[Int]

Definition Classes
TraversableLike → GenTraversableLike
def thisCollection: Traversable[Int]

Attributes
protected[this]
Definition Classes
TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Int, Col[Int]]): Col[Int]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: Int]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Traversable[Int]): Traversable[Int]

Attributes
protected[this]
Definition Classes
TraversableLike
def toDouble: VectorD

Convert a VectorI into a VectorD.
def toIndexedSeq: IndexedSeq[Int]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[Int]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterator: Iterator[Int]

Definition Classes
TraversableLike → GenTraversableOnce
def toList: List[Int]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[Int]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: Int]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[Int]

Definition Classes
TraversableLike → GenTraversableOnce
def toString(): String

Convert this vector to a String.
Convert this vector to a String.

Definition Classes
VectorI → TraversableLike → AnyRef → Any
def toTraversable: Traversable[Int]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[Int]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def tryCompareTo[B >: VectorI](b: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Option[Int]

Compare this vector with vector b.
Compare this vector with vector b.
b
the other vector

Definition Classes
VectorI → PartiallyOrdered
def unary_-(): VectorI

Return the negative of this vector (unary minus).
def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

Definition Classes
GenericTraversableTemplate
def update(r: Range, u: VectorI): 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: Int): 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: Int): 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
var v: Array[Int]

the 1D array used to store vector elements
the 1D array used to store vector elements

Attributes
protected
def view(from: Int, until: Int): TraversableView[Int, Traversable[Int]]

Definition Classes
TraversableLike
def view: TraversableView[Int, Traversable[Int]]

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: (Int) ⇒ Boolean): FilterMonadic[Int, Traversable[Int]]

Definition Classes
TraversableLike → FilterMonadic
def ~^(s: Int): VectorI

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
def ~^=(s: Int): Unit

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

Related Docs: object VectorI | package linalgebra

class VectorI extends Traversable[Int] with PartiallyOrdered[VectorI] with Error with Serializable

Instance Constructors

new VectorI(u: VectorI)

new VectorI(u: Array[Int])

new VectorI(dim: Int, v: Array[Int] = null)

Type Members

type Self = Traversable[Int]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(m: Matrii): VectorI

def *(s: Int): VectorI

def *(b: VectorI): VectorI

def *=(s: Int): VectorI

def *=(b: VectorI): VectorI

def +(s: (Int, Int)): VectorI

def +(s: Int): VectorI

def +(b: VectorI): VectorI

def ++(b: Int): VectorI

def ++(b: VectorI): VectorI

def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

def +=(s: Int): VectorI

def +=(b: VectorI): VectorI

def -(s: (Int, Int)): VectorI

def -(s: Int): VectorI

def -(b: VectorI): VectorI

def -=(s: Int): VectorI

def -=(b: VectorI): VectorI

def /(s: Int): VectorI

def /(b: VectorI): VectorI

def /:[B](z: B)(op: (B, Int) ⇒ B): B

def /=(s: Int): VectorI

def /=(b: VectorI): VectorI

def :\[B](z: B)(op: (Int, B) ⇒ B): B

def <[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

def <=[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

final def ==(arg0: Any): Boolean

def >[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

def >=[B >: VectorI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean

def _oneAt(j: Int, size: Int = dim): VectorI

def abs: VectorI

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, Int) ⇒ B, combop: (B, B) ⇒ B): B

def apply(): Array[Int]

def apply(r: Range): VectorI

def apply(i: Int): Int

def argmax(e: Int = dim): Int

def argmaxPos(e: Int = dim): Int

def argmin(e: Int = dim): Int

def argminNeg(e: Int = dim): Int

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

def companion: GenericCompanion[Traversable]

def contains(x: Int): Boolean

def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Int](xs: Array[B]): Unit

def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

def count(p: (Int) ⇒ Boolean): Int

def countNeg: Int

def countPos: Int

def cumulate: VectorI

val dim: Int

def dot(b: VectorI): Int

def drop(n: Int): Traversable[Int]

def dropWhile(p: (Int) ⇒ Boolean): Traversable[Int]

final def eq(arg0: AnyRef): Boolean

def equals(b: Any): Boolean

def exists(p: (Int) ⇒ Boolean): Boolean

def expand(more: Int = dim): VectorI

def filter(p: (Int) ⇒ Boolean): Traversable[Int]