mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-15 02:41:59 +00:00
97f2a2213e
* Move some code outside dbms/src folder * Fix paths
104 lines
2.7 KiB
C++
104 lines
2.7 KiB
C++
#include <DataStreams/SquashingTransform.h>
|
|
|
|
|
|
namespace DB
|
|
{
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int SIZES_OF_COLUMNS_DOESNT_MATCH;
|
|
}
|
|
|
|
SquashingTransform::SquashingTransform(size_t min_block_size_rows_, size_t min_block_size_bytes_, bool reserve_memory_)
|
|
: min_block_size_rows(min_block_size_rows_)
|
|
, min_block_size_bytes(min_block_size_bytes_)
|
|
, reserve_memory(reserve_memory_)
|
|
{
|
|
}
|
|
|
|
|
|
SquashingTransform::Result SquashingTransform::add(MutableColumns && columns)
|
|
{
|
|
/// End of input stream.
|
|
if (columns.empty())
|
|
return Result(std::move(accumulated_columns));
|
|
|
|
/// Just read block is already enough.
|
|
if (isEnoughSize(columns))
|
|
{
|
|
/// If no accumulated data, return just read block.
|
|
if (accumulated_columns.empty())
|
|
return Result(std::move(columns));
|
|
|
|
/// Return accumulated data (maybe it has small size) and place new block to accumulated data.
|
|
columns.swap(accumulated_columns);
|
|
return Result(std::move(columns));
|
|
}
|
|
|
|
/// Accumulated block is already enough.
|
|
if (!accumulated_columns.empty() && isEnoughSize(accumulated_columns))
|
|
{
|
|
/// Return accumulated data and place new block to accumulated data.
|
|
columns.swap(accumulated_columns);
|
|
return Result(std::move(columns));
|
|
}
|
|
|
|
append(std::move(columns));
|
|
|
|
if (isEnoughSize(accumulated_columns))
|
|
{
|
|
MutableColumns res;
|
|
res.swap(accumulated_columns);
|
|
return Result(std::move(res));
|
|
}
|
|
|
|
/// Squashed block is not ready.
|
|
return false;
|
|
}
|
|
|
|
|
|
void SquashingTransform::append(MutableColumns && columns)
|
|
{
|
|
if (accumulated_columns.empty())
|
|
{
|
|
accumulated_columns = std::move(columns);
|
|
return;
|
|
}
|
|
|
|
for (size_t i = 0, size = columns.size(); i < size; ++i)
|
|
{
|
|
auto & column = accumulated_columns[i];
|
|
if (reserve_memory)
|
|
column->reserve(min_block_size_bytes);
|
|
column->insertRangeFrom(*columns[i], 0, columns[i]->size());
|
|
}
|
|
}
|
|
|
|
|
|
bool SquashingTransform::isEnoughSize(const MutableColumns & columns)
|
|
{
|
|
size_t rows = 0;
|
|
size_t bytes = 0;
|
|
|
|
for (const auto & column : columns)
|
|
{
|
|
if (!rows)
|
|
rows = column->size();
|
|
else if (rows != column->size())
|
|
throw Exception("Sizes of columns doesn't match", ErrorCodes::SIZES_OF_COLUMNS_DOESNT_MATCH);
|
|
|
|
bytes += column->byteSize();
|
|
}
|
|
|
|
return isEnoughSize(rows, bytes);
|
|
}
|
|
|
|
|
|
bool SquashingTransform::isEnoughSize(size_t rows, size_t bytes) const
|
|
{
|
|
return (!min_block_size_rows && !min_block_size_bytes)
|
|
|| (min_block_size_rows && rows >= min_block_size_rows)
|
|
|| (min_block_size_bytes && bytes >= min_block_size_bytes);
|
|
}
|
|
|
|
}
|