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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "orsearch.h"
#include <vespa/vespalib/objects/visit.h>
namespace search::queryeval {
/**
* A simple implementation of the Or search operation.
**/
template <bool strict, typename Unpack>
class OrLikeSearch : public OrSearch
{
protected:
void doSeek(uint32_t docid) override {
const Children & children(getChildren());
for (uint32_t i = 0; i < children.size(); ++i) {
if (children[i]->seek(docid)) {
setDocId(docid);
return;
}
}
if (strict) {
uint32_t minNextId = children[0]->getDocId();
for (uint32_t i = 1; i < children.size(); ++i) {
if (children[i]->getDocId() < minNextId) {
minNextId = children[i]->getDocId();
}
}
setDocId(minNextId);
}
}
Trinary is_strict() const override { return strict ? Trinary::True : Trinary::False; }
void visitMembers(vespalib::ObjectVisitor &visitor) const override {
MultiSearch::visitMembers(visitor);
visit(visitor, "strict", strict);
}
public:
/**
* Create a new Or Search with the given children. A strict Or
* can assume that all children below are also strict. A
* non-strict Or has no strictness assumptions about its children.
*
* @param children the search objects we are or'ing
**/
OrLikeSearch(Children children, const Unpack & unpacker)
: OrSearch(std::move(children)),
_unpacker(unpacker)
{ }
private:
void onRemove(size_t index) override {
_unpacker.onRemove(index);
}
void onInsert(size_t index) override {
_unpacker.onInsert(index);
}
void doUnpack(uint32_t docid) override {
_unpacker.unpack(docid, *this);
}
bool needUnpack(size_t index) const override {
return _unpacker.needUnpack(index);
}
Unpack _unpacker;
};
template <typename Unpack, typename HEAP, typename ref_t>
class StrictHeapOrSearch : public OrSearch
{
private:
struct Less {
const uint32_t *child_docid;
constexpr explicit Less(const std::vector<uint32_t> &cd) noexcept : child_docid(cd.data()) {}
constexpr bool operator()(const ref_t &a, const ref_t &b) const noexcept {
return (child_docid[a] < child_docid[b]);
}
};
std::vector<ref_t> _data;
std::vector<uint32_t> _child_docid;
Unpack _unpacker;
void init_data() {
_data.resize(getChildren().size());
for (size_t i = 0; i < getChildren().size(); ++i) {
_data[i] = i;
}
}
void onRemove(size_t index) final {
_unpacker.onRemove(index);
_child_docid.erase(_child_docid.begin() + index);
init_data();
}
void onInsert(size_t index) final {
_unpacker.onInsert(index);
_child_docid.insert(_child_docid.begin() + index, getChildren()[index]->getDocId());
init_data();
}
void seek_child(ref_t child, uint32_t docid) {
getChildren()[child]->doSeek(docid);
_child_docid[child] = getChildren()[child]->getDocId();
}
ref_t *data_begin() noexcept { return _data.data(); }
ref_t *data_pos(size_t offset) noexcept { return _data.data() + offset; }
ref_t *data_end() noexcept { return _data.data() + _data.size(); }
public:
StrictHeapOrSearch(Children children, const Unpack &unpacker)
: OrSearch(std::move(children)),
_data(),
_child_docid(getChildren().size()),
_unpacker(unpacker)
{
HEAP::require_left_heap();
init_data();
}
~StrictHeapOrSearch() override;
void initRange(uint32_t begin, uint32_t end) final {
OrSearch::initRange(begin, end);
for (size_t i = 0; i < getChildren().size(); ++i) {
_child_docid[i] = getChildren()[i]->getDocId();
}
for (size_t i = 2; i <= _data.size(); ++i) {
HEAP::push(data_begin(), data_pos(i), Less(_child_docid));
}
}
void doSeek(uint32_t docid) final {
while (_child_docid[HEAP::front(data_begin(), data_end())] < docid) {
seek_child(HEAP::front(data_begin(), data_end()), docid);
HEAP::adjust(data_begin(), data_end(), Less(_child_docid));
}
setDocId(_child_docid[HEAP::front(data_begin(), data_end())]);
}
void doUnpack(uint32_t docid) override { // <- not final
_unpacker.each([&](ref_t child) {
if (__builtin_expect(_child_docid[child] == docid, false)) {
getChildren()[child]->doUnpack(docid);
}
}, getChildren().size());
}
bool needUnpack(size_t index) const final {
return _unpacker.needUnpack(index);
}
Trinary is_strict() const final { return Trinary::True; }
};
template <typename Unpack, typename HEAP, typename ref_t>
StrictHeapOrSearch<Unpack, HEAP, ref_t>::~StrictHeapOrSearch() = default;
}
|
