final def !=(arg0: Any): Boolean

Definition Classes: AnyRef → Any

final def ##(): Int

Definition Classes: AnyRef → Any

def *(s: Int): SparseVectorI

Multiply 'this' vector by scalar 's'.

s: the scalar to multiply by

Definition Classes: SparseVectorI → VectoI

def *(b: VectoI): SparseVectorI

Multiply 'this' vector by vector 'b'.

b: the vector to multiply by

Definition Classes: SparseVectorI → VectoI

def *=(s: Int): SparseVectorI

Multiply in-place 'this' vector and scalar 's'.

s: the scalar to add

Definition Classes: SparseVectorI → VectoI

def *=(b: VectoI): SparseVectorI

Multiply in-place 'this' vector and vector 'b'.

b: the vector to add

Definition Classes: SparseVectorI → VectoI

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

Add 'this' vector and scalar 's._2' only at position 's._1'.

s: the (scalar, position) to add

Definition Classes: SparseVectorI → VectoI

def +(s: Int): SparseVectorI

Add 'this' vector and scalar 's'.

s: the scalar to add

Definition Classes: SparseVectorI → VectoI

def +(b: VectoI): SparseVectorI

Add 'this' vector and vector 'b'.

b: the vector to add

Definition Classes: SparseVectorI → VectoI

def ++(s: Int): SparseVectorI

Concatenate 'this' vector and scalar 's'.

s: the scalar to be concatenated

Definition Classes: SparseVectorI → VectoI

def ++(b: VectoI): SparseVectorI

Concatenate 'this' vector and vector' b'.

b: the vector to be concatenated

Definition Classes: SparseVectorI → VectoI

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

Add in-place 'this' vector and scalar 's'.

s: the scalar to add

Definition Classes: SparseVectorI → VectoI

def +=(b: VectoI): SparseVectorI

Add in-place 'this' vector and vector 'b'.

b: the vector to add

Definition Classes: SparseVectorI → VectoI

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

From 'this' vector subtract scalar 's._2' only at position 's._1'.

s: the (scalar, position) to subtract

Definition Classes: SparseVectorI → VectoI

def -(s: Int): SparseVectorI

From 'this' vector subtract scalar 's'.

s: the scalar to subtract

Definition Classes: SparseVectorI → VectoI

def -(b: VectoI): SparseVectorI

From 'this' vector subtract vector 'b'.

b: the vector to subtract

Definition Classes: SparseVectorI → VectoI

def -=(s: Int): SparseVectorI

From 'this' vector subtract in-place scalar 's'.

s: the scalar to add

Definition Classes: SparseVectorI → VectoI

def -=(b: VectoI): SparseVectorI

From 'this' vector subtract in-place vector 'b'.

b: the vector to add

Definition Classes: SparseVectorI → VectoI

def /(s: Int): SparseVectorI

Divide 'this' vector by scalar 's'.

s: the scalar to divide by

Definition Classes: SparseVectorI → VectoI

def /(b: VectoI): SparseVectorI

Divide 'this' vector by vector 'b' (element-by-element).

b: the vector to divide by

Definition Classes: SparseVectorI → VectoI

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

Definition Classes: TraversableOnce → GenTraversableOnce

def /=(s: Int): SparseVectorI

Divide in-place 'this' vector and scalar 's'.

s: the scalar to add

Definition Classes: SparseVectorI → VectoI

def /=(b: VectoI): SparseVectorI

Divide in-place 'this' vector and vector 'b'.

b: the vector to add

Definition Classes: SparseVectorI → VectoI

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 _oneAt(j: Int, size: Int = dim): SparseVectorI

Create a vector of the form (0, ...

Create a vector of the form (0, ... -1, ... 0) where the -1 is at position j.

j: the position to place the -1
size: the size of the vector (upper bound = size - 1)

Definition Classes: SparseVectorI → VectoI

def abs: SparseVectorI

Return the vector that is the element-wise absolute value of 'this' vector.

Definition Classes: SparseVectorI → VectoI

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(): IndexedSeq[Int]

Get 'this' vector's entire array.

Definition Classes: SparseVectorI → VectoI

def apply(r: Range): SparseVectorI

Get 'this' vector's elements within the given range (vector slicing).

r: the given range

Definition Classes: SparseVectorI → VectoI

def apply(i: Int): Int

Get 'this' vector's element at the 'i'-th index position.

i: the given index

Definition Classes: SparseVectorI → VectoI

def argmax(s: Int, e: Int): Int

Find the argument maximum of 'this' vector (index of maximum element).

s: the starting index (inclusive) for the search
e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def argmax(e: Int = dim): Int

Find the argument maximum of 'this' vector (index of maximum element).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def argmaxPos(e: Int = dim): Int

Return the argument maximum of 'this' vector (-1 if its not positive).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def argmin(s: Int, e: Int): Int

Find the argument minimum of 'this' vector (index of minimum element).

s: the starting index (inclusive) for the search
e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def argmin(e: Int = dim): Int

Find the argument minimum of 'this' vector (index of minimum element).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def argminNeg(e: Int = dim): Int

Return the argument minimum of 'this' vector (-1 if its not negative).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

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.

x: the element to be checked

Definition Classes: SparseVectorI → VectoI

def copy: SparseVectorI

Create an exact copy of 'this' vector.

Definition Classes: SparseVectorI → VectoI

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 elements in 'this' vector.

Definition Classes: SparseVectorI → VectoI

def countPos: Int

Count the number of strictly positive elements in 'this' vector.

Definition Classes: SparseVectorI → VectoI

def countZero: Int

Count the number of zero elements in 'this' vector.

Definition Classes: SparseVectorI → VectoI

def countinct: Int

Count the number of distinct elements in 'this' vector.

Definition Classes: SparseVectorI → VectoI

def cumulate: SparseVectorI

Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf).

Cumulate the values of 'this' vector from left to right (e.g., create a CDF from a pmf). Example: (4, 2, 3, 1) --> (4, 6, 9, 10)

Definition Classes: SparseVectorI → VectoI

lazy val dim: Int

Dimension

Definition Classes: SparseVectorI → VectoI

val dim_: Int

def distinct: SparseVectorI

Return a new vector consisting of the distinct elements from 'this' vector.

Definition Classes: SparseVectorI → VectoI

def dot(b: SparseVectorI): Int

Compute the dot product (or inner product) of 'this' vector with vector 'b'.

b: the other vector

def dot(b: VectoI): Int

Compute the dot product (or inner product) of 'this' vector with vector 'b'.

b: the other vector

Definition Classes: SparseVectorI → VectoI

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 'this' vector equals vector 'b..

b: the vector to compare with this

Definition Classes: SparseVectorI → VectoI → AnyRef → Any

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

Definition Classes: TraversableLike → TraversableOnce → GenTraversableOnce

def expand(more: Int = dim): SparseVectorI

Expand the size (dim) of 'this' vector by 'more' elements.

more: the number of new elements to add

Definition Classes: SparseVectorI → VectoI

val fString: String

Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"

Attributes: protected
Definition Classes: VectoI

def filter(p: (Int) ⇒ Boolean): SparseVectorI

Filter the elements of 'this' vector based on the predicate 'p', returning a new vector.

p: the predicate (Boolean function) to apply

Definition Classes: SparseVectorI → TraversableLike → GenTraversableLike

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

Definition Classes: TraversableLike → GenTraversableLike

def filterPos(p: (Int) ⇒ Boolean): IndexedSeq[Int]

Filter the elements of 'this' vector based on the predicate 'p', returning the index positions.

p: the predicate (Boolean function) to apply

Definition Classes: SparseVectorI → VectoI

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).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

def firstPos(e: Int = dim): Int

Return the index of the first positive element in 'this' vector (-1 otherwise).

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

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.

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.

f: the function to apply

Definition Classes: SparseVectorI → VectoI → 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 for 'this' vector to be compatible with equals.

Definition Classes: SparseVectorI → VectoI → AnyRef → Any

def head: Int

Definition Classes: TraversableLike → GenTraversableLike

def headOption: Option[Int]

Definition Classes: TraversableLike → GenTraversableLike

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.

x: the given element
e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

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

Find and return index of first element satisfying predicate 'p', or -1 if not found.

p: the predicate to check

Definition Classes: SparseVectorI → VectoI

def indices: Range

Produce the range of all indices (0 to one less than dim).

Definition Classes: VectoI

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).

Definition Classes: SparseVectorI → VectoI

def isSorted: Boolean

Determine whether 'this' vector is in sorted (ascending) order.

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.

Definition Classes: VectoI

def map(f: (Int) ⇒ Int): SparseVectorI

Map the elements of 'this' vector by applying the mapping function 'f'.

f: the function to apply

Definition Classes: SparseVectorI → VectoI

def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That

Definition Classes: TraversableLike → GenTraversableLike → FilterMonadic

def max(b: VectoI): SparseVectorI

Take the maximum of 'this' vector with vector 'b' (element-by element).

b: the other vector

Definition Classes: SparseVectorI → VectoI

def max(e: Int = dim): Int

Find the maximum element in 'this' vector.

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

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.

Definition Classes: VectoI

def min(b: VectoI): SparseVectorI

Take the minimum of 'this' vector with vector 'b' (element-by element).

b: the other vector

Definition Classes: SparseVectorI → VectoI

def min(e: Int = dim): Int

Find the minimum element in 'this' vector.

e: the ending index (exclusive) for the search

Definition Classes: SparseVectorI → VectoI

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

Definition Classes: VectoI

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.

Definition Classes: VectoI

def norm1: Int

Compute the Manhattan norm (1-norm) of 'this' vector.

Definition Classes: SparseVectorI → VectoI

def normSq: Int

Compute the Euclidean norm (2-norm) squared of 'this' vector.

Definition Classes: VectoI

def normalize: SparseVectorI

Normalize 'this' vector so that it sums to one (like a probability vector).

Definition Classes: SparseVectorI → VectoI

def normalize1: SparseVectorI

Normalize 'this' vector to have a maximum of one.

Definition Classes: SparseVectorI → VectoI

def normalizeU: SparseVectorI

Normalize 'this' vector so its length is one (unit vector).

Definition Classes: SparseVectorI → VectoI

final def notify(): Unit

Definition Classes: AnyRef

final def notifyAll(): Unit

Definition Classes: AnyRef

def one(size: Int = dim): SparseVectorI

Create a one vector (all elements are one) of length 'size'.

size: the number of elements in the vector

Definition Classes: SparseVectorI → VectoI

def oneAt(j: Int, size: Int = dim): SparseVectorI

Create a vector of the form (0, ...

Create a vector of the form (0, ... 1, ... 0) where the 1 is at position j.

j: the position to place the 1
size: the size of the vector (upper bound = size - 1)

Definition Classes: SparseVectorI → VectoI

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.

Definition Classes: VectoI

val range: Range

Range for the storage array

Definition Classes: VectoI

def rank: VectorI

Establish the rank order of the elements in 'self' vector, e.g., (8.0, 2.0, 4.0, 6.0) is (3, 0, 1, 2).

Definition Classes: SparseVectorI → VectoI

def recip: SparseVectorI

Return the vector containing the reciprocal of each element of 'this' vector.

Definition Classes: SparseVectorI → VectoI

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 reverse(): SparseVectorI

Reverse the order of the elements in 'this' vector.

def reversed: List[Int]

Attributes: protected[this]
Definition Classes: TraversableOnce

def sameDimensions(b: SparseVectorI): Boolean

Check whether the other vector 'b' is at least as long as 'this' vector.

b: the other vector

def sameDimensions(b: VectoI): Boolean

Check whether the other vector 'b' is at least as long as 'this' vector.

b: the other vector

Definition Classes: VectoI

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]): SparseVectorI

Select a subset of elements of 'this' vector corresponding to a 'basis'.

basis: the set of index positions (e.g., 0, 2, 5)

Definition Classes: SparseVectorI → VectoI

def seq: Traversable[Int]

Definition Classes: Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

def set(u: Seq[Int]): Unit

Set the values in 'this' vector to the values in array 'u'.

u: the array of values to be assigned

Definition Classes: SparseVectorI → VectoI

def set(x: Int): Unit

Set each value in 'this' vector to 'x'.

x: the value to be assigned

Definition Classes: SparseVectorI → VectoI

def setFormat(newFormat: String): Unit

Set the format to the 'newFormat' (e.g., "%.6g,\t" or "%12.6g,\t").

newFormat: the new format String

Definition Classes: VectoI

def size: Int

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(from: Int, till: Int): SparseVectorI

Slice 'this' vector 'from' to 'end'.

from: the start of the slice (included)
till: the end of the slice (excluded)

Definition Classes: SparseVectorI → VectoI → TraversableLike → GenTraversableLike

def sort(): Unit

Sort 'this' vector in-place in ascending (non-decreasing) order.

Definition Classes: SparseVectorI → VectoI

def sort2(): Unit

Sort 'this' vector in-place in descending (non-increasing) order.

Definition Classes: SparseVectorI → VectoI

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

Return the vector containing the square of each element of 'this' vector.

Definition Classes: VectoI

def stringPrefix: String

Definition Classes: TraversableLike → GenTraversableLike

def sum: Int

Sum the elements of 'this' vector.

Definition Classes: SparseVectorI → VectoI

def sum[B >: Int](implicit num: Numeric[B]): B

Definition Classes: TraversableOnce → GenTraversableOnce

def sumNE(i: Int): Int

Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').

i: the index of the element to skip

Definition Classes: SparseVectorI → VectoI

def sumPos: Int

Sum the positive (> 0) elements of 'this' vector.

Definition Classes: SparseVectorI → VectoI

def swap(i: Int, j: Int): Unit

Swap elements 'i' and 'j' in 'this' vector.

i: the first element in the swap
j: the second element in the swap

Definition Classes: SparseVectorI → VectoI

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

Convert 'this' sparse vector to a dense vector.

Definition Classes: SparseVectorI → VectoI

def toDouble: VectorD

Convert 'this' SparseVectorI into a VectorD.

Definition Classes: SparseVectorI → VectoI

def toIndexedSeq: IndexedSeq[Int]

Definition Classes: TraversableOnce → GenTraversableOnce

def toInt: VectorI

Convert 'this' SparseVectorI into a VectorI.

Definition Classes: SparseVectorI → VectoI

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 toLong: VectorL

Convert 'this' SparseVectorI into a VectorL.

Definition Classes: SparseVectorI → VectoI

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.

Definition Classes: SparseVectorI → VectoI → TraversableLike → AnyRef → Any

def toString2: String

Convert 'this' vector to a String, showing the zero elements as well,

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 >: SparseVectorI](b: B)(implicit view_1: (B) ⇒ PartiallyOrdered[B]): Option[Int]

Compare 'this' vector with vector 'b'.

b: the other vector

Definition Classes: SparseVectorI → PartiallyOrdered

def unary_-(): SparseVectorI

Return the negative of 'this' vector (unary minus).

Definition Classes: SparseVectorI → VectoI

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: VectoI): Unit

Set 'this' vector's elements over the given range (vector slicing).

r: the given range
u: the vector to assign

Definition Classes: SparseVectorI → VectoI

def update(r: Range, x: Int): Unit

Set 'this' vector's elements over the given range (vector slicing).

r: the given range
x: the value to assign

Definition Classes: SparseVectorI → VectoI

def update(i: Int, x: Int): Unit

Set 'this' vector's element at the 'i'-th index position.

i: the given index
x: the value to assign

Definition Classes: SparseVectorI → VectoI

var v: RowMap

Attributes: protected

def variance: Double

Compute the (unbiased) sample variance of the elements of 'this' vector.

Definition Classes: VectoI

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 zero(size: Int = dim): SparseVectorI

Create a zero vector (all elements are zero) of length 'size'.

size: the number of elements in the vector

Definition Classes: SparseVectorI → VectoI

def ~^(s: Int): SparseVectorI

Return the vector containing each element of 'this' vector raised to the s-th power.

s: the scalar exponent

Definition Classes: SparseVectorI → VectoI

def ~^=(s: Int): SparseVectorI

Raise each element of 'this' vector to the 's'-th power.

s: the scalar exponent

Definition Classes: SparseVectorI → VectoI

def ∙(b: VectoI): Int

Compute the dot product (or inner product) of 'this' vector with vector 'b'.

b: the other vector

Definition Classes: VectoI

def ≠(b: VectoI): Boolean

Compare 'this' vector with that vector 'b' for inequality.

b: that vector

Definition Classes: VectoI

def ≤(b: VectoI): Boolean

Compare 'this' vector with that vector 'b' for less than or equal to.

b: that vector

Definition Classes: VectoI

def ≥(b: VectoI): Boolean

Compare 'this' vector with that vector 'b' for greater than or equal to.

b: that vector

Definition Classes: VectoI

def ⦁(b: SparseVectorI): Int

Compute the dot product (or inner product) of 'this' vector with vector 'b'.

b: the other vector

def ⦁(b: VectoI): Int

Compute the dot product (or inner product) of 'this' vector with vector 'b'.

b: the other vector

Packages

SparseVectorI

Companion object SparseVectorI

class SparseVectorI extends VectoI

Instance Constructors

Type Members

Value Members

Inherited from VectoI

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

SparseVectorI 

Companion object SparseVectorI

class SparseVectorI extends VectoI

Instance Constructors

Type Members

Value Members

Inherited from VectoI

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

SparseVectorI