Packages

class SparseVectorI extends VectoI

The SparseVectorI 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
VectoI, 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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SparseVectorI
  2. VectoI
  3. Serializable
  4. Serializable
  5. Error
  6. Vec
  7. PartiallyOrdered
  8. Traversable
  9. GenTraversable
  10. GenericTraversableTemplate
  11. TraversableLike
  12. GenTraversableLike
  13. Parallelizable
  14. TraversableOnce
  15. GenTraversableOnce
  16. FilterMonadic
  17. HasNewBuilder
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SparseVectorI(iv: (Int, Int), dm: Int)

    Construct a vector and assign values from vector 'u'.

    Construct a vector and assign values from vector 'u'.

    iv

    the tuple containing (index, value)

    dm

    the dimension for the new vector

  2. new SparseVectorI(u: VectoI)

    Construct a vector and assign values from vector 'u'.

    Construct a vector and assign values from vector 'u'.

    u

    the other vector

  3. new SparseVectorI(dim_: Int, v: RowMap = null)

    dim_

    the dimension/size of the vector

    v

    the SortedLinkedHashMap used to store vector elements

Type Members

  1. type Self = Traversable[Int]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def *(s: Int): SparseVectorI

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

    Definition Classes
    SparseVectorIVectoI
  4. def *(b: VectoI): SparseVectorI

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by

    Definition Classes
    SparseVectorIVectoI
  5. def *=(s: Int): SparseVectorI

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorIVectoI
  6. def *=(b: VectoI): SparseVectorI

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorIVectoI
  7. def +(s: (Int, Int)): SparseVectorI

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

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

    s

    the (scalar, position) to add

    Definition Classes
    SparseVectorIVectoI
  8. def +(s: Int): SparseVectorI

    Add 'this' vector and scalar 's'.

    Add 'this' vector and scalar 's'.

    s

    the scalar to add

    Definition Classes
    SparseVectorIVectoI
  9. def +(b: VectoI): SparseVectorI

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add

    Definition Classes
    SparseVectorIVectoI
  10. def ++(s: Int): SparseVectorI

    Concatenate 'this' vector and scalar 's'.

    Concatenate 'this' vector and scalar 's'.

    s

    the scalar to be concatenated

    Definition Classes
    SparseVectorIVectoI
  11. def ++(b: VectoI): SparseVectorI

    Concatenate 'this' vector and vector' b'.

    Concatenate 'this' vector and vector' b'.

    b

    the vector to be concatenated

    Definition Classes
    SparseVectorIVectoI
  12. def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  13. def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike
  14. def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike
  15. def +=(s: Int): SparseVectorI

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorIVectoI
  16. def +=(b: VectoI): SparseVectorI

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorIVectoI
  17. def -(s: (Int, Int)): SparseVectorI

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

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

    s

    the (scalar, position) to subtract

    Definition Classes
    SparseVectorIVectoI
  18. def -(s: Int): SparseVectorI

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

    Definition Classes
    SparseVectorIVectoI
  19. def -(b: VectoI): SparseVectorI

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract

    Definition Classes
    SparseVectorIVectoI
  20. def -=(s: Int): SparseVectorI

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorIVectoI
  21. def -=(b: VectoI): SparseVectorI

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorIVectoI
  22. def /(s: Int): SparseVectorI

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

    Definition Classes
    SparseVectorIVectoI
  23. def /(b: VectoI): SparseVectorI

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

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

    b

    the vector to divide by

    Definition Classes
    SparseVectorIVectoI
  24. def /:[B](z: B)(op: (B, Int) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def /=(s: Int): SparseVectorI

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorIVectoI
  26. def /=(b: VectoI): SparseVectorI

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorIVectoI
  27. def :\[B](z: B)(op: (Int, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def <[B >: VectoI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  29. def <=[B >: VectoI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  30. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  31. def >[B >: VectoI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  32. def >=[B >: VectoI](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  33. 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
    SparseVectorIVectoI
  34. def abs: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  35. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  36. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  37. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  38. def aggregate[B](z: ⇒ B)(seqop: (B, Int) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def apply(): IndexedSeq[Int]

    Get 'this' vector's entire array.

    Get 'this' vector's entire array.

    Definition Classes
    SparseVectorIVectoI
  40. def apply(r: Range): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  41. 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

    Definition Classes
    SparseVectorIVectoI
  42. 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

    Definition Classes
    SparseVectorIVectoI
  43. 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

    Definition Classes
    SparseVectorIVectoI
  44. 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

    Definition Classes
    SparseVectorIVectoI
  45. 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

    Definition Classes
    SparseVectorIVectoI
  46. 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

    Definition Classes
    SparseVectorIVectoI
  47. 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

    Definition Classes
    SparseVectorIVectoI
  48. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  49. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
    Definition Classes
    TraversableOnce
  52. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  53. 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

    Definition Classes
    SparseVectorIVectoI
  54. def copy: SparseVectorI

    Create an exact copy of 'this' vector.

    Create an exact copy of 'this' vector.

    Definition Classes
    SparseVectorIVectoI
  55. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  56. def copyToArray[B >: Int](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def copyToArray[B >: Int](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  59. def count(p: (Int) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def countNeg: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  61. def countPos: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  62. def countZero: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  63. def countinct: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  64. 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
    SparseVectorIVectoI
  65. lazy val dim: Int

    Dimension

    Dimension

    Definition Classes
    SparseVectorIVectoI
  66. val dim_: Int
  67. def distinct: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  68. def dot(b: SparseVectorI): 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

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

    Definition Classes
    SparseVectorIVectoI
  70. def drop(n: Int): Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def dropWhile(p: (Int) ⇒ Boolean): Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  73. def equals(b: Any): Boolean

    Override equals to determine whether 'this' vector equals vector 'b..

    Override equals to determine whether 'this' vector equals vector 'b..

    b

    the vector to compare with this

    Definition Classes
    SparseVectorIVectoI → AnyRef → Any
  74. def exists(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  75. def expand(more: Int = dim): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  76. 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
    Definition Classes
    VectoI
  77. def filter(p: (Int) ⇒ Boolean): SparseVectorI

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

    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
  78. def filterNot(p: (Int) ⇒ Boolean): Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. 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

    Definition Classes
    SparseVectorIVectoI
  80. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  81. def find(p: (Int) ⇒ Boolean): Option[Int]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  82. 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

    Definition Classes
    SparseVectorIVectoI
  83. 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

    Definition Classes
    SparseVectorIVectoI
  84. def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  85. def flatten[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  86. 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
  87. def fold[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def foldRight[B](z: B)(op: (Int, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def forall(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  91. 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
    SparseVectorIVectoI → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  92. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  93. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  94. def groupBy[K](f: (Int) ⇒ K): Map[K, Traversable[Int]]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  96. def hashCode(): Int

    Must also override hashCode for 'this' vector to be compatible with equals.

    Must also override hashCode for 'this' vector to be compatible with equals.

    Definition Classes
    SparseVectorIVectoI → AnyRef → Any
  97. def head: Int
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def headOption: Option[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  99. 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

    Definition Classes
    SparseVectorIVectoI
  100. 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

    Definition Classes
    SparseVectorIVectoI
  101. def indices: Range

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

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

    Definition Classes
    VectoI
  102. def init: Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def inits: Iterator[Traversable[Int]]
    Definition Classes
    TraversableLike
  104. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  105. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  106. def isNonnegative: Boolean

    Check whether 'this' vector is nonnegative (has no negative elements).

    Check whether 'this' vector is nonnegative (has no negative elements).

    Definition Classes
    SparseVectorIVectoI
  107. def isSorted: Boolean

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

  108. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  109. def last: Int
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def lastOption: Option[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def mag: Int

    Find the element with the greatest magnitude in 'this' vector.

    Find the element with the greatest magnitude in 'this' vector.

    Definition Classes
    VectoI
  112. def map(f: (Int) ⇒ Int): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  113. def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  114. def max(b: VectoI): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  115. 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

    Definition Classes
    SparseVectorIVectoI
  116. def max[B >: Int](implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def mean: Double

    Compute the mean of the elements of 'this' vector.

    Compute the mean of the elements of 'this' vector.

    Definition Classes
    VectoI
  119. def min(b: VectoI): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  120. 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

    Definition Classes
    SparseVectorIVectoI
  121. def min[B >: Int](implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. val nd: Double

    Number of elements in the vector as a Int

    Number of elements in the vector as a Int

    Definition Classes
    VectoI
  127. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  128. def newBuilder: Builder[Int, Traversable[Int]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  129. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def norm: Int

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

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

    Definition Classes
    VectoI
  131. def norm1: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  132. def normSq: Int

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

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

    Definition Classes
    VectoI
  133. def normalize: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  134. def normalize1: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  135. def normalizeU: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  136. final def notify(): Unit
    Definition Classes
    AnyRef
  137. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  138. def one(size: Int = dim): SparseVectorI

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

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

    size

    the number of elements in the vector

    Definition Classes
    SparseVectorIVectoI
  139. 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
    SparseVectorIVectoI
  140. def par: ParIterable[Int]
    Definition Classes
    Parallelizable
  141. def parCombiner: Combiner[Int, ParIterable[Int]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  142. def partition(p: (Int) ⇒ Boolean): (Traversable[Int], Traversable[Int])
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def product[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. 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
  145. val range: Range

    Range for the storage array

    Range for the storage array

    Definition Classes
    VectoI
  146. 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).

    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
    SparseVectorIVectoI
  147. def recip: SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  148. def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B
    Definition Classes
    TraversableOnce
  150. def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def reduceRight[B >: Int](op: (Int, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def repr: Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def reverse(): SparseVectorI

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

  156. def reversed: List[Int]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  157. def sameDimensions(b: SparseVectorI): 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

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

    Definition Classes
    VectoI
  159. def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Int], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  161. 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.

  162. def select(basis: Array[Int]): SparseVectorI

    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)

    Definition Classes
    SparseVectorIVectoI
  163. def seq: Traversable[Int]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  164. def set(u: Seq[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

    Definition Classes
    SparseVectorIVectoI
  165. 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

    Definition Classes
    SparseVectorIVectoI
  166. 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

    Definition Classes
    VectoI
  167. def size: Int

    Return the size (number of elements) of 'this' vector.

    Return the size (number of elements) of 'this' vector.

    Definition Classes
    VectoIVec → GenTraversableLike → TraversableOnce → GenTraversableOnce
  168. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  169. def slice(from: Int, till: Int): SparseVectorI

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

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

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

    Definition Classes
    SparseVectorIVectoI
  171. def sort2(): Unit

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

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

    Definition Classes
    SparseVectorIVectoI
  172. def span(p: (Int) ⇒ Boolean): (Traversable[Int], Traversable[Int])
    Definition Classes
    TraversableLike → GenTraversableLike
  173. def splitAt(n: Int): (Traversable[Int], Traversable[Int])
    Definition Classes
    TraversableLike → GenTraversableLike
  174. def sq: VectoI

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

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

    Definition Classes
    VectoI
  175. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  176. def sum: Int

    Sum the elements of 'this' vector.

    Sum the elements of 'this' vector.

    Definition Classes
    SparseVectorIVectoI
  177. def sum[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. 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

    Definition Classes
    SparseVectorIVectoI
  179. def sumPos: Int

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

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

    Definition Classes
    SparseVectorIVectoI
  180. 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

    Definition Classes
    SparseVectorIVectoI
  181. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  182. def tail: Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  183. def tails: Iterator[Traversable[Int]]
    Definition Classes
    TraversableLike
  184. def take(n: Int): Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  185. def takeWhile(p: (Int) ⇒ Boolean): Traversable[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  186. def thisCollection: Traversable[Int]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  187. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Int, Col[Int]]): Col[Int]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  188. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. def toBuffer[B >: Int]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toCollection(repr: Traversable[Int]): Traversable[Int]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  191. def toDense: VectorI

    Convert 'this' sparse vector to a dense vector.

    Convert 'this' sparse vector to a dense vector.

    Definition Classes
    SparseVectorIVectoI
  192. def toDouble: VectorD

    Convert 'this' SparseVectorI into a VectorD.

    Convert 'this' SparseVectorI into a VectorD.

    Definition Classes
    SparseVectorIVectoI
  193. def toIndexedSeq: IndexedSeq[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. def toInt: VectorI

    Convert 'this' SparseVectorI into a VectorI.

    Convert 'this' SparseVectorI into a VectorI.

    Definition Classes
    SparseVectorIVectoI
  195. def toIterable: Iterable[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  196. def toIterator: Iterator[Int]
    Definition Classes
    TraversableLike → GenTraversableOnce
  197. def toList: List[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  198. def toLong: VectorL

    Convert 'this' SparseVectorI into a VectorL.

    Convert 'this' SparseVectorI into a VectorL.

    Definition Classes
    SparseVectorIVectoI
  199. def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  200. def toSeq: Seq[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  201. def toSet[B >: Int]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  202. def toStream: Stream[Int]
    Definition Classes
    TraversableLike → GenTraversableOnce
  203. def toString: String

    Convert 'this' vector to a String.

    Convert 'this' vector to a String.

    Definition Classes
    SparseVectorIVectoI → TraversableLike → AnyRef → Any
  204. def toString2: String

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

  205. def toTraversable: Traversable[Int]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  206. def toVector: Vector[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  207. 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.

  208. def tryCompareTo[B >: SparseVectorI](b: B)(implicit view_1: (B) ⇒ PartiallyOrdered[B]): Option[Int]

    Compare 'this' vector with vector 'b'.

    Compare 'this' vector with vector 'b'.

    b

    the other vector

    Definition Classes
    SparseVectorI → PartiallyOrdered
  209. def unary_-(): SparseVectorI

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

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

    Definition Classes
    SparseVectorIVectoI
  210. def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  211. def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  212. 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

    Definition Classes
    SparseVectorIVectoI
  213. 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

    Definition Classes
    SparseVectorIVectoI
  214. 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

    Definition Classes
    SparseVectorIVectoI
  215. var v: RowMap
    Attributes
    protected
  216. def variance: Double

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

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

    Definition Classes
    VectoI
  217. def view(from: Int, until: Int): TraversableView[Int, Traversable[Int]]
    Definition Classes
    TraversableLike
  218. def view: TraversableView[Int, Traversable[Int]]
    Definition Classes
    TraversableLike
  219. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  220. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  221. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  222. def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, Traversable[Int]]
    Definition Classes
    TraversableLike → FilterMonadic
  223. def zero(size: Int = dim): SparseVectorI

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

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

    size

    the number of elements in the vector

    Definition Classes
    SparseVectorIVectoI
  224. def ~^(s: Int): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  225. def ~^=(s: Int): SparseVectorI

    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

    Definition Classes
    SparseVectorIVectoI
  226. 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

    Definition Classes
    VectoI
  227. 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

    Definition Classes
    VectoI
  228. 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

    Definition Classes
    VectoI
  229. 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

    Definition Classes
    VectoI
  230. def (b: SparseVectorI): 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

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

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