#include <dune/common/diagonalmatrix.hh>
◆ block_type
template<class K , int n>
export the type representing the components
◆ const_iterator
template<class K , int n>
typedef for stl compliant access
◆ ConstIterator
template<class K , int n>
ConstIterator class for sequential access.
◆ field_type
template<class K , int n>
export the type representing the field
◆ size_type
template<class K , int n>
The type used for the index access and size operation.
◆ anonymous enum
template<class K , int n>
◆ anonymous enum
template<class K , int n>
We are at the leaf of the block recursion.
Enumerator |
---|
blocklevel | The number of block levels we contain.
|
◆ anonymous enum
template<class K , int n>
export size
Enumerator |
---|
size | The size of this vector.
|
◆ DiagonalRowVectorConst() [1/2]
template<class K , int n>
Constructor making uninitialized vector.
◆ DiagonalRowVectorConst() [2/2]
template<class K , int n>
Constructor making vector with identical coordinates.
◆ beforeBegin()
template<class K , int n>
- Returns
- an iterator that is positioned before the first row of the matrix.
◆ beforeEnd()
template<class K , int n>
- Returns
- an iterator that is positioned before the end iterator of the rows. i.e. at the row.
◆ begin()
template<class K , int n>
◆ diagonal()
template<class K , int n>
◆ dim()
template<class K , int n>
dimension of the vector space
◆ end()
template<class K , int n>
◆ identical()
template<class K , int n>
◆ N()
template<class K , int n>
number of blocks in the vector (are of size 1 here)
◆ operator &()
template<class K , int n>
◆ operator==()
template<class K , int n>
Binary vector comparison.
◆ operator[]()
template<class K , int n>
same for read only access
◆ pointer()
template<class K , int n>
◆ realIndex()
template<class K , int n>
◆ rowIndex()
template<class K , int n>
index of this row in surrounding matrix
◆ p_
template<class K , int n>
◆ row_
template<class K , int n>
The documentation for this class was generated from the following file: