blob: 00835d64c4eda17dd4364f1061795d84c2e522cf (
plain) (
blame)
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "termdatafromnode.h"
#include "querynodes.h"
#include <vespa/searchlib/query/tree/customtypevisitor.h>
namespace proton::matching {
namespace {
struct TermDataFromTermVisitor
: public search::query::CustomTypeVisitor<ProtonNodeTypes>
{
const ProtonTermData *data;
TermDataFromTermVisitor() : data(0) {}
template <class TermNode>
void visitTerm(const TermNode &n) {
data = &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(ProtonTrue &) override {}
void visit(ProtonFalse &) override {}
void visit(ProtonWeightedSetTerm &n) override { visitTerm(n); }
void visit(ProtonDotProduct &n) override { visitTerm(n); }
void visit(ProtonWandTerm &n) override { visitTerm(n); }
void visit(ProtonPhrase &n) override { visitTerm(n); }
void visit(ProtonEquiv &n) override { visitTerm(n); }
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 &n) override { visitTerm(n); }
void visit(ProtonFuzzyTerm &n) override { visitTerm(n); }
};
} // namespace
const ProtonTermData *
termDataFromNode(const search::query::Node &node)
{
TermDataFromTermVisitor visitor;
const_cast<search::query::Node &>(node).accept(visitor);
return visitor.data;
}
}
|
