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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
|
#include "storage/country_info_getter.hpp"
#include "storage/country.hpp"
#include "storage/country_polygon.hpp"
#include "platform/local_country_file_utils.hpp"
#include "coding/read_write_utils.hpp"
#include "geometry/latlon.hpp"
#include "geometry/mercator.hpp"
#include "geometry/region2d.hpp"
#include "base/logging.hpp"
#include "base/string_utils.hpp"
#include "3party/Alohalytics/src/alohalytics.h"
#include <functional>
#include <limits>
namespace storage
{
namespace
{
size_t const kInvalidId = std::numeric_limits<size_t>::max();
struct DoFreeCacheMemory
{
void operator()(std::vector<m2::RegionD> & v) const { std::vector<m2::RegionD>().swap(v); }
};
class DoCalcUSA
{
public:
DoCalcUSA(m2::RectD * rects) : m_rects(rects) {}
void operator()(CountryDef const & c)
{
if (c.m_countryId == "USA_Alaska")
m_rects[1] = c.m_rect;
else if (c.m_countryId == "USA_Hawaii")
m_rects[2] = c.m_rect;
else
m_rects[0].Add(c.m_rect);
}
private:
m2::RectD * const m_rects;
};
} // namespace
// CountryInfoGetterBase ---------------------------------------------------------------------------
TCountryId CountryInfoGetterBase::GetRegionCountryId(m2::PointD const & pt) const
{
TRegionId const id = FindFirstCountry(pt);
return id != kInvalidId ? m_countries[id].m_countryId : kInvalidCountryId;
}
bool CountryInfoGetterBase::IsBelongToRegions(m2::PointD const & pt,
TRegionIdSet const & regions) const
{
for (auto const & id : regions)
{
if (m_countries[id].m_rect.IsPointInside(pt) && IsBelongToRegionImpl(id, pt))
return true;
}
return false;
}
bool CountryInfoGetterBase::IsBelongToRegions(TCountryId const & countryId,
TRegionIdSet const & regions) const
{
for (auto const & id : regions)
{
if (m_countries[id].m_countryId == countryId)
return true;
}
return false;
}
void CountryInfoGetterBase::RegionIdsToCountryIds(TRegionIdSet const & regions,
TCountriesVec & countries) const
{
for (auto const & id : regions)
countries.push_back(m_countries[id].m_countryId);
}
CountryInfoGetterBase::TRegionId CountryInfoGetterBase::FindFirstCountry(m2::PointD const & pt) const
{
for (size_t id = 0; id < m_countries.size(); ++id)
{
if (m_countries[id].m_rect.IsPointInside(pt) && IsBelongToRegionImpl(id, pt))
return id;
}
return kInvalidId;
}
// CountryInfoGetter -------------------------------------------------------------------------------
vector<TCountryId> CountryInfoGetter::GetRegionsCountryIdByRect(m2::RectD const & rect, bool rough) const
{
size_t constexpr kAverageSize = 10;
std::vector<TCountryId> result;
result.reserve(kAverageSize);
for (size_t id = 0; id < m_countries.size(); ++id)
{
if (rect.IsRectInside(m_countries[id].m_rect))
{
result.push_back(m_countries[id].m_countryId);
}
else if (rect.IsIntersect(m_countries[id].m_rect))
{
if (rough || IsIntersectedByRegionImpl(id, rect))
result.push_back(m_countries[id].m_countryId);
}
}
return result;
}
void CountryInfoGetter::GetRegionsCountryId(m2::PointD const & pt, TCountriesVec & closestCoutryIds)
{
double const kLookupRadiusM = 30 /* km */ * 1000;
closestCoutryIds.clear();
m2::RectD const lookupRect = MercatorBounds::RectByCenterXYAndSizeInMeters(pt, kLookupRadiusM);
for (size_t id = 0; id < m_countries.size(); ++id)
{
if (m_countries[id].m_rect.IsIntersect(lookupRect) && IsCloseEnough(id, pt, kLookupRadiusM))
closestCoutryIds.emplace_back(m_countries[id].m_countryId);
}
}
void CountryInfoGetter::GetRegionInfo(m2::PointD const & pt, CountryInfo & info) const
{
TRegionId const id = FindFirstCountry(pt);
if (id != kInvalidId)
GetRegionInfo(m_countries[id].m_countryId, info);
}
void CountryInfoGetter::GetRegionInfo(TCountryId const & countryId, CountryInfo & info) const
{
auto const it = m_id2info.find(countryId);
if (it == m_id2info.end())
return;
info = it->second;
if (info.m_name.empty())
info.m_name = countryId;
CountryInfo::FileName2FullName(info.m_name);
}
void CountryInfoGetter::CalcUSALimitRect(m2::RectD rects[3]) const
{
ForEachCountry("USA_", DoCalcUSA(rects));
}
m2::RectD CountryInfoGetter::CalcLimitRect(string const & prefix) const
{
m2::RectD rect;
ForEachCountry(prefix, [&rect](CountryDef const & c)
{
rect.Add(c.m_rect);
});
return rect;
}
m2::RectD CountryInfoGetter::GetLimitRectForLeaf(TCountryId const & leafCountryId) const
{
auto const it = this->m_countryIndex.find(leafCountryId);
ASSERT(it != this->m_countryIndex.end(), ());
ASSERT_LESS(it->second, this->m_countries.size(), ());
return m_countries[it->second].m_rect;
}
void CountryInfoGetter::GetMatchedRegions(string const & affiliation, TRegionIdSet & regions) const
{
CHECK(m_affiliations, ());
auto it = m_affiliations->find(affiliation);
if (it == m_affiliations->end())
return;
for (size_t i = 0; i < m_countries.size(); ++i)
{
if (binary_search(it->second.begin(), it->second.end(), m_countries[i].m_countryId))
regions.push_back(i);
}
}
void CountryInfoGetter::InitAffiliationsInfo(TMappingAffiliations const * affiliations)
{
m_affiliations = affiliations;
}
template <typename ToDo>
void CountryInfoGetter::ForEachCountry(string const & prefix, ToDo && toDo) const
{
for (auto const & country : m_countries)
{
if (strings::StartsWith(country.m_countryId, prefix.c_str()))
toDo(country);
}
}
// CountryInfoReader -------------------------------------------------------------------------------
// static
unique_ptr<CountryInfoGetter> CountryInfoReader::CreateCountryInfoReader(Platform const & platform)
{
try
{
CountryInfoReader * result = new CountryInfoReader(platform.GetReader(PACKED_POLYGONS_FILE),
platform.GetReader(COUNTRIES_FILE));
return unique_ptr<CountryInfoReader>(result);
}
catch (RootException const & e)
{
LOG(LCRITICAL, ("Can't load needed resources for storage::CountryInfoGetter:", e.Msg()));
}
return unique_ptr<CountryInfoReader>();
}
// static
unique_ptr<CountryInfoGetter> CountryInfoReader::CreateCountryInfoReaderObsolete(
Platform const & platform)
{
try
{
CountryInfoReader * result = new CountryInfoReader(platform.GetReader(PACKED_POLYGONS_OBSOLETE_FILE),
platform.GetReader(COUNTRIES_OBSOLETE_FILE));
return unique_ptr<CountryInfoReader>(result);
}
catch (RootException const & e)
{
LOG(LCRITICAL, ("Can't load needed resources for storage::CountryInfoGetter:", e.Msg()));
}
return unique_ptr<CountryInfoReader>();
}
CountryInfoReader::CountryInfoReader(ModelReaderPtr polyR, ModelReaderPtr countryR)
: CountryInfoGetter(true), m_reader(polyR), m_cache(3)
{
ReaderSource<ModelReaderPtr> src(m_reader.GetReader(PACKED_POLYGONS_INFO_TAG));
rw::Read(src, m_countries);
size_t const countrySz = m_countries.size();
m_countryIndex.reserve(countrySz);
for (size_t i = 0; i < countrySz; ++i)
m_countryIndex[m_countries[i].m_countryId] = i;
string buffer;
countryR.ReadAsString(buffer);
LoadCountryFile2CountryInfo(buffer, m_id2info, m_isSingleMwm);
}
void CountryInfoReader::ClearCachesImpl() const
{
std::lock_guard<std::mutex> lock(m_cacheMutex);
m_cache.ForEachValue(DoFreeCacheMemory());
m_cache.Reset();
}
template <typename TFn>
std::result_of_t<TFn(vector<m2::RegionD>)> CountryInfoReader::WithRegion(size_t id, TFn && fn) const
{
std::lock_guard<std::mutex> lock(m_cacheMutex);
bool isFound = false;
std::vector<m2::RegionD> & rgns = m_cache.Find(static_cast<uint32_t>(id), isFound);
if (!isFound)
{
rgns.clear();
// Load regions from file.
ReaderSource<ModelReaderPtr> src(m_reader.GetReader(strings::to_string(id)));
uint32_t const count = ReadVarUint<uint32_t>(src);
for (size_t i = 0; i < count; ++i)
{
std::vector<m2::PointD> points;
serial::LoadOuterPath(src, serial::GeometryCodingParams(), points);
rgns.emplace_back(move(points));
}
}
return fn(rgns);
}
bool CountryInfoReader::IsBelongToRegionImpl(size_t id, m2::PointD const & pt) const
{
auto contains = [&pt](std::vector<m2::RegionD> const & regions) {
for (auto const & region : regions)
{
if (region.Contains(pt))
return true;
}
return false;
};
return WithRegion(id, contains);
}
bool CountryInfoReader::IsIntersectedByRegionImpl(size_t id, m2::RectD const & rect) const
{
std::vector<pair<m2::PointD, m2::PointD>> edges = {{rect.LeftTop(), rect.RightTop()},
{rect.RightTop(), rect.RightBottom()},
{rect.RightBottom(), rect.LeftBottom()},
{rect.LeftBottom(), rect.LeftTop()}};
auto contains = [&edges](std::vector<m2::RegionD> const & regions) {
for (auto const & region : regions)
{
for (auto const & edge : edges)
{
m2::PointD result;
if (region.FindIntersection(edge.first, edge.second, result))
return true;
}
}
return false;
};
if (WithRegion(id, contains))
return true;
return IsBelongToRegionImpl(id, rect.Center());
}
bool CountryInfoReader::IsCloseEnough(size_t id, m2::PointD const & pt, double distance)
{
m2::RectD const lookupRect = MercatorBounds::RectByCenterXYAndSizeInMeters(pt, distance);
auto isCloseEnough = [&](std::vector<m2::RegionD> const & regions) {
for (auto const & region : regions)
{
if (region.Contains(pt) || region.AtBorder(pt, lookupRect.SizeX() / 2))
return true;
}
return false;
};
return WithRegion(id, isCloseEnough);
}
// CountryInfoGetterForTesting ---------------------------------------------------------------------
CountryInfoGetterForTesting::CountryInfoGetterForTesting(std::vector<CountryDef> const & countries)
: CountryInfoGetter(true)
{
for (auto const & country : countries)
AddCountry(country);
}
void CountryInfoGetterForTesting::AddCountry(CountryDef const & country)
{
m_countries.push_back(country);
string const & name = country.m_countryId;
m_id2info[name].m_name = name;
}
void CountryInfoGetterForTesting::GetMatchedRegions(string const & affiliation,
TRegionIdSet & regions) const
{
for (size_t i = 0; i < m_countries.size(); ++i)
{
if (m_countries[i].m_countryId == affiliation)
regions.push_back(i);
}
}
void CountryInfoGetterForTesting::ClearCachesImpl() const {}
bool CountryInfoGetterForTesting::IsBelongToRegionImpl(size_t id,
m2::PointD const & pt) const
{
CHECK_LESS(id, m_countries.size(), ());
return m_countries[id].m_rect.IsPointInside(pt);
}
bool CountryInfoGetterForTesting::IsIntersectedByRegionImpl(size_t id, m2::RectD const & rect) const
{
CHECK_LESS(id, m_countries.size(), ());
return rect.IsIntersect(m_countries[id].m_rect);
}
bool CountryInfoGetterForTesting::IsCloseEnough(size_t id, m2::PointD const & pt, double distance)
{
CHECK_LESS(id, m_countries.size(), ());
m2::RegionD rgn;
rgn.AddPoint(m_countries[id].m_rect.LeftTop());
rgn.AddPoint(m_countries[id].m_rect.RightTop());
rgn.AddPoint(m_countries[id].m_rect.RightBottom());
rgn.AddPoint(m_countries[id].m_rect.LeftBottom());
rgn.AddPoint(m_countries[id].m_rect.LeftTop());
m2::RectD const lookupRect = MercatorBounds::RectByCenterXYAndSizeInMeters(pt, distance);
return rgn.Contains(pt) || rgn.AtBorder(pt, lookupRect.SizeX() / 2);
}
} // namespace storage
|