SparsityPatternIterators::Accessor Class Reference

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

Inheritance diagram for SparsityPatternIterators::Accessor:

Public Types
using	size_type = SparsityPatternIterators::size_type

Public Member Functions
	Accessor (const SparsityPatternBase *matrix, const std::size_t linear_index)
	Accessor (const SparsityPatternBase *matrix)
	Accessor ()
size_type	row () const
size_type	index () const
size_type	global_index () const
size_type	column () const
bool	is_valid_entry () const
bool	operator== (const Accessor &) const
bool	operator< (const Accessor &) const

Protected Member Functions
void	advance ()

Static Protected Member Functions
static ::ExceptionBase &	DummyAccessor ()

Protected Attributes
const SparsityPatternBase *	container
std::size_t	linear_index

Friends
class	LinearIndexIterator< Iterator, Accessor >
class	ChunkSparsityPatternIterators::Accessor

Detailed Description

Accessor class for iterators into sparsity patterns. This class is also the base class for both const and non-const accessor classes into sparse matrices.

Note that this class only allows read access to elements, providing their row and column number (or alternatively the index within the complete sparsity pattern). It does not allow modifying the sparsity pattern itself.

Author

Wolfgang Bangerth

Date

2004

Definition at line 134 of file sparsity_pattern.h.

---

The documentation for this class was generated from the following file:

• include/deal.II/lac/sparsity_pattern.h