Reference documentation for deal.II version GIT 0582167846 20230924 21:20:02+00:00

#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 
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.
Definition at line 190 of file dynamic_sparsity_pattern.h.

inline 
Constructor. Create an iterator into the sparsity pattern sp
for the given global index (i.e., the index of the given element counting from the zeroth row).
Definition at line 894 of file dynamic_sparsity_pattern.h.

inline 
Constructor. Create an invalid (end) iterator into the sparsity pattern sp
.
Definition at line 902 of file dynamic_sparsity_pattern.h.

default 
Default constructor creating an invalid iterator. This constructor is here only to be able to store iterators in STL containers such as std::vector
.

inline 
Prefix increment.
Definition at line 909 of file dynamic_sparsity_pattern.h.

inline 
Postfix increment.
Definition at line 918 of file dynamic_sparsity_pattern.h.

inline 
Dereferencing operator.
Definition at line 928 of file dynamic_sparsity_pattern.h.

inline 
Dereferencing operator.
Definition at line 936 of file dynamic_sparsity_pattern.h.
Comparison. True, if both iterators point to the same matrix position.
Definition at line 943 of file dynamic_sparsity_pattern.h.
Inverse of ==
.
Definition at line 951 of file dynamic_sparsity_pattern.h.
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.
Definition at line 957 of file dynamic_sparsity_pattern.h.

inline 
Return the distance between the current iterator and the argument. The distance is given by how many times one has to apply operator++ to the current iterator to get the argument (for a positive return value), or operator (for a negative return value).
Definition at line 965 of file dynamic_sparsity_pattern.h.

private 
Store an object of the accessor class.
Definition at line 274 of file dynamic_sparsity_pattern.h.