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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
// Unit tests for customtypevisitor.
#include <vespa/searchlib/query/tree/customtypevisitor.h>
#include <vespa/searchlib/query/tree/intermediatenodes.h>
#include <vespa/searchlib/query/tree/string_term_vector.h>
#include <vespa/searchlib/query/tree/termnodes.h>
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/log/log.h>
LOG_SETUP("customtypevisitor_test");
using std::string;
using namespace search::query;
namespace {
template <class Base>
struct InitTerm : Base {
InitTerm() : Base(typename Base::Type(), "view", 0, Weight(0)) {}
};
struct MyAnd : And {};
struct MyAndNot : AndNot {};
struct MyEquiv : Equiv {};
struct MyNear : Near { MyNear() : Near(1) {} };
struct MyONear : ONear { MyONear() : ONear(1) {} };
struct MyOr : Or {};
struct MyPhrase : Phrase { MyPhrase() : Phrase("view", 0, Weight(42)) {} };
struct MySameElement : SameElement { MySameElement() : SameElement("view", 0, Weight(42)) {} };
struct MyRank : Rank {};
struct MyNumberTerm : InitTerm<NumberTerm> {};
struct MyLocationTerm : InitTerm<LocationTerm> {};
struct MyPrefixTerm : InitTerm<PrefixTerm> {};
struct MyRangeTerm : InitTerm<RangeTerm> {};
struct MyStringTerm : InitTerm<StringTerm> {};
struct MySubstrTerm : InitTerm<SubstringTerm> {};
struct MySuffixTerm : InitTerm<SuffixTerm> {};
struct MyFuzzyTerm : FuzzyTerm { MyFuzzyTerm(): FuzzyTerm("term", "view", 0, Weight(0), 2, 0, false) {} };
struct MyWeakAnd : WeakAnd { MyWeakAnd() : WeakAnd(1234, "view") {} };
struct MyWeightedSetTerm : WeightedSetTerm { MyWeightedSetTerm() : WeightedSetTerm(0, "view", 0, Weight(42)) {} };
struct MyDotProduct : DotProduct { MyDotProduct() : DotProduct(0, "view", 0, Weight(42)) {} };
struct MyWandTerm : WandTerm { MyWandTerm() : WandTerm(0, "view", 0, Weight(42), 57, 67, 77.7) {} };
struct MyPredicateQuery : InitTerm<PredicateQuery> {};
struct MyRegExpTerm : InitTerm<RegExpTerm> {};
struct MyNearestNeighborTerm : NearestNeighborTerm {
MyNearestNeighborTerm() : NearestNeighborTerm("qt", "fn", 0, Weight(42), 10, true, 666, 1234.5) {}
};
struct MyTrue : TrueQueryNode {};
struct MyFalse : FalseQueryNode {};
struct MyInTerm : InTerm {
MyInTerm()
: InTerm(std::make_unique<StringTermVector>(0), MultiTerm::Type::STRING, "view", 0, Weight(0))
{
}
};
struct MyQueryNodeTypes {
using And = MyAnd;
using AndNot = MyAndNot;
using Equiv = MyEquiv;
using NumberTerm = MyNumberTerm;
using LocationTerm = MyLocationTerm;
using Near = MyNear;
using ONear = MyONear;
using Or = MyOr;
using Phrase = MyPhrase;
using SameElement = MySameElement;
using PrefixTerm = MyPrefixTerm;
using RangeTerm = MyRangeTerm;
using Rank = MyRank;
using StringTerm = MyStringTerm;
using SubstringTerm = MySubstrTerm;
using SuffixTerm = MySuffixTerm;
using FuzzyTerm = MyFuzzyTerm;
using WeakAnd = MyWeakAnd;
using WeightedSetTerm = MyWeightedSetTerm;
using DotProduct = MyDotProduct;
using WandTerm = MyWandTerm;
using PredicateQuery = MyPredicateQuery;
using RegExpTerm = MyRegExpTerm;
using NearestNeighborTerm = MyNearestNeighborTerm;
using FalseQueryNode = MyFalse;
using TrueQueryNode = MyTrue;
using InTerm = MyInTerm;
};
class MyCustomVisitor : public CustomTypeVisitor<MyQueryNodeTypes>
{
public:
template <typename T>
bool &isVisited() {
static bool b;
return b;
}
template <typename T> void setVisited() { isVisited<T>() = true; }
void visit(MyAnd &) override { setVisited<MyAnd>(); }
void visit(MyAndNot &) override { setVisited<MyAndNot>(); }
void visit(MyEquiv &) override { setVisited<MyEquiv>(); }
void visit(MyNumberTerm &) override { setVisited<MyNumberTerm>(); }
void visit(MyLocationTerm &) override { setVisited<MyLocationTerm>(); }
void visit(MyNear &) override { setVisited<MyNear>(); }
void visit(MyONear &) override { setVisited<MyONear>(); }
void visit(MyOr &) override { setVisited<MyOr>(); }
void visit(MyPhrase &) override { setVisited<MyPhrase>(); }
void visit(MySameElement &) override { setVisited<MySameElement>(); }
void visit(MyPrefixTerm &) override { setVisited<MyPrefixTerm>(); }
void visit(MyRangeTerm &) override { setVisited<MyRangeTerm>(); }
void visit(MyRank &) override { setVisited<MyRank>(); }
void visit(MyStringTerm &) override { setVisited<MyStringTerm>(); }
void visit(MySubstrTerm &) override { setVisited<MySubstrTerm>(); }
void visit(MySuffixTerm &) override { setVisited<MySuffixTerm>(); }
void visit(MyWeakAnd &) override { setVisited<MyWeakAnd>(); }
void visit(MyWeightedSetTerm &) override { setVisited<MyWeightedSetTerm>(); }
void visit(MyDotProduct &) override { setVisited<MyDotProduct>(); }
void visit(MyWandTerm &) override { setVisited<MyWandTerm>(); }
void visit(MyPredicateQuery &) override { setVisited<MyPredicateQuery>(); }
void visit(MyRegExpTerm &) override { setVisited<MyRegExpTerm>(); }
void visit(MyNearestNeighborTerm &) override { setVisited<MyNearestNeighborTerm>(); }
void visit(MyTrue &) override { setVisited<MyTrue>(); }
void visit(MyFalse &) override { setVisited<MyFalse>(); }
void visit(MyFuzzyTerm &) override { setVisited<MyFuzzyTerm>(); }
void visit(MyInTerm&) override { setVisited<MyInTerm>(); }
};
template <class T>
void requireThatNodeIsVisited() {
MyCustomVisitor visitor;
Node::UP query(new T);
visitor.isVisited<T>() = false;
query->accept(visitor);
ASSERT_TRUE(visitor.isVisited<T>());
}
TEST("customtypevisitor_test") {
requireThatNodeIsVisited<MyAnd>();
requireThatNodeIsVisited<MyAndNot>();
requireThatNodeIsVisited<MyNear>();
requireThatNodeIsVisited<MyONear>();
requireThatNodeIsVisited<MyOr>();
requireThatNodeIsVisited<MyPhrase>();
requireThatNodeIsVisited<MySameElement>();
requireThatNodeIsVisited<MyRangeTerm>();
requireThatNodeIsVisited<MyRank>();
requireThatNodeIsVisited<MyNumberTerm>();
requireThatNodeIsVisited<MyPrefixTerm>();
requireThatNodeIsVisited<MyStringTerm>();
requireThatNodeIsVisited<MySubstrTerm>();
requireThatNodeIsVisited<MySuffixTerm>();
requireThatNodeIsVisited<MyWeightedSetTerm>();
requireThatNodeIsVisited<MyDotProduct>();
requireThatNodeIsVisited<MyWandTerm>();
requireThatNodeIsVisited<MyPredicateQuery>();
requireThatNodeIsVisited<MyRegExpTerm>();
requireThatNodeIsVisited<MyLocationTerm>();
requireThatNodeIsVisited<MyNearestNeighborTerm>();
requireThatNodeIsVisited<MyTrue>();
requireThatNodeIsVisited<MyFalse>();
requireThatNodeIsVisited<MyFuzzyTerm>();
}
} // namespace
TEST_MAIN() { TEST_RUN_ALL(); }
|
