Dune::ConstArrayListIterator< T, N, A > Class Template Reference
[Common]
#include <arraylist.hh>
Inheritance diagram for Dune::ConstArrayListIterator< T, N, A >:

Detailed Description
template<class T, int N, class A>
class Dune::ConstArrayListIterator< T, N, A >
A constant random access iterator for the Dune::ArrayList class.
Public Types | |
enum | { chunkSize_ = (N > 0)? N : 1 } |
typedef A::value_type | MemberType |
The member type. | |
typedef T | DerivedType |
The type of derived iterator. | |
typedef V | Value |
The type of value accessed through the iterator. | |
typedef V * | Pointer |
The pointer to the Value. | |
typedef D | DifferenceType |
The type of the difference between two positions. | |
typedef R | Reference |
The type of the reference to the values accessed. | |
Public Member Functions | |
bool | equals (const ConstArrayListIterator< MemberType, N, A > &other) const |
Comares to iterators. | |
void | increment () |
Increment the iterator. | |
void | decrement () |
decrement the iterator. | |
void | advance (difference_type n) |
difference_type | distanceTo (const ConstArrayListIterator< T, N, A > &other) const |
const MemberType & | elementAt (size_type i) const |
Get the value of the list at an arbitrary position. | |
const MemberType & | dereference () const |
Access the element at the current position. | |
Reference | operator * () const |
Dereferencing operator. | |
Reference | operator[] (DifferenceType n) const |
Get the element n positions from the current one. | |
DerivedType & | operator++ () |
Preincrement operator. | |
DerivedType | operator++ (int) |
Postincrement operator. | |
DerivedType & | operator-- () |
Predecrement operator. | |
DerivedType | operator-- (int) |
Postdecrement operator. |
Member Typedef Documentation
template<class T, class V, class R = V&, class D = std::ptrdiff_t>
typedef T Dune::RandomAccessIteratorFacade< T, V, R, D >::DerivedType [inherited] |
The type of derived iterator.
The iterator has to define following functions have to be present:
// Access the value referred to. Reference dereference() const;
// Compare for equality with j equals(i);
// position the iterator at the next element. void increment()
// position the iterator at the previous element. void decrement()
// advance the iterator by a number of positions- void advance(DifferenceType n); // calculate the distance to another iterator. // One should incorporate an assertion wether // the same containers are referenced DifferenceType distanceTo(j) const;
For an elaborate explanation see the STL Documentation
Member Enumeration Documentation
template<class T, int N, class A>
anonymous enum |
Member Function Documentation
template<class T, class V, class R = V&, class D = std::ptrdiff_t>
Reference Dune::RandomAccessIteratorFacade< T, V, R, D >::operator[] | ( | DifferenceType | n | ) | const [inline, inherited] |
Get the element n positions from the current one.
- Parameters:
-
n The distance to the element.
- Returns:
- The element at that distance.
The documentation for this class was generated from the following file: