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

centers_table_test.cpp « indexer_tests « indexer - github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 6874d26fa64c51043c00acbd2a5904512f8fab13 (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
#include "testing/testing.hpp"

#include "indexer/centers_table.hpp"
#include "indexer/classificator_loader.hpp"
#include "indexer/data_header.hpp"
#include "indexer/feature_algo.hpp"
#include "indexer/features_vector.hpp"

#include "platform/platform.hpp"

#include "coding/file_name_utils.hpp"
#include "coding/reader.hpp"
#include "coding/writer.hpp"

#include "geometry/mercator.hpp"
#include "geometry/point2d.hpp"

#include "std/cstdint.hpp"
#include "std/string.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"

using namespace search;

namespace
{
using TBuffer = vector<uint8_t>;

struct CentersTableTest
{
  CentersTableTest() { classificator::Load(); }
};

UNIT_CLASS_TEST(CentersTableTest, Smoke)
{
  string const kMap = my::JoinFoldersToPath(GetPlatform().WritableDir(), "minsk-pass.mwm");

  feature::DataHeader header(kMap);
  auto const codingParams = header.GetDefCodingParams();

  FeaturesVectorTest fv(kMap);

  TBuffer buffer;

  {
    CentersTableBuilder builder;

    builder.SetCodingParams(codingParams);
    fv.GetVector().ForEach(
        [&](FeatureType & ft, uint32_t id) { builder.Put(id, feature::GetCenter(ft)); });

    MemWriter<TBuffer> writer(buffer);
    builder.Freeze(writer);
  }

  {
    MemReader reader(buffer.data(), buffer.size());
    auto table = CentersTable::Load(reader, codingParams);
    TEST(table.get(), ());

    fv.GetVector().ForEach([&](FeatureType & ft, uint32_t id) {
      m2::PointD actual;
      TEST(table->Get(id, actual), ());

      m2::PointD expected = feature::GetCenter(ft);

      TEST_LESS_OR_EQUAL(MercatorBounds::DistanceOnEarth(actual, expected), 1, (id));
    });
  }
}

UNIT_CLASS_TEST(CentersTableTest, Subset)
{
  vector<pair<uint32_t, m2::PointD>> const features = {
      {1, m2::PointD(0, 0)}, {5, m2::PointD(1, 1)}, {10, m2::PointD(2, 2)}};

  serial::CodingParams codingParams;

  TBuffer buffer;
  {
    CentersTableBuilder builder;

    builder.SetCodingParams(codingParams);
    for (auto const & feature : features)
      builder.Put(feature.first, feature.second);

    MemWriter<TBuffer> writer(buffer);
    builder.Freeze(writer);
  }

  {
    MemReader reader(buffer.data(), buffer.size());
    auto table = CentersTable::Load(reader, codingParams);
    TEST(table.get(), ());

    uint32_t i = 0;
    size_t j = 0;

    while (i < 100)
    {
      ASSERT(j == features.size() || features[j].first >= i, ("Invariant violation"));

      m2::PointD actual;
      if (j != features.size() && i == features[j].first)
      {
        TEST(table->Get(i, actual), ());
        TEST_LESS_OR_EQUAL(MercatorBounds::DistanceOnEarth(actual, features[j].second), 1, ());
      }
      else
      {
        TEST(!table->Get(i, actual), ());
      }

      ++i;
      while (j != features.size() && features[j].first < i)
        ++j;
    }
  }
}
}  // namespace