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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/searchlib/queryeval/dot_product_search.h>
#include <vespa/searchlib/fef/fef.h>
#include <vespa/searchlib/query/tree/simplequery.h>
#include <vespa/searchlib/queryeval/field_spec.h>
#include <vespa/searchlib/queryeval/blueprint.h>
#include <vespa/searchlib/queryeval/emptysearch.h>
#include <vespa/searchlib/queryeval/fake_result.h>
#include <vespa/searchlib/queryeval/fake_searchable.h>
#include <vespa/searchlib/queryeval/fake_requestcontext.h>
#include <vespa/searchlib/test/weightedchildrenverifiers.h>
using namespace search;
using namespace search::query;
using namespace search::fef;
using namespace search::queryeval;
using search::test::SearchIteratorVerifier;
using search::test::DocumentWeightAttributeHelper;
namespace {
void setupFakeSearchable(FakeSearchable &fake) {
for (size_t docid = 1; docid < 10; ++docid) {
std::string token1 = vespalib::make_string("%zu", docid);
std::string token2 = vespalib::make_string("1%zu", docid);
std::string token3 = vespalib::make_string("2%zu", docid);
fake.addResult("field", token1, FakeResult().doc(docid).weight(docid).pos(0));
fake.addResult("multi-field", token1, FakeResult().doc(docid).weight(docid).pos(0));
fake.addResult("multi-field", token2, FakeResult().doc(docid).weight(2 * docid).pos(0));
fake.addResult("multi-field", token3, FakeResult().doc(docid).weight(3 * docid).pos(0));
}
}
struct DP {
static const uint32_t fieldId = 0;
static const TermFieldHandle handle = 0;
std::vector<std::pair<std::string, uint32_t> > tokens;
DP &add(const std::string &token, uint32_t weight) {
tokens.push_back(std::make_pair(token, weight));
return *this;
}
Node::UP createNode() const {
SimpleDotProduct *node = new SimpleDotProduct("view", 0, Weight(0));
for (size_t i = 0; i < tokens.size(); ++i) {
node->append(Node::UP(new SimpleStringTerm(tokens[i].first, "view", 0, Weight(tokens[i].second))));
}
return Node::UP(node);
}
FakeResult search(Searchable &searchable, const std::string &field, bool strict) const {
MatchData::UP md(MatchData::makeTestInstance(1, 1));
FakeRequestContext requestContext;
Node::UP node = createNode();
FieldSpecList fields = FieldSpecList().add(FieldSpec(field, fieldId, handle));
queryeval::Blueprint::UP bp = searchable.createBlueprint(requestContext, fields, *node);
bp->fetchPostings(strict);
SearchIterator::UP sb = bp->createSearch(*md, strict);
EXPECT_TRUE(dynamic_cast<DotProductSearch*>(sb.get()) != 0);
sb->initFullRange();
FakeResult result;
for (uint32_t docId = 1; docId < 10; ++docId) {
if (sb->seek(docId)) {
sb->unpack(docId);
result.doc(docId);
double score = md->resolveTermField(handle)->getRawScore();
EXPECT_EQUAL((int)score, score);
result.score(score);
}
}
return result;
}
};
struct MockSearch : public SearchIterator {
int seekCnt;
uint32_t _initial;
MockSearch(uint32_t initial) : SearchIterator(), seekCnt(0), _initial(initial) { }
void initRange(uint32_t begin, uint32_t end) override {
SearchIterator::initRange(begin, end);
setDocId(_initial);
}
virtual void doSeek(uint32_t) override {
++seekCnt;
setAtEnd();
}
virtual void doUnpack(uint32_t) override {}
};
struct MockFixture {
MockSearch *mock;
TermFieldMatchData tfmd;
std::unique_ptr<SearchIterator> search;
MockFixture(uint32_t initial) :
MockFixture(initial, {new EmptySearch()})
{ }
MockFixture(uint32_t initial, std::vector<SearchIterator *> children) : mock(0), tfmd(), search() {
std::vector<TermFieldMatchData*> childMatch;
std::vector<int32_t> weights;
const size_t numChildren(children.size()+1);
MatchData::UP md(MatchData::makeTestInstance(numChildren, numChildren));
for (size_t i(0); i < children.size(); i++) {
childMatch.push_back(md->resolveTermField(i));
weights.push_back(1);
}
mock = new MockSearch(initial);
childMatch.push_back(md->resolveTermField(children.size()));
children.push_back(mock);
weights.push_back(1);
search = DotProductSearch::create(children, tfmd, childMatch, weights, std::move(md));
}
};
void verifySimple(const FakeResult & expect, DP & ws) {
FakeSearchable index;
setupFakeSearchable(index);
EXPECT_EQUAL(expect, ws.search(index, "field", true));
EXPECT_EQUAL(expect, ws.search(index, "field", false));
EXPECT_EQUAL(expect, ws.search(index, "multi-field", true));
EXPECT_EQUAL(expect, ws.search(index, "multi-field", false));
}
} // namespace <unnamed>
TEST("test Simple") {
FakeResult expect = FakeResult()
.doc(3).score(30 * 3)
.doc(5).score(50 * 5)
.doc(7).score(70 * 7);
DP ws = DP().add("7", 70).add("5", 50).add("3", 30).add("100", 1000);
TEST_DO(verifySimple(expect, ws));
}
TEST("test Simple Single") {
FakeResult expect = FakeResult()
.doc(7).score(70 * 7);
DP ws = DP().add("7", 70);
TEST_DO(verifySimple(expect, ws));
}
TEST("test Multi") {
FakeSearchable index;
setupFakeSearchable(index);
FakeResult expect = FakeResult()
.doc(3).score(30 * 3 + 130 * 2 * 3 + 230 * 3 * 3)
.doc(5).score(50 * 5 + 150 * 2 * 5)
.doc(7).score(70 * 7);
DP ws = DP().add("7", 70).add("5", 50).add("3", 30)
.add("15", 150).add("13", 130)
.add("23", 230).add("100", 1000);
EXPECT_EQUAL(expect, ws.search(index, "multi-field", true));
EXPECT_EQUAL(expect, ws.search(index, "multi-field", false));
}
TEST_F("test Eager Empty Child", MockFixture(search::endDocId, {})) {
MockSearch *mock = f1.mock;
SearchIterator &search = *f1.search;
search.initFullRange();
EXPECT_TRUE(search.isAtEnd());
EXPECT_EQUAL(0, mock->seekCnt);
}
TEST_F("test Eager Empty Children", MockFixture(search::endDocId)) {
MockSearch *mock = f1.mock;
SearchIterator &search = *f1.search;
search.initFullRange();
EXPECT_EQUAL(search.beginId(), search.getDocId());
EXPECT_TRUE(!search.seek(1));
EXPECT_TRUE(search.isAtEnd());
EXPECT_EQUAL(0, mock->seekCnt);
}
void verifyEagerMatching(SearchIterator & search, MockSearch * mock) {
EXPECT_TRUE(!search.seek(3));
EXPECT_EQUAL(5u, search.getDocId());
EXPECT_EQUAL(0, mock->seekCnt);
EXPECT_TRUE(search.seek(5));
EXPECT_EQUAL(5u, search.getDocId());
EXPECT_EQUAL(0, mock->seekCnt);
EXPECT_TRUE(!search.seek(7));
EXPECT_TRUE(search.isAtEnd());
EXPECT_EQUAL(1, mock->seekCnt);
}
TEST_F("test Eager Matching Child", MockFixture(5, {})) {
MockSearch *mock = f1.mock;
SearchIterator &search = *f1.search;
search.initFullRange();
EXPECT_EQUAL(5u, search.getDocId());
verifyEagerMatching(search, mock);
}
TEST_F("test Eager Matching Children", MockFixture(5)) {
MockSearch *mock = f1.mock;
SearchIterator &search = *f1.search;
search.initFullRange();
EXPECT_EQUAL(search.beginId(), search.getDocId());
verifyEagerMatching(search, mock);
}
class IteratorChildrenVerifier : public search::test::IteratorChildrenVerifier {
private:
SearchIterator::UP create(const std::vector<SearchIterator*> &children) const override {
std::vector<fef::TermFieldMatchData*> no_child_match;
MatchData::UP no_match_data;
return DotProductSearch::create(children, _tfmd, no_child_match, _weights, std::move(no_match_data));
}
};
class WeightIteratorChildrenVerifier : public search::test::DwaIteratorChildrenVerifier {
private:
SearchIterator::UP create(std::vector<DocumentWeightIterator> && children) const override {
return SearchIterator::UP(DotProductSearch::create(_tfmd, _weights, std::move(children)));
}
};
TEST("verify search iterator conformance with search iterator children") {
IteratorChildrenVerifier verifier;
verifier.verify();
}
TEST("verify search iterator conformance with document weight iterator children") {
WeightIteratorChildrenVerifier verifier;
verifier.verify();
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
