VectoI

trait VectoI extends Traversable[Int] with PartiallyOrdered[VectoI] with Vec with Error with Serializable

The VectoI class stores and operates on Numeric Vectors of base type Int. It follows the framework of gen.VectorN [T] and is provided for performance.

Linear Supertypes

Serializable, Serializable, Error, Vec, PartiallyOrdered[VectoI], Traversable[Int], GenTraversable[Int], GenericTraversableTemplate[Int, Traversable], TraversableLike[Int, Traversable[Int]], GenTraversableLike[Int, Traversable[Int]], Parallelizable[Int, ParIterable[Int]], TraversableOnce[Int], GenTraversableOnce[Int], FilterMonadic[Int, Traversable[Int]], HasNewBuilder[Int, Traversable[Int]], AnyRef, Any

Known Subclasses

RleVectorI, SparseVectorI, VectorI

Ordering

Alphabetic
By Inheritance

Inherited

VectoI
Serializable
Serializable
Error
Vec
PartiallyOrdered
Traversable
GenTraversable
GenericTraversableTemplate
TraversableLike
GenTraversableLike
Parallelizable
TraversableOnce
GenTraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Type Members

type Self = Traversable[Int]

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

Definition Classes
TraversableLike

Abstract Value Members

abstract def *(s: (Int, Int)): VectoI
Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.
Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.
s
the (position, scalar) to multiply
abstract def *(s: Int): VectoI
Multiply 'this' vector by scalar 's'.
Multiply 'this' vector by scalar 's'.
s
the scalar to multiply by
abstract def *(b: VectoI): VectoI
Multiply 'this' vector by vector 'b'.
Multiply 'this' vector by vector 'b'.
b
the vector to multiply by
abstract def *=(s: Int): VectoI
Multiply in-place 'this' vector and scalar 's'.
Multiply in-place 'this' vector and scalar 's'.
s
the scalar to multiply by
abstract def *=(b: VectoI): VectoI
Multiply in-place 'this' vector and vector 'b'.
Multiply in-place 'this' vector and vector 'b'.
b
the vector to multiply by
abstract def +(s: (Int, Int)): VectoI
Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.
Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.
s
the (position, scalar) to add
abstract def +(s: Int): VectoI
Add 'this' vector and scalar 's'.
Add 'this' vector and scalar 's'.
s
the scalar to add
abstract def +(b: VectoI): VectoI
Add 'this' vector and vector 'b'.
Add 'this' vector and vector 'b'.
b
the vector to add
abstract def ++(s: Int): VectoI
Concatenate 'this' vector and scalar 's'.
Concatenate 'this' vector and scalar 's'.
s
the scalar to be concatenated
abstract def ++(b: VectoI): VectoI
Concatenate 'this' vector and vector' b'.
Concatenate 'this' vector and vector' b'.
b
the vector to be concatenated
abstract def +=(s: Int): VectoI
Add in-place 'this' vector and scalar 's'.
Add in-place 'this' vector and scalar 's'.
s
the scalar to add
abstract def +=(b: VectoI): VectoI
Add in-place 'this' vector and vector 'b'.
Add in-place 'this' vector and vector 'b'.
b
the vector to add
abstract def -(s: (Int, Int)): VectoI
From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.
From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.
s
the (position, scalar) to subtract
abstract def -(s: Int): VectoI
From 'this' vector subtract scalar 's'.
From 'this' vector subtract scalar 's'.
s
the scalar to subtract
abstract def -(b: VectoI): VectoI
From 'this' vector subtract vector 'b'.
From 'this' vector subtract vector 'b'.
b
the vector to subtract
abstract def -=(s: Int): VectoI
From 'this' vector subtract in-place scalar 's'.
From 'this' vector subtract in-place scalar 's'.
s
the scalar to substract
abstract def -=(b: VectoI): VectoI
From 'this' vector subtract in-place vector 'b'.
From 'this' vector subtract in-place vector 'b'.
b
the vector to subtract
abstract def /(s: (Int, Int)): VectoI
Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.
Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.
s
the (position, scalar) to divide
abstract def /(s: Int): VectoI
Divide 'this' vector by scalar 's'.
Divide 'this' vector by scalar 's'.
s
the scalar to divide by
abstract def /(b: VectoI): VectoI
Divide 'this' vector by vector 'b' (element-by-element).
Divide 'this' vector by vector 'b' (element-by-element).
b
the vector to divide by
abstract def /=(s: Int): VectoI
Divide in-place 'this' vector and scalar 's'.
Divide in-place 'this' vector and scalar 's'.
s
the scalar to divide by
abstract def /=(b: VectoI): VectoI
Divide in-place 'this' vector and vector 'b'.
Divide in-place 'this' vector and vector 'b'.
b
the vector to divide by
abstract def _oneAt(j: Int, size: Int = dim): VectoI
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)
abstract def abs: VectoI
Return the vector that is the element-wise absolute value of 'this' vector.
abstract def apply(): IndexedSeq[Int]
Get 'this' vector's entire sequence/array.
abstract def apply(r: Range): VectoI
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
abstract 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
abstract 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
abstract 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
abstract def argmaxPos(e: Int = dim): Int
Return the argument maximum of 'this' vector (-1 if it's not positive).
Return the argument maximum of 'this' vector (-1 if it's not positive).
e
the ending index (exclusive) for the search
abstract 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
abstract 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
abstract def argminNeg(e: Int = dim): Int
Return the argument minimum of 'this' vector (-1 if it's not negative).
Return the argument minimum of 'this' vector (-1 if it's not negative).
e
the ending index (exclusive) for the search
abstract 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
abstract def copy: VectoI
Create a copy of this Vector.
abstract def countNeg: Int
Count the number of strictly negative elements in 'this' vector.
abstract def countPos: Int
Count the number of strictly positive elements in 'this' vector.
abstract def countZero: Int
Count the number of zero elements in the 'this' vector.
abstract def countinct: Int
Count the number of distinct elements in 'this' vector.
abstract def cumulate: VectoI
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)
abstract val dim: Int
Vector dimension
abstract def distinct: VectoI
Create a vector consisting of the distinct elements in 'this' vector.
abstract def dot(b: VectoI): 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
abstract def expand(more: Int = dim): VectoI
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
abstract def filterPos(p: (Int) ⇒ 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 (Boolean function) to apply
abstract 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
abstract 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
abstract 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
VectoI → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
abstract def indexOf(x: Int, 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
abstract def indexWhere(p: (Int) ⇒ 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
abstract def isNonnegative: Boolean
Check whether 'this' vector is nonnegative (has no negative elements).
abstract def map(f: (Int) ⇒ Int): VectoI
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
abstract def max(b: VectoI): VectoI
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
abstract 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
abstract def min(b: VectoI): VectoI
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
abstract 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
abstract def norm1: Int
Compute the Manhattan norm (1-norm) of 'this' vector.
abstract def normalize: VectoI
Normalize 'this' vector so that it sums to one (like a probability vector).
abstract def normalize1: VectoI
Normalize 'this' vector to have a maximum of one.
abstract def normalizeU: VectoI
Normalize 'this' vector so its length is one (unit vector).
abstract def one(size: Int): VectoI
Create a one vector (all elements are one) of length 'size'.
Create a one vector (all elements are one) of length 'size'.
size
the size of the new vector
abstract def oneAt(j: Int, size: Int = dim): VectoI
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)
abstract def rank: VectoI
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).
abstract def recip: VectoI
Return the vector containing the reciprocal of each element of 'this' vector.
abstract def select(basis: Array[Int]): VectoI
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)
abstract def set(u: Seq[Int]): Unit
Set the values in 'this' vector to the values in sequence 'u'.
Set the values in 'this' vector to the values in sequence 'u'.
u
the sequence of values to be assigned
abstract 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
abstract def sort(): Unit
Sort 'this' vector in-place in ascending (non-decreasing) order.
abstract def sort2(): Unit
Sort 'this' vector in-place in descending (non-increasing) order.
abstract def sum: Int
Sum the elements of 'this' vector.
abstract def sumNE(i: Int): Int
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
abstract def sumPos: Int
Sum the positive (> 0) elements of 'this' vector.
abstract 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
abstract def toDense: VectorI
Convert 'this' VectoI into a dense version.
abstract def toDouble: VectoD
Convert 'this' VectoI into a VectoD.
abstract def toInt: VectoI
Convert 'this' VectoI into a VectoI.
abstract def toLong: VectoL
Convert 'this' VectoI into a VectoL.
abstract def tryCompareTo[B >: VectoI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Option[Int]

Definition Classes
PartiallyOrdered
abstract def unary_-(): VectoI
Return the negative of 'this' vector (unary minus).
abstract def update(r: Range, u: VectoI): 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
abstract 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
abstract 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
abstract def zero(size: Int): VectoI
Create a zero vector (all elements are zero) of length 'size'.
Create a zero vector (all elements are zero) of length 'size'.
size
the size of the new vector
abstract def ~^(s: Int): VectoI
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
abstract def ~^=(s: Int): VectoI
Raise in-place each element of 'this' vector to the 's'-th power.
Raise in-place each element of 'this' vector to the 's'-th power.
s
the scalar exponent

Concrete Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
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 /:[B](z: B)(op: (B, Int) ⇒ B): B

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

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

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

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

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

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

Definition Classes
PartiallyOrdered
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(iv: VectoI): VectoI
Get 'this' vector's elements that are given in the index vector.
Get 'this' vector's elements that are given in the index vector.
iv
the index vector
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[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 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 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(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def exists(p: (Int) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
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
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 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
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 >: 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 genericBuilder[B]: Builder[B, Traversable[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@native()
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

Definition Classes
AnyRef → Any
Annotations
@native()
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
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[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
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 mean: Double
Compute the mean of the elements of 'this' vector.
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
val nd: Double
Number of elements in the vector as a Int
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: Int
Compute the Euclidean norm (2-norm) of 'this' vector.
def normSq: Int
Compute the Euclidean norm (2-norm) squared of 'this' vector.
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
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 pvariance: Double
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.
val range: Range
Range for the storage array
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: VectoI): 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 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 seq: Traversable[Int]

Definition Classes
Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
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
Return the size (number of elements) of 'this' vector.
Return the size (number of elements) of 'this' vector.

Definition Classes
VectoI → Vec → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
def slice(rg: Range): VectoI
Slice 'this' vector over the given range 'rg'.
Slice 'this' vector over the given range 'rg'.
rg
the range specifying the slice
def slice(from: Int, till: Int = dim): VectoI
Slice 'this' vector 'from' to 'end'.
Slice 'this' vector 'from' to 'end'. Override in implementing classes.
from
the start of the slice (included)
till
the end of the slice (excluded)

Definition Classes
VectoI → TraversableLike → GenTraversableLike
def sliceEx(rg: Range): VectoI
Slice 'this' vector excluding the given range 'rg'.
Slice 'this' vector excluding the given range 'rg'.
rg
the excluded range of the slice
def span(p: (Int) ⇒ Boolean): (Traversable[Int], Traversable[Int])

Definition Classes
TraversableLike → GenTraversableLike
def split(k: Int): Array[VectoI]
Split 'this' vector into 'k' arrays of equal sizes (perhaps except for the last one).
Split 'this' vector into 'k' arrays of equal sizes (perhaps except for the last one).
k
the number of pieces the vector is to be split into
def splitAt(n: Int): (Traversable[Int], Traversable[Int])

Definition Classes
TraversableLike → GenTraversableLike
def sq: VectoI
Return the vector containing the square of each element of 'this' vector.
def stringPrefix: String

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

Definition Classes
TraversableOnce → GenTraversableOnce
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 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

Definition Classes
TraversableLike → 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 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 variance: Double
Compute the (unbiased) sample variance of the elements of 'this' vector.
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
@native() @throws( ... )
def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, Traversable[Int]]

Definition Classes
TraversableLike → FilterMonadic
def ∙(b: VectoI): 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 ≠(b: VectoI): Boolean
Compare 'this' vector with that vector 'b' for inequality.
Compare 'this' vector with that vector 'b' for inequality.
b
that vector
def ≤(b: VectoI): 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
def ≥(b: VectoI): 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

Packages

VectoI

trait VectoI extends Traversable[Int] with PartiallyOrdered[VectoI] with Vec with Error with Serializable

Type Members

Abstract Value Members

Concrete Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoI]

Inherited from Traversable[Int]

Inherited from GenTraversable[Int]

Inherited from GenericTraversableTemplate[Int, Traversable]

Inherited from TraversableLike[Int, Traversable[Int]]

Inherited from GenTraversableLike[Int, Traversable[Int]]

Inherited from Parallelizable[Int, ParIterable[Int]]

Inherited from TraversableOnce[Int]

Inherited from GenTraversableOnce[Int]

Inherited from FilterMonadic[Int, Traversable[Int]]

Inherited from HasNewBuilder[Int, Traversable[Int]]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

VectoI 

trait VectoI extends Traversable[Int] with PartiallyOrdered[VectoI] with Vec with Error with Serializable

Type Members

Abstract Value Members

Concrete Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoI]

Inherited from Traversable[Int]

Inherited from GenTraversable[Int]

Inherited from GenericTraversableTemplate[Int, Traversable]

Inherited from TraversableLike[Int, Traversable[Int]]

Inherited from GenTraversableLike[Int, Traversable[Int]]

Inherited from Parallelizable[Int, ParIterable[Int]]

Inherited from TraversableOnce[Int]

Inherited from GenTraversableOnce[Int]

Inherited from FilterMonadic[Int, Traversable[Int]]

Inherited from HasNewBuilder[Int, Traversable[Int]]

Inherited from AnyRef

Inherited from Any

Ungrouped

VectoI