Reference documentation for deal.II version 9.3.3
|
#include <deal.II/lac/chunk_sparse_matrix.h>
Public Types | |
using | MatrixType = const ChunkSparseMatrix< number > |
using | size_type = types::global_dof_index |
Public Member Functions | |
Accessor (MatrixType *matrix, const unsigned int row) | |
Accessor (MatrixType *matrix) | |
Accessor (const ChunkSparseMatrixIterators::Accessor< number, false > &a) | |
number | value () const |
const MatrixType & | get_matrix () const |
size_type | row () const |
std::size_t | reduced_index () const |
size_type | column () const |
bool | is_valid_entry () const |
bool | operator== (const Accessor &) const |
bool | operator< (const Accessor &) const |
Protected Member Functions | |
void | advance () |
Protected Attributes | |
const ChunkSparsityPattern * | sparsity_pattern |
SparsityPatternIterators::Accessor | reduced_accessor |
size_type | chunk_row |
size_type | chunk_col |
Private Attributes | |
MatrixType * | matrix |
Friends | |
template<typename , bool > | |
class | Iterator |
Accessor class for constant matrices, used in the const_iterators. This class builds on the accessor classes used for sparsity patterns to loop over all nonzero entries, and only adds the accessor functions to gain access to the actual value stored at a certain location.
Definition at line 99 of file chunk_sparse_matrix.h.