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
|
#include <Processors/Transforms/CubeTransform.h>
#include <Processors/Transforms/TotalsHavingTransform.h>
#include <Processors/QueryPlan/AggregatingStep.h>
#include "Processors/Transforms/RollupTransform.h"
namespace DB
{
namespace ErrorCodes
{
extern const int LOGICAL_ERROR;
}
CubeTransform::CubeTransform(Block header, AggregatingTransformParamsPtr params_, bool use_nulls_)
: GroupByModifierTransform(std::move(header), params_, use_nulls_)
, aggregates_mask(getAggregatesMask(params->getHeader(), params->params.aggregates))
{
if (keys.size() >= 8 * sizeof(mask))
throw Exception(ErrorCodes::LOGICAL_ERROR, "Too many keys are used for CubeTransform.");
}
Chunk CubeTransform::generate()
{
if (!consumed_chunks.empty())
{
mergeConsumed();
auto num_rows = current_chunk.getNumRows();
mask = (static_cast<UInt64>(1) << keys.size()) - 1;
current_columns = current_chunk.getColumns();
current_zero_columns.clear();
current_zero_columns.reserve(keys.size());
for (auto key : keys)
current_zero_columns.emplace_back(getColumnWithDefaults(key, num_rows));
}
auto gen_chunk = std::move(current_chunk);
if (mask)
{
--mask;
auto columns = current_columns;
auto size = keys.size();
for (size_t i = 0; i < size; ++i)
/// Reverse bit order to support previous behaviour.
if ((mask & (UInt64(1) << (size - i - 1))) == 0)
columns[keys[i]] = current_zero_columns[i];
Chunks chunks;
chunks.emplace_back(std::move(columns), current_columns.front()->size());
current_chunk = merge(std::move(chunks), !use_nulls, false);
}
finalizeChunk(gen_chunk, aggregates_mask);
if (!gen_chunk.empty())
gen_chunk.addColumn(0, ColumnUInt64::create(gen_chunk.getNumRows(), grouping_set++));
return gen_chunk;
}
}
|
