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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "fakefilterocc.h"
#include "fpfactory.h"
#include <vespa/searchlib/queryeval/iterators.h>
using search::fef::TermFieldMatchData;
using search::fef::TermFieldMatchDataPosition;
namespace search::fakedata {
static FPFactoryInit
init(std::make_pair("FilterOcc",
makeFPFactory<FPFactoryT<FakeFilterOcc> >));
FakeFilterOcc::FakeFilterOcc(const FakeWord &fw)
: FakePosting(fw.getName() + ".filterocc"),
_uncompressed(),
_docIdLimit(0),
_hitDocs(0)
{
std::vector<uint32_t> fake;
for (const auto& elem : fw._postings) {
fake.push_back(elem._docId);
}
std::swap(_uncompressed, fake);
_docIdLimit = fw._docIdLimit;
_hitDocs = fw._postings.size();
}
FakeFilterOcc::~FakeFilterOcc()
{
}
void
FakeFilterOcc::forceLink()
{
}
size_t
FakeFilterOcc::bitSize() const
{
return 32 * _uncompressed.size();
}
bool
FakeFilterOcc::hasWordPositions() const
{
return false;
}
int
FakeFilterOcc::lowLevelSinglePostingScan() const
{
return 0;
}
int
FakeFilterOcc::lowLevelSinglePostingScanUnpack() const
{
return 0;
}
int
FakeFilterOcc::
lowLevelAndPairPostingScan(const FakePosting &rhs) const
{
(void) rhs;
return 0;
}
int
FakeFilterOcc::
lowLevelAndPairPostingScanUnpack(const FakePosting &rhs) const
{
(void) rhs;
return 0;
}
class FakeFilterOccArrayIterator: public queryeval::RankedSearchIteratorBase
{
private:
FakeFilterOccArrayIterator(const FakeFilterOccArrayIterator &other);
FakeFilterOccArrayIterator& operator=(const FakeFilterOccArrayIterator &);
public:
const uint32_t *_arr;
const uint32_t *_arrEnd;
FakeFilterOccArrayIterator(const uint32_t *arr,
const uint32_t *arrEnd,
const fef::TermFieldMatchDataArray &matchData);
~FakeFilterOccArrayIterator();
void doUnpack(uint32_t docId) override;
void doSeek(uint32_t docId) override;
void initRange(uint32_t begin, uint32_t end) override;
Trinary is_strict() const override { return Trinary::True; }
};
void
FakeFilterOccArrayIterator::doSeek(uint32_t docId)
{
const uint32_t *oarr = _arr;
const uint32_t *oarrEnd = _arrEnd;
if (getUnpacked())
clearUnpacked();
if (oarr >= oarrEnd)
goto doneuncompressed;
for (;;) {
if ((int) *oarr >= (int) docId)
goto found;
if (++oarr >= oarrEnd)
goto doneuncompressed;
}
found:
_arr = oarr;
setDocId(*oarr);
return; // Still data
doneuncompressed:
_arr = oarr;
setAtEnd(); // Mark end of data
return; // Ran off end
}
FakeFilterOccArrayIterator::
FakeFilterOccArrayIterator(const uint32_t *arr,
const uint32_t *arrEnd,
const fef::TermFieldMatchDataArray &matchData)
: queryeval::RankedSearchIteratorBase(matchData),
_arr(arr),
_arrEnd(arrEnd)
{
clearUnpacked();
}
void
FakeFilterOccArrayIterator::initRange(uint32_t begin, uint32_t end)
{
queryeval::RankedSearchIteratorBase::initRange(begin, end);
if (_arr < _arrEnd) {
setDocId(*_arr);
} else {
setAtEnd();
}
}
FakeFilterOccArrayIterator::~FakeFilterOccArrayIterator()
{
}
void
FakeFilterOccArrayIterator::doUnpack(uint32_t docId)
{
if (_matchData.size() != 1 || getUnpacked()) {
return;
}
assert(docId == getDocId());
_matchData[0]->reset(docId);
setUnpacked();
}
std::unique_ptr<search::queryeval::SearchIterator>
FakeFilterOcc::
createIterator(const fef::TermFieldMatchDataArray &matchData) const
{
return std::make_unique<FakeFilterOccArrayIterator>(&*_uncompressed.begin(), &*_uncompressed.end(), matchData);
}
}
|
