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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "postinglistsearchcontext.hpp"
#include "attributeiterators.hpp"
#include "diversity.hpp"
#include <vespa/vespalib/btree/btreeiterator.hpp>
namespace search::attribute {
using vespalib::btree::BTreeNode;
PostingListSearchContext::
PostingListSearchContext(const IEnumStoreDictionary& dictionary, bool has_btree_dictionary, uint32_t docIdLimit,
uint64_t numValues, bool hasWeight, bool useBitVector, const ISearchContext &baseSearchCtx)
: _dictionary(dictionary),
_baseSearchCtx(baseSearchCtx),
_bv(nullptr),
_frozenDictionary(has_btree_dictionary ? _dictionary.get_posting_dictionary().getFrozenView() : FrozenDictionary()),
_lowerDictItr(has_btree_dictionary ? DictionaryConstIterator(BTreeNode::Ref(), _frozenDictionary.getAllocator()) : DictionaryConstIterator()),
_upperDictItr(has_btree_dictionary ? DictionaryConstIterator(BTreeNode::Ref(), _frozenDictionary.getAllocator()) : DictionaryConstIterator()),
_numValues(numValues),
_uniqueValues(0u),
_docIdLimit(docIdLimit),
_dictSize(_frozenDictionary.size()),
_pidx(),
_frozenRoot(),
_FSTC(0.0),
_PLSTC(0.0),
_hasWeight(hasWeight),
_useBitVector(useBitVector),
_counted_hits()
{
}
PostingListSearchContext::~PostingListSearchContext() = default;
void
PostingListSearchContext::lookupTerm(const vespalib::datastore::EntryComparator &comp)
{
auto lookup_result = _dictionary.find_posting_list(comp, _frozenDictionary.getRoot());
if (lookup_result.first.valid()) {
_pidx = lookup_result.second;
_uniqueValues = 1u;
}
}
void
PostingListSearchContext::lookupRange(const vespalib::datastore::EntryComparator &low,
const vespalib::datastore::EntryComparator &high)
{
if (!_dictionary.get_has_btree_dictionary()) {
_uniqueValues = 2; // Avoid zero and single value optimizations, use filtering
return;
}
_lowerDictItr.lower_bound(_frozenDictionary.getRoot(), AtomicEntryRef(), low);
_upperDictItr = _lowerDictItr;
if (_upperDictItr.valid() && !high.less(EnumIndex(), _upperDictItr.getKey().load_acquire())) {
_upperDictItr.seekPast(AtomicEntryRef(), high);
}
_uniqueValues = _upperDictItr - _lowerDictItr;
}
void
PostingListSearchContext::lookupSingle()
{
if (_lowerDictItr.valid()) {
_pidx = _lowerDictItr.getData().load_acquire();
}
}
template class PostingListSearchContextT<vespalib::btree::BTreeNoLeafData>;
template class PostingListSearchContextT<int32_t>;
template class PostingListFoldedSearchContextT<vespalib::btree::BTreeNoLeafData>;
template class PostingListFoldedSearchContextT<int32_t>;
}
|
