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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "groupengine.h"
#include <vespa/searchlib/expression/nullresultnode.h>
#include <vespa/searchlib/common/sort.h>
#include <vespa/vespalib/stllike/hash_set.hpp>
#include <cassert>
using namespace search::expression;
using namespace search::aggregation;
namespace search::grouping {
GroupEngine::GroupEngine(const GroupingLevel * request, size_t level, GroupEngine * nextEngine, bool frozen) :
Collect(request->getGroupPrototype()),
_request(request),
_nextEngine(nextEngine),
_idByteSize(0),
_ids(),
_idScratch(),
_rank(),
_groupBacking(),
_level(level),
_frozen(frozen)
{
if ((request != NULL) && (level > 0)) {
_idScratch.reset(request->getExpression().getResult()->clone());
} else {
_idScratch.reset(new NullResultNode());
}
_idByteSize = _idScratch->getRawByteSize();
}
GroupEngine::~GroupEngine()
{
if (_idByteSize) {
for (size_t i(0), m(_ids.size()/_idByteSize); i < m; i++) {
_idScratch->destroy(&_ids[getIdBase(GroupRef(i))]);
}
}
for (size_t i(0), m(_groupBacking.size()); i < m; i++) {
delete _groupBacking[i];
}
}
GroupRef GroupEngine::group(Children & children, uint32_t docId, double rank)
{
const ExpressionTree &selector = _request->getExpression();
if (!selector.execute(docId, rank)) {
throw std::runtime_error("Does not know how to handle failed select statements");
}
const ResultNode &selectResult = *selector.getResult();
auto found = children.find(selectResult);
GroupRef gr;
if (found == children.end()) {
if (_request->allowMoreGroups(children.size())) {
gr = createGroup(selectResult);
_rank.push_back(rank);
children.insert(gr);
} else {
return gr;
}
} else {
gr = *found;
}
if (_nextEngine != NULL) {
_nextEngine->group(*_groupBacking[gr], docId, rank);
}
return gr;
}
void GroupEngine::group(uint32_t docId, double rank)
{
if (_nextEngine != NULL) {
_nextEngine->group(*_groupBacking[0], docId, rank);
}
}
void GroupEngine::merge(Children &, const GroupEngine &)
{
}
void GroupEngine::merge(const GroupEngine & b)
{
if (_nextEngine != NULL) {
_nextEngine->merge(*_groupBacking[0], *b._nextEngine);
}
}
std::unique_ptr<GroupEngine::Children>
GroupEngine::createChildren() {
return std::unique_ptr<Children>(new Children(0, GroupHash(*this), GroupEqual(*this)));
}
#if 0
int GroupEngine::cmpRank(GroupRef a, GroupRef b) const
{
#if 0
return cmpAggr(a, b);
#else
#if 0
int diff(cmpAggr(a, b));
return diff
? diff
: ((_rank[a] > _rank[b])
? -1
: ((_rank[a] < _rank[b]) ? 1 : 0));
#else
return (_rank[a] > _rank[b])
? -1
: ((_rank[a] < _rank[b]) ? 1 : 0);
#endif
#endif
}
#endif
GroupRef GroupEngine::createGroup(const search::expression::ResultNode & v)
{
GroupRef gr(_idByteSize ? _ids.size()/_idByteSize : 0);
_ids.resize(getIdBase(GroupRef(gr + 1)));
uint8_t * base(&_ids[getIdBase(gr)]);
v.create(base);
v.encode(base);
if (_nextEngine != NULL) {
_groupBacking.push_back(_nextEngine->createChildren().release());
}
return gr;
}
GroupRef
GroupEngine::createFullGroup(const search::expression::ResultNode & v)
{
GroupRef gr(GroupEngine::createGroup(v));
createCollectors(gr);
return gr;
}
namespace {
class RadixAccess {
public:
RadixAccess(const uint64_t * v) : _radix(v) { }
uint64_t operator () (size_t i) const { return _radix[i]; }
private:
const uint64_t * _radix;
};
}
Group::UP GroupEngine::getGroup(GroupRef ref) const
{
Group::UP p(new Group(_request->getGroupPrototype()));
Group & g(*p);
g.setId(getGroupId(ref));
g.setRank(_rank[ref]);
if (_nextEngine != NULL) {
const Children & ch(*_groupBacking[ref]);
std::vector<GroupRef> v(ch.size());
{
size_t i(0);
for (const auto& elem : ch) {
v[i++] = elem;
}
}
uint64_t maxN(_nextEngine->_request->getPrecision());
if (maxN < v.size()) {
#if 0
std::sort(v.begin(), v.end(), GroupRankLess(*_nextEngine));
#else
size_t radixSorted;
if (_nextEngine->hasSpecifiedOrder()) {
uint64_t * radixCache = new uint64_t[v.size()];
if (_nextEngine->isPrimarySortKeyAscending()) {
for (size_t i(0); i < v.size(); i++) {
radixCache[i] = _nextEngine->radixAggrAsc(GroupRef(i));
}
} else {
for (size_t i(0); i < v.size(); i++) {
radixCache[i] = _nextEngine->radixAggrDesc(GroupRef(i));
}
}
radixSorted = ShiftBasedRadixSorter<GroupRef, RadixAccess, GroupRankLess, 56>::
radix_sort(RadixAccess(radixCache), GroupRankLess(*_nextEngine), &v[0], v.size(), 16, maxN);
delete [] radixCache;
} else {
radixSorted = ShiftBasedRadixSorter<GroupRef, GroupRankRadix, GroupRankLess, 56>::
radix_sort(GroupRankRadix(*_nextEngine), GroupRankLess(*_nextEngine), &v[0], v.size(), 16, maxN);
}
assert(radixSorted >= maxN);
assert(radixSorted <= v.size());
v.resize(radixSorted);
std::sort(v.begin(), v.end(), GroupRankLess(*_nextEngine));
#endif
v.resize(maxN);
}
std::sort(v.begin(), v.end(), GroupIdLess(*_nextEngine));
for (size_t i(0); i < v.size(); i++) {
g.addChild(_nextEngine->getGroup(v[i]));
}
}
getCollectors(ref, g);
return p;
}
GroupRef
GroupEngine::preFillEngine(const Group & r, size_t depth)
{
GroupRef gr;
if (depth >= _level) {
gr = (r.hasId())
? createFullGroup(r.getId())
: createFullGroup(NullResultNode());
_rank.push_back(r.getRank());
if (_nextEngine != NULL) {
Children & ch(*_groupBacking[gr]);
for (size_t i(0), m(r.getChildrenSize()); i < m; i++) {
GroupRef tmp = _nextEngine->preFillEngine(r.getChild(i), depth);
if (tmp.valid()) {
ch.insert(tmp);
}
}
}
preFill(gr, r);
}
return gr;
}
}
// this function was added by ../../forcelink.sh
void forcelink_file_searchlib_grouping_groupengine() {}
|
