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
|
#pragma once
#include "rect2d.hpp"
#include "point2d.hpp"
#include "../base/stl_add.hpp"
#include "../base/logging.hpp"
#include "../std/sstream.hpp"
#include "../std/kdtree.hpp"
namespace m4
{
template <typename T>
struct TraitsDef
{
m2::RectD const LimitRect(T const & t) const
{
return t.GetLimitRect();
}
};
template <class T, typename Traits = TraitsDef<T> >
class Tree
{
struct value_t
{
T m_val;
double m_pts[4];
typedef double value_type;
value_t(T const & t, m2::RectD const & r) : m_val(t)
{
m_pts[0] = r.minX();
m_pts[1] = r.minY();
m_pts[2] = r.maxX();
m_pts[3] = r.maxY();
}
bool IsIntersect(m2::RectD const & r) const
{
return !((m_pts[2] <= r.minX()) || (m_pts[0] >= r.maxX()) ||
(m_pts[3] <= r.minY()) || (m_pts[1] >= r.maxY()));
}
bool operator ==(value_t const & r) const
{
return (m_val == r.m_val);
}
string DebugPrint() const
{
ostringstream out;
out << DebugPrint(m_val) << ", ("
<< m_pts[0] << ", "
<< m_pts[1] << ", "
<< m_pts[2] << ", "
<< m_pts[3] << ")";
return out.str();
}
double operator[](size_t i) const { return m_pts[i]; }
m2::RectD GetRect() const { return m2::RectD(m_pts[0], m_pts[1], m_pts[2], m_pts[3]); }
};
typedef KDTree::KDTree<4, value_t> tree_t;
tree_t m_tree;
typedef vector<value_t const *> store_vec_t;
// Base do-class for rect-iteration in tree.
class for_each_base
{
protected:
m2::RectD const & m_rect;
public:
for_each_base(m2::RectD const & r) : m_rect(r)
{
}
bool ScanLeft(size_t plane, value_t const & v) const
{
switch (plane & 3) // % 4
{
case 2: return m_rect.minX() < v[2];
case 3: return m_rect.minY() < v[3];
default: return true;
}
}
bool ScanRight(size_t plane, value_t const & v) const
{
switch (plane & 3) // % 4
{
case 0: return m_rect.maxX() > v[0];
case 1: return m_rect.maxY() > v[1];
default: return true;
}
}
};
// Do-class for getting elements in rect.
class insert_if_intersect : public for_each_base
{
typedef for_each_base base_t;
store_vec_t & m_isect;
public:
insert_if_intersect(store_vec_t & isect, m2::RectD const & r)
: for_each_base(r), m_isect(isect)
{
}
void operator() (value_t const & v)
{
if (v.IsIntersect(base_t::m_rect))
m_isect.push_back(&v);
}
};
// Do-class for processing elements in rect.
template <class ToDo> class for_each_in_rect : public for_each_base
{
typedef for_each_base base_t;
ToDo & m_toDo;
public:
for_each_in_rect(ToDo & toDo, m2::RectD const & rect)
: for_each_base(rect), m_toDo(toDo)
{
}
void operator() (value_t const & v)
{
if (v.IsIntersect(base_t::m_rect))
m_toDo(v.m_val);
}
};
protected:
Traits m_traits;
m2::RectD GetLimitRect(T const & t) const { return m_traits.LimitRect(t); }
public:
Tree(Traits const & traits = Traits()) : m_traits(traits) {}
typedef T elem_t;
void Add(T const & obj)
{
Add(obj, GetLimitRect(obj));
}
void Add(T const & obj, m2::RectD const & rect)
{
m_tree.insert(value_t(obj, rect));
}
template <class TCompare>
void ReplaceIf(T const & obj, m2::RectD const & rect, TCompare comp)
{
store_vec_t isect;
m_tree.for_each(insert_if_intersect(isect, rect));
for (size_t i = 0; i < isect.size(); ++i)
if (!comp(obj, isect[i]->m_val))
return;
for (size_t i = 0; i < isect.size(); ++i)
m_tree.erase(*isect[i]);
Add(obj, rect);
}
void Erase(T const & obj, m2::RectD const & r)
{
value_t val(obj, r);
m_tree.erase_exact(val);
}
void Erase(T const & obj)
{
value_t val(obj, m_traits.LimitRect(obj));
m_tree.erase_exact(val);
}
template <class TCompare>
void ReplaceIf(T const & obj, TCompare comp)
{
ReplaceIf(obj, GetLimitRect(obj), comp);
}
template <class ToDo>
void ForEach(ToDo toDo) const
{
for (typename tree_t::const_iterator i = m_tree.begin(); i != m_tree.end(); ++i)
toDo((*i).m_val);
}
template <class ToDo>
void ForEachWithRect(ToDo toDo) const
{
for (typename tree_t::const_iterator i = m_tree.begin(); i != m_tree.end(); ++i)
toDo((*i).GetRect(), (*i).m_val);
}
template <class ToDo>
void ForEachInRect(m2::RectD const & rect, ToDo toDo) const
{
m_tree.for_each(for_each_in_rect<ToDo>(toDo, rect));
}
bool IsEmpty() const { return m_tree.empty(); }
size_t GetSize() const { return m_tree.size(); }
void Clear() { m_tree.clear(); }
string DebugPrint() const
{
ostringstream out;
for (typename tree_t::const_iterator it = m_tree.begin();
it != m_tree.end();
++it)
out << it->DebugPrint() << ", ";
return out.str();
}
};
template <typename T, typename Traits>
string DebugPrint(Tree<T, Traits> const & t)
{
return t.DebugPrint();
}
}
|
