Packages

class SparseVectorL extends VectoL

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

Linear Supertypes
VectoL, Serializable, Error, Vec, PartiallyOrdered[VectoL], Iterable[Long], IterableFactoryDefaults[Long, Iterable], IterableOps[Long, Iterable, Iterable[Long]], IterableOnceOps[Long, Iterable, Iterable[Long]], IterableOnce[Long], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SparseVectorL
  2. VectoL
  3. Serializable
  4. Error
  5. Vec
  6. PartiallyOrdered
  7. Iterable
  8. IterableFactoryDefaults
  9. IterableOps
  10. IterableOnceOps
  11. IterableOnce
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new SparseVectorL(iv: (Int, Long), 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 SparseVectorL(u: VectoL)

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

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

    u

    the other vector

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

    dim_

    the dimension/size of the vector

    v

    the SortedLinkedHashMap used to store vector elements

Type Members

  1. type AsPartiallyOrdered[B] = (B) => PartiallyOrdered[B]
    Definition Classes
    PartiallyOrdered

Value Members

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

    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
    SparseVectorL → VectoL
  4. def *(s: Long): SparseVectorL

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

    Definition Classes
    SparseVectorL → VectoL
  5. def *(b: VectoL): SparseVectorL

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by

    Definition Classes
    SparseVectorL → VectoL
  6. def *=(s: Long): SparseVectorL

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

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

    s

    the scalar to multiply by

    Definition Classes
    SparseVectorL → VectoL
  7. def *=(b: VectoL): SparseVectorL

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

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

    b

    the vector to multiply by

    Definition Classes
    SparseVectorL → VectoL
  8. def +(s: (Int, Long)): SparseVectorL

    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
    SparseVectorL → VectoL
  9. def +(s: Long): SparseVectorL

    Add 'this' vector and scalar 's'.

    Add 'this' vector and scalar 's'.

    s

    the scalar to add

    Definition Classes
    SparseVectorL → VectoL
  10. def +(b: VectoL): SparseVectorL

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add

    Definition Classes
    SparseVectorL → VectoL
  11. def ++(s: Long): SparseVectorL

    Concatenate 'this' vector and scalar 's'.

    Concatenate 'this' vector and scalar 's'.

    s

    the scalar to be concatenated

    Definition Classes
    SparseVectorL → VectoL
  12. def ++(b: VectoL): SparseVectorL

    Concatenate 'this' vector and vector' b'.

    Concatenate 'this' vector and vector' b'.

    b

    the vector to be concatenated

    Definition Classes
    SparseVectorL → VectoL
  13. final def ++[B >: Long](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  14. def +=(s: Long): SparseVectorL

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

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

    s

    the scalar to add

    Definition Classes
    SparseVectorL → VectoL
  15. def +=(b: VectoL): SparseVectorL

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

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

    b

    the vector to add

    Definition Classes
    SparseVectorL → VectoL
  16. def -(s: (Int, Long)): SparseVectorL

    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
    SparseVectorL → VectoL
  17. def -(s: Long): SparseVectorL

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

    Definition Classes
    SparseVectorL → VectoL
  18. def -(b: VectoL): SparseVectorL

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract

    Definition Classes
    SparseVectorL → VectoL
  19. def -=(s: Long): SparseVectorL

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

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

    s

    the scalar to subtract

    Definition Classes
    SparseVectorL → VectoL
  20. def -=(b: VectoL): SparseVectorL

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

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

    b

    the vector to subtract

    Definition Classes
    SparseVectorL → VectoL
  21. def /(s: (Int, Long)): SparseVectorL

    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
    SparseVectorL → VectoL
  22. def /(s: Long): SparseVectorL

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

    Definition Classes
    SparseVectorL → VectoL
  23. def /(b: VectoL): SparseVectorL

    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
    SparseVectorL → VectoL
  24. def /=(s: Long): SparseVectorL

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

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

    s

    the scalar to divide by

    Definition Classes
    SparseVectorL → VectoL
  25. def /=(b: VectoL): SparseVectorL

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

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

    b

    the vector to divide by

    Definition Classes
    SparseVectorL → VectoL
  26. def <[B >: VectoL](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  27. def <=[B >: VectoL](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  28. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  29. def >[B >: VectoL](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  30. def >=[B >: VectoL](that: B)(implicit arg0: AsPartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  31. def _oneAt(j: Int, size: Int = dim): SparseVectorL

    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
    SparseVectorL → VectoL
  32. def abs: SparseVectorL

    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
    SparseVectorL → VectoL
  33. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  34. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  35. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  36. def apply(): IndexedSeq[Long]

    Get 'this' vector's entire array.

    Get 'this' vector's entire array.

    Definition Classes
    SparseVectorL → VectoL
  37. def apply(r: Range): SparseVectorL

    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
    SparseVectorL → VectoL
  38. def apply(i: Int): Long

    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
    SparseVectorL → VectoL
  39. def apply(iv: VectoI): VectoL

    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
    VectoL
  40. 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
    SparseVectorL → VectoL
  41. 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
    SparseVectorL → VectoL
  42. 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
    SparseVectorL → VectoL
  43. 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
    SparseVectorL → VectoL
  44. 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
    SparseVectorL → VectoL
  45. 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
    SparseVectorL → VectoL
  46. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  47. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  48. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  49. final def coll: SparseVectorL.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  50. def collect[B](pf: PartialFunction[Long, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  51. def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]
    Definition Classes
    IterableOnceOps
  52. def concat[B >: Long](suffix: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  53. def contains(x: Long): 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
    SparseVectorL → VectoL
  54. def copy: SparseVectorL

    Create an exact copy of 'this' vector.

    Create an exact copy of 'this' vector.

    Definition Classes
    SparseVectorL → VectoL
  55. def copyToArray[B >: Long](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  56. def copyToArray[B >: Long](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  57. def copyToArray[B >: Long](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  58. def corresponds[B](that: IterableOnce[B])(p: (Long, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  59. def count(p: (Long) => Boolean): Int
    Definition Classes
    IterableOnceOps
  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
    SparseVectorL → VectoL
  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
    SparseVectorL → VectoL
  62. def countZero: Int

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

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

    Definition Classes
    SparseVectorL → VectoL
  63. def countinct: Int

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

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

    Definition Classes
    SparseVectorL → VectoL
  64. def cumulate: SparseVectorL

    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
    SparseVectorL → VectoL
  65. lazy val dim: Int

    Dimension

    Dimension

    Definition Classes
    SparseVectorL → VectoL
  66. val dim_: Int
  67. def distinct: SparseVectorL

    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
    SparseVectorL → VectoL
  68. def dot(b: SparseVectorL): Long

    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: VectoL): Long

    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
    SparseVectorL → VectoL
  70. def drop(n: Int): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  71. def dropRight(n: Int): Iterable[Long]
    Definition Classes
    IterableOps
  72. def dropWhile(p: (Long) => Boolean): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  73. def empty: Iterable[Long]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  74. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  75. 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
    SparseVectorL → VectoL → AnyRef → Any
  76. def exists(p: (Long) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  77. def expand(more: Int = dim): SparseVectorL

    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
    SparseVectorL → VectoL
  78. 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
    VectoL
  79. def filter(p: (Long) => Boolean): SparseVectorL

    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
    SparseVectorL → VectoL → IterableOps → IterableOnceOps
  80. def filterMissing: SparseVectorL

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

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

    Definition Classes
    SparseVectorL → VectoL
  81. def filterNot(pred: (Long) => Boolean): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  82. def filterPos(p: (Long) => 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
    SparseVectorL → VectoL
  83. def filterPos2(v2: VectoL, p: (Long, Long) => 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
    SparseVectorL → VectoL
  84. def find(p: (Long) => Boolean): Option[Long]
    Definition Classes
    IterableOnceOps
  85. 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
    SparseVectorL → VectoL
  86. 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
    SparseVectorL → VectoL
  87. def flatMap[B](f: (Long) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  88. def flatten[B](implicit asIterable: (Long) => IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  89. 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
  90. def fold[A1 >: Long](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  91. def foldLeft[B](z: B)(op: (B, Long) => B): B
    Definition Classes
    IterableOnceOps
  92. def foldRight[B](z: B)(op: (Long, B) => B): B
    Definition Classes
    IterableOnceOps
  93. def forall(p: (Long) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  94. def foreach[U](f: (Long) => U): Unit

    Iterate over 'this' vector element by element.

    Iterate over 'this' vector element by element.

    f

    the function to apply

    Definition Classes
    SparseVectorL → VectoL → IterableOnceOps
  95. def fromSpecific(coll: IterableOnce[Long]): Iterable[Long]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  96. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  97. def groupBy[K](f: (Long) => K): Map[K, Iterable[Long]]
    Definition Classes
    IterableOps
  98. def groupMap[K, B](key: (Long) => K)(f: (Long) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  99. def groupMapReduce[K, B](key: (Long) => K)(f: (Long) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  100. def grouped(size: Int): Iterator[Iterable[Long]]
    Definition Classes
    IterableOps
  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
    SparseVectorL → VectoL → AnyRef → Any
  102. def head: Long
    Definition Classes
    IterableOps
  103. def headOption: Option[Long]
    Definition Classes
    IterableOps
  104. def indexOf(x: Long, 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
    SparseVectorL → VectoL
  105. def indexWhere(p: (Long) => 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
    SparseVectorL → VectoL
  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
    VectoL → Vec
  107. def init: Iterable[Long]
    Definition Classes
    IterableOps
  108. def inits: Iterator[Iterable[Long]]
    Definition Classes
    IterableOps
  109. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  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
    SparseVectorL → VectoL
  112. def isSorted: Boolean

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

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

    Definition Classes
    SparseVectorL → VectoL
  113. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  114. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  115. def iterator: Iterator[Long]

    Return an iterator which yields all the elements.

    Return an iterator which yields all the elements.

    Definition Classes
    SparseVectorL → IterableOnce
  116. def knownSize: Int
    Definition Classes
    IterableOnce
  117. def last: Long
    Definition Classes
    IterableOps
  118. def lastOption: Option[Long]
    Definition Classes
    IterableOps
  119. def lazyZip[B](that: Iterable[B]): LazyZip2[Long, B, SparseVectorL.this.type]
    Definition Classes
    Iterable
  120. def mag: Long

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

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

    Definition Classes
    VectoL
  121. def map(f: (Long) => Long): SparseVectorL

    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
    SparseVectorL → VectoL
  122. def map[B](f: (Long) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  123. def max(b: VectoL): SparseVectorL

    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
    SparseVectorL → VectoL
  124. def max(e: Int = dim): Long

    Find the maximum element in 'this' vector.

    Find the maximum element in 'this' vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    SparseVectorL → VectoL
  125. def max[B >: Long](implicit ord: Ordering[B]): Long
    Definition Classes
    IterableOnceOps
  126. def maxBy[B](f: (Long) => B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    IterableOnceOps
  127. def maxByOption[B](f: (Long) => B)(implicit cmp: Ordering[B]): Option[Long]
    Definition Classes
    IterableOnceOps
  128. def maxOption[B >: Long](implicit ord: Ordering[B]): Option[Long]
    Definition Classes
    IterableOnceOps
  129. def mean: Double

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

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

    Definition Classes
    VectoL
  130. def min(b: VectoL): SparseVectorL

    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
    SparseVectorL → VectoL
  131. def min(e: Int = dim): Long

    Find the minimum element in 'this' vector.

    Find the minimum element in 'this' vector.

    e

    the ending index (exclusive) for the search

    Definition Classes
    SparseVectorL → VectoL
  132. def min[B >: Long](implicit ord: Ordering[B]): Long
    Definition Classes
    IterableOnceOps
  133. def minBy[B](f: (Long) => B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    IterableOnceOps
  134. def minByOption[B](f: (Long) => B)(implicit cmp: Ordering[B]): Option[Long]
    Definition Classes
    IterableOnceOps
  135. def minOption[B >: Long](implicit ord: Ordering[B]): Option[Long]
    Definition Classes
    IterableOnceOps
  136. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  137. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  138. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  139. val nd: Double

    Number of elements in the vector as a Long

    Number of elements in the vector as a Long

    Definition Classes
    VectoL
  140. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  141. def newSpecificBuilder: Builder[Long, Iterable[Long]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  142. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  143. def norm: Long

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

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

    Definition Classes
    VectoL
  144. def norm1: Long

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

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

    Definition Classes
    SparseVectorL → VectoL
  145. def normSq: Long

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

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

    Definition Classes
    VectoL
  146. def normalize: SparseVectorL

    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
    SparseVectorL → VectoL
  147. def normalize1: SparseVectorL

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

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

    Definition Classes
    SparseVectorL → VectoL
  148. def normalizeU: SparseVectorL

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

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

    Definition Classes
    SparseVectorL → VectoL
  149. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  150. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  151. def one(size: Int = dim): SparseVectorL

    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
    SparseVectorL → VectoL
  152. def oneAt(j: Int, size: Int = dim): SparseVectorL

    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
    SparseVectorL → VectoL
  153. def partition(p: (Long) => Boolean): (Iterable[Long], Iterable[Long])
    Definition Classes
    IterableOps
  154. def partitionMap[A1, A2](f: (Long) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  155. def pot(b: VectoL): Long

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

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

    b

    the other vector

    Definition Classes
    VectoL
  156. def product[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  157. 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
    VectoL
  158. val range: Range

    Range for the storage array

    Range for the storage array

    Definition Classes
    VectoL
  159. 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
    SparseVectorL → VectoL
  160. def recip: SparseVectorL

    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
    SparseVectorL → VectoL
  161. def reduce[B >: Long](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  162. def reduceLeft[B >: Long](op: (B, Long) => B): B
    Definition Classes
    IterableOnceOps
  163. def reduceLeftOption[B >: Long](op: (B, Long) => B): Option[B]
    Definition Classes
    IterableOnceOps
  164. def reduceOption[B >: Long](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  165. def reduceRight[B >: Long](op: (Long, B) => B): B
    Definition Classes
    IterableOnceOps
  166. def reduceRightOption[B >: Long](op: (Long, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  167. def reorder(rnk: VectoI): VectoL

    Return the elements in 'this' vector in the given rank order 'rnk'.

    Return the elements in 'this' vector in the given rank order 'rnk'.

    rnk

    the given rank order

    Definition Classes
    VectoL
  168. def reverse(): SparseVectorL

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

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

    Definition Classes
    SparseVectorL → VectoL
  169. def reversed: Iterable[Long]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  170. def rot(b: VectoL)(from: Int = b.dim - 1): Long

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

    Compute the dot product (or inner product) of 'this' vector with vector 'b' reversed. zero-padded and reversed.

    b

    the other vector

    Definition Classes
    VectoL
  171. def sameDimensions(b: SparseVectorL): 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

  172. def sameDimensions(b: VectoL): 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
    VectoL
  173. def scan[B >: Long](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  174. def scanLeft[B](z: B)(op: (B, Long) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  175. def scanRight[B](z: B)(op: (Long, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  176. def select(basis: Array[Int]): SparseVectorL

    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
    SparseVectorL → VectoL
  177. def select(basis: VectoI): VectoL

    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
    VectoL
  178. def selectEx(basis: VectoI): VectoL

    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
    VectoL
  179. def selectEx(basis: Array[Int]): VectoL

    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
    VectoL
  180. def set(u: Seq[Long]): 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
    SparseVectorL → VectoL
  181. def set(x: Long): 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
    SparseVectorL → VectoL
  182. 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
    VectoL
  183. def size: Int

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

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

    Definition Classes
    VectoL → Vec → IterableOnceOps
  184. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  185. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  186. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  187. def slice(from: Int, till: Int): SparseVectorL

    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
    SparseVectorL → VectoL → IterableOps → IterableOnceOps
  188. def slice(rg: Range): VectoL

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

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

    rg

    the range specifying the slice

    Definition Classes
    VectoL
  189. def sliceEx(rg: Range): VectoL

    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
    VectoL
  190. def sliding(size: Int, step: Int): Iterator[Iterable[Long]]
    Definition Classes
    IterableOps
  191. def sliding(size: Int): Iterator[Iterable[Long]]
    Definition Classes
    IterableOps
  192. 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
    SparseVectorL → VectoL
  193. 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
    SparseVectorL → VectoL
  194. def span(p: (Long) => Boolean): (Iterable[Long], Iterable[Long])
    Definition Classes
    IterableOps → IterableOnceOps
  195. def split(basis: VectoI): (VectoL, VectoL)

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    basis

    the index positions to be included/excluded

    Definition Classes
    VectoL
  196. def split(basis: Array[Int]): (VectoL, VectoL)

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    Split the elements of 'this' vector into two vectors, one including the 'basis' and the other excluding the 'basis'.

    basis

    the index positions to be included/excluded

    Definition Classes
    VectoL
  197. def split(k: Int): Array[VectoL]

    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
    VectoL
  198. def splitAt(n: Int): (Iterable[Long], Iterable[Long])
    Definition Classes
    IterableOps → IterableOnceOps
  199. def sq: VectoL

    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
    VectoL
  200. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Long, S]): S
    Definition Classes
    IterableOnce
  201. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding()
  202. def sum: Long

    Sum the elements of 'this' vector.

    Sum the elements of 'this' vector.

    Definition Classes
    SparseVectorL → VectoL
  203. def sum[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  204. def sumNE(i: Int): Long

    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
    SparseVectorL → VectoL
  205. def sumPos: Long

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

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

    Definition Classes
    SparseVectorL → VectoL
  206. 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
    SparseVectorL → VectoL
  207. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  208. def tail: Iterable[Long]
    Definition Classes
    IterableOps
  209. def tails: Iterator[Iterable[Long]]
    Definition Classes
    IterableOps
  210. def take(n: Int): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  211. def takeRight(n: Int): Iterable[Long]
    Definition Classes
    IterableOps
  212. def takeWhile(p: (Long) => Boolean): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  213. def tapEach[U](f: (Long) => U): Iterable[Long]
    Definition Classes
    IterableOps → IterableOnceOps
  214. def to[C1](factory: Factory[Long, C1]): C1
    Definition Classes
    IterableOnceOps
  215. def toArray[B >: Long](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  216. final def toBuffer[B >: Long]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  217. def toDense: VectorL

    Convert 'this' sparse vector to a dense vector.

    Convert 'this' sparse vector to a dense vector.

    Definition Classes
    SparseVectorL → VectoL
  218. def toDouble: VectorD

    Convert 'this' SparseVectorL into a VectorD.

    Convert 'this' SparseVectorL into a VectorD.

    Definition Classes
    SparseVectorL → VectoL
  219. def toIndexedSeq: IndexedSeq[Long]
    Definition Classes
    IterableOnceOps
  220. def toInt: VectorI

    Convert 'this' SparseVectorL into a VectorI.

    Convert 'this' SparseVectorL into a VectorI.

    Definition Classes
    SparseVectorL → VectoL
  221. final def toIterable: SparseVectorL.this.type
    Definition Classes
    Iterable → IterableOps
  222. def toList: List[Long]
    Definition Classes
    IterableOnceOps
  223. def toLong: VectorL

    Convert 'this' SparseVectorL into a VectorL.

    Convert 'this' SparseVectorL into a VectorL.

    Definition Classes
    SparseVectorL → VectoL
  224. def toMap[K, V](implicit ev: <:<[Long, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  225. def toSeq: Seq[Long]
    Definition Classes
    IterableOnceOps
  226. def toSet[B >: Long]: Set[B]
    Definition Classes
    IterableOnceOps
  227. def toString: String

    Convert 'this' vector to a String.

    Convert 'this' vector to a String.

    Definition Classes
    SparseVectorL → VectoL → Iterable → AnyRef → Any
  228. def toString2: String

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

  229. def toVector: Vector[Long]
    Definition Classes
    IterableOnceOps
  230. def transpose[B](implicit asIterable: (Long) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  231. def tryCompareTo[B >: SparseVectorL](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
    SparseVectorL → PartiallyOrdered
  232. def unary_-: SparseVectorL

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

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

    Definition Classes
    SparseVectorL → VectoL
  233. def unzip[A1, A2](implicit asPair: (Long) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  234. def unzip3[A1, A2, A3](implicit asTriple: (Long) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  235. def update(r: Range, u: VectoL): 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
    SparseVectorL → VectoL
  236. def update(r: Range, x: Long): 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
    SparseVectorL → VectoL
  237. def update(i: Int, x: Long): 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
    SparseVectorL → VectoL
  238. var v: RowMap
    Attributes
    protected
  239. 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
    VectoL
  240. def view: View[Long]
    Definition Classes
    IterableOps
  241. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  242. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  243. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  244. def withFilter(p: (Long) => Boolean): WithFilter[Long, Iterable]
    Definition Classes
    IterableOps
  245. def zero(size: Int = dim): SparseVectorL

    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
    SparseVectorL → VectoL
  246. def zip[B](that: IterableOnce[B]): Iterable[(Long, B)]
    Definition Classes
    IterableOps
  247. def zipAll[A1 >: Long, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  248. def zipWithIndex: Iterable[(Long, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  249. def ~^(s: Long): SparseVectorL

    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
    SparseVectorL → VectoL
  250. def ~^=(s: Long): SparseVectorL

    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
    SparseVectorL → VectoL
  251. def ∙(b: VectoL): Long

    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'. When b.dim > dim, the remaining elements in b are skipped. When b.dim < dim, an index out of bound exception is thrown.

    b

    the other vector

    Definition Classes
    VectoL
  252. def ≠(b: VectoL): Boolean

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

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

    b

    that vector

    Definition Classes
    VectoL
  253. def ≤(b: VectoL): 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
    VectoL
  254. def ≥(b: VectoL): 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
    VectoL
  255. def ⦁(b: SparseVectorL): Long

    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

  256. def ⦁(b: VectoL): Long

    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

Deprecated Value Members

  1. def ++:[B >: Long](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. final def /:[B](z: B)(op: (B, Long) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. final def :\[B](z: B)(op: (Long, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  4. def aggregate[B](z: => B)(seqop: (B, Long) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  5. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  6. final def copyToBuffer[B >: Long](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  7. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  8. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  9. final def repr: Iterable[Long]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  10. def seq: SparseVectorL.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterator: Iterator[Long]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  12. final def toStream: Stream[Long]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  13. final def toTraversable: Traversable[Long]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  14. def view(from: Int, until: Int): View[Long]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from VectoL

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoL]

Inherited from Iterable[Long]

Inherited from IterableFactoryDefaults[Long, Iterable]

Inherited from IterableOps[Long, Iterable, Iterable[Long]]

Inherited from IterableOnceOps[Long, Iterable, Iterable[Long]]

Inherited from IterableOnce[Long]

Inherited from AnyRef

Inherited from Any

Ungrouped