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
|
#include "search/features_layer_path_finder.hpp"
#include "search/cancel_exception.hpp"
#include "search/features_layer_matcher.hpp"
#include "search/house_numbers_matcher.hpp"
#include "indexer/features_vector.hpp"
#include "base/cancellable.hpp"
namespace search
{
namespace
{
using TParentGraph = unordered_map<uint32_t, uint32_t>;
// This function tries to estimate amount of work needed to perform an
// intersection pass on a sequence of layers.
template <typename TIt>
uint64_t CalcPassCost(TIt begin, TIt end)
{
uint64_t cost = 0;
if (begin == end)
return cost;
uint64_t reachable = max((*begin)->m_sortedFeatures->size(), size_t(1));
for (++begin; begin != end; ++begin)
{
uint64_t const layer = max((*begin)->m_sortedFeatures->size(), size_t(1));
cost += layer * reachable;
reachable = min(reachable, layer);
}
return cost;
}
uint64_t CalcTopDownPassCost(vector<FeaturesLayer const *> const & layers)
{
return CalcPassCost(layers.rbegin(), layers.rend());
}
uint64_t CalcBottomUpPassCost(vector<FeaturesLayer const *> const & layers)
{
return CalcPassCost(layers.begin(), layers.end());
}
bool LooksLikeHouseNumber(strings::UniString const & query, bool queryIsPrefix)
{
vector<Parse> parses;
ParseQuery(query, queryIsPrefix, parses);
for (auto const & parse : parses)
{
if (parse.IsEmpty())
continue;
if (feature::IsHouseNumber(parse.m_parts.front()))
return true;
}
return false;
}
bool GetPath(uint32_t id, vector<FeaturesLayer const *> const & layers, TParentGraph const & parent,
IntersectionResult & result)
{
result.Clear();
size_t level = 0;
TParentGraph::const_iterator it;
do
{
result.Set(layers[level]->m_type, id);
++level;
it = parent.find(id);
if (it != parent.cend())
id = it->second;
} while (level < layers.size() && it != parent.cend());
return level == layers.size();
}
} // namespace
FeaturesLayerPathFinder::FeaturesLayerPathFinder(my::Cancellable const & cancellable)
: m_cancellable(cancellable)
{
}
void FeaturesLayerPathFinder::FindReachableVertices(FeaturesLayerMatcher & matcher,
vector<FeaturesLayer const *> const & layers,
vector<IntersectionResult> & results)
{
if (layers.empty())
return;
uint64_t const topDownCost = CalcTopDownPassCost(layers);
uint64_t const bottomUpCost = CalcBottomUpPassCost(layers);
if (bottomUpCost < topDownCost)
FindReachableVerticesBottomUp(matcher, layers, results);
else
FindReachableVerticesTopDown(matcher, layers, results);
}
void FeaturesLayerPathFinder::FindReachableVerticesTopDown(
FeaturesLayerMatcher & matcher, vector<FeaturesLayer const *> const & layers,
vector<IntersectionResult> & results)
{
ASSERT(!layers.empty(), ());
vector<uint32_t> reachable = *(layers.back()->m_sortedFeatures);
vector<uint32_t> buffer;
TParentGraph parent;
auto addEdge = [&](uint32_t childFeature, uint32_t parentFeature)
{
parent[childFeature] = parentFeature;
buffer.push_back(childFeature);
};
for (size_t i = layers.size() - 1; i != 0; --i)
{
BailIfCancelled(m_cancellable);
if (reachable.empty())
return;
FeaturesLayer parent(*layers[i]);
if (i != layers.size() - 1)
my::SortUnique(reachable);
parent.m_sortedFeatures = &reachable;
parent.m_hasDelayedFeatures = false;
FeaturesLayer child(*layers[i - 1]);
child.m_hasDelayedFeatures = child.m_type == SearchModel::SEARCH_TYPE_BUILDING &&
LooksLikeHouseNumber(child.m_subQuery, child.m_lastTokenIsPrefix);
buffer.clear();
matcher.Match(child, parent, addEdge);
reachable.swap(buffer);
}
IntersectionResult result;
for (auto const & id : reachable)
{
if (GetPath(id, layers, parent, result))
results.push_back(result);
}
}
void FeaturesLayerPathFinder::FindReachableVerticesBottomUp(
FeaturesLayerMatcher & matcher, vector<FeaturesLayer const *> const & layers,
vector<IntersectionResult> & results)
{
ASSERT(!layers.empty(), ());
vector<uint32_t> reachable = *(layers.front()->m_sortedFeatures);
vector<uint32_t> buffer;
TParentGraph parent;
auto addEdge = [&](uint32_t childFeature, uint32_t parentFeature)
{
parent[childFeature] = parentFeature;
buffer.push_back(parentFeature);
};
for (size_t i = 0; i + 1 != layers.size(); ++i)
{
BailIfCancelled(m_cancellable);
if (reachable.empty())
return;
FeaturesLayer child(*layers[i]);
if (i != 0)
my::SortUnique(reachable);
child.m_sortedFeatures = &reachable;
child.m_hasDelayedFeatures = false;
FeaturesLayer parent(*layers[i + 1]);
parent.m_hasDelayedFeatures =
parent.m_type == SearchModel::SEARCH_TYPE_BUILDING &&
LooksLikeHouseNumber(parent.m_subQuery, parent.m_lastTokenIsPrefix);
buffer.clear();
matcher.Match(child, parent, addEdge);
reachable.swap(buffer);
}
IntersectionResult result;
for (auto const & id : *(layers.front()->m_sortedFeatures))
{
if (GetPath(id, layers, parent, result))
results.push_back(result);
}
}
} // namespace search
|
