blob: 1f04a4a804b84db8cc631f548838a192bfe3824f (
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
40
41
42
43
44
45
46
47
48
49
50
51
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "diskindex.h"
#include <vespa/searchlib/queryeval/blueprint.h>
namespace search::diskindex {
/**
* Blueprint implementation for term searching in a disk index.
**/
class DiskTermBlueprint : public queryeval::SimpleLeafBlueprint
{
private:
queryeval::FieldSpec _field;
const DiskIndex & _diskIndex;
vespalib::string _query_term;
DiskIndex::LookupResult::UP _lookupRes;
bool _useBitVector;
bool _fetchPostingsDone;
index::PostingListHandle::UP _postingHandle;
BitVector::UP _bitVector;
public:
/**
* Create a new blueprint.
*
* @param field the field to search in.
* @param diskIndex the disk index used to read the bit vector or posting list.
* @param lookupRes the result after disk dictionary lookup.
* @param useBitVector whether or not we should use bit vector.
**/
DiskTermBlueprint(const queryeval::FieldSpec & field,
const DiskIndex & diskIndex,
const vespalib::string& query_term,
DiskIndex::LookupResult::UP lookupRes,
bool useBitVector);
// Inherit doc from Blueprint.
// For now, this DiskTermBlueprint instance must have longer lifetime than the created iterator.
std::unique_ptr<queryeval::SearchIterator> createLeafSearch(const fef::TermFieldMatchDataArray & tfmda, bool strict) const override;
void fetchPostings(const queryeval::ExecuteInfo &execInfo) override;
std::unique_ptr<queryeval::SearchIterator> createFilterSearch(bool strict, FilterConstraint) const override;
void visitMembers(vespalib::ObjectVisitor& visitor) const override;
};
}
|
