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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "posting_iterator.h"
#include <vespa/searchlib/queryeval/iterators.h>
#include <vespa/searchlib/fef/termfieldmatchdata.h>
#include <vespa/vespalib/btree/btreeiterator.hpp>
#include <vespa/vespalib/btree/btreenode.hpp>
#include <vespa/vespalib/btree/btreenodeallocator.hpp>
#include <vespa/vespalib/btree/btreenodestore.hpp>
#include <vespa/vespalib/btree/btreeroot.hpp>
#include <vespa/vespalib/btree/btreestore.hpp>
#include <vespa/log/log.h>
LOG_SETUP(".searchlib.memoryindex.posting_iterator");
namespace search::memoryindex {
/**
* Base search iterator over memory field index posting list.
*
* The template parameter specifies whether the wrapped posting list has interleaved features or not.
*/
template <bool interleaved_features>
class PostingIteratorBase : public queryeval::RankedSearchIteratorBase {
protected:
using FieldIndexType = FieldIndex<interleaved_features>;
using PostingListIteratorType = typename FieldIndexType::PostingList::ConstIterator;
PostingListIteratorType _itr;
const FeatureStore& _feature_store;
FeatureStore::DecodeContextCooked _feature_decoder;
public:
PostingIteratorBase(PostingListIteratorType itr,
const FeatureStore& feature_store,
uint32_t field_id,
fef::TermFieldMatchDataArray match_data);
~PostingIteratorBase();
void doSeek(uint32_t docId) override;
void initRange(uint32_t begin, uint32_t end) override;
Trinary is_strict() const override { return Trinary::True; }
};
template <bool interleaved_features>
PostingIteratorBase<interleaved_features>::PostingIteratorBase(PostingListIteratorType itr,
const FeatureStore& feature_store,
uint32_t field_id,
fef::TermFieldMatchDataArray match_data) :
queryeval::RankedSearchIteratorBase(std::move(match_data)),
_itr(itr),
_feature_store(feature_store),
_feature_decoder(nullptr)
{
_feature_store.setupForField(field_id, _feature_decoder);
}
template <bool interleaved_features>
PostingIteratorBase<interleaved_features>::~PostingIteratorBase() = default;
template <bool interleaved_features>
void
PostingIteratorBase<interleaved_features>::initRange(uint32_t begin, uint32_t end)
{
SearchIterator::initRange(begin, end);
_itr.lower_bound(begin);
if (!_itr.valid() || isAtEnd(_itr.getKey())) {
setAtEnd();
} else {
setDocId(_itr.getKey());
}
clearUnpacked();
}
template <bool interleaved_features>
void
PostingIteratorBase<interleaved_features>::doSeek(uint32_t docId)
{
if (getUnpacked()) {
clearUnpacked();
}
_itr.linearSeek(docId);
if (!_itr.valid()) {
setAtEnd();
} else {
setDocId(_itr.getKey());
}
}
/**
* Search iterator over memory field index posting list.
*
* Template parameters:
* - interleaved_features: specifies whether the wrapped posting list has interleaved features or not.
* - unpack_normal_features: specifies whether to unpack normal features or not.
* - unpack_interleaved_features: specifies whether to unpack interleaved features or not.
*/
template <bool interleaved_features, bool unpack_normal_features, bool unpack_interleaved_features>
class PostingIterator : public PostingIteratorBase<interleaved_features> {
public:
using ParentType = PostingIteratorBase<interleaved_features>;
using ParentType::ParentType;
using ParentType::_feature_decoder;
using ParentType::_feature_store;
using ParentType::_itr;
using ParentType::_matchData;
using ParentType::getDocId;
using ParentType::getUnpacked;
using ParentType::setUnpacked;
void doUnpack(uint32_t docId) override;
};
template <bool interleaved_features, bool unpack_normal_features, bool unpack_interleaved_features>
void
PostingIterator<interleaved_features, unpack_normal_features, unpack_interleaved_features>::doUnpack(uint32_t docId)
{
if (!_matchData.valid() || getUnpacked()) {
return;
}
assert(docId == getDocId());
assert(_itr.valid());
assert(docId == _itr.getKey());
if (unpack_normal_features) {
vespalib::datastore::EntryRef featureRef(_itr.getData().get_features());
_feature_store.setupForUnpackFeatures(featureRef, _feature_decoder);
_feature_decoder.unpackFeatures(_matchData, docId);
} else {
_matchData[0]->reset(docId);
}
if (interleaved_features && unpack_interleaved_features) {
auto* tfmd = _matchData[0];
tfmd->setNumOccs(_itr.getData().get_num_occs());
tfmd->setFieldLength(_itr.getData().get_field_length());
}
setUnpacked();
}
template <bool interleaved_features>
queryeval::SearchIterator::UP
make_search_iterator(typename FieldIndex<interleaved_features>::PostingList::ConstIterator itr,
const FeatureStore& feature_store,
uint32_t field_id,
fef::TermFieldMatchDataArray match_data)
{
assert(match_data.size() == 1);
auto* tfmd = match_data[0];
if (tfmd->needs_normal_features()) {
if (tfmd->needs_interleaved_features()) {
return std::make_unique<PostingIterator<interleaved_features, true, true>>
(itr, feature_store, field_id, std::move(match_data));
} else {
return std::make_unique<PostingIterator<interleaved_features, true, false>>
(itr, feature_store, field_id, std::move(match_data));
}
} else {
if (tfmd->needs_interleaved_features()) {
return std::make_unique<PostingIterator<interleaved_features, false, true>>
(itr, feature_store, field_id, std::move(match_data));
} else {
return std::make_unique<PostingIterator<interleaved_features, false, false>>
(itr, feature_store, field_id, std::move(match_data));
}
}
}
template
queryeval::SearchIterator::UP
make_search_iterator<false>(typename FieldIndex<false>::PostingList::ConstIterator,
const FeatureStore&,
uint32_t,
fef::TermFieldMatchDataArray);
template
queryeval::SearchIterator::UP
make_search_iterator<true>(typename FieldIndex<true>::PostingList::ConstIterator,
const FeatureStore&,
uint32_t,
fef::TermFieldMatchDataArray);
template class PostingIteratorBase<false>;
template class PostingIteratorBase<true>;
template class PostingIterator<false, false, false>;
template class PostingIterator<false, false, true>;
template class PostingIterator<false, true, false>;
template class PostingIterator<false, true, true>;
template class PostingIterator<true, false, false>;
template class PostingIterator<true, false, true>;
template class PostingIterator<true, true, false>;
template class PostingIterator<true, true, true>;
}
|
