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

Multiply 'this' (row) vector by matrix 'm'.

Multiply 'this' vector by scalar 's'.

Multiply 'this' vector by vector 'b'.

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

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

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

Add 'this' vector and scalar 's'.

Add 'this' vector and vector 'b'.

Concatenate 'this' vector and scalar 's'.

Concatenate 'this' vector and vector' b'.

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

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

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

From 'this' vector subtract scalar 's'.

From 'this' vector subtract vector 'b'.

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

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

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

Divide 'this' vector by scalar 's'.

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

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

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

Create a vector of the form (0, ... -1, ... 0) where the -1 is at position j.

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

Get 'this' vector's entire array.

Get 'this' vector's elements within the given range (vector slicing).

Get 'this' vector's element at the 'i'-th index position.

Get 'this' vector's elements that are given in the index vector.

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

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

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

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

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

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

Determine whether 'x' is contained in 'this' vector.

Create an exact copy of 'this' vector.

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

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

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

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

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)

Vector dimension

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

Compute the dot product (or inner product) of vector 'b' and vector 'c'. It takes the dot product on a subrange from 'i' (inclusive) to 'j' exclusive.

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'. This is the parallel version.

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

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

Format String used for printing vector values (change using 'setFormat') Ex: "%d,\t", "%.6g,\t" or "%12.6g,\t"

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

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

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

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

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

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

Show the flaw by printing the error message.

Iterate over 'this' vector element by element.

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

Return the index of the first occurrence of element 'x' in 'this' vector, or -1 if not found.

Find and return index of first element satisfying predicate 'p', or -1 if not found.

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

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

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

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

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

Take the maximum of 'this' vector with vector 'b' (element-by element).

Find the maximum element in 'this' vector.

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

Take the minimum of 'this' vector with vector 'b' (element-by element).

Find the minimum element in 'this' vector.

Number of elements in the vector as a Double

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

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

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

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

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

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

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

Create a vector of the form (0, ... 1, ... 0) where the 1 is at position j.

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

Compute the population variance of the elements of 'this' vector. This is also the (biased) MLE estimator for sample variance.

Range for the storage array

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

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

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

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

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

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.

Select a subset of elements of 'this' vector corresponding to a 'basis'.

Select a subset of elements of 'this' vector corresponding to a 'basis'.

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

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

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

Set each value in 'this' vector to 'x'.

Set the format to the 'newFormat' (e.g., "%.6g,\t" or "%12.6g,\t").

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

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

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

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

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

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

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

Split 'this' vector into 'k' arrays of equal sizes (perhaps except for the last one).

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

Sum the elements of 'this' vector.

Sum the elements of 'this' vector skipping the 'i'-th element (Not Equal 'i').

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

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

Convert 'this' VectoD into a dense VectorD.

Convert 'this' VectorD into a VectorD.

Convert 'this' VectorD into a VectorI.

Convert 'this' VectorD into a VectorL.

Convert 'this' vector to a String.

Compare 'this' vector with vector 'b'.

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

Set 'this' vector's elements over the given range (vector slicing).

Set 'this' vector's elements over the given range (vector slicing).

Set 'this' vector's element at the 'i'-th index position.

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

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

Return the vector containing each element of 'this' vector raised to the s-th power.

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

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.

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

Compare 'this' vector with that vector 'b' for less than or equal to.

Compare 'this' vector with that vector 'b' for greater than or equal to.