template<typename Derived>
class Eigen::SparseMapBase< Derived, WriteAccessors >
Common base class for writable Map and Ref instance of sparse matrix and vector.
class SparseMapBase
|
| Scalar & | coeffRef (Index row, Index col) |
| |
| StorageIndex * | innerIndexPtr () |
| |
| const StorageIndex * | innerIndexPtr () const |
| |
| StorageIndex * | innerNonZeroPtr () |
| |
| const StorageIndex * | innerNonZeroPtr () const |
| |
| StorageIndex * | outerIndexPtr () |
| |
| const StorageIndex * | outerIndexPtr () const |
| |
| Scalar * | valuePtr () |
| |
| const Scalar * | valuePtr () const |
| |
| | ~SparseMapBase () |
| |
| Scalar | coeff (Index row, Index col) const |
| |
| Index | cols () const |
| |
| const StorageIndex * | innerIndexPtr () const |
| |
| const StorageIndex * | innerNonZeroPtr () const |
| |
| Index | innerSize () const |
| |
| bool | isCompressed () const |
| |
| Index | nonZeros () const |
| |
| const StorageIndex * | outerIndexPtr () const |
| |
| Index | outerSize () const |
| |
| Index | rows () const |
| |
| const Scalar * | valuePtr () const |
| |
| | ~SparseMapBase () |
| |
| Map< Array< Scalar, Dynamic, 1 > > | coeffs () |
| |
| const Map< const Array< Scalar, Dynamic, 1 > > | coeffs () const |
| |
| StorageIndex * | innerIndexPtr () |
| |
| const StorageIndex * | innerIndexPtr () const |
| |
| StorageIndex * | innerNonZeroPtr () |
| |
| const StorageIndex * | innerNonZeroPtr () const |
| |
| bool | isCompressed () const |
| |
| Index | nonZeros () const |
| |
| StorageIndex * | outerIndexPtr () |
| |
| const StorageIndex * | outerIndexPtr () const |
| |
| Scalar * | valuePtr () |
| |
| const Scalar * | valuePtr () const |
| |
| Index | cols () const |
| |
| const internal::eval< Derived >::type | eval () const |
| |
| Index | innerSize () const |
| |
| bool | isVector () const |
| |
| template<typename OtherDerived > |
| const Product< Derived, OtherDerived, AliasFreeProduct > | operator* (const SparseMatrixBase< OtherDerived > &other) const |
| |
| Index | outerSize () const |
| |
| const SparseView< Derived > | pruned (const Scalar &reference=Scalar(0), const RealScalar &epsilon=NumTraits< Scalar >::dummy_precision()) const |
| |
| Index | rows () const |
| |
| Index | size () const |
| |
| SparseSymmetricPermutationProduct< Derived, Upper|Lower > | twistedBy (const PermutationMatrix< Dynamic, Dynamic, StorageIndex > &perm) const |
| |
| EIGEN_CONSTEXPR Index | cols () const EIGEN_NOEXCEPT |
| |
| Derived & | derived () |
| |
| const Derived & | derived () const |
| |
| EIGEN_CONSTEXPR Index | rows () const EIGEN_NOEXCEPT |
| |
| EIGEN_CONSTEXPR Index | size () const EIGEN_NOEXCEPT |
| |
template<typename Derived >
- Returns
- a non-const reference to the value of the matrix at position i, j
If the element does not exist then it is inserted via the insert(Index,Index) function which itself turns the matrix into a non compressed form if that was not the case.
This is a O(log(nnz_j)) operation (binary search) plus the cost of insert(Index,Index) function if the element does not already exist.