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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "fake_match_loop.h"
#include "fakeposting.h"
#include <vespa/searchlib/fef/termfieldmatchdataarray.h>
#include <vespa/searchlib/queryeval/andsearch.h>
#include <vespa/searchlib/queryeval/orsearch.h>
#include <vespa/searchlib/queryeval/searchiterator.h>
using search::fef::TermFieldMatchData;
using search::fef::TermFieldMatchDataArray;
using search::queryeval::AndSearch;
using search::queryeval::OrSearch;
using search::queryeval::SearchIterator;
namespace search::fakedata {
namespace {
class IteratorState {
private:
TermFieldMatchData _md;
TermFieldMatchDataArray _tfmda;
std::unique_ptr<SearchIterator> _itr;
public:
IteratorState(const FakePosting& posting)
: _md(),
_tfmda(),
_itr()
{
_tfmda.add(&_md);
_md.setNeedNormalFeatures(posting.enable_unpack_normal_features());
_md.setNeedInterleavedFeatures(posting.enable_unpack_interleaved_features());
_itr = posting.createIterator(_tfmda);
}
~IteratorState() {}
SearchIterator& itr() { return *_itr; }
SearchIterator* release() { return _itr.release(); }
};
template <bool do_unpack>
int
do_match_loop(SearchIterator& itr, uint32_t doc_id_limit)
{
uint32_t hits = 0;
itr.initFullRange();
uint32_t doc_id = itr.getDocId();
while (doc_id < doc_id_limit) {
if (itr.seek(doc_id)) {
++hits;
if (do_unpack) {
itr.unpack(doc_id);
}
++doc_id;
} else if (doc_id < itr.getDocId()) {
doc_id = itr.getDocId();
} else {
++doc_id;
}
}
return hits;
}
}
int
FakeMatchLoop::direct_posting_scan(const FakePosting& posting, uint32_t doc_id_limit)
{
IteratorState state(posting);
return do_match_loop<false>(state.itr(), doc_id_limit);
}
int
FakeMatchLoop::direct_posting_scan_with_unpack(const FakePosting& posting, uint32_t doc_id_limit)
{
IteratorState state(posting);
return do_match_loop<true>(state.itr(), doc_id_limit);
}
int
FakeMatchLoop::and_pair_posting_scan(const FakePosting& posting_1, const FakePosting& posting_2, uint32_t doc_id_limit)
{
IteratorState state_1(posting_1);
IteratorState state_2(posting_2);
std::unique_ptr<SearchIterator> iterator(AndSearch::create({state_1.release(), state_2.release()}, true));
return do_match_loop<false>(*iterator, doc_id_limit);
}
int
FakeMatchLoop::and_pair_posting_scan_with_unpack(const FakePosting& posting_1, const FakePosting& posting_2, uint32_t doc_id_limit)
{
IteratorState state_1(posting_1);
IteratorState state_2(posting_2);
std::unique_ptr<SearchIterator> iterator(AndSearch::create({state_1.release(), state_2.release()}, true));
return do_match_loop<true>(*iterator, doc_id_limit);
}
int
FakeMatchLoop::or_pair_posting_scan(const FakePosting& posting_1, const FakePosting& posting_2, uint32_t doc_id_limit)
{
IteratorState state_1(posting_1);
IteratorState state_2(posting_2);
std::unique_ptr<SearchIterator> iterator(OrSearch::create({state_1.release(), state_2.release()}, true));
return do_match_loop<false>(*iterator, doc_id_limit);
}
int
FakeMatchLoop::or_pair_posting_scan_with_unpack(const FakePosting& posting_1, const FakePosting& posting_2, uint32_t doc_id_limit)
{
IteratorState state_1(posting_1);
IteratorState state_2(posting_2);
std::unique_ptr<SearchIterator> iterator(OrSearch::create({state_1.release(), state_2.release()}, true));
return do_match_loop<true>(*iterator, doc_id_limit);
}
}
|
