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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "same_element_builder.h"
#include "querynodes.h"
#include <vespa/searchlib/query/tree/customtypevisitor.h>
#include <vespa/searchlib/queryeval/leaf_blueprints.h>
#include <vespa/searchcorespi/index/indexsearchable.h>
using search::queryeval::Blueprint;
using search::queryeval::EmptyBlueprint;
using search::queryeval::FieldSpecList;
using search::queryeval::IRequestContext;
using search::queryeval::SameElementBlueprint;
using search::queryeval::Searchable;
namespace proton::matching {
namespace {
class SameElementBuilderVisitor : public search::query::CustomTypeVisitor<ProtonNodeTypes>
{
private:
const IRequestContext &_requestContext;
ISearchContext &_context;
SameElementBlueprint &_result;
public:
SameElementBuilderVisitor(const IRequestContext &requestContext, ISearchContext &context, SameElementBlueprint &result)
: _requestContext(requestContext),
_context(context),
_result(result) {}
template <class TermNode>
void visitTerm(const TermNode &n) {
if (n.numFields() == 1) {
const ProtonTermData::FieldEntry &field = n.field(0);
assert(field.getFieldId() != search::fef::IllegalFieldId);
assert(field.getHandle() == search::fef::IllegalHandle);
FieldSpecList field_spec;
field_spec.add(_result.getNextChildField(field.field_name, field.getFieldId()));
Searchable &searchable = field.attribute_field ? _context.getAttributes() : _context.getIndexes();
_result.addTerm(searchable.createBlueprint(_requestContext, field_spec, n));
}
}
void visit(ProtonAnd &) override {}
void visit(ProtonAndNot &) override {}
void visit(ProtonNear &) override {}
void visit(ProtonONear &) override {}
void visit(ProtonOr &) override {}
void visit(ProtonRank &) override {}
void visit(ProtonWeakAnd &) override {}
void visit(ProtonSameElement &) override {}
void visit(ProtonWeightedSetTerm &) override {}
void visit(ProtonDotProduct &) override {}
void visit(ProtonWandTerm &) override {}
void visit(ProtonPhrase &) override {}
void visit(ProtonEquiv &) override {}
void visit(ProtonNumberTerm &n) override { visitTerm(n); }
void visit(ProtonLocationTerm &n) override { visitTerm(n); }
void visit(ProtonPrefixTerm &n) override { visitTerm(n); }
void visit(ProtonRangeTerm &n) override { visitTerm(n); }
void visit(ProtonStringTerm &n) override { visitTerm(n); }
void visit(ProtonSubstringTerm &n) override { visitTerm(n); }
void visit(ProtonSuffixTerm &n) override { visitTerm(n); }
void visit(ProtonPredicateQuery &) override {}
void visit(ProtonRegExpTerm &n) override { visitTerm(n); }
void visit(ProtonNearestNeighborTerm &) override {}
};
} // namespace proton::matching::<unnamed>
SameElementBuilder::SameElementBuilder(const search::queryeval::IRequestContext &requestContext, ISearchContext &context,
const vespalib::string &struct_field_name, bool expensive)
: _requestContext(requestContext),
_context(context),
_result(std::make_unique<SameElementBlueprint>(struct_field_name, expensive))
{
}
void
SameElementBuilder::add_child(search::query::Node &node)
{
SameElementBuilderVisitor visitor(_requestContext, _context, *_result);
node.accept(visitor);
}
Blueprint::UP
SameElementBuilder::build()
{
if (!_result || _result->terms().empty()) {
return std::make_unique<EmptyBlueprint>();
}
return std::move(_result);
}
} // namespace proton::matching
|
