Reference documentation for deal.II version 9.3.3
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Public Member Functions | Private Attributes | List of all members
DynamicSparsityPatternIterators::Iterator Class Reference
Linear algebra classes » Sparsity patterns

#include <deal.II/lac/dynamic_sparsity_pattern.h>

Public Member Functions

 Iterator (const DynamicSparsityPattern *sp, const size_type row, const unsigned int index_within_row)
 
 Iterator (const DynamicSparsityPattern *sp)
 
 Iterator ()=default
 
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
 
int operator- (const Iterator &p) const
 

Private Attributes

Accessor accessor
 

Detailed Description

An iterator class for walking over the elements of a sparsity pattern.

The typical use for these iterators is to iterate over the elements of a sparsity pattern (or, since they also serve as the basis for iterating over the elements of an associated matrix, over the elements of a sparse matrix), or over the elements of individual rows. There is no guarantee that the elements of a row are actually traversed in an order in which column numbers monotonically increase. See the documentation of the SparsityPattern class for more information.

Note
This class operates directly on the internal data structures of the DynamicSparsityPattern class. As a consequence, some operations are cheap and some are not. In particular, it is cheap to access the column index of the sparsity pattern entry pointed to. On the other hand, it is expensive to compute the distance between two iterators. As a consequence, when you design algorithms that use these iterators, it is common practice to not loop over all elements of a sparsity pattern at once, but to have an outer loop over all rows and within this loop iterate over the elements of this row. This way, you only ever need to dereference the iterator to obtain the column indices whereas the (expensive) lookup of the row index can be avoided by using the loop index instead.

Definition at line 188 of file dynamic_sparsity_pattern.h.

The documentation for this class was generated from the following file:
Generated by doxygen 1.9.4