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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "groupingcontext.h"
#include <vespa/searchlib/aggregation/predicates.h>
#include <vespa/searchlib/aggregation/modifiers.h>
#include <vespa/searchlib/aggregation/hitsaggregationresult.h>
#include <vespa/searchlib/common/bitvector.h>
#include <vespa/log/log.h>
LOG_SETUP(".searchcore/grouping.groupingcontext");
namespace search::grouping {
using aggregation::CountFS4Hits;
using aggregation::FS4HitSetDistributionKey;
void
GroupingContext::deserialize(const char *groupSpec, uint32_t groupSpecLen)
{
if ((groupSpec != nullptr) && (groupSpecLen > 4)) {
vespalib::nbostream is(groupSpec, groupSpecLen);
vespalib::NBOSerializer nis(is);
uint32_t numGroupings = 0;
nis >> numGroupings;
_groupingList.reserve(numGroupings);
for (size_t i = 0; i < numGroupings; i++) {
auto grouping = std::make_shared<search::aggregation::Grouping>();
grouping->deserialize(nis);
_groupingList.push_back(std::move(grouping));
}
}
}
size_t
GroupingContext::countFS4Hits()
{
size_t numFs4Hits(0);
for (auto & g : _groupingList) {
CountFS4Hits counter;
g->select(counter, counter);
numFs4Hits += counter.getHitCount();
}
return numFs4Hits;
}
void
GroupingContext::setDistributionKey(uint32_t distributionKey)
{
for (auto & g : _groupingList) {
FS4HitSetDistributionKey updater(distributionKey);
g->select(updater, updater);
}
}
GroupingContext::GroupingContext(const BitVector & validLids, const vespalib::Clock & clock, vespalib::steady_time timeOfDoom,
const char *groupSpec, uint32_t groupSpecLen, bool enableNested)
: _validLids(validLids),
_clock(clock),
_timeOfDoom(timeOfDoom),
_os(),
_groupingList(),
_enableNestedMultivalueGrouping(enableNested)
{
deserialize(groupSpec, groupSpecLen);
}
GroupingContext::GroupingContext(const BitVector & validLids, const vespalib::Clock & clock, vespalib::steady_time timeOfDoom)
: _validLids(validLids),
_clock(clock),
_timeOfDoom(timeOfDoom),
_os(),
_groupingList(),
_enableNestedMultivalueGrouping(true)
{ }
GroupingContext::GroupingContext(const GroupingContext & rhs)
: _validLids(rhs._validLids),
_clock(rhs._clock),
_timeOfDoom(rhs._timeOfDoom),
_os(),
_groupingList(),
_enableNestedMultivalueGrouping(rhs._enableNestedMultivalueGrouping)
{ }
void
GroupingContext::addGrouping(std::shared_ptr<Grouping> g)
{
_groupingList.push_back(std::move(g));
}
void
GroupingContext::serialize()
{
vespalib::NBOSerializer nos(_os);
nos << (uint32_t)_groupingList.size();
for (const auto & grouping : _groupingList) {
grouping->serialize(nos);
}
}
bool
GroupingContext::needRanking() const
{
if (_groupingList.empty()) {
return false;
}
return true;
}
void
GroupingContext::aggregate(Grouping & grouping, uint32_t docId, HitRank rank) const {
if (_validLids.testBit(docId)) {
grouping.aggregate(docId, rank);
}
}
unsigned int
GroupingContext::aggregateRanked(Grouping &grouping, const RankedHit *rankedHit, unsigned int len) const {
unsigned int i(0);
for(; (i < len) && !hasExpired(); i++) {
aggregate(grouping, rankedHit[i].getDocId(), rankedHit[i].getRank());
}
return i;
}
void
GroupingContext::aggregate(Grouping & grouping, const BitVector * bVec, unsigned int lidLimit) const {
for (uint32_t d(bVec->getFirstTrueBit()); (d < lidLimit) && !hasExpired(); d = bVec->getNextTrueBit(d+1)) {
aggregate(grouping, d, 0.0);
}
}
void
GroupingContext::aggregate(Grouping & grouping, const BitVector * bVec, unsigned int lidLimit, unsigned int topN) const {
for(uint32_t d(bVec->getFirstTrueBit()), i(0); (d < lidLimit) && (i < topN) && !hasExpired(); d = bVec->getNextTrueBit(d+1), i++) {
aggregate(grouping, d, 0.0);
}
}
void
GroupingContext::aggregate(Grouping & grouping, const RankedHit * rankedHit, unsigned int len, const BitVector * bVec) const
{
grouping.preAggregate(false);
uint32_t count = aggregateRanked(grouping, rankedHit, grouping.getMaxN(len));
if (bVec != nullptr) {
int64_t topN = grouping.getTopN();
if (topN > count) {
aggregate(grouping, bVec, bVec->size(), topN - count);
} else {
aggregate(grouping, bVec, bVec->size());
}
}
grouping.postProcess();
}
void
GroupingContext::aggregate(Grouping & grouping, const RankedHit * rankedHit, unsigned int len) const
{
bool isOrdered(! grouping.needResort());
grouping.preAggregate(isOrdered);
search::aggregation::HitsAggregationResult::SetOrdered pred;
grouping.select(pred, pred);
aggregateRanked(grouping, rankedHit, grouping.getMaxN(len));
grouping.postProcess();
}
void
GroupingContext::groupUnordered(const RankedHit *searchResults, uint32_t binSize, const search::BitVector * overflow)
{
for (const auto & g : _groupingList) {
if ( g->needResort() ) {
aggregate(*g, searchResults, binSize, overflow);
LOG(debug, "groupUnordered: %s", g->asString().c_str());
g->cleanTemporary();
g->cleanupAttributeReferences();
}
}
}
void
GroupingContext::groupInRelevanceOrder(const RankedHit *searchResults, uint32_t binSize)
{
for (const auto & g : _groupingList) {
if ( ! g->needResort() ) {
aggregate(*g, searchResults, binSize);
LOG(debug, "groupInRelevanceOrder: %s", g->asString().c_str());
g->cleanTemporary();
g->cleanupAttributeReferences();
}
}
}
}
|
