scalation
API
Generated with
scalation/scalation/scalation.mathstat/VectorT

VectorT

scalation.mathstat.VectorT
See theVectorT companion object
class VectorT(val dim: Int, var v: Array[TimeNum]) extends IndexedSeq[TimeNum], PartiallyOrdered[VectorT], DefaultSerializable

The VectorT class stores and operates on Numeric Vectors of base type TimeNum.

Value parameters

dim

the dimension/size of the vector

v

the 1D array used to store vector elements

Attributes

Companion
object
Graph
Supertypes
trait DefaultSerializable
trait Serializable
trait PartiallyOrdered[VectorT]
trait IndexedSeq[TimeNum]
trait IndexedSeqOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait IndexedSeq[TimeNum]
trait IndexedSeqOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait Seq[TimeNum]
trait SeqOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait Cloneable[IndexedSeq[TimeNum]]
trait Cloneable
trait Seq[TimeNum]
trait Equals
trait SeqOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait PartialFunction[Int, TimeNum]
trait Int => TimeNum
trait Iterable[TimeNum]
trait Iterable[TimeNum]
trait IterableFactoryDefaults[TimeNum, IndexedSeq]
trait IterableOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait IterableOnceOps[TimeNum, IndexedSeq, IndexedSeq[TimeNum]]
trait IterableOnce[TimeNum]
class Object
trait Matchable
class Any
Show all

Members list

Type members

Inherited types

type AsPartiallyOrdered = Function1

Attributes

Inherited from:
PartiallyOrdered

Value members

Concrete methods

def *(y: IndexedSeq[TimeNum]): VectorT
def *(a: TimeNum): VectorT
def *=(y: IndexedSeq[TimeNum]): VectorT
def *=(a: TimeNum): VectorT
def +(y: IndexedSeq[TimeNum]): VectorT

Compute the element-wise sum (or difference, product, quotient) of vectors this and y.

Compute the element-wise sum (or difference, product, quotient) of vectors this and y.

Value parameters

y

the other vector/indexed sequence

Attributes

def +(a: TimeNum): VectorT

Compute the element-wise sum (or difference, product, quotient) of this and scalar a.

Compute the element-wise sum (or difference, product, quotient) of this and scalar a.

Value parameters

a

the scalar second operand

Attributes

def +(ia: (Int, TimeNum)): VectorT

Add this vector and scalar a only at position i, e.g., x + (3, 5.5).

Add this vector and scalar a only at position i, e.g., x + (3, 5.5).

Value parameters

ia

= (i, a) the (index position, scalar) to add

Attributes

def ++(y: IndexedSeq[TimeNum]): VectorT

Concatenate this vector and vector y.

Concatenate this vector and vector y.

Value parameters

y

the other vector/indexed sequence

Attributes

def +:(a: TimeNum): VectorT

Prepend (or append) this vector with scalar a.

Prepend (or append) this vector with scalar a.

Value parameters

a

the scalar second operand

Attributes

def +=(y: IndexedSeq[TimeNum]): VectorT

Compute the element-wise sum (or difference, product, quotient) of vectors this and y. Perform operations in-place (destructive) to reduce memory allocations.

Compute the element-wise sum (or difference, product, quotient) of vectors this and y. Perform operations in-place (destructive) to reduce memory allocations.

Value parameters

y

the other vector/indexed sequence

Attributes

def +=(a: TimeNum): VectorT

Compute the element-wise sum (or difference, product, quotient) of this and scalar a. Perform operations in-place (destructive) to reduce memory allocations.

Compute the element-wise sum (or difference, product, quotient) of this and scalar a. Perform operations in-place (destructive) to reduce memory allocations.

Value parameters

a

the scalar second operand

Attributes

def -(y: IndexedSeq[TimeNum]): VectorT
def -(a: TimeNum): VectorT
def -(ia: (Int, TimeNum)): VectorT

Subtract from this vector the scalar a only at position i, e.g., x - (3, 5.5).

Subtract from this vector the scalar a only at position i, e.g., x - (3, 5.5).

Value parameters

ia

= (i, a) the (index position, scalar) to subtract

Attributes

def -=(y: IndexedSeq[TimeNum]): VectorT
def -=(a: TimeNum): VectorT
def /(y: IndexedSeq[TimeNum]): VectorT
def /(a: TimeNum): VectorT
def /=(y: IndexedSeq[TimeNum]): VectorT
def /=(a: TimeNum): VectorT
def :+(a: TimeNum): VectorT
def abs: VectorT

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.

Attributes

def acorr(k: Int): Double

Compute the 'k'-lag auto-correlation of this vector. Assumes a stationary process vector, if not its an approximation.

Compute the 'k'-lag auto-correlation of this vector. Assumes a stationary process vector, if not its an approximation.

Value parameters

k

the lag parameter

Attributes

def acorr_(k: Int): Double
def acov(k: Int): Double

Compute the 'k'-lag auto-covariance of this vector for stationary and non-stationary series (acov_).

Compute the 'k'-lag auto-covariance of this vector for stationary and non-stationary series (acov_).

Value parameters

k

the lag parameter

Attributes

def acov_(k: Int): Double
def apply(i: Int): TimeNum

Return the i-th element of this vector.

Return the i-th element of this vector.

Value parameters

i

the index of the element to return

Attributes

def apply(r: Range): VectorT

Return the elements in range r of this vector.

Return the elements in range r of this vector.

Value parameters

r

the index range of elements to return

Attributes

def apply(idx: IndexedSeq[Int]): VectorT

Return the elements in index sequence idx of this vector.

Return the elements in index sequence idx of this vector.

Value parameters

idx

the index sequence of elements to return

Attributes

def apply(idx: IndexedSeq[Int]): VectorT
def argmax(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).

Value parameters

e

the ending index (exclusive) for the search

Attributes

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

Value parameters

e

the ending index (exclusive) for the search

s

the starting index (inclusive) for the search

Attributes

def argmin(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).

Value parameters

e

the ending index (exclusive) for the search

Attributes

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

Value parameters

e

the ending index (exclusive) for the search

s

the starting index (inclusive) for the search

Attributes

def chop(k: Int): Array[VectorT]

Chop this vector into k sub-vectors of equal sizes (perhaps except for the last one).

Chop this vector into k sub-vectors of equal sizes (perhaps except for the last one).

Value parameters

k

the number of pieces to chop this vector into

Attributes

def copy: VectorT

Return a deep copy of this vector (note: clone may not be deep). Uses Java's native Arrays.copyOf for efficiency.

Return a deep copy of this vector (note: clone may not be deep). Uses Java's native Arrays.copyOf for efficiency.

Attributes

infix def corr(y: VectorT): Double

Compute Pearson's correlation of this vector with vector y. If either variance is zero, will result in Not-a-Number (NaN), return one if the vectors are the same, or -0 (indicating undefined).

Compute Pearson's correlation of this vector with vector y. If either variance is zero, will result in Not-a-Number (NaN), return one if the vectors are the same, or -0 (indicating undefined).

Value parameters

y

the other vector

Attributes

def countZero: Int

Count the number of zero elements in the this vector.

Count the number of zero elements in the this vector.

Attributes

infix def cov(y: IndexedSeq[TimeNum]): Double

Compute the sample covariance (or population covariance) of this vector with vector y.

Compute the sample covariance (or population covariance) of this vector with vector y.

Value parameters

y

the other vector

Attributes

infix def cov_(y: IndexedSeq[TimeNum]): Double
def cumulate: VectorT

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)

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)

Attributes

infix def diff(y: IndexedSeq[TimeNum]): VectorT

Return the difference between this vector and vector y.

Return the difference between this vector and vector y.

Value parameters

y

the other vector/indexed sequence

Attributes

override def distinct: VectorT

Form a new vector consisting of the unique values in this vector.

Form a new vector consisting of the unique values in this vector.

Attributes

Definition Classes
SeqOps
infix def dot(y: IndexedSeq[TimeNum]): TimeNum

Compute the dot (inner) product of vectors this and y.

Compute the dot (inner) product of vectors this and y.

Value parameters

the

other vector/indexed sequence

Attributes

def expand(more: Int): VectorT

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

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

Value parameters

more

the number of new elements to add

Attributes

override def filter(p: TimeNum => Boolean): VectorT

Filter the elements in this vector based on the predicate (or not predicate).

Filter the elements in this vector based on the predicate (or not predicate).

Value parameters

the

filter predicate

Attributes

Definition Classes
IterableOps -> IterableOnceOps
override def filterNot(p: TimeNum => Boolean): VectorT

Attributes

Definition Classes
IterableOps -> IterableOnceOps
def filterPos(p: TimeNum => Boolean): IndexedSeq[Int]

Filter the elements in this vector based on the predicate, returning index positions.

Filter the elements in this vector based on the predicate, returning index positions.

Value parameters

the

filter predicate

Attributes

override def foreach[U](f: TimeNum => U): Unit

Iterate over this vector element by element applying the given function.

Iterate over this vector element by element applying the given function.

Value parameters

f

the function to apply

Attributes

Definition Classes
IterableOnceOps
infix def intersect(y: IndexedSeq[TimeNum]): VectorT

Return the intersection of this vector and vector y.

Return the intersection of this vector and vector y.

Value parameters

y

the other vector/indexed sequence

Attributes

def iqsort: Array[Int]

Indirectly sort this vector using QuickSort, returning the rank order.

Indirectly sort this vector using QuickSort, returning the rank order.

Attributes

def isNonnegative: Boolean

Return whether this is non-negative (contains no negative values).

Return whether this is non-negative (contains no negative values).

Attributes

def iselsort: Array[Int]

Indirectly sort this vector using SelectionSort, returning the rank order.

Indirectly sort this vector using SelectionSort, returning the rank order.

Attributes

def kurtosis: Double

Compute the kurtosis of 'x' vector. High kurtosis (> 3) indicates a distribution with heavier tails than a Normal distribution.

Compute the kurtosis of 'x' vector. High kurtosis (> 3) indicates a distribution with heavier tails than a Normal distribution.

Attributes

See also
def kurtosis_: Double
inline def length: Int

Return the length of this vector.

Return the length of this vector.

Attributes

def mag: TimeNum

Return the magnitude of this vector, i.e., the element value farthest from zero.

Return the magnitude of this vector, i.e., the element value farthest from zero.

Attributes

def map(f: TimeNum => TimeNum): VectorT

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

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

Value parameters

f

the function to apply

Attributes

def map2Long: (VectorL, BiMap[TimeNum, Long])

Convert this VectorT into a VectorL by mapping each distinct value in VectorT into a distinct numeric integer value, returning the new vector and the bidirectional mapping. Use the from method in BiMap to recover the original TimeNum. e.g., VectorT (_0, _1) will be mapped to VectorL (0, 1)

Convert this VectorT into a VectorL by mapping each distinct value in VectorT into a distinct numeric integer value, returning the new vector and the bidirectional mapping. Use the from method in BiMap to recover the original TimeNum. e.g., VectorT (_0, _1) will be mapped to VectorL (0, 1)

Attributes

def max: TimeNum

Find the maximum element in this vector.

Find the maximum element in this vector.

Attributes

infix def maxv(y: IndexedSeq[TimeNum]): VectorT

Return a new vector consisting of the maximum of this and y's corresponding elements.

Return a new vector consisting of the maximum of this and y's corresponding elements.

Value parameters

y

the other vector/indexed sequence

Attributes

def mean: Double

Compute the sample mean (also the population mean, they are the same).

Compute the sample mean (also the population mean, they are the same).

E(X)

Attributes

def median(k: Int): TimeNum

Indirectly find the k-median (k-th smallest element) of array v.

Indirectly find the k-median (k-th smallest element) of array v.

Value parameters

k

the type of median (e.g., k = (dim+1)/2 is the median)

Attributes

def median_: TimeNum

Compute the averaged median, which is the median when dim is odd and the average of the median and the next k-median when dim is even.

Compute the averaged median, which is the median when dim is odd and the average of the median and the next k-median when dim is even.

Attributes

def min: TimeNum

Find the minimum element in this vector.

Find the minimum element in this vector.

Attributes

infix def minv(y: IndexedSeq[TimeNum]): VectorT

Return a new vector consisting of the minimum of this and y's corresponding elements.

Return a new vector consisting of the minimum of this and y's corresponding elements.

Value parameters

y

the other vector/indexed sequence

Attributes

def ms: Double

Compute the mean square (ms) (or root mean square (rms)) of this vector.

Compute the mean square (ms) (or root mean square (rms)) of this vector.

Attributes

inline def nd: Double
def norm: Double
def norm1: TimeNum

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

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

Attributes

def normSq: TimeNum

Compute the Euclidean norm (2-norm) (or its square) of this vector.

Compute the Euclidean norm (2-norm) (or its square) of this vector.

Attributes

def normSqs(k: Int): (TimeNum, TimeNum, TimeNum)

Compute three squared norms for the k-prefix, middle and k-suffix of this vector.

Compute three squared norms for the k-prefix, middle and k-suffix of this vector.

Attributes

def normalize: VectorD

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

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

Attributes

def normalize1: VectorD

Normalize this vector to have a maximum of one.

Normalize this vector to have a maximum of one.

Attributes

def not(idx: IndexedSeq[Int]): VectorT

Return the elements not in index sequence idx of this vector.

Return the elements not in index sequence idx of this vector.

Value parameters

idx

the index sequence of elements to skip

Attributes

def recip: VectorD

Return the vector consisting of the reciprocal of each element of this vector.

Return the vector consisting of the reciprocal of each element of this vector.

Attributes

override def reverse: VectorT

Reverse the elements in this vector.

Reverse the elements in this vector.

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
def rms: Double
infix def scorr(y: VectorT): Double

Compute Spearman's rank correlation of this vector with vector y. The iqsort method gives the rank order of a vector.

Compute Spearman's rank correlation of this vector with vector y. The iqsort method gives the rank order of a vector.

Value parameters

y

the other vector

Attributes

See also

en.wikipedia.org/wiki/Spearman%27s_rank_correlation_coefficient

def set(a: TimeNum): Unit

Set all elements in this vector to a (or vector y.

Set all elements in this vector to a (or vector y.

Value parameters

a

the value to be assigned

Attributes

def set(y: IndexedSeq[TimeNum]): Unit
def skew: Double

Compute the skewness of this vector. Negative skewness indicates the distribution is elongated on the left, zero skewness indicates it is symmetric, and positive skewness indicates it is elongated on the right.

Compute the skewness of this vector. Negative skewness indicates the distribution is elongated on the left, zero skewness indicates it is symmetric, and positive skewness indicates it is elongated on the right.

Attributes

See also
def skew_: Double
override def sortWith(cmp: (TimeNum, TimeNum) => Boolean): VectorT

Sort the elements in this vector according to cmp (use '_ > _' for descending order.

Sort the elements in this vector according to cmp (use '_ > _' for descending order.

Value parameters

cmp

the comparison operator.

Attributes

Definition Classes
SeqOps
def sorted: VectorT

Sort the elements in this vector according to ord.lt (ascending order).

Sort the elements in this vector according to ord.lt (ascending order).

Attributes

def split(idx: IndexedSeq[Int]): (VectorT, VectorT)

Split the elements from this vector to form two vectors: one from the elements in idx (e.g., testing set) and the other from elements not in idx (e.g., training set). Note split and split_ produce different element orders.

Split the elements from this vector to form two vectors: one from the elements in idx (e.g., testing set) and the other from elements not in idx (e.g., training set). Note split and split_ produce different element orders.

Value parameters

idx

the element indices to include/exclude

Attributes

def split(i: Int): (VectorT, VectorT)

Split the elements from this vector to form two vectors: one from the the first i elements and the other from the rest of the elements.

Split the elements from this vector to form two vectors: one from the the first i elements and the other from the rest of the elements.

Value parameters

i

the split index

Attributes

def split_(idx: IndexedSeq[Int]): (VectorT, VectorT)

Split the elements from this vector to form two vectors: one from the elements in idx (e.g., testing set) and the other from elements not in idx (e.g., training set). Concise, but less efficient than split

Split the elements from this vector to form two vectors: one from the elements in idx (e.g., testing set) and the other from elements not in idx (e.g., training set). Concise, but less efficient than split

Value parameters

idx

the element indices to include/exclude

Attributes

def sqrt: VectorD

Return the vector consisting of the square root of each element of this vector.

Return the vector consisting of the square root of each element of this vector.

Attributes

def standardize: VectorD

Produce a standardized version of the vector by subtracting the mean and dividing by the standard deviation (e.g., Normal -> Standard Normal).

Produce a standardized version of the vector by subtracting the mean and dividing by the standard deviation (e.g., Normal -> Standard Normal).

Attributes

def stdev: Double

Compute the sample standard deviation (and population standard deviation).

Compute the sample standard deviation (and population standard deviation).

Attributes

def stdev_: Double
def sum: TimeNum

Compute sum for the elements in this vector.

Compute sum for the elements in this vector.

Attributes

def sums(k: Int): (TimeNum, TimeNum, TimeNum)

Compute three sums for the k-prefix, middle and k-suffix of this vector.

Compute three sums for the k-prefix, middle and k-suffix of this vector.

Attributes

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

Swap (in-place) elements i and k in this vector.

Swap (in-place) elements i and k in this vector.

Value parameters

i

the first element in the swap

k

the second element in the swap

Attributes

def toDouble: VectorD

Convert this TimeNum vector to a Double vector.

Convert this TimeNum vector to a Double vector.

Attributes

def toLong: VectorL

Convert this TimeNum vector to an Long vector.

Convert this TimeNum vector to an Long vector.

Attributes

def toProbability: VectorD

Convert to a probability vector, by normalizing so that it sums to one.

Convert to a probability vector, by normalizing so that it sums to one.

Attributes

override def toString: String

Convert vector to a string.

Convert vector to a string.

Attributes

Definition Classes
Seq -> Function1 -> Iterable -> Any
infix def tryCompareTo[B >: VectorT : AsPartiallyOrdered](bb: B): Option[Int]

Try to compare this vector to bb (return None if they are not comparable). As a partial order some vectors may not be comparable.

Try to compare this vector to bb (return None if they are not comparable). As a partial order some vectors may not be comparable.

Value parameters

bb

the other vector

Attributes

def unary_-: VectorT

Return the negative of this vector (unary minus).

Return the negative of this vector (unary minus).

Attributes

def update(i: Int, a: TimeNum): Unit

Update the i-th element (or in range) of this vector.

Update the i-th element (or in range) of this vector.

Value parameters

a

the updated value to assign

i

the index of the element to update

Attributes

def update(r: Range, a: TimeNum): Unit

Update the i-th element (or in range) of this vector.

Update the i-th element (or in range) of this vector.

Value parameters

a

the updated value to assign

i

the index of the element to update

Attributes

def variance: Double

Compute the sample variance (and population population).

Compute the sample variance (and population population).

E(X - μ)^2

Attributes

def variance(mu: Double): Double
def variance_: Double
def variance_(mu: Double): Double
def ~^(a: TimeNum): VectorT

Compute the element-wise power function of this vector raised to scalar a.

Compute the element-wise power function of this vector raised to scalar a.

Value parameters

the

scalar second operand

Attributes

Inherited methods

final def ++[B >: TimeNum](suffix: IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
final override def ++:[B >: TimeNum](prefix: IterableOnce[B]): IndexedSeq[B]

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def +:[B >: TimeNum](elem: B): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
final def :+[B >: TimeNum](elem: B): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
final def :++[B >: TimeNum](suffix: IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def <[B >: VectorT : AsPartiallyOrdered](that: B): Boolean

Attributes

Inherited from:
PartiallyOrdered
def <=[B >: VectorT : AsPartiallyOrdered](that: B): Boolean

Attributes

Inherited from:
PartiallyOrdered
def >[B >: VectorT : AsPartiallyOrdered](that: B): Boolean

Attributes

Inherited from:
PartiallyOrdered
def >=[B >: VectorT : AsPartiallyOrdered](that: B): Boolean

Attributes

Inherited from:
PartiallyOrdered
final def addString(b: StringBuilder): b.type

Attributes

Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): b.type

Attributes

Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): b.type

Attributes

Inherited from:
IterableOnceOps
def andThen[C](k: PartialFunction[TimeNum, C]): PartialFunction[Int, C]

Attributes

Inherited from:
PartialFunction
override def andThen[C](k: TimeNum => C): PartialFunction[Int, C]

Attributes

Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def appended[B >: TimeNum](elem: B): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def appendedAll[B >: TimeNum](suffix: IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: TimeNum](x: A1, default: A1 => B1): B1

Attributes

Inherited from:
PartialFunction
def canEqual(that: Any): Boolean

Attributes

Inherited from:
Seq
override def clone(): IndexedSeq[TimeNum]

Create a copy of the receiver object.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

Attributes

Returns

a copy of the receiver object.

Note

not specified by SLS as a member of AnyRef

Definition Classes
SeqOps -> Cloneable -> Object
Inherited from:
SeqOps
def collect[B](pf: PartialFunction[TimeNum, B]): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[TimeNum, B]): Option[B]

Attributes

Inherited from:
IterableOnceOps
def combinations(n: Int): Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, TimeNum]

Attributes

Inherited from:
PartialFunction
def compose[A](g: A => Int): A => TimeNum

Attributes

Inherited from:
Function1
final override def concat[B >: TimeNum](suffix: IterableOnce[B]): IndexedSeq[B]

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def contains[A1 >: TimeNum](elem: A1): Boolean

Attributes

Inherited from:
SeqOps
def containsSlice[B >: TimeNum](that: Seq[B]): Boolean

Attributes

Inherited from:
SeqOps
def copyToArray[B >: TimeNum](xs: Array[B], start: Int, len: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: TimeNum](xs: Array[B], start: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: TimeNum](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (TimeNum, B) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (TimeNum, B) => Boolean): Boolean

Attributes

Inherited from:
SeqOps
def count(p: TimeNum => Boolean): Int

Attributes

Inherited from:
IterableOnceOps
def diff[B >: TimeNum](that: Seq[B]): IndexedSeq[TimeNum]

Attributes

Inherited from:
SeqOps
def distinctBy[B](f: TimeNum => B): IndexedSeq[TimeNum]

Attributes

Inherited from:
SeqOps
override def drop(n: Int): IndexedSeq[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def dropRight(n: Int): IndexedSeq[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def dropWhile(p: TimeNum => Boolean): IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[Int, TimeNum]

Attributes

Inherited from:
PartialFunction
override def empty: IndexedSeq[TimeNum]

Attributes

Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from:
IterableFactoryDefaults
def endsWith[B >: TimeNum](that: Iterable[B]): Boolean

Attributes

Inherited from:
SeqOps
override def equals(o: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Seq -> Equals -> Any
Inherited from:
Seq
def exists(p: TimeNum => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def find(p: TimeNum => Boolean): Option[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def findLast(p: TimeNum => Boolean): Option[TimeNum]

Attributes

Inherited from:
SeqOps
def flatMap[B](f: TimeNum => IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
def flatten[B](implicit asIterable: TimeNum => IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
def fold[A1 >: TimeNum](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, TimeNum) => B): B

Attributes

Inherited from:
IterableOnceOps
override def foldRight[B](z: B)(op: (TimeNum, B) => B): B

Attributes

Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def forall(p: TimeNum => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[TimeNum]): IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableFactoryDefaults
def groupBy[K](f: TimeNum => K): Map[K, IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: TimeNum => K)(f: TimeNum => B): Map[K, IndexedSeq[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: TimeNum => K)(f: TimeNum => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
override def hashCode(): Int

Calculates a hash code value for the object.

Calculates a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns

the hash code value for this object.

Definition Classes
Seq -> Any
Inherited from:
Seq
override def head: TimeNum

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
override def headOption: Option[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def indexOf[B >: TimeNum](elem: B): Int

Attributes

Inherited from:
SeqOps
def indexOf[B >: TimeNum](elem: B, from: Int): Int

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: TimeNum](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: TimeNum](that: Seq[B], from: Int): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: TimeNum => Boolean): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: TimeNum => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
def indices: Range

Attributes

Inherited from:
SeqOps
def init: IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableOps
def inits: Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
def intersect[B >: TimeNum](that: Seq[B]): IndexedSeq[TimeNum]

Attributes

Inherited from:
SeqOps
def isDefinedAt(idx: Int): Boolean

Attributes

Inherited from:
SeqOps
override def isEmpty: Boolean

Attributes

Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
override def iterableFactory: SeqFactory[IndexedSeq]

Attributes

Definition Classes
IndexedSeq -> IndexedSeq -> Seq -> Seq -> Iterable -> Iterable -> IterableOps
Inherited from:
IndexedSeq
def iterator: Iterator[TimeNum]

Attributes

Inherited from:
IndexedSeqOps
override def knownSize: Int

Attributes

Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
override def last: TimeNum

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def lastIndexOf[B >: TimeNum](elem: B, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: TimeNum](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: TimeNum](that: Seq[B], end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: TimeNum => Boolean): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: TimeNum => Boolean, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastOption: Option[TimeNum]

Attributes

Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[TimeNum, B, Iterable.this.type]

Attributes

Inherited from:
Iterable
final override def lengthCompare(that: Iterable[_]): Int

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final override def lengthCompare(len: Int): Int

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final def lengthIs: SizeCompareOps

Attributes

Inherited from:
SeqOps
def lift: Int => Option[TimeNum]

Attributes

Inherited from:
PartialFunction
override def map[B](f: TimeNum => B): IndexedSeq[B]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def mapInPlace(f: TimeNum => TimeNum): IndexedSeqOps.this.type

Attributes

Inherited from:
IndexedSeqOps
def max[B >: TimeNum](implicit ord: Ordering[B]): TimeNum

Attributes

Inherited from:
IterableOnceOps
def maxBy[B](f: TimeNum => B)(implicit ord: Ordering[B]): TimeNum

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: TimeNum => B)(implicit ord: Ordering[B]): Option[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: TimeNum](implicit ord: Ordering[B]): Option[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def min[B >: TimeNum](implicit ord: Ordering[B]): TimeNum

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: TimeNum => B)(implicit ord: Ordering[B]): TimeNum

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: TimeNum => B)(implicit ord: Ordering[B]): Option[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: TimeNum](implicit ord: Ordering[B]): Option[TimeNum]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[TimeNum, IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: TimeNum](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Attributes

Inherited from:
PartialFunction
def padTo[B >: TimeNum](len: Int, elem: B): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def partition(p: TimeNum => Boolean): (IndexedSeq[TimeNum], IndexedSeq[TimeNum])

Attributes

Inherited from:
IterableOps
def partitionMap[A1, A2](f: TimeNum => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])

Attributes

Inherited from:
IterableOps
def patch[B >: TimeNum](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def permutations: Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
SeqOps
override def prepended[B >: TimeNum](elem: B): IndexedSeq[B]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def prependedAll[B >: TimeNum](prefix: IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def product[B >: TimeNum](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def reduce[B >: TimeNum](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: TimeNum](op: (B, TimeNum) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: TimeNum](op: (B, TimeNum) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: TimeNum](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: TimeNum](op: (TimeNum, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: TimeNum](op: (TimeNum, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
override def reverseIterator: Iterator[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override protected def reversed: Iterable[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def runWith[U](action: TimeNum => U): Int => Boolean

Attributes

Inherited from:
PartialFunction
def sameElements[B >: TimeNum](that: IterableOnce[B]): Boolean

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$concat[B >: TimeNum](suffix: IterableOnce[B]): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(otherSize: Int): Int

Attributes

Inherited from:
SeqOps
def scala$collection$mutable$Cloneable$$super$clone(): Object

Attributes

Inherited from:
Cloneable
def scan[B >: TimeNum](z: B)(op: (B, B) => B): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, TimeNum) => B): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
def scanRight[B](z: B)(op: (TimeNum, B) => B): IndexedSeq[B]

Attributes

Inherited from:
IterableOps
override def search[B >: TimeNum](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def search[B >: TimeNum](elem: B)(implicit ord: Ordering[B]): SearchResult

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def segmentLength(p: TimeNum => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
final def segmentLength(p: TimeNum => Boolean): Int

Attributes

Inherited from:
SeqOps
final override def size: Int

Attributes

Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
override def slice(from: Int, until: Int): IndexedSeq[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def sliding(size: Int, step: Int): Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
def sortBy[B](f: TimeNum => B)(implicit ord: Ordering[B]): IndexedSeq[TimeNum]

Attributes

Inherited from:
SeqOps
def sortInPlace[B >: TimeNum]()(implicit ord: Ordering[B]): IndexedSeqOps.this.type

Attributes

Inherited from:
IndexedSeqOps
def sortInPlaceBy[B](f: TimeNum => B)(implicit ord: Ordering[B]): IndexedSeqOps.this.type

Attributes

Inherited from:
IndexedSeqOps
def sortInPlaceWith(lt: (TimeNum, TimeNum) => Boolean): IndexedSeqOps.this.type

Attributes

Inherited from:
IndexedSeqOps
def sorted[B >: TimeNum](implicit ord: Ordering[B]): IndexedSeq[TimeNum]

Attributes

Inherited from:
SeqOps
def span(p: TimeNum => Boolean): (IndexedSeq[TimeNum], IndexedSeq[TimeNum])

Attributes

Inherited from:
IterableOps
override def splitAt(n: Int): (IndexedSeq[TimeNum], IndexedSeq[TimeNum])

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def startsWith[B >: TimeNum](that: IterableOnce[B], offset: Int): Boolean

Attributes

Inherited from:
SeqOps
override def stepper[S <: Stepper[_]](implicit shape: StepperShape[TimeNum, S]): S & EfficientSplit

Attributes

Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
def sum[B >: TimeNum](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableOps
def tails: Iterator[IndexedSeq[TimeNum]]

Attributes

Inherited from:
IterableOps
override def take(n: Int): IndexedSeq[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def takeRight(n: Int): IndexedSeq[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def takeWhile(p: TimeNum => Boolean): IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: TimeNum => U): IndexedSeq[TimeNum]

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[TimeNum, C1]): C1

Attributes

Inherited from:
IterableOnceOps
def toArray[B >: TimeNum : ClassTag]: Array[B]

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: TimeNum]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def toList: List[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: TimeNum <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
def toSeq: Seq[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def toSet[B >: TimeNum]: Set[B]

Attributes

Inherited from:
IterableOnceOps
def toVector: Vector[TimeNum]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: TimeNum => Iterable[B]): IndexedSeq[IndexedSeq[B]]

Attributes

Inherited from:
IterableOps
def unapply(a: Int): Option[TimeNum]

Attributes

Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: TimeNum => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

Attributes

Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: TimeNum => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

Attributes

Inherited from:
IterableOps
def updated[B >: TimeNum](index: Int, elem: B): IndexedSeq[B]

Attributes

Inherited from:
SeqOps
override def view: IndexedSeqView[TimeNum]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def withFilter(p: TimeNum => Boolean): WithFilter[TimeNum, IndexedSeq]

Attributes

Inherited from:
IterableOps
def zip[B](that: IterableOnce[B]): IndexedSeq[(TimeNum, B)]

Attributes

Inherited from:
IterableOps
def zipAll[A1 >: TimeNum, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]

Attributes

Inherited from:
IterableOps
def zipWithIndex: IndexedSeq[(TimeNum, Int)]

Attributes

Inherited from:
IterableOps

Deprecated and Inherited methods

final def /:[B](z: B)(op: (B, TimeNum) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (TimeNum, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, TimeNum) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[IndexedSeq]

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: TimeNum](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def hasDefiniteSize: Boolean

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def prefixLength(p: TimeNum => Boolean): Int

Attributes

Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
final def repr: IndexedSeq[TimeNum]

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def reverseMap[B](f: TimeNum => B): IndexedSeq[B]

Attributes

Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[TimeNum]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[TimeNum]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[TimeNum]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
final def transform(f: TimeNum => TimeNum): SeqOps.this.type

Attributes

Deprecated
[Since version 2.13.0] Use `mapInPlace` on an `IndexedSeq` instead
Inherited from:
SeqOps
final def union[B >: TimeNum](that: Seq[B]): IndexedSeq[B]

Attributes

Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
override def view(from: Int, until: Int): IndexedSeqView[TimeNum]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps

Concrete fields

val dim: Int
Generated with