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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "query.h"
#include "near_query_node.h"
#include "onear_query_node.h"
#include "same_element_query_node.h"
#include <vespa/searchlib/parsequery/stackdumpiterator.h>
#include <vespa/vespalib/objects/visit.hpp>
#include <cassert>
namespace search::streaming {
void
QueryConnector::visitMembers(vespalib::ObjectVisitor &visitor) const
{
visit(visitor, "Operator", _opName);
}
QueryConnector::QueryConnector(const char * opName) noexcept
: QueryNode(),
_opName(opName),
_index(),
_children()
{
}
void
QueryConnector::addChild(QueryNode::UP child) {
_children.push_back(std::move(child));
}
QueryConnector::~QueryConnector() = default;
const HitList &
QueryConnector::evaluateHits(HitList & hl) const
{
if (evaluate()) {
hl.emplace_back(0, 0, 1, 1);
}
return hl;
}
void
QueryConnector::reset()
{
for (const auto & node : _children) {
node->reset();
}
}
void
QueryConnector::getLeaves(QueryTermList & tl)
{
for (const auto & node : _children) {
node->getLeaves(tl);
}
}
void
QueryConnector::getLeaves(ConstQueryTermList & tl) const
{
for (const auto & node : _children) {
node->getLeaves(tl);
}
}
size_t
QueryConnector::depth() const
{
size_t d(0);
for (const auto & node : _children) {
size_t t = node->depth();
if (t > d) {
d = t;
}
}
return d+1;
}
size_t
QueryConnector::width() const
{
size_t w(0);
for (const auto & node : _children) {
w += node->width();
}
return w;
}
std::unique_ptr<QueryConnector>
QueryConnector::create(ParseItem::ItemType type)
{
switch (type) {
case search::ParseItem::ITEM_AND: return std::make_unique<AndQueryNode>();
case search::ParseItem::ITEM_OR:
case search::ParseItem::ITEM_WEAK_AND: return std::make_unique<OrQueryNode>();
case search::ParseItem::ITEM_NOT: return std::make_unique<AndNotQueryNode>();
case search::ParseItem::ITEM_SAME_ELEMENT: return std::make_unique<SameElementQueryNode>();
case search::ParseItem::ITEM_NEAR: return std::make_unique<NearQueryNode>();
case search::ParseItem::ITEM_ONEAR: return std::make_unique<ONearQueryNode>();
case search::ParseItem::ITEM_RANK: return std::make_unique<RankWithQueryNode>();
default: return nullptr;
}
}
bool
TrueNode::evaluate() const
{
return true;
}
bool FalseNode::evaluate() const {
return false;
}
bool
AndQueryNode::evaluate() const
{
for (const auto & qn : getChildren()) {
if ( ! qn->evaluate() ) return false;
}
return true;
}
bool
AndNotQueryNode::evaluate() const {
if (getChildren().empty()) return true;
auto it = getChildren().begin();
auto mt = getChildren().end();
if ((*it)->evaluate()) {
for (++it; it != mt; it++) {
if ((*it)->evaluate()) return false;
}
return true;
}
return false;
}
bool
OrQueryNode::evaluate() const {
for (const auto & qn : getChildren()) {
if (qn->evaluate()) return true;
}
return false;
}
bool
RankWithQueryNode::evaluate() const {
bool first = true;
bool firstOk = false;
for (const auto & qn : getChildren()) {
if (qn->evaluate()) {
if (first) firstOk = true;
}
first = false;
}
return firstOk;
}
Query::Query() = default;
Query::Query(const QueryNodeResultFactory & factory, vespalib::stringref queryRep)
: _root()
{
build(factory, queryRep);
}
bool
Query::evaluate() const {
return valid() && _root->evaluate();
}
bool
Query::build(const QueryNodeResultFactory & factory, vespalib::stringref queryRep)
{
search::SimpleQueryStackDumpIterator stack(queryRep);
if (stack.next()) {
_root = QueryNode::Build(nullptr, factory, stack, true);
}
return valid();
}
void
Query::getLeaves(QueryTermList & tl) {
if (valid()) {
_root->getLeaves(tl);
}
}
void
Query::getLeaves(ConstQueryTermList & tl) const {
if (valid()) {
_root->getLeaves(tl);
}
}
void
Query::reset() {
if (valid()) {
_root->reset();
}
}
size_t
Query::depth() const {
return valid() ? _root->depth() : 0;
}
size_t
Query::width() const {
return valid() ? _root->width() : 0;
}
}
|
