![]() |
Reference documentation for deal.II version 9.6.0
|
#include <deal.II/lac/trilinos_sparse_matrix.h>
Public Types | |
using | size_type = ::types::global_dof_index |
Public Member Functions | |
AccessorBase (SparseMatrix *matrix, const size_type row, const size_type index) | |
size_type | row () const |
size_type | index () const |
size_type | column () const |
Protected Member Functions | |
void | visit_present_row () |
Protected Attributes | |
SparseMatrix * | matrix |
size_type | a_row |
size_type | a_index |
std::shared_ptr< std::vector< size_type > > | colnum_cache |
std::shared_ptr< std::vector< TrilinosScalar > > | value_cache |
Handling of indices for both constant and non constant Accessor objects
For a regular SparseMatrix, we would use an accessor for the sparsity pattern. For Trilinos matrices, this does not seem so simple, therefore, we write a little base class here.
Definition at line 107 of file trilinos_sparse_matrix.h.
Declare the type for container size.
Definition at line 113 of file trilinos_sparse_matrix.h.
TrilinosWrappers::SparseMatrixIterators::AccessorBase::AccessorBase | ( | SparseMatrix * | matrix, |
const size_type | row, | ||
const size_type | index ) |
Constructor.
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::row | ( | ) | const |
Row number of the element represented by this object.
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::index | ( | ) | const |
Index in row of the element represented by this object.
size_type TrilinosWrappers::SparseMatrixIterators::AccessorBase::column | ( | ) | const |
Column number of the element represented by this object.
|
protected |
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 141 of file trilinos_sparse_matrix.cc.
|
mutableprotected |
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 147 of file trilinos_sparse_matrix.h.
|
protected |
Current row number.
Definition at line 151 of file trilinos_sparse_matrix.h.
|
protected |
Current index in row.
Definition at line 156 of file trilinos_sparse_matrix.h.
|
protected |
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 178 of file trilinos_sparse_matrix.h.
|
protected |
Cache for the values of this row.
Definition at line 183 of file trilinos_sparse_matrix.h.