![]() |
Reference documentation for deal.II version 9.6.0
|
#include <deal.II/lac/chunk_sparse_matrix.h>
Public Types | |
using | size_type = types::global_dof_index |
Public Member Functions | |
number | value () const |
number & | value () |
const ChunkSparseMatrix< number > & | 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 |
General template for sparse matrix accessors. The first template argument denotes the underlying numeric type, the second the constness of the matrix.
The general template is not implemented, only the specializations for the two possible values of the second template argument. Therefore, the interface listed here only serves as a template provided since doxygen does not link the specializations.
Definition at line 68 of file chunk_sparse_matrix.h.
|
inherited |
Declare the type for container size.
Definition at line 68 of file chunk_sparsity_pattern.h.
number ChunkSparseMatrixIterators::Accessor< number, Constness >::value | ( | ) | const |
Value of this matrix entry.
number & ChunkSparseMatrixIterators::Accessor< number, Constness >::value | ( | ) |
Value of this matrix entry.
const ChunkSparseMatrix< number > & ChunkSparseMatrixIterators::Accessor< number, Constness >::get_matrix | ( | ) | const |
Return a reference to the matrix into which this accessor points. Note that in the present case, this is a constant reference.
|
inherited |
Row number of the element represented by this object. This function can only be called for entries for which is_valid_entry() is true.
|
inherited |
Return the global index from the reduced sparsity pattern.
|
inherited |
Column number of the element represented by this object. This function can only be called for entries for which is_valid_entry() is true.
|
inherited |
Return whether the sparsity pattern entry pointed to by this iterator is valid or not. Note that after compressing the sparsity pattern, all entries are valid. However, before compression, the sparsity pattern allocated some memory to be used while still adding new nonzero entries; if you create iterators in this phase of the sparsity pattern's lifetime, you will iterate over elements that are not valid. If this is so, then this function will return false.
Comparison. True, if both iterators point to the same matrix position.
Comparison operator. Result is true if either the first row number is smaller or if the row numbers are equal and the first index is smaller.
This function is only valid if both iterators point into the same sparsity pattern.
|
protectedinherited |
Move the accessor to the next nonzero entry in the matrix.
|
protectedinherited |
The sparsity pattern we operate on accessed.
Definition at line 134 of file chunk_sparsity_pattern.h.
|
protectedinherited |
The accessor of the (reduced) sparsity pattern.
Definition at line 139 of file chunk_sparsity_pattern.h.
|
protectedinherited |
Current chunk row number.
Definition at line 144 of file chunk_sparsity_pattern.h.
|
protectedinherited |
Current chunk col number.
Definition at line 149 of file chunk_sparsity_pattern.h.