#include <iterator.h>
Public Types | |
typedef std::random_access_iterator_tag | iterator_category |
typedef T | value_type |
typedef size_t | difference_type |
typedef T * | pointer |
typedef T & | reference |
Public Member Functions | |
PlainIterator (T *element) | |
reference | operator* () |
pointer | operator-> () |
PlainIterator & | operator++ () |
PlainIterator | operator++ (int) |
PlainIterator & | operator-- () |
PlainIterator | operator-- (int) |
PlainIterator & | operator+= (difference_type dist) |
PlainIterator | operator+ (difference_type dist) |
PlainIterator & | operator-= (difference_type dist) |
PlainIterator | operator- (difference_type dist) |
difference_type | operator- (const PlainIterator &right) |
reference | operator[] (difference_type off) |
bool | operator== (const PlainIterator &right) |
bool | operator!= (const PlainIterator &right) |
bool | operator< (const PlainIterator &right) |
Private Attributes | |
T * | element |
This class provide iterator mnemonics for plain C array. This was mainly implemented so the more efficient std::sort can by used for plain array instead of library qsort function.