-
Notifications
You must be signed in to change notification settings - Fork 0
/
iterator.h
274 lines (241 loc) · 6.44 KB
/
iterator.h
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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
#pragma once
#ifndef _ITERATOR_H
#define _ITERATOR_H
namespace ministl
{
#include<cstddef>
struct forward_iterator_tag {};
struct reverse_iterator_tag {};
struct bidirectional_iterator_tag : public forward_iterator_tag {};
struct random_access_iterator_tag : public bidirectional_iterator_tag {};
template<class Category, class T, class Distance = ptrdiff_t, class Pointer = T*, class Reference = T&>
struct iterator
{
typedef Category Iiteraotr_category;
typedef T value_type;
typedef Distance difference_type;
typedef Pointer pointer;
typedef Reference reference;
};
template<class T, class Distance = ptrdiff_t, class Pointer = T*, class Reference = T&>
struct forward_iterator
{
typedef forward_iterator_tag Iiteraotr_category;
typedef T value_type;
typedef Distance difference_type;
typedef Pointer pointer;
typedef Reference reference;
pointer p;
};
template<class T, class Distance = ptrdiff_t, class Pointer = T*, class Reference = T&>
struct reverse_iterator
{
typedef reverse_iterator_tag Iiteraotr_category;
typedef T value_type;
typedef Distance difference_type;
typedef Pointer pointer;
typedef Reference reference;
};
template<class T, class Distance = ptrdiff_t, class Pointer = T*, class Reference = T&>
struct bidirectional_iterator
{
typedef bidirectional_iterator_tag Iiteraotr_category;
typedef T value_type;
typedef Distance difference_type;
typedef Pointer pointer;
typedef Reference reference;
};
template<class T, class Distance = ptrdiff_t, class Pointer = T*, class Reference = T&>
struct random_access_iterator
{
typedef random_access_iterator_tag Iiteraotr_category;
typedef T value_type;
typedef Distance difference_type;
typedef Pointer pointer;
typedef Reference reference;
};
template<class Iterator>
struct iterator_traits
{
typedef typename Iterator::iterator_category iterator_category;
typedef typename Iterator::value_type value_type;
typedef typename Iterator::difference_type difference_type;
typedef typename Iterator::pointer pointer;
typedef typename Iterator::reference reference;
};
template<class T>
struct iterator_traits<T*>
{
typedef random_access_iterator_tag iterator_category;
typedef T value_type;
typedef ptrdiff_t difference_type;
typedef T* pointer;
typedef T& reference;
};
template<class T>
struct iterator_traits<const T*>
{
typedef random_access_iterator_tag iterator_category;
typedef T value_type;
typedef ptrdiff_t difference_type;
typedef T* pointer;
typedef T& reference;
};
template<class Iterator>
inline typename iterator_traits<Iterator>::iterator_category
iterator_category(const Iterator&)
{
typedef typename iterator_traits<Iterator>::iterator_category category;
return category();
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
void advance(InputIterator p, Distance n)
{
assert(n != 0);
_advance(p, n, iterator_category(p));
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
void advance(InputIterator p, Distance n, forward_iterator_tag)
{
while (n--)p++;
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
void advance(InputIterator p, Distance n, random_access_iterator_tag)
{
p = p + n;
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
void advance(InputIterator p, Distance n, bidirectional_iterator_tag)
{
if (n > 0)
{
while (n != 0)
n--, p++;
}
else
{
while (n != 0)
n++, p--;
}
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
Distance distance(InputIterator a, InputIterator b)
{
return _distance(a, b, iterator_category(a));
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
Distance _distance(InputIterator a, InputIterator b, random_access_iterator_tag)
{
return b - a;
}
template<class InputIterator, class Distance = iterator_traits<InputIterator>::difference_type>
Distance _distance(InputIterator a, InputIterator b, forward_iterator_tag)
{
Distance cnt = 0;
while (a < b)
a++, cnt++;
return cnt;
}
//Itertor adaptors - inserter
template<class Container>
class back_inserter_iterator
{
private:
typedef back_inserter_iterator<Container> self;
public:
back_inserter_iterator(Container& rhs) :ptr(&rhs)
{
}
self& operator=(const typename Container::value_type& value)
{
ptr->push_back(value);
return *this;
}
self& operator++()
{
return *this;
}
self& operator++(int)
{
return *this;
}
self& operator*()
{
return *this;
}
private:
Container* ptr;
};
template<class Container>
back_inserter_iterator<Container> back_inserter(const Container& rhs)
{
return back_inserter_iterator<Container>(rhs);
}
template<class Container>
class inserter_iterator
{
private:
typedef inserter_iterator<Container> self;
typedef typename Container::iterator itername;
public:
inserter_iterator(Container& rhs1,itername& rhs2) :ptr(&rhs1),iter(rhs2)
{
}
self& operator=(const typename Container::value_type& value)
{
iter = ptr->insert(iter, value);
iter++;
return *this;
}
self& operator++()
{
return *this;
}
self& operator++(int)
{
return *this;
}
self& operator*()
{
return *this;
}
private:
Container* ptr;
itername iter;
};
//- stream iterator
/*
流迭代器可以把迭代器绑定到一个数据流对象上,在内部维护这个对象,
*/
template<class T>
class ostream_iterator
{
private:
typedef forward_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
typedef ostream_iterator<T> self;
public:
ostream_iterator(std::ostream& ss, const char* str) :stream(&ss), delim(str)
{
}
self& operator=(const T& value)
{
*stream << value;
if (delim != nullptr)
{
*stream << delim;
}
return *this;
}
self& operator++(int) { return *this; }
self& operator++() { return *this; }
self& operator*() { return *this; }
private:
std::ostream* stream;
const char* delim;
};
}
#endif