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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "andsearch.h"
#include "andsearchstrict.h"
#include "termwise_helper.h"
#include <vespa/searchlib/common/bitvector.h>
namespace search::queryeval {
BitVector::UP
AndSearch::get_hits(uint32_t begin_id) {
return TermwiseHelper::andChildren(getChildren().begin(), getChildren().end(), begin_id);
}
void
AndSearch::or_hits_into(BitVector &result, uint32_t begin_id) {
result.orWith(*get_hits(begin_id));
}
void
AndSearch::and_hits_into(BitVector &result, uint32_t begin_id)
{
TermwiseHelper::andChildren(result, getChildren().begin(), getChildren().end(), begin_id);
}
SearchIterator::UP
AndSearch::andWith(UP filter, uint32_t estimate_)
{
return offerFilterToChildren(std::move(filter), estimate_);
}
SearchIterator::UP
AndSearch::offerFilterToChildren(UP filter, uint32_t estimate_)
{
const Children & children(getChildren());
for (uint32_t i(0); filter && (i < children.size()); ++i) {
filter = children[i]->andWith(std::move(filter), estimate_);
}
return filter;
}
void
AndSearch::doUnpack(uint32_t docid)
{
const Children & children(getChildren());
for (uint32_t i(0); i < children.size(); ++i) {
children[i]->doUnpack(docid);
}
}
AndSearch::AndSearch(Children children) :
MultiSearch(std::move(children)),
_estimate(std::numeric_limits<uint32_t>::max())
{
}
namespace {
class FullUnpack
{
public:
void unpack(uint32_t docid, const MultiSearch & search) {
const MultiSearch::Children & children(search.getChildren());
for (uint32_t i(0); i < children.size(); ++i) {
children[i]->doUnpack(docid);
}
}
bool needUnpack(size_t index) const {
(void) index;
return true;
}
void onRemove(size_t index) { (void) index; }
void onInsert(size_t index) { (void) index; }
};
class SelectiveUnpack
{
public:
SelectiveUnpack(const UnpackInfo & unpackInfo) :
_unpackInfo(unpackInfo)
{ }
void unpack(uint32_t docid, const MultiSearch & search) {
auto &children = search.getChildren();
_unpackInfo.each([&children,docid](size_t i){children[i]->doUnpack(docid);},
children.size());
}
bool needUnpack(size_t index) const {
return _unpackInfo.needUnpack(index);
}
void onRemove(size_t index) {
_unpackInfo.remove(index);
}
void onInsert(size_t index) {
_unpackInfo.insert(index);
}
private:
UnpackInfo _unpackInfo;
};
}
std::unique_ptr<AndSearch>
AndSearch::create(ChildrenIterators children, bool strict)
{
UnpackInfo unpackInfo;
unpackInfo.forceAll();
return create(std::move(children), strict, unpackInfo);
}
std::unique_ptr<AndSearch>
AndSearch::create(ChildrenIterators children, bool strict, const UnpackInfo & unpackInfo) {
if (strict) {
if (unpackInfo.unpackAll()) {
using MyAnd = AndSearchStrict<FullUnpack>;
return std::make_unique<MyAnd>(std::move(children), FullUnpack());
} else if(unpackInfo.empty()) {
using MyAnd = AndSearchStrict<NoUnpack>;
return std::make_unique<MyAnd>(std::move(children), NoUnpack());
} else {
using MyAnd = AndSearchStrict<SelectiveUnpack>;
return std::make_unique<MyAnd>(std::move(children), SelectiveUnpack(unpackInfo));
}
} else {
if (unpackInfo.unpackAll()) {
using MyAnd = AndSearchNoStrict<FullUnpack>;
return std::make_unique<MyAnd>(std::move(children), FullUnpack());
} else if (unpackInfo.empty()) {
using MyAnd = AndSearchNoStrict<NoUnpack>;
return std::make_unique<MyAnd>(std::move(children), NoUnpack());
} else {
using MyAnd = AndSearchNoStrict<SelectiveUnpack>;
return std::make_unique<MyAnd>(std::move(children), SelectiveUnpack(unpackInfo));
}
}
}
}
|
