Packages

trait VectoL extends Traversable[Long] with PartiallyOrdered[VectoL] with Vec with Error with Serializable

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

Type Members

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

Abstract Value Members

  1. abstract def *(s: (Int, Long)): VectoL

    Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.

    Multiply 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x * (3, 5.5)'.

    s

    the (position, scalar) to multiply

  2. abstract def *(s: Long): VectoL

    Multiply 'this' vector by scalar 's'.

    Multiply 'this' vector by scalar 's'.

    s

    the scalar to multiply by

  3. abstract def *(b: VectoL): VectoL

    Multiply 'this' vector by vector 'b'.

    Multiply 'this' vector by vector 'b'.

    b

    the vector to multiply by

  4. abstract def *=(s: Long): VectoL

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

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

    s

    the scalar to multiply by

  5. abstract def *=(b: VectoL): VectoL

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

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

    b

    the vector to multiply by

  6. abstract def +(s: (Int, Long)): VectoL

    Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.

    Add 'this' vector and scalar 's._2' only at position 's._1', e.g., 'x + (3, 5.5)'.

    s

    the (position, scalar) to add

  7. abstract def +(s: Long): VectoL

    Add 'this' vector and scalar 's'.

    Add 'this' vector and scalar 's'.

    s

    the scalar to add

  8. abstract def +(b: VectoL): VectoL

    Add 'this' vector and vector 'b'.

    Add 'this' vector and vector 'b'.

    b

    the vector to add

  9. abstract def ++(s: Long): VectoL

    Concatenate 'this' vector and scalar 's'.

    Concatenate 'this' vector and scalar 's'.

    s

    the scalar to be concatenated

  10. abstract def ++(b: VectoL): VectoL

    Concatenate 'this' vector and vector' b'.

    Concatenate 'this' vector and vector' b'.

    b

    the vector to be concatenated

  11. abstract def +=(s: Long): VectoL

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

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

    s

    the scalar to add

  12. abstract def +=(b: VectoL): VectoL

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

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

    b

    the vector to add

  13. abstract def -(s: (Int, Long)): VectoL

    From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.

    From 'this' vector subtract scalar 's._2' only at position 's._1', e.g., 'x - (3, 5.5)'.

    s

    the (position, scalar) to subtract

  14. abstract def -(s: Long): VectoL

    From 'this' vector subtract scalar 's'.

    From 'this' vector subtract scalar 's'.

    s

    the scalar to subtract

  15. abstract def -(b: VectoL): VectoL

    From 'this' vector subtract vector 'b'.

    From 'this' vector subtract vector 'b'.

    b

    the vector to subtract

  16. abstract def -=(s: Long): VectoL

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

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

    s

    the scalar to substract

  17. abstract def -=(b: VectoL): VectoL

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

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

    b

    the vector to subtract

  18. abstract def /(s: (Int, Long)): VectoL

    Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.

    Divide 'this' vector by scalar 's._2' only at position 's._1', e.g., 'x / (3, 5.5)'.

    s

    the (position, scalar) to divide

  19. abstract def /(s: Long): VectoL

    Divide 'this' vector by scalar 's'.

    Divide 'this' vector by scalar 's'.

    s

    the scalar to divide by

  20. abstract def /(b: VectoL): VectoL

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

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

    b

    the vector to divide by

  21. abstract def /=(s: Long): VectoL

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

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

    s

    the scalar to divide by

  22. abstract def /=(b: VectoL): VectoL

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

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

    b

    the vector to divide by

  23. abstract def _oneAt(j: Int, size: Int = dim): VectoL

    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)

  24. abstract def abs: VectoL

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

  25. abstract def apply(): IndexedSeq[Long]

    Get 'this' vector's entire sequence/array.

  26. abstract def apply(r: Range): VectoL

    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

  27. abstract 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

  28. abstract def argmax(s: Int, e: Int): Int

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

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

    s

    the starting index (inclusive) for the search

    e

    the ending index (exclusive) for the search

  29. abstract def argmax(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  30. abstract def argmaxPos(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  31. abstract def argmin(s: Int, e: Int): Int

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

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

    s

    the starting index (inclusive) for the search

    e

    the ending index (exclusive) for the search

  32. abstract def argmin(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  33. abstract def argminNeg(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  34. abstract 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

  35. abstract def copy: VectoL

    Create a copy of this Vector.

  36. abstract def countNeg: Int

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

  37. abstract def countPos: Int

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

  38. abstract def countZero: Int

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

  39. abstract def countinct: Int

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

  40. abstract def cumulate: VectoL

    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)

  41. abstract val dim: Int

    Vector dimension

  42. abstract def distinct: VectoL

    Create a vector consisting of the distinct elements in 'this' vector.

  43. abstract 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

  44. abstract def expand(more: Int = dim): VectoL

    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

  45. abstract def filterMissing: VectoL

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

  46. abstract def filterPos(p: (Long) ⇒ Boolean): IndexedSeq[Int]

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

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

    p

    the unary predicate (Boolean function) to apply

  47. abstract 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

  48. abstract def firstNeg(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  49. abstract def firstPos(e: Int = dim): Int

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

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

    e

    the ending index (exclusive) for the search

  50. abstract 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
    VectoL → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  51. abstract 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

  52. abstract 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

  53. abstract def isNonnegative: Boolean

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

  54. abstract def isSorted: Boolean

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

  55. abstract def map(f: (Long) ⇒ Long): VectoL

    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

  56. abstract def max(b: VectoL): VectoL

    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

  57. abstract 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

  58. abstract def min(b: VectoL): VectoL

    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

  59. abstract 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

  60. abstract def norm1: Long

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

  61. abstract def normalize: VectoL

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

  62. abstract def normalize1: VectoL

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

  63. abstract def normalizeU: VectoL

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

  64. abstract def one(size: Int): VectoL

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

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

    size

    the size of the new vector

  65. abstract def oneAt(j: Int, size: Int = dim): VectoL

    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)

  66. abstract def rank: VectoI

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

  67. abstract def recip: VectoL

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

  68. abstract def reverse(): VectoL

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

  69. abstract def select(basis: Array[Int]): 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)

  70. abstract def set(u: Seq[Long]): Unit

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

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

    u

    the sequence of values to be assigned

  71. abstract 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

  72. abstract def sort(): Unit

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

  73. abstract def sort2(): Unit

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

  74. abstract def sum: Long

    Sum the elements of 'this' vector.

  75. abstract 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

  76. abstract def sumPos: Long

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

  77. abstract def swap(i: Int, j: Int): Unit

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

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

    i

    the first element in the swap

    j

    the second element in the swap

  78. abstract def toDense: VectorL

    Convert 'this' VectoL into a dense version.

  79. abstract def toDouble: VectoD

    Convert 'this' VectoL into a VectoD.

  80. abstract def toInt: VectoI

    Convert 'this' VectoL into a VectoI.

  81. abstract def toLong: VectoL

    Convert 'this' VectoL into a VectoL.

  82. abstract def tryCompareTo[B >: VectoL](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Option[Int]
    Definition Classes
    PartiallyOrdered
  83. abstract def unary_-(): VectoL

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

  84. abstract 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

  85. abstract 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

  86. abstract 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

  87. abstract def zero(size: Int): VectoL

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

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

    size

    the size of the new vector

  88. abstract def ~^(s: Long): VectoL

    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

  89. abstract def ~^=(s: Long): VectoL

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

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

    s

    the scalar exponent

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Long, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: Long, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: Long, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike
  6. def /:[B](z: B)(op: (B, Long) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. def :\[B](z: B)(op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def <[B >: VectoL](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  9. def <=[B >: VectoL](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def >[B >: VectoL](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  12. def >=[B >: VectoL](that: B)(implicit arg0: (B) ⇒ PartiallyOrdered[B]): Boolean
    Definition Classes
    PartiallyOrdered
  13. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def aggregate[B](z: ⇒ B)(seqop: (B, Long) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. 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

  18. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  19. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  20. def collect[B, That](pf: PartialFunction[Long, B])(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  21. def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]
    Definition Classes
    TraversableOnce
  22. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  23. def copyToArray[B >: Long](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  24. def copyToArray[B >: Long](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: Long](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToBuffer[B >: Long](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  27. def count(p: (Long) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def drop(n: Int): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  29. def dropWhile(p: (Long) ⇒ Boolean): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  30. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  32. def exists(p: (Long) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  33. 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
  34. def filter(p: (Long) ⇒ Boolean): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def filterNot(p: (Long) ⇒ Boolean): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. def find(p: (Long) ⇒ Boolean): Option[Long]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  38. def flatMap[B, That](f: (Long) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  39. def flatten[B](implicit asTraversable: (Long) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  40. 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
  41. def fold[A1 >: Long](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def foldLeft[B](z: B)(op: (B, Long) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def foldRight[B](z: B)(op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def forall(p: (Long) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  45. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  46. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  47. def groupBy[K](f: (Long) ⇒ K): Map[K, Traversable[Long]]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  49. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  50. def head: Long
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def headOption: Option[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. 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
    VectoLVec
  53. def init: Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def inits: Iterator[Traversable[Long]]
    Definition Classes
    TraversableLike
  55. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  56. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  57. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  58. def last: Long
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def lastOption: Option[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def mag: Long

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

  61. def map[B, That](f: (Long) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  62. def max[B >: Long](implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def maxBy[B](f: (Long) ⇒ B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def mean: Double

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

  65. def min[B >: Long](implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def minBy[B](f: (Long) ⇒ B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. val nd: Double

    Number of elements in the vector as a Long

  71. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  72. def newBuilder: Builder[Long, Traversable[Long]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  73. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def norm: Long

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

  75. def normSq: Long

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

  76. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  77. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  78. def par: ParIterable[Long]
    Definition Classes
    Parallelizable
  79. def parCombiner: Combiner[Long, ParIterable[Long]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  80. def partition(p: (Long) ⇒ Boolean): (Traversable[Long], Traversable[Long])
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def product[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. 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.

  83. val range: Range

    Range for the storage array

  84. def reduce[A1 >: Long](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def reduceLeft[B >: Long](op: (B, Long) ⇒ B): B
    Definition Classes
    TraversableOnce
  86. def reduceLeftOption[B >: Long](op: (B, Long) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def reduceOption[A1 >: Long](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def reduceRight[B >: Long](op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def reduceRightOption[B >: Long](op: (Long, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def repr: Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def reversed: List[Long]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  92. 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

  93. def scan[B >: Long, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def scanLeft[B, That](z: B)(op: (B, Long) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Long], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def scanRight[B, That](z: B)(op: (Long, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Long], 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.

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

  97. def seq: Traversable[Long]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  98. 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

  99. def size: Int

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

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

    Definition Classes
    VectoLVec → GenTraversableLike → TraversableOnce → GenTraversableOnce
  100. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  101. 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

  102. def slice(from: Int, till: Int = dim): VectoL

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

    Slice 'this' vector 'from' to 'end'. Override in implementing classes.

    from

    the start of the slice (included)

    till

    the end of the slice (excluded)

    Definition Classes
    VectoL → TraversableLike → GenTraversableLike
  103. 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

  104. def span(p: (Long) ⇒ Boolean): (Traversable[Long], Traversable[Long])
    Definition Classes
    TraversableLike → GenTraversableLike
  105. 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

  106. def splitAt(n: Int): (Traversable[Long], Traversable[Long])
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def sq: VectoL

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

  108. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def sum[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  111. def tail: Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def tails: Iterator[Traversable[Long]]
    Definition Classes
    TraversableLike
  113. def take(n: Int): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def takeWhile(p: (Long) ⇒ Boolean): Traversable[Long]
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def thisCollection: Traversable[Long]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  116. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Long, Col[Long]]): Col[Long]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  117. def toArray[B >: Long](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def toBuffer[B >: Long]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def toCollection(repr: Traversable[Long]): Traversable[Long]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  120. def toIndexedSeq: IndexedSeq[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def toIterable: Iterable[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def toIterator: Iterator[Long]
    Definition Classes
    TraversableLike → GenTraversableOnce
  123. def toList: List[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def toMap[T, U](implicit ev: <:<[Long, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def toSeq: Seq[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def toSet[B >: Long]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def toStream: Stream[Long]
    Definition Classes
    TraversableLike → GenTraversableOnce
  128. def toString(): String
    Definition Classes
    TraversableLike → Any
  129. def toTraversable: Traversable[Long]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  130. def toVector: Vector[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def transpose[B](implicit asTraversable: (Long) ⇒ 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.

  132. def unzip[A1, A2](implicit asPair: (Long) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  133. def unzip3[A1, A2, A3](implicit asTriple: (Long) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  134. def variance: Double

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

  135. def view(from: Int, until: Int): TraversableView[Long, Traversable[Long]]
    Definition Classes
    TraversableLike
  136. def view: TraversableView[Long, Traversable[Long]]
    Definition Classes
    TraversableLike
  137. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  138. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  139. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  140. def withFilter(p: (Long) ⇒ Boolean): FilterMonadic[Long, Traversable[Long]]
    Definition Classes
    TraversableLike → FilterMonadic
  141. 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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Error

Inherited from Vec

Inherited from PartiallyOrdered[VectoL]

Inherited from Traversable[Long]

Inherited from GenTraversable[Long]

Inherited from GenericTraversableTemplate[Long, Traversable]

Inherited from TraversableLike[Long, Traversable[Long]]

Inherited from GenTraversableLike[Long, Traversable[Long]]

Inherited from Parallelizable[Long, ParIterable[Long]]

Inherited from TraversableOnce[Long]

Inherited from GenTraversableOnce[Long]

Inherited from FilterMonadic[Long, Traversable[Long]]

Inherited from HasNewBuilder[Long, Traversable[Long]]

Inherited from AnyRef

Inherited from Any

Ungrouped