| 1 |
#include <iostream> |
| 2 |
#include <iterator> |
| 3 |
#include "vector.h" |
| 4 |
|
| 5 |
template <typename Type> |
| 6 |
class Vector2: public Vector<Type> |
| 7 |
{ |
| 8 |
public: |
| 9 |
Vector2() |
| 10 |
: |
| 11 |
Vector<Type>() |
| 12 |
{}; |
| 13 |
Vector2(size_t n) |
| 14 |
: |
| 15 |
Vector<Type>(n) |
| 16 |
{} |
| 17 |
|
| 18 |
class reverse_iterator: |
| 19 |
public random_access_iterator<Type, ptrdiff_t> |
| 20 |
{ |
| 21 |
friend class Vector2<Type>; |
| 22 |
|
| 23 |
public: |
| 24 |
Type &operator*() const; |
| 25 |
bool operator==(reverse_iterator const &other) const; |
| 26 |
reverse_iterator &operator++(); |
| 27 |
reverse_iterator operator++(int); |
| 28 |
reverse_iterator &operator--(); |
| 29 |
reverse_iterator operator--(int); |
| 30 |
|
| 31 |
reverse_iterator operator+(int step) const; |
| 32 |
reverse_iterator operator-(int step) const; |
| 33 |
int operator-(reverse_iterator const &other) const; |
| 34 |
|
| 35 |
bool operator<(reverse_iterator const &other) const; |
| 36 |
private: |
| 37 |
reverse_iterator(Vector<Type> *vp); |
| 38 |
reverse_iterator(Type *begin, Type *end); |
| 39 |
}; |
| 40 |
|
| 41 |
reverse_iterator rbegin() |
| 42 |
{ |
| 43 |
return reverse_iterator(this); |
| 44 |
} |
| 45 |
reverse_iterator rend() |
| 46 |
{ |
| 47 |
// requirements random access iterator |
| 48 |
return reverse_iterator(this->begin(), this->begin()); |
| 49 |
} |
| 50 |
}; |
| 51 |
|
| 52 |
int main() |
| 53 |
{ |
| 54 |
Vector2<int> vi; |
| 55 |
// requirements random access iterator |
| 56 |
sort(vi.rbegin(), vi.rend()); |
| 57 |
} |