mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-18 21:51:57 +00:00
176 lines
4.8 KiB
C++
176 lines
4.8 KiB
C++
#pragma once
|
||
|
||
#include <DB/IO/WriteHelpers.h>
|
||
#include <DB/IO/ReadHelpers.h>
|
||
|
||
#include <DB/DataTypes/DataTypeArray.h>
|
||
#include <DB/DataTypes/DataTypesNumberFixed.h>
|
||
|
||
#include <DB/Columns/ColumnVector.h>
|
||
#include <DB/Columns/ColumnArray.h>
|
||
|
||
#include <DB/AggregateFunctions/IUnaryAggregateFunction.h>
|
||
|
||
#define AGGREGATE_FUNCTION_GROUP_ARRAY_MAX_ARRAY_SIZE 0xFFFFFF
|
||
|
||
|
||
namespace DB
|
||
{
|
||
|
||
namespace ErrorCodes
|
||
{
|
||
extern const int TOO_LARGE_ARRAY_SIZE;
|
||
}
|
||
|
||
|
||
/// A particular case is an implementation for numeric types.
|
||
template <typename T>
|
||
struct AggregateFunctionGroupArrayDataNumeric
|
||
{
|
||
/// Memory is allocated to several elements immediately so that the state occupies 64 bytes.
|
||
static constexpr size_t bytes_in_arena = 64 - sizeof(PODArray<T>);
|
||
|
||
using Array = PODArray<T, bytes_in_arena, AllocatorWithStackMemory<Allocator<false>, bytes_in_arena>>;
|
||
Array value;
|
||
};
|
||
|
||
|
||
template <typename T>
|
||
class AggregateFunctionGroupArrayNumeric final
|
||
: public IUnaryAggregateFunction<AggregateFunctionGroupArrayDataNumeric<T>, AggregateFunctionGroupArrayNumeric<T>>
|
||
{
|
||
public:
|
||
String getName() const override { return "groupArray"; }
|
||
|
||
DataTypePtr getReturnType() const override
|
||
{
|
||
return std::make_shared<DataTypeArray>(std::make_shared<typename DataTypeFromFieldType<T>::Type>());
|
||
}
|
||
|
||
void setArgument(const DataTypePtr & argument)
|
||
{
|
||
}
|
||
|
||
void addImpl(AggregateDataPtr place, const IColumn & column, size_t row_num, Arena *) const
|
||
{
|
||
this->data(place).value.push_back(static_cast<const ColumnVector<T> &>(column).getData()[row_num]);
|
||
}
|
||
|
||
void merge(AggregateDataPtr place, ConstAggregateDataPtr rhs, Arena * arena) const override
|
||
{
|
||
this->data(place).value.insert(this->data(rhs).value.begin(), this->data(rhs).value.end());
|
||
}
|
||
|
||
void serialize(ConstAggregateDataPtr place, WriteBuffer & buf) const override
|
||
{
|
||
const auto & value = this->data(place).value;
|
||
size_t size = value.size();
|
||
writeVarUInt(size, buf);
|
||
buf.write(reinterpret_cast<const char *>(&value[0]), size * sizeof(value[0]));
|
||
}
|
||
|
||
void deserialize(AggregateDataPtr place, ReadBuffer & buf, Arena *) const override
|
||
{
|
||
size_t size = 0;
|
||
readVarUInt(size, buf);
|
||
|
||
if (size > AGGREGATE_FUNCTION_GROUP_ARRAY_MAX_ARRAY_SIZE)
|
||
throw Exception("Too large array size", ErrorCodes::TOO_LARGE_ARRAY_SIZE);
|
||
|
||
auto & value = this->data(place).value;
|
||
|
||
value.resize(size);
|
||
buf.read(reinterpret_cast<char *>(&value[0]), size * sizeof(value[0]));
|
||
}
|
||
|
||
void insertResultInto(ConstAggregateDataPtr place, IColumn & to) const override
|
||
{
|
||
const auto & value = this->data(place).value;
|
||
size_t size = value.size();
|
||
|
||
ColumnArray & arr_to = static_cast<ColumnArray &>(to);
|
||
ColumnArray::Offsets_t & offsets_to = arr_to.getOffsets();
|
||
|
||
offsets_to.push_back((offsets_to.size() == 0 ? 0 : offsets_to.back()) + size);
|
||
|
||
typename ColumnVector<T>::Container_t & data_to = static_cast<ColumnVector<T> &>(arr_to.getData()).getData();
|
||
data_to.insert(this->data(place).value.begin(), this->data(place).value.end());
|
||
}
|
||
};
|
||
|
||
|
||
|
||
/// General case (ineffective). NOTE You can also implement a special case for strings.
|
||
struct AggregateFunctionGroupArrayDataGeneric
|
||
{
|
||
Array value; /// TODO Add MemoryTracker
|
||
};
|
||
|
||
|
||
/// Puts all values to an array, general case. Implemented inefficiently.
|
||
class AggregateFunctionGroupArrayGeneric final
|
||
: public IUnaryAggregateFunction<AggregateFunctionGroupArrayDataGeneric, AggregateFunctionGroupArrayGeneric>
|
||
{
|
||
private:
|
||
DataTypePtr type;
|
||
|
||
public:
|
||
String getName() const override { return "groupArray"; }
|
||
|
||
DataTypePtr getReturnType() const override
|
||
{
|
||
return std::make_shared<DataTypeArray>(type);
|
||
}
|
||
|
||
void setArgument(const DataTypePtr & argument)
|
||
{
|
||
type = argument;
|
||
}
|
||
|
||
|
||
void addImpl(AggregateDataPtr place, const IColumn & column, size_t row_num, Arena *) const
|
||
{
|
||
data(place).value.push_back(Array::value_type());
|
||
column.get(row_num, data(place).value.back());
|
||
}
|
||
|
||
void merge(AggregateDataPtr place, ConstAggregateDataPtr rhs, Arena * arena) const override
|
||
{
|
||
data(place).value.insert(data(place).value.end(), data(rhs).value.begin(), data(rhs).value.end());
|
||
}
|
||
|
||
void serialize(ConstAggregateDataPtr place, WriteBuffer & buf) const override
|
||
{
|
||
const Array & value = data(place).value;
|
||
size_t size = value.size();
|
||
writeVarUInt(size, buf);
|
||
for (size_t i = 0; i < size; ++i)
|
||
type->serializeBinary(value[i], buf);
|
||
}
|
||
|
||
void deserialize(AggregateDataPtr place, ReadBuffer & buf, Arena *) const override
|
||
{
|
||
size_t size = 0;
|
||
readVarUInt(size, buf);
|
||
|
||
if (size > AGGREGATE_FUNCTION_GROUP_ARRAY_MAX_ARRAY_SIZE)
|
||
throw Exception("Too large array size", ErrorCodes::TOO_LARGE_ARRAY_SIZE);
|
||
|
||
Array & value = data(place).value;
|
||
|
||
value.resize(size);
|
||
for (size_t i = 0; i < size; ++i)
|
||
type->deserializeBinary(value[i], buf);
|
||
}
|
||
|
||
void insertResultInto(ConstAggregateDataPtr place, IColumn & to) const override
|
||
{
|
||
to.insert(data(place).value);
|
||
}
|
||
};
|
||
|
||
|
||
#undef AGGREGATE_FUNCTION_GROUP_ARRAY_MAX_ARRAY_SIZE
|
||
|
||
}
|