generator/feature_helpers.cpp


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

#include "generator/feature_helpers.hpp"

#include "generator/feature_builder.hpp"

#include "indexer/feature_visibility.hpp"

#include "coding/point_coding.hpp"

#include "base/stl_helpers.hpp"

#include <algorithm>

using namespace std;

namespace feature
{
void CalculateMidPoints::operator()(FeatureBuilder1 const & ft, uint64_t pos)
{
  // Reset state.
  m_midLoc = m2::PointD::Zero();;
  m_locCount = 0;

  ft.ForEachGeometryPoint(*this);
  ASSERT_NOT_EQUAL(m_locCount, 0, ());
  m_midLoc = m_midLoc / m_locCount;

  uint64_t const pointAsInt64 = PointToInt64Obsolete(m_midLoc, m_coordBits);
  int const minScale = feature::GetMinDrawableScale(ft.GetTypesHolder(), ft.GetLimitRect());

  /// May be invisible if it's small area object with [0-9] scales.
  /// @todo Probably, we need to keep that objects if 9 scale (as we do in 17 scale).
  if (minScale != -1)
  {
    uint64_t const order = (static_cast<uint64_t>(minScale) << 59) | (pointAsInt64 >> 5);
    m_vec.push_back(make_pair(order, pos));
  }
}

bool CalculateMidPoints::operator()(m2::PointD const & p)
{
  m_midLoc += p;
  m_midAll += p;
  ++m_locCount;
  ++m_allCount;
  return true;
}

m2::PointD CalculateMidPoints::GetCenter() const
{
  if (m_allCount == 0)
    return {};

  return m_midAll / m_allCount;
}

void CalculateMidPoints::Sort()
{
  sort(m_vec.begin(), m_vec.end(), base::LessBy(&CellAndOffset::first));
}
}  // namespace feature