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
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
|
#include "search_index_builder.hpp"
#include "feature_utils.hpp"
#include "features_vector.hpp"
#include "search_delimiters.hpp"
#include "search_trie.hpp"
#include "search_string_utils.hpp"
#include "string_file.hpp"
#include "classificator.hpp"
#include "feature_visibility.hpp"
#include "categories_holder.hpp"
#include "../defines.hpp"
#include "../platform/platform.hpp"
#include "../coding/trie_builder.hpp"
#include "../coding/writer.hpp"
#include "../coding/reader_writer_ops.hpp"
#include "../base/string_utils.hpp"
#include "../base/logging.hpp"
#include "../std/algorithm.hpp"
#include "../std/vector.hpp"
namespace
{
struct FeatureNameInserter
{
StringsFile & m_names;
StringsFile::ValueT m_val;
FeatureNameInserter(StringsFile & names) : m_names(names) {}
void AddToken(signed char lang, strings::UniString const & s) const
{
m_names.AddString(StringsFile::StringT(s, lang, m_val));
}
bool operator()(signed char lang, string const & name) const
{
strings::UniString const uniName = search::NormalizeAndSimplifyString(name);
buffer_vector<strings::UniString, 32> tokens;
SplitUniString(uniName, MakeBackInsertFunctor(tokens), search::Delimiters());
/// @todo MAX_TOKENS = 32, in Query::Search we use 31 + prefix. Why 30 ???
if (tokens.size() > 30)
{
LOG(LWARNING, ("Name has too many tokens:", name));
tokens.resize(30);
}
for (size_t i = 0; i < tokens.size(); ++i)
AddToken(lang, tokens[i]);
return true;
}
};
class FeatureInserter
{
StringsFile & m_names;
CategoriesHolder const & m_categories;
typedef StringsFile::ValueT ValueT;
typedef search::trie::ValueReader SaverT;
SaverT m_valueSaver;
pair<int, int> m_scales;
class CalcPolyCenter
{
typedef m2::PointD P;
struct Value
{
Value(P const & p, double l) : m_p(p), m_len(l) {}
bool operator< (Value const & r) const { return (m_len < r.m_len); }
P m_p;
double m_len;
};
vector<Value> m_poly;
double m_length;
public:
CalcPolyCenter() : m_length(0.0) {}
void operator() (CoordPointT const & pt)
{
m2::PointD p(pt.first, pt.second);
m_length += (m_poly.empty() ? 0.0 : m_poly.back().m_p.Length(p));
m_poly.push_back(Value(p, m_length));
}
P GetCenter() const
{
typedef vector<Value>::const_iterator IterT;
double const l = m_length / 2.0;
IterT e = lower_bound(m_poly.begin(), m_poly.end(), Value(m2::PointD(0, 0), l));
if (e == m_poly.begin())
{
/// @todo It's very strange, but we have linear objects with zero length.
LOG(LWARNING, ("Zero length linear object"));
return e->m_p;
}
IterT b = e-1;
double const f = (l - b->m_len) / (e->m_len - b->m_len);
// For safety reasons (floating point calculations) do comparison instead of ASSERT.
if (0.0 <= f && f <= 1.0)
return (b->m_p * (1-f) + e->m_p * f);
else
return ((b->m_p + e->m_p) / 2.0);
}
};
class CalcMassCenter
{
typedef m2::PointD P;
P m_center;
size_t m_count;
public:
CalcMassCenter() : m_center(0.0, 0.0), m_count(0) {}
void operator() (P const & p1, P const & p2, P const & p3)
{
++m_count;
m_center += p1;
m_center += p2;
m_center += p3;
}
P GetCenter() const { return m_center / (3*m_count); }
};
m2::PointD GetCenter(FeatureType const & f) const
{
feature::EGeomType const type = f.GetFeatureType();
switch (type)
{
case feature::GEOM_POINT:
return f.GetCenter();
case feature::GEOM_LINE:
{
CalcPolyCenter doCalc;
f.ForEachPointRef(doCalc, FeatureType::BEST_GEOMETRY);
return doCalc.GetCenter();
}
default:
{
ASSERT_EQUAL ( type, feature::GEOM_AREA, () );
CalcMassCenter doCalc;
f.ForEachTriangleRef(doCalc, FeatureType::BEST_GEOMETRY);
return doCalc.GetCenter();
}
}
}
void MakeValue(FeatureType const & f, feature::TypesHolder const & types,
uint64_t pos, ValueT & value) const
{
SaverT::ValueType v;
v.m_featureId = static_cast<uint32_t>(pos);
// get BEST geometry rect of feature
v.m_pt = GetCenter(f);
v.m_rank = feature::GetSearchRank(types, v.m_pt, f.GetPopulation());
// write to buffer
PushBackByteSink<ValueT> sink(value);
m_valueSaver.Save(sink, v);
}
/// There are 3 different ways of search index skipping: \n
/// - skip features in any case (m_skipFeatures) \n
/// - skip features with empty names (m_enFeature) \n
/// - skip specified types for features with empty names (m_enTypes) \n
class SkipIndexing
{
/// Array index (0, 1) means type level for checking (1, 2).
vector<uint32_t> m_enFeature[2];
template <size_t count, size_t ind>
void FillEnFeature(char const * (& arr)[count][ind])
{
STATIC_ASSERT ( count > 0 );
STATIC_ASSERT ( ind > 0 );
Classificator const & c = classif();
m_enFeature[ind-1].reserve(count);
for (size_t i = 0; i < count; ++i)
{
vector<string> v(arr[i], arr[i] + ind);
m_enFeature[ind-1].push_back(c.GetTypeByPath(v));
}
}
vector<uint32_t> m_skipFeatures, m_enTypes;
template <size_t count, size_t ind>
static void FillTypes(char const * (& arr)[count][ind], vector<uint32_t> & dest)
{
STATIC_ASSERT ( count > 0 );
STATIC_ASSERT ( ind > 0 );
Classificator const & c = classif();
for (size_t i = 0; i < count; ++i)
{
vector<string> v(arr[i], arr[i] + ind);
dest.push_back(c.GetTypeByPath(v));
}
}
public:
SkipIndexing()
{
// Get features which shoud be skipped in any case.
char const * arrSkip2[][2] = {
{ "building", "address" }
};
FillTypes(arrSkip2, m_skipFeatures);
// Get features which shoud be skipped without names.
char const * arrEnFeature1[][1] = {
{ "highway" }, { "natural" }, { "waterway"}, { "landuse" }
};
char const * arrEnFeature2[][2] = {
{ "place", "city" },
{ "place", "town" },
{ "place", "county" },
{ "place", "state" },
{ "place", "region" },
{ "railway", "rail" }
};
FillEnFeature(arrEnFeature1);
FillEnFeature(arrEnFeature2);
// Get types which shoud be skipped for features without names.
char const * arrEnTypes1[][1] = { { "building" } };
FillTypes(arrEnTypes1, m_enTypes);
}
bool SkipFeature(feature::TypesHolder const & types) const
{
for (size_t i = 0; i < m_skipFeatures.size(); ++i)
if (types.Has(m_skipFeatures[i]))
return true;
return false;
}
bool SkipEmptyNameFeature(feature::TypesHolder const & types) const
{
for (size_t i = 0; i < types.Size(); ++i)
for (size_t j = 0; j < ARRAY_SIZE(m_enFeature); ++j)
{
uint32_t type = types[i];
ftype::TruncValue(type, j+1);
if (find(m_enFeature[j].begin(), m_enFeature[j].end(), type) != m_enFeature[j].end())
return true;
}
return false;
}
void SkipEmptyNameTypes(feature::TypesHolder & types)
{
for (size_t i = 0; i < m_enTypes.size(); ++i)
types.Remove(m_enTypes[i]);
}
};
public:
FeatureInserter(StringsFile & names,
CategoriesHolder const & catHolder,
serial::CodingParams const & cp,
pair<int, int> const & scales)
: m_names(names), m_categories(catHolder), m_valueSaver(cp), m_scales(scales)
{
}
void operator() (FeatureType const & f, uint64_t pos) const
{
feature::TypesHolder types(f);
static SkipIndexing skipIndex;
if (skipIndex.SkipFeature(types))
{
// Do not add this features in any case.
return;
}
// init inserter with serialized value
FeatureNameInserter inserter(m_names);
MakeValue(f, types, pos, inserter.m_val);
// add names of the feature
if (!f.ForEachNameRef(inserter))
{
if (skipIndex.SkipEmptyNameFeature(types))
{
// Do not add features without names to index.
return;
}
// Skip types for features without names.
skipIndex.SkipEmptyNameTypes(types);
}
if (types.Empty()) return;
// add names of categories of the feature
for (size_t i = 0; i < types.Size(); ++i)
{
uint32_t type = types[i];
// Leave only 2 level of type - for example, do not distinguish:
// highway-primary-oneway or amenity-parking-fee.
ftype::TruncValue(type, 2);
// Push to index only categorized types.
if (!m_categories.IsTypeExist(type))
continue;
// Do index only for visible types in mwm.
pair<int, int> const r = feature::GetDrawableScaleRange(type);
if (my::between_s(m_scales.first, m_scales.second, r.first) ||
my::between_s(m_scales.first, m_scales.second, r.second))
{
inserter.AddToken(search::CATEGORIES_LANG, search::FeatureTypeToString(type));
}
}
}
};
void BuildSearchIndex(FilesContainerR const & cont, CategoriesHolder const & catHolder,
Writer & writer, string const & tmpFilePath)
{
{
feature::DataHeader header;
header.Load(cont.GetReader(HEADER_FILE_TAG));
FeaturesVector featuresV(cont, header);
serial::CodingParams cp(search::GetCPForTrie(header.GetDefCodingParams()));
StringsFile names(tmpFilePath);
featuresV.ForEachOffset(FeatureInserter(names, catHolder, cp, header.GetScaleRange()));
names.EndAdding();
names.OpenForRead();
trie::Build(writer, names.Begin(), names.End(), trie::builder::EmptyEdgeBuilder());
// at this point all readers of StringsFile should be dead
}
FileWriter::DeleteFileX(tmpFilePath);
}
}
bool indexer::BuildSearchIndexFromDatFile(string const & fName, bool forceRebuild)
{
LOG(LINFO, ("Start building search index. Bits = ", search::POINT_CODING_BITS));
try
{
Platform & pl = GetPlatform();
string const datFile = pl.WritablePathForFile(fName);
string const tmpFile = pl.WritablePathForFile(fName + ".search_index_2.tmp");
{
FilesContainerR readCont(datFile);
if (!forceRebuild && readCont.IsReaderExist(SEARCH_INDEX_FILE_TAG))
return true;
FileWriter writer(tmpFile);
CategoriesHolder catHolder(pl.GetReader(SEARCH_CATEGORIES_FILE_NAME));
BuildSearchIndex(readCont, catHolder, writer,
pl.WritablePathForFile(fName + ".search_index_1.tmp"));
LOG(LINFO, ("Search index size = ", writer.Size()));
}
{
// Write to container in reversed order.
FilesContainerW writeCont(datFile, FileWriter::OP_WRITE_EXISTING);
FileWriter writer = writeCont.GetWriter(SEARCH_INDEX_FILE_TAG);
rw_ops::Reverse(FileReader(tmpFile), writer);
}
FileWriter::DeleteFileX(tmpFile);
}
catch (Reader::Exception const & e)
{
LOG(LERROR, ("Error while reading file: ", e.what()));
return false;
}
catch (Writer::Exception const & e)
{
LOG(LERROR, ("Error writing index file: ", e.what()));
return false;
}
LOG(LINFO, ("End building search index."));
return true;
}
|