blob: b0d45ee0684babb3eaae2f5463b43cac3aca002c (
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
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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "querynodes.h"
#include "termdatafromnode.h"
#include "viewresolver.h"
#include "handlerecorder.h"
#include <vespa/searchlib/query/tree/templatetermvisitor.h>
#include <vespa/searchlib/queryeval/orsearch.h>
#include <vespa/log/log.h>
LOG_SETUP(".proton.matching.querynodes");
using search::fef::FieldInfo;
using search::fef::FieldType;
using search::fef::IIndexEnvironment;
using search::fef::MatchData;
using search::fef::MatchDataLayout;
using search::fef::TermFieldHandle;
using search::query::Node;
using search::query::TemplateTermVisitor;
using search::query::Weight;
using search::queryeval::OrSearch;
using search::queryeval::SearchIterator;
using std::map;
using std::vector;
using vespalib::string;
namespace proton::matching {
ProtonTermData::ProtonTermData() = default;
ProtonTermData::ProtonTermData(const ProtonTermData &) = default;
ProtonTermData & ProtonTermData::operator = (const ProtonTermData &) = default;
ProtonTermData::~ProtonTermData() = default;
void
ProtonTermData::setDocumentFrequency(double freq)
{
for (size_t i = 0; i < _fields.size(); ++i) {
_fields[i].setDocFreq(freq);
}
}
void
ProtonTermData::resolve(const ViewResolver &resolver,
const IIndexEnvironment &idxEnv,
const string &view,
bool forceFilter)
{
std::vector<string> fields;
resolver.resolve(((view == "") ? "default" : view), fields);
_fields.clear();
_fields.reserve(fields.size());
for (size_t i = 0; i < fields.size(); ++i) {
const FieldInfo *info = idxEnv.getFieldByName(fields[i]);
if (info != 0) {
_fields.push_back(FieldEntry(fields[i], info->id()));
_fields.back().attribute_field =
(info->type() == FieldType::ATTRIBUTE) ||
(info->type() == FieldType::HIDDEN_ATTRIBUTE);
_fields.back().filter_field = forceFilter ? true : info->isFilter();
} else {
LOG(debug, "ignoring undefined field: '%s'", fields[i].c_str());
}
}
}
void
ProtonTermData::resolveFromChildren(const std::vector<Node *> &subterms)
{
for (size_t i = 0; i < subterms.size(); ++i) {
const ProtonTermData *child = termDataFromNode(*subterms[i]);
if (child == 0) {
LOG(warning, "child of equiv is not a term");
continue;
}
for (size_t j = 0; j < child->numFields(); ++j) {
FieldSpec subSpec = child->field(j).fieldSpec();
if (lookupField(subSpec.getFieldId()) == 0) {
// this must happen before handles are reserved
LOG_ASSERT(subSpec.getHandle() == search::fef::IllegalHandle);
_fields.push_back(FieldEntry(subSpec.getName(), subSpec.getFieldId()));
}
}
}
}
void
ProtonTermData::allocateTerms(MatchDataLayout &mdl)
{
for (size_t i = 0; i < _fields.size(); ++i) {
_fields[i].setHandle(mdl.allocTermField(_fields[i].getFieldId()));
}
}
void
ProtonTermData::setDocumentFrequency(uint32_t estHits, uint32_t docIdLimit)
{
if (docIdLimit > 1) {
double hits = estHits;
setDocumentFrequency(hits / (docIdLimit - 1));
} else {
setDocumentFrequency(0.0);
}
}
const ProtonTermData::FieldEntry *
ProtonTermData::lookupField(uint32_t fieldId) const
{
for (size_t i = 0; i < _fields.size(); ++i) {
if (_fields[i].getFieldId() == fieldId) {
return &_fields[i];
}
}
return 0;
}
TermFieldHandle
ProtonTermData::FieldEntry::getHandle() const
{
TermFieldHandle handle(search::fef::SimpleTermFieldData::getHandle());
HandleRecorder::registerHandle(handle);
return handle;
}
}
|
