Dune::compressed_base_array_unmanaged< B, A >::RealIterator< T > Class Template Reference
#include <basearray.hh>
Detailed Description
template<class B, class A = ISTLAllocator>
template<class T>
class Dune::compressed_base_array_unmanaged< B, A >::RealIterator< T >
iterator class for sequential access
Public Types | |
typedef Dune::RemoveConst< T >::Type | ValueType |
The unqualified value type. | |
Public Member Functions | |
RealIterator () | |
constructor | |
RealIterator (B *_p, size_type *_j, size_type _i) | |
constructor | |
RealIterator (const RealIterator< ValueType > &it) | |
Copy constructor from mutable iterator. | |
bool | equals (const RealIterator< ValueType > &it) const |
equality | |
bool | equals (const RealIterator< const ValueType > &it) const |
equality | |
size_type | index () const |
return index corresponding to pointer | |
void | setindex (size_type k) |
Set index corresponding to pointer. | |
size_type | offset () const |
offset from the fist entry. |
Member Function Documentation
template<class B, class A = ISTLAllocator>
template<class T>
size_type Dune::compressed_base_array_unmanaged< B, A >::RealIterator< T >::offset | ( | ) | const [inline] |
offset from the fist entry.
An iterator positioned at the beginning has to be increment this amount of times to the same position.
The documentation for this class was generated from the following file: