Public Member Functions | |
| Accessor (const SparsityPattern *sparsity_pattern, const unsigned int row, const unsigned int index) | |
| unsigned int | row () const |
| unsigned int | index () const |
| unsigned int | column () const |
Static Public Member Functions | |
| ::ExceptionBase & | ExcBeyondEndOfSparsityPattern () |
| ::ExceptionBase & | ExcAccessToNonlocalRow (int arg1, int arg2, int arg3) throw (errortext << "You tried to access row " << arg1 << " of a distributed sparsity pattern, " << " but only rows " << arg2 << " through " << arg3 << " are stored locally and can be accessed." ) |
Private Member Functions | |
| void | visit_present_row () |
Private Attributes | |
| SparsityPattern * | sparsity_pattern |
| unsigned int | a_row |
| unsigned int | a_index |
| std_cxx1x::shared_ptr< const std::vector< unsigned int > > | colnum_cache |
Friends | |
| class | const_iterator |
Accessor class for iterators
Definition at line 67 of file trilinos_sparsity_pattern.h.
| TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::Accessor | ( | const SparsityPattern * | sparsity_pattern, |
| const unsigned int | row, | ||
| const unsigned int | index | ||
| ) |
Constructor. Since we use accessors only for read access, a const matrix pointer is sufficient.
| unsigned int TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::row | ( | ) | const |
Row number of the element represented by this object.
| unsigned int TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::index | ( | ) | const |
Index in row of the element represented by this object.
| unsigned int TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::column | ( | ) | const |
Column number of the element represented by this object.
| ::ExceptionBase& TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::ExcBeyondEndOfSparsityPattern | ( | ) | [static] |
Exception
| ::ExceptionBase& TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::ExcAccessToNonlocalRow | ( | int | arg1, |
| int | arg2, | ||
| int | arg3 | ||
| ) | throw (errortext << "You tried to access row " << arg1 << " of a distributed sparsity pattern, " << " but only rows " << arg2 << " through " << arg3 << " are stored locally and can be accessed." ) [static] |
Exception
| void TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::visit_present_row | ( | ) | [private] |
Discard the old row caches (they may still be used by other accessors) and generate new ones for the row pointed to presently by this accessor.
friend class const_iterator [friend] |
Make enclosing class a friend.
Definition at line 170 of file trilinos_sparsity_pattern.h.
SparsityPattern* TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::sparsity_pattern [mutable, private] |
The matrix accessed.
Definition at line 117 of file trilinos_sparsity_pattern.h.
Current row number.
Definition at line 122 of file trilinos_sparsity_pattern.h.
unsigned int TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::a_index [private] |
Current index in row.
Definition at line 127 of file trilinos_sparsity_pattern.h.
std_cxx1x::shared_ptr<const std::vector<unsigned int> > TrilinosWrappers::SparsityPatternIterators::const_iterator::Accessor::colnum_cache [private] |
Cache where we store the column indices of the present row. This is necessary, since Trilinos makes access to the elements of its matrices rather hard, and it is much more efficient to copy all column entries of a row once when we enter it than repeatedly asking Trilinos for individual ones. This also makes some sense since it is likely that we will access them sequentially anyway.
In order to make copying of iterators/accessor of acceptable performance, we keep a shared pointer to these entries so that more than one accessor can access this data if necessary.
Definition at line 154 of file trilinos_sparsity_pattern.h.
documentation generated on Fri Feb 3 2012 06:04:18 by
doxygen
1.7.2