|
EIGEN_STRONG_INLINE Index | rows () const |
|
EIGEN_STRONG_INLINE Index | cols () const |
|
EIGEN_STRONG_INLINE Index | innerSize () const |
|
EIGEN_STRONG_INLINE Index | outerSize () const |
|
EIGEN_STRONG_INLINE const Scalar * | valuePtr () const |
|
EIGEN_STRONG_INLINE Scalar * | valuePtr () |
|
EIGEN_STRONG_INLINE const StorageIndex * | innerIndexPtr () const |
|
EIGEN_STRONG_INLINE StorageIndex * | innerIndexPtr () |
|
const StorageIndex * | outerIndexPtr () const |
|
StorageIndex * | outerIndexPtr () |
|
const StorageIndex * | innerNonZeroPtr () const |
|
StorageIndex * | innerNonZeroPtr () |
|
Storage & | data () |
|
const Storage & | data () const |
|
Scalar | coeff (Index row, Index col) const |
|
Scalar | coeff (Index i) const |
|
Scalar & | coeffRef (Index row, Index col) |
|
Scalar & | coeffRef (Index i) |
|
void | setZero () |
|
Index | nonZeros () const |
|
void | startVec (Index outer) |
|
Scalar & | insertBackByOuterInner (Index outer, Index inner) |
|
Scalar & | insertBack (Index i) |
|
Scalar & | insertBackByOuterInnerUnordered (Index outer, Index inner) |
|
Scalar & | insertBackUnordered (Index i) |
|
Scalar & | insert (Index row, Index col) |
|
Scalar & | insert (Index i) |
|
void | reserve (Index reserveSize) |
|
void | finalize () |
|
void | prune (const Scalar &reference, const RealScalar &epsilon=NumTraits< RealScalar >::dummy_precision()) |
|
void | resize (Index rows, Index cols) |
|
void | resize (Index newSize) |
|
void | conservativeResize (Index newSize) |
|
void | resizeNonZeros (Index size) |
|
| SparseVector (Index size) |
|
| SparseVector (Index rows, Index cols) |
|
template<typename OtherDerived > |
| SparseVector (const SparseMatrixBase< OtherDerived > &other) |
|
| SparseVector (const SparseVector &other) |
|
void | swap (SparseVector &other) |
|
template<int OtherOptions> |
void | swap (SparseMatrix< Scalar, OtherOptions, StorageIndex > &other) |
|
SparseVector & | operator= (const SparseVector &other) |
|
template<typename OtherDerived > |
SparseVector & | operator= (const SparseMatrixBase< OtherDerived > &other) |
|
template<typename Lhs , typename Rhs > |
SparseVector & | operator= (const SparseSparseProduct< Lhs, Rhs > &product) |
|
| ~SparseVector () |
|
Scalar | sum () const |
|
EIGEN_DEPRECATED void | startFill (Index reserve) |
|
EIGEN_DEPRECATED Scalar & | fill (Index r, Index c) |
|
EIGEN_DEPRECATED Scalar & | fill (Index i) |
|
EIGEN_DEPRECATED Scalar & | fillrand (Index r, Index c) |
|
EIGEN_DEPRECATED Scalar & | fillrand (Index i) |
|
EIGEN_DEPRECATED void | endFill () |
|
EIGEN_DEPRECATED Storage & | _data () |
|
EIGEN_DEPRECATED const Storage & | _data () const |
|
template<typename _Scalar, int _Options, typename _StorageIndex>
class Eigen::SparseVector< _Scalar, _Options, _StorageIndex >
a sparse vector class
- Template Parameters
-
_Scalar | the scalar type, i.e. the type of the coefficients |
See http://www.netlib.org/linalg/html_templates/node91.html for details on the storage scheme.
This class can be extended with the help of the plugin mechanism described on the page TopicCustomizing_Plugins by defining the preprocessor symbol EIGEN_SPARSEVECTOR_PLUGIN
.
template<typename _Scalar , int _Options, typename _StorageIndex >
Resizes the sparse vector to newSize, while leaving old values untouched.
If the size of the vector is decreased, then the storage of the out-of bounds coefficients is kept and reserved. Call .data().squeeze() to free extra memory.
- See also
- reserve(), setZero()
template<typename _Scalar , int _Options, typename _StorageIndex >
Resizes the sparse vector to rows x cols
This method is provided for compatibility with matrices. For a column vector, cols must be equal to 1. For a row vector, rows must be equal to 1.
- See also
- resize(Index)