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
|
#include "testing/testing.hpp"
#include "search/categories_cache.hpp"
#include "search/cities_boundaries_table.hpp"
#include "search/emitter.hpp"
#include "search/intermediate_result.hpp"
#include "search/model.hpp"
#include "search/pre_ranker.hpp"
#include "search/ranker.hpp"
#include "search/search_tests_support/helpers.hpp"
#include "search/search_tests_support/test_search_engine.hpp"
#include "search/suggest.hpp"
#include "indexer/categories_holder.hpp"
#include "indexer/feature_algo.hpp"
#include "indexer/features_vector.hpp"
#include "indexer/mwm_set.hpp"
#include "indexer/scales.hpp"
#include "generator/generator_tests_support/test_feature.hpp"
#include "generator/generator_tests_support/test_mwm_builder.hpp"
#include "geometry/mercator.hpp"
#include "platform/country_defines.hpp"
#include "platform/local_country_file.hpp"
#include "base/assert.hpp"
#include "base/cancellable.hpp"
#include "base/limited_priority_queue.hpp"
#include "base/math.hpp"
#include "base/stl_helpers.hpp"
#include <algorithm>
#include <iterator>
#include <vector>
using namespace generator::tests_support;
using namespace search::tests_support;
using namespace std;
class DataSource;
namespace storage
{
class CountryInfoGetter;
}
namespace search
{
namespace
{
class TestRanker : public Ranker
{
public:
TestRanker(DataSource & dataSource, storage::CountryInfoGetter & infoGetter,
CitiesBoundariesTable const & boundariesTable, KeywordLangMatcher & keywordsScorer,
Emitter & emitter, vector<Suggest> const & suggests, VillagesCache & villagesCache,
base::Cancellable const & cancellable, vector<PreRankerResult> & results)
: Ranker(dataSource, boundariesTable, infoGetter, keywordsScorer, emitter,
GetDefaultCategories(), suggests, villagesCache, cancellable)
, m_results(results)
{
}
inline bool Finished() const { return m_finished; }
// Ranker overrides:
void SetPreRankerResults(vector<PreRankerResult> && preRankerResults) override
{
CHECK(!Finished(), ());
move(preRankerResults.begin(), preRankerResults.end(), back_inserter(m_results));
preRankerResults.clear();
}
void UpdateResults(bool lastUpdate) override
{
CHECK(!Finished(), ());
if (lastUpdate)
m_finished = true;
}
private:
vector<PreRankerResult> & m_results;
bool m_finished = false;
};
class PreRankerTest : public SearchTest
{
public:
vector<Suggest> m_suggests;
base::Cancellable m_cancellable;
};
UNIT_CLASS_TEST(PreRankerTest, Smoke)
{
// Tests that PreRanker correctly computes distances to pivot when
// number of results is larger than batch size, and that PreRanker
// emits results nearest to the pivot.
m2::PointD const kPivot(0, 0);
m2::RectD const kViewport(m2::PointD(-5, -5), m2::PointD(5, 5));
size_t const kBatchSize = 50;
vector<TestPOI> pois;
for (int x = -5; x <= 5; ++x)
{
for (int y = -5; y <= 5; ++y)
{
pois.emplace_back(m2::PointD(x, y), "cafe", "en");
pois.back().SetTypes({{"amenity", "cafe"}});
}
}
TEST_LESS(kBatchSize, pois.size(), ());
auto mwmId = BuildCountry("Cafeland", [&](TestMwmBuilder & builder) {
for (auto const & poi : pois)
builder.Add(poi);
});
vector<PreRankerResult> results;
Emitter emitter;
CitiesBoundariesTable boundariesTable(m_dataSource);
VillagesCache villagesCache(m_cancellable);
KeywordLangMatcher keywordsScorer(0 /* maxLanguageTiers */);
TestRanker ranker(m_dataSource, m_engine.GetCountryInfoGetter(), boundariesTable, keywordsScorer,
emitter, m_suggests, villagesCache, m_cancellable, results);
PreRanker preRanker(m_dataSource, ranker);
PreRanker::Params params;
params.m_viewport = kViewport;
params.m_accuratePivotCenter = kPivot;
params.m_scale = scales::GetUpperScale();
params.m_batchSize = kBatchSize;
params.m_limit = pois.size();
params.m_viewportSearch = true;
preRanker.Init(params);
vector<double> distances(pois.size());
vector<bool> emit(pois.size());
FeaturesVectorTest fv(mwmId.GetInfo()->GetLocalFile().GetPath(MapOptions::Map));
fv.GetVector().ForEach([&](FeatureType & ft, uint32_t index) {
FeatureID id(mwmId, index);
preRanker.Emplace(id, PreRankingInfo(Model::TYPE_POI, TokenRange(0, 1)));
TEST_LESS(index, pois.size(), ());
distances[index] = MercatorBounds::DistanceOnEarth(feature::GetCenter(ft), kPivot);
emit[index] = true;
});
preRanker.UpdateResults(true /* lastUpdate */);
TEST(all_of(emit.begin(), emit.end(), base::IdFunctor()), (emit));
TEST(ranker.Finished(), ());
TEST_EQUAL(results.size(), kBatchSize, ());
vector<bool> checked(pois.size());
for (size_t i = 0; i < results.size(); ++i)
{
size_t const index = results[i].GetId().m_index;
TEST_LESS(index, pois.size(), ());
TEST(!checked[index], (index));
TEST(base::AlmostEqualAbs(distances[index], results[i].GetDistance(), 1e-3),
(distances[index], results[i].GetDistance()));
checked[index] = true;
}
}
} // namespace
} // namespace search
|
