blob: 3d9e3095536a11eb471eecaefe4a7458427ab88a (
plain) (
blame)
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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "iterator_pack.h"
#include <vespa/searchlib/common/bitvector.h>
namespace search {
AttributeIteratorPack::~AttributeIteratorPack() = default;
AttributeIteratorPack::AttributeIteratorPack(std::vector<DocumentWeightIterator> &&children)
: _children(std::move(children))
{
assert(_children.size() < 0x10000);
}
std::unique_ptr<BitVector>
AttributeIteratorPack::get_hits(uint32_t begin_id, uint32_t end_id) {
BitVector::UP result(BitVector::create(begin_id, end_id));
or_hits_into(*result, begin_id);
return result;
}
void
AttributeIteratorPack::or_hits_into(BitVector &result, uint32_t begin_id) {
for (size_t i = 0; i < size(); ++i) {
uint32_t docId = get_docid(i);
if (begin_id > docId) {
docId = seek(i, begin_id);
}
for (uint32_t limit = result.size(); docId < limit; docId = next(i)) {
result.setBit(docId);
}
}
result.invalidateCachedCount();
}
}
|