The iterator over the pairs.
More...
#include <dune/common/parallel/indexset.hh>
List of all members.
Public Types |
enum | { chunkSize_ = (N > 0) ? N : 1
} |
typedef A::value_type | MemberType |
| The member type.
|
typedef A::difference_type | difference_type |
typedef A::size_type | size_type |
typedef A::reference | reference |
typedef A::const_reference | const_reference |
typedef ArrayListIterator< T,
N, A > | DerivedType |
| The type of derived iterator.
|
typedef A::value_type | Value |
| The type of value accessed through the iterator.
|
typedef A::value_type * | Pointer |
| The pointer to the Value.
|
typedef A::difference_type | DifferenceType |
| The type of the difference between two positions.
|
typedef A::reference | Reference |
| The type of the reference to the values accessed.
|
Public Member Functions |
| iterator (ParallelIndexSet< TG, TL, N > &indexSet, const Father &father) |
| iterator (const iterator &other) |
iterator & | operator== (const iterator &other) |
bool | equals (const ArrayListIterator< MemberType, N, A > &other) const |
| Comares two iterators.
|
bool | equals (const ConstArrayListIterator< MemberType, N, A > &other) const |
| Comares two iterators.
|
void | increment () |
| Increment the iterator.
|
void | decrement () |
| decrement the iterator.
|
reference | elementAt (size_type i) const |
| Get the value of the list at an arbitrary position.
|
reference | dereference () const |
| Access the element at the current position.
|
void | eraseToHere () |
| Erase all entries before the current position and the one at the current position.
|
size_type | position () |
void | advance (difference_type n) |
difference_type | distanceTo (const ArrayListIterator< T, N, A > &other) const |
Reference | operator* () const |
| Dereferencing operator.
|
Pointer | operator-> () const |
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+= (DifferenceType n) |
DerivedType | operator+ (DifferenceType n) const |
DerivedType & | operator-- () |
| Predecrement operator.
|
DerivedType | operator-- (int) |
| Postdecrement operator.
|
DerivedType & | operator-= (DifferenceType n) |
DerivedType | operator- (DifferenceType n) const |
Detailed Description
template<typename TG, typename TL, int N = 100>
class Dune::ParallelIndexSet< TG, TL, N >::iterator
The iterator over the pairs.
Member Typedef Documentation
template<class T, int N, class A>
The type of derived iterator.
The iterator has to define following functions have to be present:
Reference dereference() const;
Reference elementAt(n) const;
bool equals(j);
void increment()
void decrement()
void advance(DifferenceType n);
DifferenceType distanceTo(j) const;
For an elaborate explanation see the STL Documentation
template<class T, int N, class A>
The type of the difference between two positions.
template<class T, int N, class A>
The pointer to the Value.
The type of the reference to the values accessed.
template<class T, int N, class A>
template<class T, int N, class A>
The type of value accessed through the iterator.
Member Enumeration Documentation
template<class T, int N, class A>
anonymous enum [inherited] |
- Enumerator:
chunkSize_ |
The number of elements in one chunk of the list.
This has to be at least one. The default is 100.
|
Member Function Documentation
Get the element n positions from the current one.
- Parameters:
-
| n | The distance to the element. |
- Returns:
- The element at that distance.
template<class T, int N, class A>
The documentation for this class was generated from the following file: