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
|
#include "search/query_params.hpp"
#include "indexer/feature_impl.hpp"
#include "std/algorithm.hpp"
namespace search
{
namespace
{
// TODO (@y, @m): reuse this class in search::Processor.
class DoAddStreetSynonyms
{
public:
DoAddStreetSynonyms(QueryParams & params) : m_params(params) {}
void operator()(QueryParams::TString const & s, size_t i)
{
if (s.size() > 2)
return;
string const ss = strings::ToUtf8(strings::MakeLowerCase(s));
// All synonyms should be lowercase!
if (ss == "n")
AddSym(i, "north");
if (ss == "w")
AddSym(i, "west");
if (ss == "s")
AddSym(i, "south");
if (ss == "e")
AddSym(i, "east");
if (ss == "nw")
AddSym(i, "northwest");
if (ss == "ne")
AddSym(i, "northeast");
if (ss == "sw")
AddSym(i, "southwest");
if (ss == "se")
AddSym(i, "southeast");
}
private:
QueryParams::TSynonymsVector & GetSyms(size_t i) const
{
size_t const count = m_params.m_tokens.size();
if (i < count)
return m_params.m_tokens[i];
ASSERT_EQUAL(i, count, ());
return m_params.m_prefixTokens;
}
void AddSym(size_t i, string const & sym) { GetSyms(i).push_back(strings::MakeUniString(sym)); }
QueryParams & m_params;
};
} // namespace
void QueryParams::Clear()
{
m_tokens.clear();
m_prefixTokens.clear();
m_types.clear();
m_langs.clear();
m_scale = scales::GetUpperScale();
}
bool QueryParams::IsCategorySynonym(size_t i) const
{
ASSERT_LESS(i, GetNumTokens(), ());
return !m_types[i].empty();
}
bool QueryParams::IsPrefixToken(size_t i) const
{
ASSERT_LESS(i, GetNumTokens(), ());
return i == m_tokens.size();
}
QueryParams::TSynonymsVector const & QueryParams::GetTokens(size_t i) const
{
ASSERT_LESS(i, GetNumTokens(), ());
return i < m_tokens.size() ? m_tokens[i] : m_prefixTokens;
}
QueryParams::TSynonymsVector & QueryParams::GetTokens(size_t i)
{
ASSERT_LESS(i, GetNumTokens(), ());
return i < m_tokens.size() ? m_tokens[i] : m_prefixTokens;
}
bool QueryParams::IsNumberTokens(size_t start, size_t end) const
{
ASSERT_LESS(start, end, ());
ASSERT_LESS_OR_EQUAL(end, GetNumTokens(), ());
for (; start != end; ++start)
{
bool number = false;
for (auto const & t : GetTokens(start))
{
if (feature::IsNumber(t))
{
number = true;
break;
}
}
if (!number)
return false;
}
return true;
}
string DebugPrint(search::QueryParams const & params)
{
ostringstream os;
os << "QueryParams [ m_tokens=" << DebugPrint(params.m_tokens)
<< ", m_prefixTokens=" << DebugPrint(params.m_prefixTokens) << "]";
return os.str();
}
} // namespace search
|
