class DenseVector[V] extends StorageVector[V] with VectorLike[V, DenseVector[V]] with Serializable
A DenseVector is the "obvious" implementation of a Vector, with one twist. The underlying data may have more data than the Vector, represented using an offset into the array (for the 0th element), and a stride that is how far elements are apart from one another.
The i'th element is at offset + i * stride
- Annotations
- @SerialVersionUID()
- Alphabetic
- By Inheritance
- DenseVector
- Serializable
- Serializable
- StorageVector
- Storage
- Vector
- VectorLike
- Tensor
- TensorLike
- NumericOps
- ImmutableNumericOps
- QuasiTensor
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new DenseVector(length: Int)(implicit man: ClassTag[V])
- new DenseVector(data: Array[V], offset: Int)
- new DenseVector(data: Array[V])
-
new
DenseVector(data: Array[V], offset: Int, stride: Int, length: Int)
- data
data array
- offset
index of the 0'th element
- stride
separation between elements
- length
number of elements
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
%[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That
Alias for :%(b) when b is a scalar.
Alias for :%(b) when b is a scalar.
- Definition Classes
- ImmutableNumericOps
-
final
def
%:%[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpMod.Impl2[TT, B, That]): That
Element-wise modulo of this and b.
Element-wise modulo of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
%=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): DenseVector[V]
Alias for :%=(b) when b is a scalar.
Alias for :%=(b) when b is a scalar.
- Definition Classes
- NumericOps
-
final
def
&[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That
Alias for &:&(b) for all b.
Alias for &:&(b) for all b.
- Definition Classes
- ImmutableNumericOps
-
final
def
&:&[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpAnd.Impl2[TT, B, That]): That
Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.
Element-wise logical "and" operator -- returns true if corresponding elements are non-zero.
- Definition Classes
- ImmutableNumericOps
-
final
def
&=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise and of this and b.
Mutates this by element-wise and of this and b.
- Definition Classes
- NumericOps
-
final
def
*[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpMulMatrix.Impl2[TT, B, That]): That
Matrix multiplication
Matrix multiplication
- Definition Classes
- ImmutableNumericOps
-
final
def
*:*[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpMulScalar.Impl2[TT, B, That]): That
Element-wise product of this and b.
Element-wise product of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
*=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): DenseVector[V]
Alias for :*=(b) when b is a scalar.
Alias for :*=(b) when b is a scalar.
- Definition Classes
- NumericOps
-
final
def
+[TT >: DenseVector[V], B, C, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That
Alias for :+(b) for all b.
Alias for :+(b) for all b.
- Definition Classes
- NumericOps
-
final
def
+:+[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpAdd.Impl2[TT, B, That]): That
Element-wise sum of this and b.
Element-wise sum of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
+=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): DenseVector[V]
Alias for :+=(b) for all b.
Alias for :+=(b) for all b.
- Definition Classes
- NumericOps
-
final
def
-[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That
Alias for -:-(b) for all b.
Alias for -:-(b) for all b.
- Definition Classes
- ImmutableNumericOps
-
final
def
-:-[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpSub.Impl2[TT, B, That]): That
Element-wise difference of this and b.
Element-wise difference of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
-=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): DenseVector[V]
Alias for :-=(b) for all b.
Alias for :-=(b) for all b.
- Definition Classes
- NumericOps
-
final
def
/[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That
Alias for :/(b) when b is a scalar.
Alias for :/(b) when b is a scalar.
- Definition Classes
- ImmutableNumericOps
-
final
def
/:/[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpDiv.Impl2[TT, B, That]): That
Element-wise quotient of this and b.
Element-wise quotient of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
/=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): DenseVector[V]
Alias for :/=(b) when b is a scalar.
Alias for :/=(b) when b is a scalar.
- Definition Classes
- NumericOps
-
final
def
:!=[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpNe.Impl2[TT, B, That]): That
Element-wise inequality comparator of this and b.
Element-wise inequality comparator of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
:%=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpMod.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise modulo of b into this.
Mutates this by element-wise modulo of b into this.
- Definition Classes
- NumericOps
-
final
def
:&=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpAnd.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise and of this and b.
Mutates this by element-wise and of this and b.
- Definition Classes
- NumericOps
-
final
def
:*=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpMulScalar.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise multiplication of b into this.
Mutates this by element-wise multiplication of b into this.
- Definition Classes
- NumericOps
-
final
def
:+=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpAdd.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise addition of b into this.
Mutates this by element-wise addition of b into this.
- Definition Classes
- NumericOps
-
final
def
:-=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpSub.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise subtraction of b from this
Mutates this by element-wise subtraction of b from this
- Definition Classes
- NumericOps
-
final
def
:/=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpDiv.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise division of b into this
Mutates this by element-wise division of b into this
- Definition Classes
- NumericOps
-
final
def
:=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpSet.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise assignment of b into this.
Mutates this by element-wise assignment of b into this.
- Definition Classes
- NumericOps
-
final
def
:==[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpEq.Impl2[TT, B, That]): That
Element-wise equality comparator of this and b.
Element-wise equality comparator of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
:^=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpPow.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise exponentiation of this by b.
Mutates this by element-wise exponentiation of this by b.
- Definition Classes
- NumericOps
-
final
def
:^^=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise xor of this and b.
Mutates this by element-wise xor of this and b.
- Definition Classes
- NumericOps
-
final
def
:|=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise or of this and b.
Mutates this by element-wise or of this and b.
- Definition Classes
- NumericOps
-
final
def
<:<[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpLT.Impl2[TT, B, That]): That
Element-wise less=than comparator of this and b.
Element-wise less=than comparator of this and b.
- Definition Classes
- NumericOps
-
final
def
<:=[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpLTE.Impl2[TT, B, That]): That
Element-wise less-than-or-equal-to comparator of this and b.
Element-wise less-than-or-equal-to comparator of this and b.
- Definition Classes
- NumericOps
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
>:=[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpGTE.Impl2[TT, B, That]): That
Element-wise greater-than-or-equal-to comparator of this and b.
Element-wise greater-than-or-equal-to comparator of this and b.
- Definition Classes
- NumericOps
-
final
def
>:>[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpGT.Impl2[TT, B, That]): That
Element-wise greater-than comparator of this and b.
Element-wise greater-than comparator of this and b.
- Definition Classes
- NumericOps
-
def
\[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpSolveMatrixBy.Impl2[TT, B, That]): That
Shaped solve of this by b.
Shaped solve of this by b.
- Definition Classes
- ImmutableNumericOps
-
final
def
^:^[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpPow.Impl2[TT, B, That]): That
Element-wise exponentiation of this and b.
Element-wise exponentiation of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
^^[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That
Alias for :^^(b) for all b.
Alias for :^^(b) for all b.
- Definition Classes
- ImmutableNumericOps
-
final
def
^^:^^[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpXor.Impl2[TT, B, That]): That
Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.
Element-wise logical "xor" operator -- returns true if only one of the corresponding elements is non-zero.
- Definition Classes
- ImmutableNumericOps
-
final
def
^^=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpXor.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise xor of this and b.
Mutates this by element-wise xor of this and b.
- Definition Classes
- NumericOps
-
def
active: TensorActive[Int, V, DenseVector[V]]
- Definition Classes
- TensorLike
-
def
activeIterator: Iterator[(Int, V)]
- Definition Classes
- DenseVector → QuasiTensor
-
def
activeKeysIterator: Iterator[Int]
- Definition Classes
- DenseVector → QuasiTensor
-
def
activeSize: Int
How many elements are stored in terms of space.
How many elements are stored in terms of space. In HashVectors, activeSize is the number of non-zero elements, while iterableSize is the number of buckets currently allocated. (activeSize <= iterableSize in general, activeSize == iterableSize for everything except hashing implementations.)
- Definition Classes
- DenseVector → Storage → TensorLike
-
def
activeValuesIterator: Iterator[V]
- Definition Classes
- DenseVector → QuasiTensor
-
def
allVisitableIndicesActive: Boolean
Always returns true.
Always returns true.
- Definition Classes
- DenseVector → Storage
-
def
apply(i: Int): V
- Definition Classes
- DenseVector → TensorLike → QuasiTensor
-
def
apply[Slice1, Slice2, Result](slice1: Slice1, slice2: Slice2)(implicit canSlice: CanSlice2[DenseVector[V], Slice1, Slice2, Result]): Result
Method for slicing that is tuned for Matrices.
Method for slicing that is tuned for Matrices.
- Definition Classes
- TensorLike
-
def
apply[Result](a: Int, b: Int, c: Int, slice: Int*)(implicit canSlice: CanSlice[DenseVector[V], Seq[Int], Result]): Result
Slice a sequence of elements.
Slice a sequence of elements. Must be at least 2.
- Definition Classes
- TensorLike
-
def
apply[Slice, Result](slice: Slice)(implicit canSlice: CanSlice[DenseVector[V], Slice, Result]): Result
method for slicing a tensor.
method for slicing a tensor. For instance, DenseVectors support efficient slicing by a Range object.
- Definition Classes
- TensorLike
-
def
asDenseMatrix: DenseMatrix[V]
Creates a view of this DenseVector that is represented as a 1 by length DenseMatrix
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
def
copy: DenseVector[V]
Returns a copy of this DenseVector.
Returns a copy of this DenseVector. stride will always be 1, offset will always be 0.
- Definition Classes
- DenseVector → Vector
-
val
data: Array[V]
Returns the actual flat array of elements used.
Returns the actual flat array of elements used.
- Definition Classes
- DenseVector → Storage
-
final
def
dot[TT >: DenseVector[V], B, BB >: B, That](b: B)(implicit op: operators.OpMulInner.Impl2[TT, BB, That]): That
Inner product of this and b.
Inner product of this and b.
- Definition Classes
- ImmutableNumericOps
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(p1: Any): Boolean
- Definition Classes
- DenseVector → Vector → AnyRef → Any
-
def
exists(f: (V) ⇒ Boolean): Boolean
- Definition Classes
- Vector
-
def
findAll(f: (V) ⇒ Boolean): IndexedSeq[Int]
Returns all indices k whose value satisfies a predicate.
Returns all indices k whose value satisfies a predicate.
- Definition Classes
- QuasiTensor
-
def
fold[E1 >: V](z: E1)(op: (E1, E1) ⇒ E1): E1
See scala.collection.mutable.ArrayOps.fold.
See scala.collection.mutable.ArrayOps.fold.
- Definition Classes
- Vector
-
def
foldLeft[B](z: B)(op: (B, V) ⇒ B): B
See scala.collection.mutable.ArrayOps.foldLeft.
See scala.collection.mutable.ArrayOps.foldLeft.
- Definition Classes
- Vector
-
def
foldRight[B](z: B)(op: (V, B) ⇒ B): B
See scala.collection.mutable.ArrayOps.foldRight.
See scala.collection.mutable.ArrayOps.foldRight.
- Definition Classes
- Vector
-
def
forall(f: (V) ⇒ Boolean): Boolean
Returns true if and only if the given predicate is true for all elements.
Returns true if and only if the given predicate is true for all elements.
- Definition Classes
- Vector → TensorLike
-
def
forall(fn: (Int, V) ⇒ Boolean): Boolean
Returns true if and only if the given predicate is true for all elements.
Returns true if and only if the given predicate is true for all elements.
- Definition Classes
- TensorLike
-
def
foreach[U](fn: (V) ⇒ U): Unit
Faster foreach
Faster foreach
- Definition Classes
- DenseVector → VectorLike
-
def
foreachKey[U](fn: (Int) ⇒ U): Unit
Applies the given function to each key in the tensor.
Applies the given function to each key in the tensor.
- Definition Classes
- TensorLike
-
def
foreachPair[U](fn: (Int, V) ⇒ U): Unit
Applies the given function to each key and its corresponding value.
Applies the given function to each key and its corresponding value.
- Definition Classes
- TensorLike
-
def
foreachValue[U](fn: (V) ⇒ U): Unit
Applies the given function to each value in the map (one for each element of the domain, including zeros).
Applies the given function to each value in the map (one for each element of the domain, including zeros).
- Definition Classes
- TensorLike
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- DenseVector → Vector → QuasiTensor → AnyRef → Any
-
def
indexAt(i: Int): Int
Gives the logical index from the physical index.
-
def
isActive(i: Int): Boolean
Always returns true.
Always returns true.
Some storages (namely HashStorage) won't have active indices packed. This lets you know if the bin is actively in use.
- i
index into index/data arrays
- Definition Classes
- DenseVector → Storage
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
iterableSize: Int
How many elements must be iterated over using valueAt/indexAt.
How many elements must be iterated over using valueAt/indexAt. In HashVectors, activeSize is the number of non-zero elements, while iterableSize is the number of buckets currently allocated. (activeSize <= iterableSize in general, activeSize == iterableSize for everything except hashing implementations.)
- Definition Classes
- Storage
-
def
iterator: Iterator[(Int, V)]
- Definition Classes
- Vector → QuasiTensor
-
def
keySet: Set[Int]
- returns
the set of keys in this vector (0 until length)
- Definition Classes
- Vector → QuasiTensor
-
def
keys: TensorKeys[Int, V, DenseVector[V]]
- Definition Classes
- TensorLike
-
def
keysIterator: Iterator[Int]
- Definition Classes
- Vector → QuasiTensor
-
val
length: Int
- Definition Classes
- DenseVector → Vector
-
def
map[V2, That](fn: (V) ⇒ V2)(implicit canMapValues: CanMapValues[DenseVector[V], V, V2, That]): That
- Definition Classes
- VectorLike
-
def
mapActivePairs[TT >: DenseVector[V], O, That](f: (Int, V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, Int, V, O, That]): That
Maps all active key-value pairs values.
Maps all active key-value pairs values.
- Definition Classes
- TensorLike
-
def
mapActiveValues[TT >: DenseVector[V], O, That](f: (V) ⇒ O)(implicit bf: CanMapActiveValues[TT, V, O, That]): That
Maps all non-zero values.
Maps all non-zero values.
- Definition Classes
- TensorLike
-
def
mapPairs[TT >: DenseVector[V], O, That](f: (Int, V) ⇒ O)(implicit bf: CanMapKeyValuePairs[TT, Int, V, O, That]): That
Creates a new map containing a transformed copy of this map.
Creates a new map containing a transformed copy of this map.
- Definition Classes
- TensorLike
-
def
mapValues[TT >: DenseVector[V], O, That](f: (V) ⇒ O)(implicit bf: CanMapValues[TT, V, O, That]): That
Creates a new map containing a transformed copy of this map.
Creates a new map containing a transformed copy of this map.
- Definition Classes
- TensorLike
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val offset: Int
-
def
padTo(len: Int, elem: V)(implicit cm: ClassTag[V]): Vector[V]
See scala.collection.mutable.ArrayOps.padTo.
See scala.collection.mutable.ArrayOps.padTo.
- Definition Classes
- Vector
-
def
pairs: TensorPairs[Int, V, DenseVector[V]]
- Definition Classes
- TensorLike
-
def
reduce[E1 >: V](op: (E1, E1) ⇒ E1): E1
See scala.collection.mutable.ArrayOps.reduce.
See scala.collection.mutable.ArrayOps.reduce.
- Definition Classes
- Vector
-
def
reduceLeft[B >: V](op: (B, V) ⇒ B): B
See scala.collection.mutable.ArrayOps.reduceLeft.
See scala.collection.mutable.ArrayOps.reduceLeft.
- Definition Classes
- Vector
-
def
reduceRight[B >: V](op: (V, B) ⇒ B): B
See scala.collection.mutable.ArrayOps.reduceRight.
See scala.collection.mutable.ArrayOps.reduceRight.
- Definition Classes
- Vector
-
def
repr: DenseVector[V]
- Definition Classes
- DenseVector → ImmutableNumericOps
-
def
scan[E1 >: V](z: E1)(op: (E1, E1) ⇒ E1)(implicit cm: ClassTag[V], cm1: ClassTag[E1]): Vector[E1]
See scala.collection.mutable.ArrayOps.scan.
See scala.collection.mutable.ArrayOps.scan.
- Definition Classes
- Vector
-
def
scanLeft[B](z: B)(op: (B, V) ⇒ B)(implicit cm1: ClassTag[B]): Vector[B]
See scala.collection.mutable.ArrayOps.scanLeft.
See scala.collection.mutable.ArrayOps.scanLeft.
- Definition Classes
- Vector
-
def
scanRight[B](z: B)(op: (V, B) ⇒ B)(implicit cm1: ClassTag[B]): Vector[B]
See scala.collection.mutable.ArrayOps.scanRight.
See scala.collection.mutable.ArrayOps.scanRight.
- Definition Classes
- Vector
-
def
size: Int
- Definition Classes
- Vector → TensorLike
-
def
slice(start: Int, end: Int, stride: Int = 1): DenseVector[V]
Slices the DenseVector, in the range [start,end] with a stride stride.
- val stride: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
t[TT >: DenseVector[V], That, Slice1, Result](a: Slice1)(implicit op: CanTranspose[TT, That], canSlice: CanSlice[That, Slice1, Result]): Result
A transposed view of this object, followed by a slice.
A transposed view of this object, followed by a slice. Sadly frequently necessary.
- Definition Classes
- ImmutableNumericOps
-
final
def
t[TT >: DenseVector[V], That, Slice1, Slice2, Result](a: Slice1, b: Slice2)(implicit op: CanTranspose[TT, That], canSlice: CanSlice2[That, Slice1, Slice2, Result]): Result
A transposed view of this object, followed by a slice.
A transposed view of this object, followed by a slice. Sadly frequently necessary.
- Definition Classes
- ImmutableNumericOps
-
final
def
t[TT >: DenseVector[V], That](implicit op: CanTranspose[TT, That]): That
A transposed view of this object.
A transposed view of this object.
- Definition Classes
- ImmutableNumericOps
-
def
toArray(implicit cm: ClassTag[V]): Array[V]
Returns copy of this breeze.linalg.Vector as a scala.Array
Returns copy of this breeze.linalg.Vector as a scala.Array
- Definition Classes
- DenseVector → Vector
-
def
toDenseMatrix: DenseMatrix[V]
Creates a copy of this DenseVector that is represented as a 1 by length DenseMatrix
-
def
toDenseVector(implicit cm: ClassTag[V]): DenseVector[V]
- Definition Classes
- Vector
-
def
toScalaVector()(implicit cm: ClassTag[V]): scala.Vector[V]
Returns copy of this breeze.linalg.DenseVector as a scala.Vector
-
def
toString(): String
- Definition Classes
- DenseVector → AnyRef → Any
-
def
toVector(implicit cm: ClassTag[V]): Vector[V]
Returns copy of this breeze.linalg.Vector as a scala.Vector
Returns copy of this breeze.linalg.Vector as a scala.Vector
- Definition Classes
- Vector
-
final
def
unary_![TT >: DenseVector[V], That](implicit op: operators.OpNot.Impl[TT, That]): That
- Definition Classes
- ImmutableNumericOps
-
final
def
unary_-[TT >: DenseVector[V], That](implicit op: operators.OpNeg.Impl[TT, That]): That
- Definition Classes
- ImmutableNumericOps
-
def
update(i: Int, v: V): Unit
- Definition Classes
- DenseVector → TensorLike → QuasiTensor
-
def
valueAt(i: Int): V
same as apply(i).
same as apply(i). Gives the value at the underlying offset.
- i
index into the data array
- returns
apply(i)
- Definition Classes
- DenseVector → Storage
-
def
values: TensorValues[Int, V, DenseVector[V]]
- Definition Classes
- TensorLike
-
def
valuesIterator: Iterator[V]
- Definition Classes
- Vector → QuasiTensor
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
writeReplace(): AnyRef
- Attributes
- protected
- Annotations
- @throws( classOf[ObjectStreamException] )
-
final
def
|[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That
Alias for :||(b) for all b.
Alias for :||(b) for all b.
- Definition Classes
- ImmutableNumericOps
-
final
def
|:|[TT >: DenseVector[V], B, That](b: B)(implicit op: operators.OpOr.Impl2[TT, B, That]): That
Element-wise logical "or" operator -- returns true if either element is non-zero.
Element-wise logical "or" operator -- returns true if either element is non-zero.
- Definition Classes
- ImmutableNumericOps
-
final
def
|=[TT >: DenseVector[V], B](b: B)(implicit op: operators.OpOr.InPlaceImpl2[TT, B]): DenseVector[V]
Mutates this by element-wise or of this and b.
Mutates this by element-wise or of this and b.
- Definition Classes
- NumericOps
Deprecated Value Members
-
def
all(implicit semi: Semiring[V]): Boolean
Returns true if all elements are non-zero
Returns true if all elements are non-zero
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use breeze.linalg.all instead
-
def
any(implicit semi: Semiring[V]): Boolean
Returns true if some element is non-zero
Returns true if some element is non-zero
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use breeze.linalg.any instead
-
def
argmax(implicit ord: Ordering[V]): Int
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use argmax(t) instead of t.argmax
-
def
argmin(implicit ord: Ordering[V]): Int
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use argmin(t) instead of t.argmin
-
def
argsort(implicit ord: Ordering[V]): IndexedSeq[Int]
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use argsort(t) instead of t.argsort
-
def
argtopk(k: Int)(implicit ordering: Ordering[V]): IndexedSeq[Int]
Returns the k indices with maximum value.
Returns the k indices with maximum value. (NOT absolute value.)
- k
how many to return
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use argtopk(t, k) instead of t.argtopk(k)
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
- Deprecated
(Since version ) see corresponding Javadoc for more information.
-
def
forallValues(fn: (V) ⇒ Boolean): Boolean
Returns true if and only if the given predicate is true for all elements.
Returns true if and only if the given predicate is true for all elements.
- Definition Classes
- TensorLike
- Annotations
- @deprecated
- Deprecated
(Since version 0.8) Please use 'forall' with the same arguments, which is more in accordance with scala.collections syntax
-
def
max(implicit ord: Ordering[V]): V
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use max(t) instead of t.max
-
def
min(implicit ord: Ordering[V]): V
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use min(t) instead of t.min
-
def
sum(implicit num: Numeric[V]): V
- Definition Classes
- QuasiTensor
- Annotations
- @deprecated
- Deprecated
(Since version 0.6) Use sum(t) instead of t.sum
-
def
unsafeUpdate(i: Int, v: V): Unit
- Annotations
- @deprecated
- Deprecated
(Since version 0.12-SNAPSHOT) This isn't actually any faster any more
-
def
unsafeValueAt(i: Int): V
Unsafe version of above, a way to skip the checks.
Unsafe version of above, a way to skip the checks.
- Annotations
- @deprecated
- Deprecated
(Since version 0.12-SNAPSHOT) This isn't actually any faster any more