Public Member Functions | |
| Iterator (const SparsityPattern *sp, const unsigned int row, const unsigned int index) | |
| 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 |
Private Attributes | |
| Accessor | accessor |
STL conforming iterator walking over the elements of a sparsity pattern.
Definition at line 227 of file sparsity_pattern.h.
| SparsityPatternIterators::Iterator::Iterator | ( | const SparsityPattern * | sp, |
| const unsigned int | row, | ||
| const unsigned int | index | ||
| ) |
Constructor. Create an iterator into the sparsity pattern sp for the given row and the index within it.
| Iterator& SparsityPatternIterators::Iterator::operator++ | ( | ) |
Prefix increment.
| Iterator SparsityPatternIterators::Iterator::operator++ | ( | int | ) |
Postfix increment.
| const Accessor& SparsityPatternIterators::Iterator::operator* | ( | ) | const |
Dereferencing operator.
| const Accessor* SparsityPatternIterators::Iterator::operator-> | ( | ) | const |
Dereferencing operator.
Comparison. True, if both iterators point to the same matrix position.
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.
Store an object of the accessor class.
Definition at line 292 of file sparsity_pattern.h.
documentation generated on Fri Feb 3 2012 06:04:17 by
doxygen
1.7.2