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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "searchiterator.h"
#include <vespa/searchlib/index/docidandfeatures.h>
#include <vespa/vespalib/objects/objectdumper.h>
#include <vespa/vespalib/objects/object2slime.h>
#include <vespa/vespalib/objects/visit.h>
#include <vespa/vespalib/util/classname.h>
#include <vespa/searchlib/common/bitvector.h>
#include <vespa/vespalib/data/slime/inserter.h>
namespace search::queryeval {
BitVector::UP
SearchIterator::get_hits(uint32_t begin_id)
{
BitVector::UP result(BitVector::create(begin_id, getEndId()));
uint32_t docid = std::max(begin_id, getDocId());
while (!isAtEnd(docid)) {
if (seek(docid)) {
result->setBit(docid);
}
docid = std::max(docid + 1, getDocId());
}
result->invalidateCachedCount();
return result;
}
SearchIterator::UP
SearchIterator::andWith(UP filter, uint32_t estimate)
{
(void) estimate;
return filter;
}
void
SearchIterator::or_hits_into(BitVector &result, uint32_t begin_id)
{
uint32_t docid = std::max(begin_id, getDocId());
while (!isAtEnd(docid)) {
docid = result.getNextFalseBit(docid);
if (!isAtEnd(docid) && seek(docid)) {
result.setBit(docid);
}
docid = std::max(docid + 1, getDocId());
}
result.invalidateCachedCount();
}
void
SearchIterator::and_hits_into_non_strict(BitVector &result, uint32_t begin_id)
{
result.foreach_truebit([&](uint32_t key) { if ( ! seek(key)) { result.clearBit(key); }}, begin_id);
result.invalidateCachedCount();
}
void
SearchIterator::and_hits_into_strict(BitVector &result, uint32_t begin_id)
{
seek(begin_id);
uint32_t docidA = getDocId();
uint32_t docidB = result.getNextTrueBit(begin_id);
while (!isAtEnd(docidB) && !isAtEnd(docidA)) {
if (docidA < docidB) {
if (seek(docidB)) {
docidA = docidB;
} else {
docidA = getDocId();
}
} else if (docidA > docidB) {
result.clearInterval(docidB, docidA);
docidB = result.getNextTrueBit(docidA);
} else {
docidB = result.getNextTrueBit(docidB+1);
}
}
result.clearInterval(docidB, result.size());
}
void
SearchIterator::and_hits_into(BitVector &result, uint32_t begin_id)
{
if (is_strict() == vespalib::Trinary::True) {
and_hits_into_strict(result, begin_id);
} else {
and_hits_into_non_strict(result, begin_id);
}
}
vespalib::string
SearchIterator::asString() const
{
vespalib::ObjectDumper dumper;
visit(dumper, "", this);
return dumper.toString();
}
vespalib::slime::Cursor &
SearchIterator::asSlime(const vespalib::slime::Inserter & inserter) const
{
vespalib::slime::Cursor & cursor = inserter.insertObject();
vespalib::Object2Slime dumper(cursor);
visit(dumper, "", this);
return cursor;
}
vespalib::string
SearchIterator::getClassName() const
{
return vespalib::getClassName(*this);
}
void
SearchIterator::visitMembers(vespalib::ObjectVisitor &visitor) const
{
visit(visitor, "docid", _docid);
visit(visitor, "endid", _endid);
}
void
SearchIterator::disclose_children(std::vector<UP*> &)
{
}
}
//-----------------------------------------------------------------------------
void visit(vespalib::ObjectVisitor &self, const vespalib::string &name,
const search::queryeval::SearchIterator *obj)
{
if (obj != 0) {
self.openStruct(name, obj->getClassName());
obj->visitMembers(self);
self.closeStruct();
} else {
self.visitNull(name);
}
}
void visit(vespalib::ObjectVisitor &self, const vespalib::string &name,
const search::queryeval::SearchIterator &obj)
{
visit(self, name, &obj);
}
|
