Welcome to mirror list, hosted at ThFree Co, Russian Federation.

feature_builder.cpp « generator - github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 7e06547b74804a5bb91b33143066c4f2eb2f8cad (plain)
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
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
#include "feature_builder.hpp"

#include "../indexer/feature_impl.hpp"
#include "../indexer/feature_visibility.hpp"
#include "../indexer/geometry_serialization.hpp"
#include "../indexer/coding_params.hpp"

#include "../geometry/region2d.hpp"

#include "../coding/byte_stream.hpp"

#include "../base/logging.hpp"


using namespace feature;

///////////////////////////////////////////////////////////////////////////////////////////////////
// FeatureBuilder1 implementation
///////////////////////////////////////////////////////////////////////////////////////////////////

FeatureBuilder1::FeatureBuilder1()
: m_coastCell(-1)
{
  m_Polygons.push_back(points_t());
}

bool FeatureBuilder1::IsGeometryClosed() const
{
  points_t const & poly = GetGeometry();
  return (poly.size() > 2 && poly.front() == poly.back());
}

m2::PointD FeatureBuilder1::GetGeometryCenter() const
{
  ASSERT ( IsGeometryClosed(), () );
  m2::PointD ret(0.0, 0.0);

  points_t const & poly = GetGeometry();
  size_t const count = poly.size();
  for (size_t i = 0; i < count; ++i)
    ret += poly[i];
  return (ret / count);
}

void FeatureBuilder1::SetCenter(m2::PointD const & p)
{
  m_Center = p;
  m_Params.SetGeomType(GEOM_POINT);
  m_LimitRect.Add(p);
}

void FeatureBuilder1::AddPoint(m2::PointD const & p)
{
  m_Polygons.front().push_back(p);
  m_LimitRect.Add(p);
}

void FeatureBuilder1::SetAreaAddHoles(list<points_t> const & holes)
{
  m_Params.SetGeomType(GEOM_AREA);
  m_Polygons.resize(1);

  if (holes.empty()) return;

  points_t const & poly = GetGeometry();
  m2::Region<m2::PointD> rgn(poly.begin(), poly.end());

  for (list<points_t>::const_iterator i = holes.begin(); i != holes.end(); ++i)
  {
    ASSERT ( !i->empty(), (*this) );

    size_t j = 0;
    size_t const count = i->size();
    for (; j < count; ++j)
      if (!rgn.Contains((*i)[j]))
        break;

    if (j == count)
      m_Polygons.push_back(*i);
  }
}

void FeatureBuilder1::AddPolygon(vector<m2::PointD> & poly)
{
  // check for closing
  if (poly.size() < 3) return;
  if (poly.front() != poly.back())
    poly.push_back(poly.front());

  CalcRect(poly, m_LimitRect);

  if (!m_Polygons.back().empty())
    m_Polygons.push_back(points_t());

  m_Polygons.back().swap(poly);
}

void FeatureBuilder1::DoCorrectForType(EGeomType type)
{
  if (m_Params.GetGeomType() == type &&
      !IsDrawableLike(m_Params.m_Types, static_cast<FeatureGeoType>(type)))
  {
    m_Params.RemoveGeomType(type);
  }
}

bool FeatureBuilder1::DoCorrect()
{
  DoCorrectForType(GEOM_AREA);
  DoCorrectForType(GEOM_LINE);

  return (m_Params.GetGeomType() != GEOM_UNDEFINED);
}

FeatureBase FeatureBuilder1::GetFeatureBase() const
{
  CHECK ( CheckValid(), (*this) );

  FeatureBase f;
  f.SetHeader(m_Params.GetHeader());

  f.m_Params = m_Params;
  memcpy(f.m_Types, &m_Params.m_Types[0], sizeof(uint32_t) * m_Params.m_Types.size());
  f.m_LimitRect = m_LimitRect;

  f.m_bTypesParsed = f.m_bCommonParsed = true;

  return f;
}

namespace
{
  bool is_equal(double d1, double d2)
  {
    //return my::AlmostEqual(d1, d2, 100000000);
    return (fabs(d1 - d2) < MercatorBounds::GetCellID2PointAbsEpsilon());
  }

  bool is_equal(m2::PointD const & p1, m2::PointD const & p2)
  {
    return p1.EqualDxDy(p2, MercatorBounds::GetCellID2PointAbsEpsilon());
  }

  bool is_equal(m2::RectD const & r1, m2::RectD const & r2)
  {
    return (is_equal(r1.minX(), r2.minX()) &&
            is_equal(r1.minY(), r2.minY()) &&
            is_equal(r1.maxX(), r2.maxX()) &&
            is_equal(r1.maxY(), r2.maxY()));
  }

  bool is_equal(vector<m2::PointD> const & v1, vector<m2::PointD> const & v2)
  {
    if (v1.size() != v2.size())
      return false;

    for (size_t i = 0; i < v1.size(); ++i)
      if (!is_equal(v1[i], v2[i]))
        return false;

    return true;
  }
}

bool FeatureBuilder1::PreSerialize()
{
  if (!m_Params.IsValid()) return false;

  switch (m_Params.GetGeomType())
  {
  case GEOM_POINT:
    // If we don't have name and have house number, than replace them.
    if (m_Params.name.IsEmpty() && !m_Params.house.IsEmpty())
      m_Params.name.AddString(0, m_Params.house.Get());

    // We need refs for motorway's junctions. Try to update name always, not only for junctions.
    // if (feature::IsJunction(m_Params.m_Types)) { ... }
    if (m_Params.name.IsEmpty() && !m_Params.ref.empty())
      m_Params.name.AddString(0, m_Params.ref);

    m_Params.house.Clear();
    m_Params.ref.clear();
    break;

  case GEOM_LINE:
  {
    static feature::TypeSetChecker checkHighway("highway");

    // We need refs for road's numbers.
    if (!checkHighway.IsEqualV(m_Params.m_Types))
      m_Params.ref = string();

    m_Params.rank = 0;
    m_Params.house.Clear();
    break;
  }

  case GEOM_AREA:
    m_Params.rank = 0;
    m_Params.ref.clear();
    break;

  default:
    return false;
  }

  // Clear name for features with invisible texts.
  int64_t dummy;
  if (!m_Params.name.IsEmpty() && !GetCoastCell(dummy) &&
      (GetDrawableScaleRangeForRules(GetFeatureBase(), RULE_TEXT).first == -1))
  {
    m_Params.name.Clear();
  }

  return true;
}

bool FeatureBuilder1::operator == (FeatureBuilder1 const & fb) const
{
  if (!(m_Params == fb.m_Params)) return false;

  if (m_coastCell != fb.m_coastCell) return false;

  if (m_Params.GetGeomType() == GEOM_POINT &&
      !is_equal(m_Center, fb.m_Center))
  {
    return false;
  }

  if (!is_equal(m_LimitRect, fb.m_LimitRect))
  {
    //LOG(LERROR, ("Different rects: ", m_LimitRect, fb.m_LimitRect));
    return false;
  }

  if (m_Polygons.size() != fb.m_Polygons.size())
    return false;

  list<points_t>::const_iterator i = m_Polygons.begin();
  list<points_t>::const_iterator j = fb.m_Polygons.begin();
  for (; i != m_Polygons.end(); ++i, ++j)
    if (!is_equal(*i, *j))
    {
      //LOG(LERROR, ("Different points: ", *i, *j));
      return false;
    }

  return true;
}

bool FeatureBuilder1::CheckValid() const
{
  CHECK(m_Params.CheckValid(), (*this));

  EGeomType const type = m_Params.GetGeomType();
  CHECK ( type != GEOM_UNDEFINED, (*this) );

  points_t const & poly = GetGeometry();

  if (type == GEOM_LINE)
    CHECK(poly.size() >= 2, (*this));

  if (type == GEOM_AREA)
  {
    for (list<points_t>::const_iterator i = m_Polygons.begin(); i != m_Polygons.end(); ++i)
      CHECK(i->size() >= 3, (*this));
  }

  return true;
}

void FeatureBuilder1::SerializeBase(buffer_t & data, serial::CodingParams const & params) const
{
  PushBackByteSink<buffer_t> sink(data);

  m_Params.Write(sink);

  if (m_Params.GetGeomType() == GEOM_POINT)
    serial::SavePoint(sink, m_Center, params);
}

void FeatureBuilder1::Serialize(buffer_t & data) const
{
  CHECK ( CheckValid(), (*this) );

  data.clear();

  serial::CodingParams cp;

  SerializeBase(data, cp);

  PushBackByteSink<buffer_t> sink(data);

  if (m_Params.GetGeomType() != GEOM_POINT)
  {
    WriteVarUint(sink, static_cast<uint32_t>(m_Polygons.size()));

    for (list<points_t>::const_iterator i = m_Polygons.begin(); i != m_Polygons.end(); ++i)
      serial::SaveOuterPath(*i, cp, sink);
  }

  WriteVarInt(sink, m_coastCell);

  // check for correct serialization
#ifdef DEBUG
  buffer_t tmp(data);
  FeatureBuilder1 fb;
  fb.Deserialize(tmp);
  ASSERT ( fb == *this, ("Source feature: ", *this, "Deserialized feature: ", fb) );
#endif
}

void FeatureBuilder1::Deserialize(buffer_t & data)
{
  serial::CodingParams cp;

  ArrayByteSource source(&data[0]);
  m_Params.Read(source);

  m_LimitRect.MakeEmpty();

  EGeomType const type = m_Params.GetGeomType();
  if (type == GEOM_POINT)
  {
    m_Center = serial::LoadPoint(source, cp);
    m_LimitRect.Add(m_Center);
    return;
  }

  m_Polygons.clear();
  uint32_t const count = ReadVarUint<uint32_t>(source);
  ASSERT_GREATER ( count, 0, (*this) );

  for (uint32_t i = 0; i < count; ++i)
  {
    m_Polygons.push_back(points_t());
    serial::LoadOuterPath(source, cp, m_Polygons.back());
    CalcRect(m_Polygons.back(), m_LimitRect);
  }

  m_coastCell = ReadVarInt<int64_t>(source);

  CHECK ( CheckValid(), (*this) );
}

void FeatureBuilder1::AddOsmId(string const & type, uint64_t osmId)
{
  m_osmIds.push_back(osm::OsmId(type, osmId));
}

string FeatureBuilder1::GetOsmIdsString() const
{
  ostringstream out;
  for (size_t i = 0; i < m_osmIds.size(); ++i)
    out << m_osmIds[i].Type() << " id=" << m_osmIds[i].Id() << " ";
  return out.str();
}

int FeatureBuilder1::GetMinFeatureDrawScale() const
{
  int const minScale = feature::GetMinDrawableScale(GetFeatureBase());

  // some features become invisible after merge processing, so -1 is possible
  return (minScale == -1 ? 1000 : minScale);
}

void FeatureBuilder1::SetCoastCell(int64_t iCell, string const & strCell)
{
  m_coastCell = iCell;

  ASSERT ( m_Params.name.IsEmpty(), () );
  m_Params.name.AddString(0, strCell);
}

string DebugPrint(FeatureBuilder1 const & f)
{
  ostringstream out;

  switch (f.GetGeomType())
  {
  case GEOM_POINT: out << DebugPrint(f.m_Center); break;
  case GEOM_LINE: out << "line with " << f.GetPointsCount() << " points"; break;
  case GEOM_AREA: out << "area with " << f.GetPointsCount() << " points"; break;
  default:
    out << "ERROR: unknown geometry type"; break;
  }

  return (out.str() + " " +
          DebugPrint(f.m_LimitRect) + " " +
          DebugPrint(f.m_Params) + " " +
          DebugPrint(f.m_Polygons)
          );
}

///////////////////////////////////////////////////////////////////////////////////////////////////
// FeatureBuilderGeomRef implementation
///////////////////////////////////////////////////////////////////////////////////////////////////

bool FeatureBuilder2::IsDrawableInRange(int lowS, int highS) const
{
  if (!GetGeometry().empty())
  {
    FeatureBase const fb = GetFeatureBase();

    while (lowS <= highS)
      if (feature::IsDrawableForIndex(fb, lowS++))
        return true;
  }

  return false;
}

bool FeatureBuilder2::PreSerialize(buffers_holder_t const & data)
{
  // make flags actual before header serialization
  if (data.m_ptsMask == 0 && data.m_innerPts.empty())
    m_Params.RemoveGeomType(GEOM_LINE);

  if (data.m_trgMask == 0 && data.m_innerTrg.empty())
    m_Params.RemoveGeomType(GEOM_AREA);

  // we don't need empty features without geometry
  return base_type::PreSerialize();
}

namespace
{
  template <class TSink> class BitSink
  {
    TSink & m_sink;
    uint8_t m_pos;
    uint8_t m_current;

  public:
    BitSink(TSink & sink) : m_sink(sink), m_pos(0), m_current(0) {}

    void Finish()
    {
      if (m_pos > 0)
      {
        WriteToSink(m_sink, m_current);
        m_pos = 0;
        m_current = 0;
      }
    }

    void Write(uint8_t value, uint8_t count)
    {
      ASSERT_LESS ( count, 9, () );
      ASSERT_EQUAL ( value >> count, 0, () );

      if (m_pos + count > 8)
        Finish();

      m_current |= (value << m_pos);
      m_pos += count;
    }
  };
}

void FeatureBuilder2::Serialize(buffers_holder_t & data, serial::CodingParams const & params)
{
  data.m_buffer.clear();

  // header data serialization
  SerializeBase(data.m_buffer, params);

  PushBackByteSink<buffer_t> sink(data.m_buffer);

  uint8_t const ptsCount = static_cast<uint8_t>(data.m_innerPts.size());
  uint8_t trgCount = static_cast<uint8_t>(data.m_innerTrg.size());
  if (trgCount > 0)
  {
    ASSERT_GREATER ( trgCount, 2, () );
    trgCount -= 2;
  }

  BitSink< PushBackByteSink<buffer_t> > bitSink(sink);

  uint8_t const h = m_Params.GetTypeMask();

  if (h & HEADER_GEOM_LINE)
  {
    bitSink.Write(ptsCount, 4);
    if (ptsCount == 0)
      bitSink.Write(data.m_ptsMask, 4);
  }

  if (h & HEADER_GEOM_AREA)
  {
    bitSink.Write(trgCount, 4);
    if (trgCount == 0)
      bitSink.Write(data.m_trgMask, 4);
  }

  bitSink.Finish();

  if (h & HEADER_GEOM_LINE)
  {
    if (ptsCount > 0)
    {
      if (ptsCount > 2)
      {
        uint32_t v = data.m_ptsSimpMask;
        int const count = (ptsCount - 2 + 3) / 4;
        for (int i = 0; i < count; ++i)
        {
          WriteToSink(sink, static_cast<uint8_t>(v));
          v >>= 8;
        }
      }

      serial::SaveInnerPath(data.m_innerPts, params, sink);
    }
    else
    {
      ASSERT_GREATER ( GetGeometry().size(), 2, () );

      // Store first point once for outer linear features.
      serial::SavePoint(sink, GetGeometry()[0], params);

      // offsets was pushed from high scale index to low
      reverse(data.m_ptsOffset.begin(), data.m_ptsOffset.end());
      serial::WriteVarUintArray(data.m_ptsOffset, sink);
    }
  }

  if (h & HEADER_GEOM_AREA)
  {
    if (trgCount > 0)
      serial::SaveInnerTriangles(data.m_innerTrg, params, sink);
    else
    {
      // offsets was pushed from high scale index to low
      reverse(data.m_trgOffset.begin(), data.m_trgOffset.end());
      serial::WriteVarUintArray(data.m_trgOffset, sink);
    }
  }
}