#include <vctForwardDeclarations.h>
template<class _ownerType, bool _forward>
class vctVarStrideNArrayConstIterator< _ownerType, _forward >
- Parameters
-
_ownerType | the type of the owner of the container to which this iterator points |
_forward | set to true for forward iterators, false for reverse iterators |
- See Also
- vctVarStrideNArrayIterator
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Base type for this iterator, i.e. std::iterator.
template<class _ownerType, bool _forward>
Type (i.e. category) of iterator, i.e. std::random_access_iterator_tag.
template<class _ownerType, bool _forward>
The type of the owner of the container to which this iterator points.
template<class _ownerType, bool _forward>
The type of the iterator itself.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Default constructor: create an uninitialized object.
template<class _ownerType, bool _forward>
Constructor taking a non const element pointer; the starting position will be the first element of the nArray. Note that only read operations will be performed!
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Complementary operation to operator==.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Increment by offset.
- Parameters
-
difference | offset to increment by |
template<class _ownerType, bool _forward>
Subtraction between iterators returns the number of increments needed for the second operand to reach the first operand, if it is reachable.
- Note
- this operation assumes reachability and does not test for it.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Decrement by offset.
- Parameters
-
difference | offset to decrement by |
template<class _ownerType, bool _forward>
Order relation between iterators, required by STL.
- Note
- The STL manual states that "if j is reachable from i then
i<j". This does not imply the converse: "if i<j then j is
reachable from i". In the case here, the converse does not hold.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Equality of iterators, required by STL.
template<class _ownerType, bool _forward>
Complementary operation to operator <.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Random access (return const reference).
template<class _ownerType, bool _forward>
Auxiliary method to calculate the correct ElementPointer corresponding to the current MetaIndex. See the complete documentation for a detailed description of this algorithm.
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
template<class _ownerType, bool _forward>
Pointer to the address of the container being referred to by this iterator.
template<class _ownerType, bool _forward>
Pointer to the object being referred to by this iterator. It is not declared const, so we will be able to use it in the non const iterator class. But all the methods in vctVarStrideNArrayConstIterator are declared const to protect the data from writing.
template<class _ownerType, bool _forward>
Pseudo-index for the iterator. See complete documentation for a thorough discussion of this "meta index".
The documentation for this class was generated from the following files: