| Package | Description |
|---|---|
| mikera.vectorz.impl |
| Modifier and Type | Class and Description |
|---|---|
class |
ASingleElementVector
Abstract base classes for sparse vectors that have a single potentially non-zero element
|
class |
ASparseIndexedVector
Base class containing common implementations for sparse indexed vectors
|
class |
AxisVector
Specialised immutable unit axis vector.
|
class |
SingleElementVector
A sparse immutable vector that has a only one element that can be non-zero.
|
class |
SparseHashedVector
Hashed sparse vector, intended for large vectors with very few randomly positioned non-zero elements.
|
class |
SparseImmutableVector
Indexed sparse immutable vector
Efficient for sparse vectors.
|
class |
SparseIndexedVector
Indexed sparse vector.
|
class |
ZeroVector
Specialised immutable vector containing nothing but zeros.
|
| Modifier and Type | Method and Description |
|---|---|
ASparseVector |
SparseIndexedVector.roundToZero(double precision) |
ASparseVector |
ASparseVector.roundToZero(double precision)
Returns a vector after replacing all elements with absolute values less-than-or-equal to precision with zeros.
|
ASparseVector |
ASparseVector.sparse() |
| Modifier and Type | Method and Description |
|---|---|
void |
ZeroVector.add(ASparseVector v) |
void |
SparseIndexedVector.add(ASparseVector v) |
void |
SparseImmutableVector.add(ASparseVector v) |
void |
SparseHashedVector.add(ASparseVector v) |
void |
SingleElementVector.add(ASparseVector v) |
void |
AxisVector.add(ASparseVector v) |
abstract void |
ASparseVector.add(ASparseVector v) |
void |
SparseIndexedVector.addMultiple(ASparseVector v,
double factor) |
static SparseIndexedVector |
SparseIndexedVector.create(ASparseVector source) |
static AVector |
SparseImmutableVector.create(ASparseVector source) |
double |
ASparseIndexedVector.dotProduct(ASparseVector v) |
boolean |
ASparseVector.equals(ASparseVector v) |
void |
SparseIndexedVector.multiply(ASparseVector v) |
void |
SparseIndexedVector.sub(ASparseVector v) |
Copyright © 2016. All rights reserved.