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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "querycompletenessfeature.h"
#include "utils.h"
#include <vespa/searchlib/fef/featurenamebuilder.h>
#include <vespa/searchlib/fef/itermdata.h>
#include <vespa/vespalib/util/stash.h>
#include <limits>
#include <vespa/log/log.h>
LOG_SETUP(".features.querycompleteness");
namespace search::features {
QueryCompletenessConfig::QueryCompletenessConfig() :
fieldId(search::fef::IllegalHandle),
fieldBegin(0),
fieldEnd(std::numeric_limits<uint32_t>::max())
{
// empty
}
QueryCompletenessExecutor::QueryCompletenessExecutor(const search::fef::IQueryEnvironment &env,
const QueryCompletenessConfig &config) :
search::fef::FeatureExecutor(),
_config(config),
_fieldHandles()
{
for (uint32_t i = 0; i < env.getNumTerms(); ++i) {
const search::fef::TermFieldHandle handle = util::getTermFieldHandle(env, i, config.fieldId);
if (handle != search::fef::IllegalHandle) {
_fieldHandles.push_back(handle);
}
}
}
void
QueryCompletenessExecutor::execute(uint32_t docId)
{
uint32_t hit = 0, miss = 0;
for (const auto& handle : _fieldHandles) {
const fef::TermFieldMatchData &tfmd = *_md->resolveTermField(handle);
if (tfmd.getDocId() == docId) {
search::fef::FieldPositionsIterator field = tfmd.getIterator();
while (field.valid() && field.getPosition() < _config.fieldBegin) {
field.next();
}
if (field.valid() && field.getPosition() < _config.fieldEnd) {
++hit;
} else {
++miss;
}
} else {
++miss;
}
}
outputs().set_number(0, hit);
outputs().set_number(1, miss);
}
void
QueryCompletenessExecutor::handle_bind_match_data(const fef::MatchData &md)
{
_md = &md;
}
QueryCompletenessBlueprint::QueryCompletenessBlueprint() :
search::fef::Blueprint("queryCompleteness"),
_config()
{
// empty
}
void
QueryCompletenessBlueprint::visitDumpFeatures(const search::fef::IIndexEnvironment &,
search::fef::IDumpFeatureVisitor &) const
{
// empty
}
bool
QueryCompletenessBlueprint::setup(const search::fef::IIndexEnvironment &,
const search::fef::ParameterList ¶ms)
{
_config.fieldId = params[0].asField()->id();
if (params.size() > 1) {
_config.fieldBegin = params[1].asInteger();
if (params.size() == 3) {
_config.fieldEnd = params[2].asInteger();
}
if (_config.fieldBegin >= _config.fieldEnd) {
LOG(error, "Can not calculate query completeness for field '%s' because range is malformed (from %d to %d).",
params[0].getValue().c_str(), _config.fieldBegin, _config.fieldEnd);
return false;
}
}
describeOutput("hit", "The number of query terms matched in field.");
describeOutput("miss", "The number of query terms not matched in field.");
return true;
}
search::fef::Blueprint::UP
QueryCompletenessBlueprint::createInstance() const
{
return std::make_unique<QueryCompletenessBlueprint>();
}
search::fef::FeatureExecutor &
QueryCompletenessBlueprint::createExecutor(const search::fef::IQueryEnvironment &env, vespalib::Stash &stash) const
{
return stash.create<QueryCompletenessExecutor>(env, _config);
}
}
|
