#include <stl_iterator.h>
i
is established by the identity: &*(reverse_iterator(i)) == &*(i - 1)
This mapping is dictated by the fact that while there is always a pointer past the end of an array, there might not be a valid pointer before the beginning of an array." [24.4.1]/1,2
Reverse iterators can be tricky and surprising at first. Their semantics make sense, however, and the trickiness is a side effect of the requirement that the iterators must be safe.
Definition at line 90 of file stl_iterator.h.
|
The default constructor default-initializes member Referenced by reverse_iterator::operator+=(), and reverse_iterator::operator--(). |
|
This iterator will move in the opposite direction that |
|
The copy constructor is normal. Definition at line 125 of file stl_iterator.h. |
|
A reverse_iterator across other types can be copied in the normal fashion. Definition at line 133 of file stl_iterator.h. References reverse_iterator::base(). |
|
Referenced by reverse_iterator::operator[](), and reverse_iterator::reverse_iterator(). |
|
|
|
|
|
|
|
|
|
References reverse_iterator::reverse_iterator(). |
|
|
|
References reverse_iterator::reverse_iterator(). |
|
|
|
|
|
|
|
References reverse_iterator::base(). |