#include <deal.II/lac/trilinos_sparse_matrix.h>
The specialization for a mutable Accessor.
Definition at line 257 of file trilinos_sparse_matrix.h.
◆ MatrixType
◆ size_type
◆ Accessor()
Constructor. Since we use accessors only for read access, a const matrix pointer is sufficient.
◆ value()
Value of this matrix entry.
◆ row()
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::row |
( |
| ) |
const |
|
inherited |
Row number of the element represented by this object.
◆ index()
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::index |
( |
| ) |
const |
|
inherited |
Index in row of the element represented by this object.
◆ column()
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::column |
( |
| ) |
const |
|
inherited |
Column number of the element represented by this object.
◆ visit_present_row()
void TrilinosWrappers::SparseMatrixIterators::AccessorBase::visit_present_row |
( |
| ) |
|
|
protectedinherited |
Discard the old row caches (they may still be used by other accessors) and generate new ones for the row pointed to presently by this accessor.
Definition at line 142 of file trilinos_sparse_matrix.cc.
◆ Iterator
◆ Reference
◆ matrix
SparseMatrix* TrilinosWrappers::SparseMatrixIterators::AccessorBase::matrix |
|
mutableprotectedinherited |
Pointer to the matrix object. This object should be handled as a const pointer or non-const by the appropriate derived classes. In order to be able to implement both, it is not const here, so handle with care!
Definition at line 148 of file trilinos_sparse_matrix.h.
◆ a_row
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::a_row |
|
protectedinherited |
◆ a_index
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::a_index |
|
protectedinherited |
◆ colnum_cache
std::shared_ptr<std::vector<size_type> > TrilinosWrappers::SparseMatrixIterators::AccessorBase::colnum_cache |
|
protectedinherited |
Cache where we store the column indices of the present row. This is necessary, since Trilinos makes access to the elements of its matrices rather hard, and it is much more efficient to copy all column entries of a row once when we enter it than repeatedly asking Trilinos for individual ones. This also makes some sense since it is likely that we will access them sequentially anyway.
In order to make copying of iterators/accessor of acceptable performance, we keep a shared pointer to these entries so that more than one accessor can access this data if necessary.
Definition at line 179 of file trilinos_sparse_matrix.h.
◆ value_cache
std::shared_ptr<std::vector<TrilinosScalar> > TrilinosWrappers::SparseMatrixIterators::AccessorBase::value_cache |
|
protectedinherited |
The documentation for this class was generated from the following file: