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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "initrange.h"
#ifdef ENABLE_GTEST_MIGRATION
#include <vespa/vespalib/gtest/gtest.h>
#define ASSERT_EQUAL ASSERT_EQ
#define EXPECT_EQUAL EXPECT_EQ
#else
#include <vespa/vespalib/testkit/test_kit.h>
#endif
#include <vespa/searchlib/queryeval/emptysearch.h>
#include <vespa/searchlib/queryeval/truesearch.h>
#include <algorithm>
namespace search::test {
using namespace search::queryeval;
using std::make_unique;
class DocIdIterator : public SearchIterator
{
public:
DocIdIterator(const InitRangeVerifier::DocIds & docIds, bool strict) :
_strict(strict),
_currIndex(0),
_docIds(docIds)
{ }
void initRange(uint32_t beginId, uint32_t endId) override {
SearchIterator::initRange(beginId, endId);
_currIndex = 0;
if (_strict) {
doSeek(beginId);
}
}
void doSeek(uint32_t docId) override {
while ((_currIndex < _docIds.size()) && (_docIds[_currIndex] < docId)) {
_currIndex++;
}
if ((_currIndex < _docIds.size()) && (_docIds[_currIndex] < getEndId())) {
if (_docIds[_currIndex] == docId || _strict) {
setDocId(_docIds[_currIndex]);
}
} else {
setAtEnd();
}
}
void doUnpack(uint32_t docid) override { (void) docid; }
vespalib::Trinary is_strict() const override {
return _strict ? vespalib::Trinary::True : vespalib::Trinary::False;
}
private:
const bool _strict;
uint32_t _currIndex;
const InitRangeVerifier::DocIds _docIds;
};
InitRangeVerifier::InitRangeVerifier() :
_trueTfmd(),
_docIds()
{
// (0),1 and 10,11 and 20,21 .... 200,201 etc are hits
// 0 is of course invalid.
for (size_t i(0); (i*10+1) < getDocIdLimit(); i++) {
if (i > 0) {
_docIds.push_back(i * 10);
}
_docIds.push_back(i*10 + 1);
}
}
InitRangeVerifier::~InitRangeVerifier() = default;
InitRangeVerifier::DocIds
InitRangeVerifier::invert(const DocIds & docIds, uint32_t docIdlimit)
{
DocIds inverted;
inverted.reserve(docIdlimit);
for (size_t i(1), next(0); i < docIdlimit; i++) {
if (next < docIds.size()) {
if (i >= docIds[next]) {
if (i == docIds[next++]) {
continue;
}
}
}
inverted.push_back(i);
}
return inverted;
}
SearchIterator::UP
InitRangeVerifier::createIterator(const DocIds &docIds, bool strict)
{
return make_unique<DocIdIterator>(docIds, strict);
}
SearchIterator::UP
InitRangeVerifier::createEmptyIterator()
{
return make_unique<EmptySearch>();
}
SearchIterator::UP
InitRangeVerifier::createFullIterator() const
{
return make_unique<TrueSearch>(_trueTfmd);
}
void
InitRangeVerifier::verify(SearchIterator * iterator) const
{
SearchIterator::UP up(iterator);
verify(*up);
}
void
InitRangeVerifier::verify(SearchIterator & iterator) const
{
ASSERT_TRUE(iterator.is_strict() != vespalib::Trinary::Undefined);
if (iterator.is_strict() == vespalib::Trinary::True) {
verify(iterator, true);
}
verify(iterator, false);
}
void
InitRangeVerifier::verify(SearchIterator & iterator, bool strict) const
{
verify(iterator, Ranges({{1, 202}}), strict);
verify(iterator, Ranges({{1, 202}}), strict);
for (uint32_t rangeWidth : { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 100, 202 }) {
Ranges ranges;
for (uint32_t sum(1); sum < getDocIdLimit(); sum += rangeWidth) {
ranges.emplace_back(sum, std::min(sum+rangeWidth, getDocIdLimit()));
}
verify(iterator, ranges, strict);
std::reverse(ranges.begin(), ranges.end());
verify(iterator, ranges, strict);
}
}
void
InitRangeVerifier::verify(SearchIterator & iterator, const Ranges & ranges, bool strict) const
{
DocIds result = search(iterator, ranges, strict);
ASSERT_EQUAL(_docIds.size(), result.size());
for (size_t i(0); i < _docIds.size(); i++) {
EXPECT_EQUAL(_docIds[i], result[i]);
}
}
InitRangeVerifier::DocIds
InitRangeVerifier::search(SearchIterator & it, const Ranges & ranges, bool strict)
{
DocIds result;
for (Range range: ranges) {
DocIds part = strict ? searchStrict(it, range) : searchRelaxed(it, range);
result.insert(result.end(), part.begin(), part.end());
}
std::sort(result.begin(), result.end());
return result;
}
InitRangeVerifier::DocIds
InitRangeVerifier::searchRelaxed(SearchIterator & it, Range range)
{
DocIds result;
it.initRange(range.first, range.second);
for (uint32_t docid = range.first; docid < range.second; ++docid) {
if (it.seek(docid)) {
result.emplace_back(docid);
it.unpack(docid);
}
}
return result;
}
InitRangeVerifier::DocIds
InitRangeVerifier::searchStrict(SearchIterator & it, Range range)
{
DocIds result;
it.initRange(range.first, range.second);
for (uint32_t docId = it.seekFirst(range.first); docId < range.second; docId = it.seekNext(docId + 1)) {
result.push_back(docId);
it.unpack(docId);
}
return result;
}
}
|
