-
Notifications
You must be signed in to change notification settings - Fork 0
/
iterator
174 lines (157 loc) · 4.84 KB
/
iterator
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
#ifndef KYLE_STL_ITERATOR
#define KYLE_STL_ITERATOR 1
#include <iterator>
namespace kyle_std
{
//random iterator
template <typename T>
class _k_Random_Iterator : public std::iterator<std::random_access_iterator_tag,
T>
{
// compare
template <typename Type, typename Alloc>
friend class vector;
template <typename T1, typename T2>
friend bool operator>(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
template <typename T1, typename T2>
friend bool operator<(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
template <typename T1, typename T2>
friend bool operator>=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
template <typename T1, typename T2>
friend bool operator<=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
template <typename T1, typename T2>
friend bool operator==(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
template <typename T1, typename T2>
friend bool operator!=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs);
public:
// default constructor
explicit _k_Random_Iterator() noexcept : p(nullptr)
{}
// copy constructor
_k_Random_Iterator(const _k_Random_Iterator&) = default;
// move constructor
_k_Random_Iterator(_k_Random_Iterator&&) = default;
explicit _k_Random_Iterator(T *p) noexcept : p(p)
{}
// assign constructors
_k_Random_Iterator<T>& operator= (const _k_Random_Iterator&) = default;
_k_Random_Iterator<T>& operator= (_k_Random_Iterator&&) = default;
// postposition
inline _k_Random_Iterator<T>& operator++()
{
p += 1;
return *this;
}
inline _k_Random_Iterator<T>& operator--()
{
p -= 1;
return *this;
}
// preposition
inline _k_Random_Iterator<T> operator++(int);
inline _k_Random_Iterator<T> operator--(int);
inline _k_Random_Iterator<T> operator+(size_t);
inline _k_Random_Iterator<T> operator-(size_t);
inline std::size_t operator-(const _k_Random_Iterator&);
inline _k_Random_Iterator<T>& operator+=(const size_t offset)
{
p += offset;
return *this;
}
inline _k_Random_Iterator<T>& operator-=(const size_t offset)
{
p -= offset;
return *this;
}
// dereference
inline T& operator*() const
{
return *p;
}
inline T* operator->() const
{
return &this->operator*();
}
// offset dereference
inline T& operator[](std::size_t index) const
{
return p[index];
}
virtual ~_k_Random_Iterator() = default;
private:
T *p;
}; // class _k_Random_Iterator
// arithmetic operators for _k_Random_Iterator<T>
template <typename T>
_k_Random_Iterator<T> _k_Random_Iterator<T>::operator+(std::size_t offset)
{
_k_Random_Iterator<T> ret = *this;
ret += offset;
return std::move(ret);
}
template <typename T>
_k_Random_Iterator<T> operator+(std::size_t offset, const _k_Random_Iterator<T> &iter)
{
_k_Random_Iterator<T> ret = iter;
ret += offset;
return std::move(ret);
}
template <typename T>
_k_Random_Iterator<T> _k_Random_Iterator<T>::operator-(std::size_t offset)
{
_k_Random_Iterator<T> ret = *this;
ret -= offset;
return std::move(ret);
}
template <typename T>
std::size_t _k_Random_Iterator<T>::operator-(const _k_Random_Iterator<T> &rhs)
{
return (*this).p - rhs.p;
}
// compare operators for _k_Random_Iterator<T>
template <typename T1, typename T2>
inline bool operator>(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return lhs.p > rhs.p;
}
template <typename T1, typename T2>
inline bool operator<(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return lhs.p < rhs.p;
}
template <typename T1, typename T2>
inline bool operator>=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return !(lhs < rhs);
}
template <typename T1, typename T2>
inline bool operator<=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return !(lhs > rhs);
}
template <typename T1, typename T2>
inline bool operator==(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return lhs.p == rhs.p;
}
template <typename T1, typename T2>
inline bool operator!=(const _k_Random_Iterator<T1> &lhs, const _k_Random_Iterator<T2> &rhs)
{
return !(lhs == rhs);
}
template <typename T>
inline _k_Random_Iterator<T> _k_Random_Iterator<T>::operator++(int)
{
_k_Random_Iterator<T> ret = *this;
++*this;
return ret;
}
template <typename T>
inline _k_Random_Iterator<T> _k_Random_Iterator<T>::operator--(int)
{
_k_Random_Iterator<T> ret = *this;
--*this;
return ret;
}
} // namespace kyle_std
#endif // KYLE_STL_ITERATOR