Reference documentation for deal.II version 9.6.0
|
#include <deal.II/lac/chunk_sparsity_pattern.h>
Public Types | |
using | size_type = types::global_dof_index |
Public Member Functions | |
Iterator (const ChunkSparsityPattern *sp, const size_type row) | |
Iterator & | operator++ () |
Iterator | operator++ (int) |
const Accessor & | operator* () const |
const Accessor * | operator-> () const |
bool | operator== (const Iterator &) const |
bool | operator!= (const Iterator &) const |
bool | operator< (const Iterator &) const |
Private Attributes | |
Accessor | accessor |
Iterator that walks over the elements of a sparsity pattern.
Definition at line 166 of file chunk_sparsity_pattern.h.
Declare the type for container size.
Definition at line 172 of file chunk_sparsity_pattern.h.
ChunkSparsityPatternIterators::Iterator::Iterator | ( | const ChunkSparsityPattern * | sp, |
const size_type | row ) |
Constructor. Create an iterator into the sparsity pattern sp
for the given row and the index within it.
Iterator & ChunkSparsityPatternIterators::Iterator::operator++ | ( | ) |
Prefix increment.
const Accessor & ChunkSparsityPatternIterators::Iterator::operator* | ( | ) | const |
Dereferencing operator.
const Accessor * ChunkSparsityPatternIterators::Iterator::operator-> | ( | ) | const |
Dereferencing operator.
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 matrix.
|
private |
Store an object of the accessor class.
Definition at line 230 of file chunk_sparsity_pattern.h.