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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "query.h"
#include <vespa/searchlib/parsequery/stackdumpiterator.h>
#include <charconv>
#include <vespa/log/log.h>
LOG_SETUP(".vsm.querynode");
namespace search::streaming {
namespace {
vespalib::stringref DEFAULT("default");
bool disableRewrite(const QueryNode * qn) {
return dynamic_cast<const NearQueryNode *> (qn) ||
dynamic_cast<const PhraseQueryNode *> (qn) ||
dynamic_cast<const SameElementQueryNode *>(qn);
}
}
QueryNode::UP
QueryNode::Build(const QueryNode * parent, const QueryNodeResultFactory & factory,
SimpleQueryStackDumpIterator & queryRep, bool allowRewrite)
{
unsigned int arity = queryRep.getArity();
ParseItem::ItemType type = queryRep.getType();
UP qn;
switch (type) {
case ParseItem::ITEM_AND:
case ParseItem::ITEM_OR:
case ParseItem::ITEM_WEAK_AND:
case ParseItem::ITEM_EQUIV:
case ParseItem::ITEM_WEIGHTED_SET:
case ParseItem::ITEM_DOT_PRODUCT:
case ParseItem::ITEM_WAND:
case ParseItem::ITEM_NOT:
case ParseItem::ITEM_PHRASE:
case ParseItem::ITEM_SAME_ELEMENT:
case ParseItem::ITEM_NEAR:
case ParseItem::ITEM_ONEAR:
{
qn = QueryConnector::create(type);
if (qn) {
QueryConnector * qc = dynamic_cast<QueryConnector *> (qn.get());
NearQueryNode * nqn = dynamic_cast<NearQueryNode *> (qc);
if (nqn) {
nqn->distance(queryRep.getNearDistance());
}
if ((type == ParseItem::ITEM_WEAK_AND) ||
(type == ParseItem::ITEM_WEIGHTED_SET) ||
(type == ParseItem::ITEM_DOT_PRODUCT) ||
(type == ParseItem::ITEM_SAME_ELEMENT) ||
(type == ParseItem::ITEM_WAND))
{
qn->setIndex(queryRep.getIndexName());
}
for (size_t i=0; i < arity; i++) {
queryRep.next();
if (qc->isFlattenable(queryRep.getType())) {
arity += queryRep.getArity();
} else {
qc->addChild(Build(qc, factory, queryRep, allowRewrite && !disableRewrite(qn.get())));
}
}
}
}
break;
case ParseItem::ITEM_GEO_LOCATION_TERM:
// TODO implement this:
// vespalib::string field = queryRep.getIndexName();
// vespalib::stringref location_term = queryRep.getTerm();
// qn = std::make_unique<LocationQueryNode> ...something ....
// break;
case ParseItem::ITEM_NUMTERM:
case ParseItem::ITEM_TERM:
case ParseItem::ITEM_PREFIXTERM:
case ParseItem::ITEM_REGEXP:
case ParseItem::ITEM_SUBSTRINGTERM:
case ParseItem::ITEM_EXACTSTRINGTERM:
case ParseItem::ITEM_SUFFIXTERM:
case ParseItem::ITEM_PURE_WEIGHTED_STRING:
case ParseItem::ITEM_PURE_WEIGHTED_LONG:
{
vespalib::string index = queryRep.getIndexName();
if (index.empty()) {
if ((type == ParseItem::ITEM_PURE_WEIGHTED_STRING) || (type == ParseItem::ITEM_PURE_WEIGHTED_LONG)) {
index = parent->getIndex();
} else {
index = DEFAULT;
}
}
if (dynamic_cast<const SameElementQueryNode *>(parent) != nullptr) {
index = parent->getIndex() + "." + index;
}
using TermType = QueryTerm::Type;
TermType sTerm(TermType::WORD);
switch (type) {
case ParseItem::ITEM_REGEXP:
sTerm = TermType::REGEXP;
break;
case ParseItem::ITEM_PREFIXTERM:
sTerm = TermType::PREFIXTERM;
break;
case ParseItem::ITEM_SUBSTRINGTERM:
sTerm = TermType::SUBSTRINGTERM;
break;
case ParseItem::ITEM_EXACTSTRINGTERM:
sTerm = TermType::EXACTSTRINGTERM;
break;
case ParseItem::ITEM_SUFFIXTERM:
sTerm = TermType::SUFFIXTERM;
break;
default:
break;
}
QueryTerm::string ssTerm;
if (type == ParseItem::ITEM_PURE_WEIGHTED_LONG) {
char buf[24];
auto res = std::to_chars(buf, buf + sizeof(buf), queryRep.getIntergerTerm(), 10);
ssTerm.assign(buf, res.ptr - buf);
} else {
ssTerm = queryRep.getTerm();
}
QueryTerm::string ssIndex(index);
if (ssIndex == "sddocname") {
// This is suboptimal as the term should be checked too.
// But it will do for now as only correct sddocname queries are sent down.
qn = std::make_unique<TrueNode>();
} else {
auto qt = std::make_unique<QueryTerm>(factory.create(), ssTerm, ssIndex, sTerm);
qt->setWeight(queryRep.GetWeight());
qt->setUniqueId(queryRep.getUniqueId());
if (qt->encoding().isBase10Integer() ||
! qt->encoding().isFloat() ||
! factory.getRewriteFloatTerms() ||
! allowRewrite ||
(ssTerm.find('.') == vespalib::string::npos))
{
qn = std::move(qt);
} else {
auto phrase = std::make_unique<PhraseQueryNode>();
phrase->addChild(std::make_unique<QueryTerm>(factory.create(), ssTerm.substr(0, ssTerm.find('.')), ssIndex, TermType::WORD));
phrase->addChild(std::make_unique<QueryTerm>(factory.create(), ssTerm.substr(ssTerm.find('.') + 1), ssIndex, TermType::WORD));
auto orqn = std::make_unique<EquivQueryNode>();
orqn->addChild(std::move(qt));
orqn->addChild(std::move(phrase));
qn = std::move(orqn);
}
}
}
break;
case ParseItem::ITEM_RANK:
{
if (arity >= 1) {
queryRep.next();
qn = Build(parent, factory, queryRep, false);
for (uint32_t skipCount = arity-1; (skipCount > 0) && queryRep.next(); skipCount--) {
skipCount += queryRep.getArity();
}
}
}
break;
default:
{
for (uint32_t skipCount = arity; (skipCount > 0) && queryRep.next(); skipCount--) {
skipCount += queryRep.getArity();
LOG(warning, "Does not understand anything,.... skipping %d", type);
}
}
break;
}
return qn;
}
const HitList & QueryNode::evaluateHits(HitList & hl) const
{
return hl;
}
}
|
