mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-13 19:14:30 +00:00
94 lines
2.4 KiB
C++
94 lines
2.4 KiB
C++
#include <DataStreams/CubeBlockInputStream.h>
|
|
#include <DataStreams/finalizeBlock.h>
|
|
#include <DataTypes/DataTypeAggregateFunction.h>
|
|
#include <Columns/ColumnAggregateFunction.h>
|
|
#include <Columns/FilterDescription.h>
|
|
#include <Common/typeid_cast.h>
|
|
|
|
namespace DB
|
|
{
|
|
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int TOO_MANY_COLUMNS;
|
|
}
|
|
|
|
CubeBlockInputStream::CubeBlockInputStream(
|
|
const BlockInputStreamPtr & input_, const Aggregator::Params & params_) : aggregator(params_),
|
|
keys(params_.keys)
|
|
{
|
|
if (keys.size() > 30)
|
|
throw Exception("Too many columns for cube", ErrorCodes::TOO_MANY_COLUMNS);
|
|
|
|
children.push_back(input_);
|
|
Aggregator::CancellationHook hook = [this]() { return this->isCancelled(); };
|
|
aggregator.setCancellationHook(hook);
|
|
}
|
|
|
|
|
|
Block CubeBlockInputStream::getHeader() const
|
|
{
|
|
Block res = children.at(0)->getHeader();
|
|
finalizeBlock(res);
|
|
return res;
|
|
}
|
|
|
|
|
|
Block CubeBlockInputStream::readImpl()
|
|
{
|
|
/** After reading all blocks from input stream,
|
|
* we will calculate all subsets of columns on next iterations of readImpl
|
|
* by zeroing columns at positions, where bits are zero in current bitmask.
|
|
*/
|
|
|
|
if (!is_data_read)
|
|
{
|
|
BlocksList source_blocks;
|
|
while (auto block = children[0]->read())
|
|
source_blocks.push_back(block);
|
|
|
|
if (source_blocks.empty())
|
|
return {};
|
|
|
|
is_data_read = true;
|
|
mask = (1 << keys.size()) - 1;
|
|
|
|
if (source_blocks.size() > 1)
|
|
source_block = aggregator.mergeBlocks(source_blocks, false);
|
|
else
|
|
source_block = std::move(source_blocks.front());
|
|
|
|
zero_block = source_block.cloneEmpty();
|
|
for (auto key : keys)
|
|
{
|
|
auto & current = zero_block.getByPosition(key);
|
|
current.column = current.column->cloneResized(source_block.rows());
|
|
}
|
|
|
|
auto finalized = source_block;
|
|
finalizeBlock(finalized);
|
|
return finalized;
|
|
}
|
|
|
|
if (!mask)
|
|
return {};
|
|
|
|
--mask;
|
|
auto cube_block = source_block;
|
|
|
|
for (size_t i = 0; i < keys.size(); ++i)
|
|
{
|
|
if (!((mask >> i) & 1))
|
|
{
|
|
size_t pos = keys.size() - i - 1;
|
|
auto & current = cube_block.getByPosition(keys[pos]);
|
|
current.column = zero_block.getByPosition(keys[pos]).column;
|
|
}
|
|
}
|
|
|
|
BlocksList cube_blocks = { cube_block };
|
|
Block finalized = aggregator.mergeBlocks(cube_blocks, true);
|
|
return finalized;
|
|
}
|
|
}
|