-
Notifications
You must be signed in to change notification settings - Fork 0
/
Map.h
286 lines (255 loc) · 4.77 KB
/
Map.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
275
276
277
278
279
280
281
282
283
284
285
286
#ifndef MAP_HPP
#define MAP_HPP
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <cassert>
#include <bitset>
#include "Iterable.h"
#define BIT_SIZE 8
template <class T>
class MapIterator
{
public:
typedef MapIterator self_type;
typedef T value_type;
typedef T& reference;
typedef T* pointer;
typedef std::forward_iterator_tag iterator_category;
typedef int difference_type;
MapIterator(std::vector<T>& d, int N)
:data(d), index(N)
{
}
MapIterator(const MapIterator<T>& obj)
:data(obj.data), index(obj.index)
{
}
self_type& operator=(const MapIterator<T>& obj)
{
data = obj.data;
index = obj.index;
return *this;
}
self_type operator++()
{
self_type i = *this;
index++;
return i;
}
self_type operator++(int junk)
{
index++;
return *this;
}
const reference operator*()
{
return data[index];
}
const pointer operator->()
{
return &data[index];
}
bool operator==(const self_type& rhs)
{
return index == rhs.index;
}
bool operator!=(const self_type& rhs)
{
return !(*this == rhs);
}
private:
std::vector<T>& data;
int index;
};
template <class T>
class ConstMapIterator
{
public:
typedef ConstMapIterator self_type;
typedef T value_type;
typedef T const& reference;
typedef T const* pointer;
typedef int difference_type;
typedef std::forward_iterator_tag iterator_category;
ConstMapIterator(const std::vector<T>& d, int N)
:data(d), index(N)
{
}
ConstMapIterator(const ConstMapIterator<T>& obj)
:data(obj.data), index(obj.index)
{
}
self_type operator++()
{
self_type i = *this;
index++;
return i;
}
self_type operator++(int junk)
{
index++;
return *this;
}
reference operator*()
{
return data[index];
}
pointer operator->()
{
return &data[index];
}
bool operator==(const self_type& rhs)
{
return index == rhs.index;
}
bool operator!=(const self_type& rhs)
{
return !(*this == rhs);
}
private:
const std::vector<T>& data;
int index;
};
template <class T>
class MapFilterIterator
{
public:
typedef MapFilterIterator self_type;
typedef T value_type;
typedef T const& reference;
typedef T* pointer;
typedef std::forward_iterator_tag iterator_category;
typedef int difference_type;
MapFilterIterator(const std::vector<T>& d, int N, bool(*predicate)(T))
: data(d), index(N)
{
this->predicate = predicate;
}
self_type operator++()
{
index++;
if (index == data.size())
return *this;
self_type i = *this;
while (!predicate(data[index]))
index++;
return i;
}
self_type operator++(int junk)
{
index++;
if (index == data.size())
return *this;
while (!predicate(data[index]))
index++;
return *this;
}
reference operator*()
{
if (index == data.size())
return data[0];
return data[index];
}
pointer operator->()
{
if (index == data.size())
return &data[0];
return &data[index];
}
bool operator==(const self_type& rhs)
{
return index == rhs.index;
}
bool operator!=(const self_type& rhs)
{
return !(*this == rhs);
}
private:
bool(*predicate)(T);
const std::vector<T>& data;
int index;
};
template <typename T>
struct Coords
{
T latitude;
T longitude;
Coords(T lat, T lon)
:latitude(lat), longitude(lon)
{}
bool operator==(const Coords<T>& cord) const
{
return latitude == cord.latitude && longitude == cord.longitude;
}
};
template <typename T>
struct Region
{
std::string name;
std::vector<Coords<T> > coords;
Region(std::string name, Coords<T> crd) :name(name)
{
this->coords.push_back(crd);
}
bool operator==(const Region<T>& reg)
{
return name == reg.name && coords == reg.coords;
}
};
template < typename T >
std::ostream& operator<<(std::ostream& out, const Region<T>& reg)
{
out << reg.name << std::endl;
for (std::vector<Coords<T> >::const_iterator it = reg.coords.begin();
it != reg.coords.end();
++it)
{
out << it->latitude << " " << it->longitude << "\n";
}
return out;
}
template <typename TRegion>
class Map : public Iterable<MapIterator<TRegion>, ConstMapIterator<TRegion>, MapFilterIterator<TRegion> >
{
private:
std::vector<TRegion> regions;
public:
typedef TRegion size_type;
typedef MapIterator<TRegion> iterator;
typedef ConstMapIterator<TRegion> const_iterator;
typedef MapFilterIterator<TRegion> filter_iterator;
Map()
{
}
Map(TRegion rgn)
{
this->regions.push_back(rgn);
}
void addRegion(TRegion rgn)
{
this->regions.push_back(rgn);
}
filter_iterator filter(bool(*predicate)(typename filter_iterator::value_type))
{
return filter_iterator(regions, 0, predicate);
}
iterator begin()
{
return iterator(regions, 0);
}
const_iterator begin() const
{
return const_iterator(regions, 0);
}
iterator end()
{
return iterator(regions, regions.size());
}
const_iterator end() const
{
return const_iterator(regions, regions.size());
}
};
#endif