deal.II version GIT relicensing-1972-g22a7b89abe 2024-10-11 21:20:00+00:00
|
#include <deal.II/lac/trilinos_tpetra_sparsity_pattern.h>
Public Types | |
using | size_type = types::global_dof_index |
Public Member Functions | |
Iterator (const SparsityPattern< MemorySpace > *sparsity_pattern, const size_type row, const size_type index) | |
Iterator (const Iterator< MemorySpace > &i) | |
Iterator< MemorySpace > & | operator++ () |
Iterator | operator++ (int) |
const Accessor< MemorySpace > & | operator* () const |
const Accessor< MemorySpace > * | operator-> () const |
bool | operator== (const Iterator< MemorySpace > &) const |
bool | operator!= (const Iterator< MemorySpace > &) const |
bool | operator< (const Iterator< MemorySpace > &) const |
Static Public Member Functions | |
static ::ExceptionBase & | ExcInvalidIndexWithinRow (size_type arg1, size_type arg2) |
Private Attributes | |
Accessor< MemorySpace > | accessor |
Friends | |
class | TpetraWrappers::SparsityPattern< MemorySpace > |
Iterator class for sparsity patterns of type TrilinosWrappers::SparsityPattern. Access to individual elements of the sparsity pattern is handled by the Accessor class in this namespace.
Definition at line 183 of file trilinos_tpetra_sparsity_pattern.h.
using LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::size_type = types::global_dof_index |
Declare type for container size.
Definition at line 189 of file trilinos_tpetra_sparsity_pattern.h.
LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::Iterator | ( | const SparsityPattern< MemorySpace > * | sparsity_pattern, |
const size_type | row, | ||
const size_type | index | ||
) |
Constructor. Create an iterator into the matrix matrix
for the given row and the index within it.
LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::Iterator | ( | const Iterator< MemorySpace > & | i | ) |
Copy constructor.
Iterator< MemorySpace > & LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator++ | ( | ) |
Prefix increment.
Iterator LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator++ | ( | int | ) |
Postfix increment.
const Accessor< MemorySpace > & LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator* | ( | ) | const |
Dereferencing operator.
const Accessor< MemorySpace > * LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator-> | ( | ) | const |
Dereferencing operator.
bool LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator== | ( | const Iterator< MemorySpace > & | ) | const |
Comparison. True, if both iterators point to the same matrix position.
bool LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator!= | ( | const Iterator< MemorySpace > & | ) | const |
Inverse of ==
.
bool LinearAlgebra::TpetraWrappers::SparsityPatternIterators::Iterator< MemorySpace >::operator< | ( | const Iterator< MemorySpace > & | ) | const |
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.
|
friend |
Definition at line 262 of file trilinos_tpetra_sparsity_pattern.h.
|
private |
Store an object of the accessor class.
Definition at line 262 of file trilinos_tpetra_sparsity_pattern.h.