Reference documentation for deal.II version 9.1.1
|
#include <deal.II/lac/sparsity_pattern.h>
Public Types | |
using | size_type = types::global_dof_index |
using | container_pointer_type = SparsityPatternBase * |
Public Types inherited from LinearIndexIterator< Iterator, Accessor > | |
using | iterator_category = std::random_access_iterator_tag |
using | value_type = Accessor |
using | difference_type = std::ptrdiff_t |
using | reference = const value_type & |
using | pointer = const value_type * |
using | size_type = typename value_type::size_type |
Public Member Functions | |
Iterator (const SparsityPatternBase *sp, const std::size_t linear_index) | |
Iterator (const Accessor &accessor) | |
Public Member Functions inherited from LinearIndexIterator< Iterator, Accessor > | |
Iterator & | operator= (const Iterator &it) |
Iterator & | operator++ () |
Iterator | operator++ (int) |
Iterator & | operator-- () |
Iterator | operator-- (int) |
Iterator | operator+ (const difference_type n) const |
Iterator | operator- (const difference_type n) const |
difference_type | operator- (const Iterator &p) const |
Iterator & | operator+= (const difference_type n) |
Iterator & | operator-= (const difference_type n) |
reference | operator* () const |
pointer | operator-> () const |
bool | operator== (const Iterator &) const |
bool | operator!= (const Iterator &) const |
bool | operator<= (const Iterator &) const |
bool | operator>= (const Iterator &) const |
bool | operator< (const Iterator &) const |
bool | operator> (const Iterator &) const |
Additional Inherited Members | |
Protected Member Functions inherited from LinearIndexIterator< Iterator, Accessor > | |
LinearIndexIterator (const Accessor accessor) | |
Protected Attributes inherited from LinearIndexIterator< Iterator, Accessor > | |
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 283 of file sparsity_pattern.h.
Size type.
Definition at line 289 of file sparsity_pattern.h.
Type of the stored pointer.
Definition at line 294 of file sparsity_pattern.h.
SparsityPatternIterators::Iterator::Iterator | ( | const SparsityPatternBase * | sp, |
const std::size_t | linear_index | ||
) |
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).
SparsityPatternIterators::Iterator::Iterator | ( | const Accessor & | accessor | ) |
Constructor. Create an iterator into the sparsity pattern sp
for a given accessor.