Packages

class SparseVectorD extends VectoD

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

Linear Supertypes
VectoD, Serializable, Serializable, Error, Vec, PartiallyOrdered[VectoD], Traversable[Double], GenTraversable[Double], GenericTraversableTemplate[Double, Traversable], TraversableLike[Double, Traversable[Double]], GenTraversableLike[Double, Traversable[Double]], Parallelizable[Double, ParIterable[Double]], TraversableOnce[Double], GenTraversableOnce[Double], FilterMonadic[Double, Traversable[Double]], HasNewBuilder[Double, Traversable[Double]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SparseVectorD
  2. VectoD
  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 SparseVectorD(iv: (Int, Double), 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 SparseVectorD(u: VectoD)

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

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

    u

    the other vector

  3. new SparseVectorD(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[Double]
    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, Double)): SparseVectorD

    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 (scalar, position) to multiply by

    Definition Classes
    SparseVectorDVectoD
  4. def *(s: Double): SparseVectorD

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

    Definition Classes
    SparseVectorDVectoD
  5. def *(b: VectoD): SparseVectorD

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by

    Definition Classes
    SparseVectorDVectoD
  6. def *=(s: Double): SparseVectorD

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

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

    s

    the scalar to multiply by

    Definition Classes
    SparseVectorDVectoD
  7. def *=(b: VectoD): SparseVectorD

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

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

    b

    the vector to multiply by

    Definition Classes
    SparseVectorDVectoD
  8. def +(s: (Int, Double)): SparseVectorD

    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 (scalar, position) to add

    Definition Classes
    SparseVectorDVectoD
  9. def +(s: Double): SparseVectorD

    Add 'this' vector and scalar 's'.

    Add 'this' vector and scalar 's'.

    s

    the scalar to add

    Definition Classes
    SparseVectorDVectoD
  10. def +(b: VectoD): SparseVectorD

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add

    Definition Classes
    SparseVectorDVectoD
  11. def ++(s: Double): SparseVectorD

    Concatenate 'this' vector and scalar 's'.

    Concatenate 'this' vector and scalar 's'.

    s

    the scalar to be concatenated

    Definition Classes
    SparseVectorDVectoD
  12. def ++(b: VectoD): SparseVectorD

    Concatenate 'this' vector and vector' b'.

    Concatenate 'this' vector and vector' b'.

    b

    the vector to be concatenated

    Definition Classes
    SparseVectorDVectoD
  13. def ++[B >: Double, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  14. def ++:[B >: Double, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike
  15. def ++:[B >: Double, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike
  16. def +=(s: Double): SparseVectorD

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorDVectoD
  17. def +=(b: VectoD): SparseVectorD

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorDVectoD
  18. def -(s: (Int, Double)): SparseVectorD

    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 (scalar, position) to subtract

    Definition Classes
    SparseVectorDVectoD
  19. def -(s: Double): SparseVectorD

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

    Definition Classes
    SparseVectorDVectoD
  20. def -(b: VectoD): SparseVectorD

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract

    Definition Classes
    SparseVectorDVectoD
  21. def -=(s: Double): SparseVectorD

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

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

    s

    the scalar to subtract

    Definition Classes
    SparseVectorDVectoD
  22. def -=(b: VectoD): SparseVectorD

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

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

    b

    the vector to subtract

    Definition Classes
    SparseVectorDVectoD
  23. def /(s: (Int, Double)): SparseVectorD

    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 (scalar, position) to divide by

    Definition Classes
    SparseVectorDVectoD
  24. def /(s: Double): SparseVectorD

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

    Definition Classes
    SparseVectorDVectoD
  25. def /(b: VectoD): SparseVectorD

    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
    SparseVectorDVectoD
  26. def /:[B](z: B)(op: (B, Double) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def /=(s: Double): SparseVectorD

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

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

    s

    the scalar to divide by

    Definition Classes
    SparseVectorDVectoD
  28. def /=(b: VectoD): SparseVectorD

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

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

    b

    the vector to divide by

    Definition Classes
    SparseVectorDVectoD
  29. def :\[B](z: B)(op: (Double, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def <[B >: VectoD](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  31. def <=[B >: VectoD](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  32. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  33. def >[B >: VectoD](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  34. def >=[B >: VectoD](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  35. def _oneAt(j: Int, size: Int = dim): SparseVectorD

    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
    SparseVectorDVectoD
  36. def abs: SparseVectorD

    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
    SparseVectorDVectoD
  37. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  38. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  39. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  40. def aggregate[B](z: ⇒ B)(seqop: (B, Double) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def apply(): IndexedSeq[Double]

    Get 'this' vector's entire array.

    Get 'this' vector's entire array.

    Definition Classes
    SparseVectorDVectoD
  42. def apply(r: Range): SparseVectorD

    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
    SparseVectorDVectoD
  43. def apply(i: Int): Double

    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
    SparseVectorDVectoD
  44. def apply(iv: VectoI): VectoD

    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

    Definition Classes
    VectoD
  45. 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
    SparseVectorDVectoD
  46. 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
    SparseVectorDVectoD
  47. 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
    SparseVectorDVectoD
  48. 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
    SparseVectorDVectoD
  49. 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
    SparseVectorDVectoD
  50. 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
    SparseVectorDVectoD
  51. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  52. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  53. def collect[B, That](pf: PartialFunction[Double, B])(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def collectFirst[B](pf: PartialFunction[Double, B]): Option[B]
    Definition Classes
    TraversableOnce
  55. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  56. def contains(x: Double): 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
    SparseVectorDVectoD
  57. def copy: SparseVectorD

    Create an exact copy of 'this' vector.

    Create an exact copy of 'this' vector.

    Definition Classes
    SparseVectorDVectoD
  58. def copyToArray[B >: Double](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  59. def copyToArray[B >: Double](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def copyToArray[B >: Double](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def copyToBuffer[B >: Double](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  62. def count(p: (Double) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. 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
    SparseVectorDVectoD
  64. 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
    SparseVectorDVectoD
  65. def countZero: Int

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

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

    Definition Classes
    SparseVectorDVectoD
  66. def countinct: Int

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

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

    Definition Classes
    SparseVectorDVectoD
  67. def cumulate: SparseVectorD

    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
    SparseVectorDVectoD
  68. lazy val dim: Int

    Dimension

    Dimension

    Definition Classes
    SparseVectorDVectoD
  69. val dim_: Int
  70. def distinct: SparseVectorD

    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
    SparseVectorDVectoD
  71. def dot(b: SparseVectorD): Double

    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

  72. def dot(b: VectoD): Double

    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
    SparseVectorDVectoD
  73. def drop(n: Int): Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def dropWhile(p: (Double) ⇒ Boolean): Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  76. 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
    SparseVectorDVectoD → AnyRef → Any
  77. def exists(p: (Double) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  78. def expand(more: Int = dim): SparseVectorD

    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
    SparseVectorDVectoD
  79. 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
    VectoD
  80. def filter(p: (Double) ⇒ Boolean): SparseVectorD

    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
    SparseVectorD → TraversableLike → GenTraversableLike
  81. def filterMissing: SparseVectorD

    Filter out the missing elements of 'this' vector based on the predicate that 'e != noDouble'.

    Filter out the missing elements of 'this' vector based on the predicate that 'e != noDouble'.

    Definition Classes
    SparseVectorDVectoD
  82. def filterNot(p: (Double) ⇒ Boolean): Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def filterPos(p: (Double) ⇒ 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
    SparseVectorDVectoD
  84. def filterPos2(v2: VectoD, p: (Double, Double) ⇒ Boolean): IndexedSeq[(Int, Int)]

    Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.

    Filter the elements of 'this' vector and vector 'v2' based on the binary predicate 'p', returning the index positions for both vectors.

    v2

    the other vector to compare with

    p

    the binary predicate (Boolean function) to apply

    Definition Classes
    SparseVectorDVectoD
  85. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  86. def find(p: (Double) ⇒ Boolean): Option[Double]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  87. 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
    SparseVectorDVectoD
  88. 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
    SparseVectorDVectoD
  89. def flatMap[B, That](f: (Double) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  90. def flatten[B](implicit asTraversable: (Double) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  91. 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
  92. def fold[A1 >: Double](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def foldLeft[B](z: B)(op: (B, Double) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def foldRight[B](z: B)(op: (Double, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def forall(p: (Double) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  96. def foreach[U](f: (Double) ⇒ U): Unit

    Iterate over 'this' vector element by element.

    Iterate over 'this' vector element by element.

    f

    the function to apply

    Definition Classes
    SparseVectorDVectoD → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  97. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  98. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  99. def groupBy[K](f: (Double) ⇒ K): Map[K, Traversable[Double]]
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  101. 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
    SparseVectorDVectoD → AnyRef → Any
  102. def head: Double
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def headOption: Option[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def indexOf(x: Double, 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
    SparseVectorDVectoD
  105. def indexWhere(p: (Double) ⇒ 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
    SparseVectorDVectoD
  106. 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
    VectoDVec
  107. def init: Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def inits: Iterator[Traversable[Double]]
    Definition Classes
    TraversableLike
  109. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  110. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  111. 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
    SparseVectorDVectoD
  112. def isSorted: Boolean

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

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

    Definition Classes
    SparseVectorDVectoD
  113. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  114. def last: Double
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def lastOption: Option[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  116. def mag: Double

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

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

    Definition Classes
    VectoD
  117. def map(f: (Double) ⇒ Double): SparseVectorD

    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
    SparseVectorDVectoD
  118. def map[B, That](f: (Double) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  119. def max(b: VectoD): SparseVectorD

    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
    SparseVectorDVectoD
  120. def max(e: Int = dim): Double

    Find the maximum element in 'this' vector.

    Find the maximum element in 'this' vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    SparseVectorDVectoD
  121. def max[B >: Double](implicit cmp: Ordering[B]): Double
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def maxBy[B](f: (Double) ⇒ B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def mean: Double

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

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

    Definition Classes
    VectoD
  124. def min(b: VectoD): SparseVectorD

    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
    SparseVectorDVectoD
  125. def min(e: Int = dim): Double

    Find the minimum element in 'this' vector.

    Find the minimum element in 'this' vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    SparseVectorDVectoD
  126. def min[B >: Double](implicit cmp: Ordering[B]): Double
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def minBy[B](f: (Double) ⇒ B)(implicit cmp: Ordering[B]): Double
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. val nd: Double

    Number of elements in the vector as a Double

    Number of elements in the vector as a Double

    Definition Classes
    VectoD
  132. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  133. def newBuilder: Builder[Double, Traversable[Double]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  134. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def norm: Double

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

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

    Definition Classes
    VectoD
  136. def norm1: Double

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

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

    Definition Classes
    SparseVectorDVectoD
  137. def normSq: Double

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

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

    Definition Classes
    VectoD
  138. def normalize: SparseVectorD

    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
    SparseVectorDVectoD
  139. def normalize1: SparseVectorD

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

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

    Definition Classes
    SparseVectorDVectoD
  140. def normalizeU: SparseVectorD

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

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

    Definition Classes
    SparseVectorDVectoD
  141. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  142. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  143. def one(size: Int = dim): SparseVectorD

    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
    SparseVectorDVectoD
  144. def oneAt(j: Int, size: Int = dim): SparseVectorD

    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
    SparseVectorDVectoD
  145. def par: ParIterable[Double]
    Definition Classes
    Parallelizable
  146. def parCombiner: Combiner[Double, ParIterable[Double]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  147. def partition(p: (Double) ⇒ Boolean): (Traversable[Double], Traversable[Double])
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def product[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. 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
    VectoD
  150. val range: Range

    Range for the storage array

    Range for the storage array

    Definition Classes
    VectoD
  151. 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
    SparseVectorDVectoD
  152. def recip: SparseVectorD

    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
    SparseVectorDVectoD
  153. def reduce[A1 >: Double](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def reduceLeft[B >: Double](op: (B, Double) ⇒ B): B
    Definition Classes
    TraversableOnce
  155. def reduceLeftOption[B >: Double](op: (B, Double) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def reduceOption[A1 >: Double](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def reduceRight[B >: Double](op: (Double, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def reduceRightOption[B >: Double](op: (Double, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def repr: Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def reverse(): SparseVectorD

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

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

    Definition Classes
    SparseVectorDVectoD
  161. def reversed: List[Double]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  162. def sameDimensions(b: SparseVectorD): 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

  163. def sameDimensions(b: VectoD): 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
    VectoD
  164. def scan[B >: Double, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  165. def scanLeft[B, That](z: B)(op: (B, Double) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Double], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  166. def scanRight[B, That](z: B)(op: (Double, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Double], 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.

  167. def select(basis: Array[Int]): SparseVectorD

    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
    SparseVectorDVectoD
  168. def selectEx(basis: Array[Int]): VectoD

    Select all elements of 'this' vector excluding ones in the 'basis'.

    Select all elements of 'this' vector excluding ones in the 'basis'.

    basis

    the index positions to be excluded

    Definition Classes
    VectoD
  169. def seq: Traversable[Double]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  170. def set(u: Seq[Double]): 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
    SparseVectorDVectoD
  171. def set(x: Double): 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
    SparseVectorDVectoD
  172. 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
    VectoD
  173. def size: Int

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

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

    Definition Classes
    VectoDVec → GenTraversableLike → TraversableOnce → GenTraversableOnce
  174. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  175. def slice(from: Int, till: Int): SparseVectorD

    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
    SparseVectorDVectoD → TraversableLike → GenTraversableLike
  176. def slice(rg: Range): VectoD

    Slice 'this' vector over the given range 'rg'.

    Slice 'this' vector over the given range 'rg'.

    rg

    the range specifying the slice

    Definition Classes
    VectoD
  177. def sliceEx(rg: Range): VectoD

    Slice 'this' vector excluding the given range 'rg'.

    Slice 'this' vector excluding the given range 'rg'.

    rg

    the excluded range of the slice

    Definition Classes
    VectoD
  178. 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
    SparseVectorDVectoD
  179. 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
    SparseVectorDVectoD
  180. def span(p: (Double) ⇒ Boolean): (Traversable[Double], Traversable[Double])
    Definition Classes
    TraversableLike → GenTraversableLike
  181. def split(k: Int): Array[VectoD]

    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

    Definition Classes
    VectoD
  182. def splitAt(n: Int): (Traversable[Double], Traversable[Double])
    Definition Classes
    TraversableLike → GenTraversableLike
  183. def sq: VectoD

    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
    VectoD
  184. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  185. def sum: Double

    Sum the elements of 'this' vector.

    Sum the elements of 'this' vector.

    Definition Classes
    SparseVectorDVectoD
  186. def sum[B >: Double](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def sumNE(i: Int): Double

    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
    SparseVectorDVectoD
  188. def sumPos: Double

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

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

    Definition Classes
    SparseVectorDVectoD
  189. 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
    SparseVectorDVectoD
  190. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  191. def tail: Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  192. def tails: Iterator[Traversable[Double]]
    Definition Classes
    TraversableLike
  193. def take(n: Int): Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  194. def takeWhile(p: (Double) ⇒ Boolean): Traversable[Double]
    Definition Classes
    TraversableLike → GenTraversableLike
  195. def thisCollection: Traversable[Double]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  196. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Double, Col[Double]]): Col[Double]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  197. def toArray[B >: Double](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  198. def toBuffer[B >: Double]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  199. def toCollection(repr: Traversable[Double]): Traversable[Double]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  200. def toDense: VectorD

    Convert 'this' sparse vector to a dense vector.

    Convert 'this' sparse vector to a dense vector.

    Definition Classes
    SparseVectorDVectoD
  201. def toDouble: VectorD

    Convert 'this' SparseVectorD into a VectorD.

    Convert 'this' SparseVectorD into a VectorD.

    Definition Classes
    SparseVectorDVectoD
  202. def toIndexedSeq: IndexedSeq[Double]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  203. def toInt: VectorI

    Convert 'this' SparseVectorD into a VectorI.

    Convert 'this' SparseVectorD into a VectorI.

    Definition Classes
    SparseVectorDVectoD
  204. def toIterable: Iterable[Double]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  205. def toIterator: Iterator[Double]
    Definition Classes
    TraversableLike → GenTraversableOnce
  206. def toList: List[Double]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  207. def toLong: VectorL

    Convert 'this' SparseVectorD into a VectorL.

    Convert 'this' SparseVectorD into a VectorL.

    Definition Classes
    SparseVectorDVectoD
  208. def toMap[T, U](implicit ev: <:<[Double, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  209. def toSeq: Seq[Double]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  210. def toSet[B >: Double]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  211. def toStream: Stream[Double]
    Definition Classes
    TraversableLike → GenTraversableOnce
  212. def toString: String

    Convert 'this' vector to a String.

    Convert 'this' vector to a String.

    Definition Classes
    SparseVectorDVectoD → TraversableLike → AnyRef → Any
  213. def toString2: String

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

  214. def toTraversable: Traversable[Double]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  215. def toVector: Vector[Double]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  216. def transpose[B](implicit asTraversable: (Double) ⇒ 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.

  217. def tryCompareTo[B >: SparseVectorD](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
    SparseVectorD → PartiallyOrdered
  218. def unary_-(): SparseVectorD

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

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

    Definition Classes
    SparseVectorDVectoD
  219. def unzip[A1, A2](implicit asPair: (Double) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  220. def unzip3[A1, A2, A3](implicit asTriple: (Double) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  221. def update(r: Range, u: VectoD): 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
    SparseVectorDVectoD
  222. def update(r: Range, x: Double): 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
    SparseVectorDVectoD
  223. def update(i: Int, x: Double): 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
    SparseVectorDVectoD
  224. var v: RowMap
    Attributes
    protected
  225. 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
    VectoD
  226. def view(from: Int, until: Int): TraversableView[Double, Traversable[Double]]
    Definition Classes
    TraversableLike
  227. def view: TraversableView[Double, Traversable[Double]]
    Definition Classes
    TraversableLike
  228. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  229. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  230. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  231. def withFilter(p: (Double) ⇒ Boolean): FilterMonadic[Double, Traversable[Double]]
    Definition Classes
    TraversableLike → FilterMonadic
  232. def zero(size: Int = dim): SparseVectorD

    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
    SparseVectorDVectoD
  233. def ~^(s: Double): SparseVectorD

    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
    SparseVectorDVectoD
  234. def ~^=(s: Double): SparseVectorD

    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
    SparseVectorDVectoD
  235. def (b: VectoD): Double

    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
    VectoD
  236. def (b: VectoD): Boolean

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

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

    b

    that vector

    Definition Classes
    VectoD
  237. def (b: VectoD): 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
    VectoD
  238. def (b: VectoD): 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
    VectoD
  239. def (b: SparseVectorD): Double

    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

  240. def (b: VectoD): Double

    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 VectoD

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoD]

Inherited from Traversable[Double]

Inherited from GenTraversable[Double]

Inherited from GenericTraversableTemplate[Double, Traversable]

Inherited from TraversableLike[Double, Traversable[Double]]

Inherited from GenTraversableLike[Double, Traversable[Double]]

Inherited from Parallelizable[Double, ParIterable[Double]]

Inherited from TraversableOnce[Double]

Inherited from GenTraversableOnce[Double]

Inherited from FilterMonadic[Double, Traversable[Double]]

Inherited from HasNewBuilder[Double, Traversable[Double]]

Inherited from AnyRef

Inherited from Any

Ungrouped