|
libhatchet
|
#include <hxdeque.hpp>
Public Member Functions | |
| const_iterator (void) | |
| const T & | operator* (void) const |
| const_iterator | operator+ (hxsize_t n_) const |
| const_iterator | operator- (hxsize_t n_) const |
| hxsize_t | operator- (const const_iterator &x_) const |
| const T & | operator[] (hxsize_t n_) const |
| const_iterator & | operator++ (void) |
| const_iterator | operator++ (int) |
| const_iterator & | operator-- (void) |
| const_iterator | operator-- (int) |
| bool | operator== (const const_iterator &x_) const |
| bool | operator< (const const_iterator &x_) const |
const_iterator - A const random-access iterator over logical indices.
Iterators are invalidated by any operation that changes the deque.
|
inline |
Constructs an end iterator.
|
inline |
Returns a const reference to the element at the current position.
|
inline |
Returns an iterator advanced by n positions.
|
inline |
Advances the iterator to the next element (post-increment).
|
inline |
Advances the iterator to the next element.
|
inline |
Returns the signed distance between two iterators.
|
inline |
Returns an iterator retreated by n positions.
|
inline |
Retreats the iterator to the previous element (post-decrement).
|
inline |
Retreats the iterator to the previous element.
|
inline |
Returns true when this iterator is ordered before x.
|
inline |
Compares two iterators for equality.
|
inline |
Returns a const reference to the element n positions ahead of this one.