mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-15 10:52:30 +00:00
406 lines
11 KiB
C++
406 lines
11 KiB
C++
#include <Columns/ColumnTuple.h>
|
|
#include <DataStreams/ColumnGathererStream.h>
|
|
#include <IO/WriteBufferFromString.h>
|
|
#include <IO/Operators.h>
|
|
#include <ext/map.h>
|
|
#include <ext/range.h>
|
|
#include <Common/typeid_cast.h>
|
|
#include <Common/assert_cast.h>
|
|
#include <Common/WeakHash.h>
|
|
#include <Core/Field.h>
|
|
|
|
|
|
namespace DB
|
|
{
|
|
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int ILLEGAL_COLUMN;
|
|
extern const int NOT_IMPLEMENTED;
|
|
extern const int CANNOT_INSERT_VALUE_OF_DIFFERENT_SIZE_INTO_TUPLE;
|
|
extern const int LOGICAL_ERROR;
|
|
}
|
|
|
|
|
|
std::string ColumnTuple::getName() const
|
|
{
|
|
WriteBufferFromOwnString res;
|
|
res << "Tuple(";
|
|
bool is_first = true;
|
|
for (const auto & column : columns)
|
|
{
|
|
if (!is_first)
|
|
res << ", ";
|
|
is_first = false;
|
|
res << column->getName();
|
|
}
|
|
res << ")";
|
|
return res.str();
|
|
}
|
|
|
|
ColumnTuple::ColumnTuple(MutableColumns && mutable_columns)
|
|
{
|
|
columns.reserve(mutable_columns.size());
|
|
for (auto & column : mutable_columns)
|
|
{
|
|
if (isColumnConst(*column))
|
|
throw Exception{"ColumnTuple cannot have ColumnConst as its element", ErrorCodes::ILLEGAL_COLUMN};
|
|
|
|
columns.push_back(std::move(column));
|
|
}
|
|
}
|
|
|
|
ColumnTuple::Ptr ColumnTuple::create(const Columns & columns)
|
|
{
|
|
for (const auto & column : columns)
|
|
if (isColumnConst(*column))
|
|
throw Exception{"ColumnTuple cannot have ColumnConst as its element", ErrorCodes::ILLEGAL_COLUMN};
|
|
|
|
auto column_tuple = ColumnTuple::create(MutableColumns());
|
|
column_tuple->columns.assign(columns.begin(), columns.end());
|
|
|
|
return column_tuple;
|
|
}
|
|
|
|
ColumnTuple::Ptr ColumnTuple::create(const TupleColumns & columns)
|
|
{
|
|
for (const auto & column : columns)
|
|
if (isColumnConst(*column))
|
|
throw Exception{"ColumnTuple cannot have ColumnConst as its element", ErrorCodes::ILLEGAL_COLUMN};
|
|
|
|
auto column_tuple = ColumnTuple::create(MutableColumns());
|
|
column_tuple->columns = columns;
|
|
|
|
return column_tuple;
|
|
}
|
|
|
|
MutableColumnPtr ColumnTuple::cloneEmpty() const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
MutableColumns new_columns(tuple_size);
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->cloneEmpty();
|
|
|
|
return ColumnTuple::create(std::move(new_columns));
|
|
}
|
|
|
|
MutableColumnPtr ColumnTuple::cloneResized(size_t new_size) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
MutableColumns new_columns(tuple_size);
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->cloneResized(new_size);
|
|
|
|
return ColumnTuple::create(std::move(new_columns));
|
|
}
|
|
|
|
Field ColumnTuple::operator[](size_t n) const
|
|
{
|
|
return ext::map<Tuple>(columns, [n] (const auto & column) { return (*column)[n]; });
|
|
}
|
|
|
|
void ColumnTuple::get(size_t n, Field & res) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
Tuple tuple(tuple_size);
|
|
for (const auto i : ext::range(0, tuple_size))
|
|
columns[i]->get(n, tuple[i]);
|
|
|
|
res = tuple;
|
|
}
|
|
|
|
StringRef ColumnTuple::getDataAt(size_t) const
|
|
{
|
|
throw Exception("Method getDataAt is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
}
|
|
|
|
void ColumnTuple::insertData(const char *, size_t)
|
|
{
|
|
throw Exception("Method insertData is not supported for " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
}
|
|
|
|
void ColumnTuple::insert(const Field & x)
|
|
{
|
|
auto & tuple = DB::get<const Tuple &>(x);
|
|
|
|
const size_t tuple_size = columns.size();
|
|
if (tuple.size() != tuple_size)
|
|
throw Exception("Cannot insert value of different size into tuple", ErrorCodes::CANNOT_INSERT_VALUE_OF_DIFFERENT_SIZE_INTO_TUPLE);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
columns[i]->insert(tuple[i]);
|
|
}
|
|
|
|
void ColumnTuple::insertFrom(const IColumn & src_, size_t n)
|
|
{
|
|
const ColumnTuple & src = assert_cast<const ColumnTuple &>(src_);
|
|
|
|
const size_t tuple_size = columns.size();
|
|
if (src.columns.size() != tuple_size)
|
|
throw Exception("Cannot insert value of different size into tuple", ErrorCodes::CANNOT_INSERT_VALUE_OF_DIFFERENT_SIZE_INTO_TUPLE);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
columns[i]->insertFrom(*src.columns[i], n);
|
|
}
|
|
|
|
void ColumnTuple::insertDefault()
|
|
{
|
|
for (auto & column : columns)
|
|
column->insertDefault();
|
|
}
|
|
|
|
void ColumnTuple::popBack(size_t n)
|
|
{
|
|
for (auto & column : columns)
|
|
column->popBack(n);
|
|
}
|
|
|
|
StringRef ColumnTuple::serializeValueIntoArena(size_t n, Arena & arena, char const *& begin) const
|
|
{
|
|
StringRef res(begin, 0);
|
|
for (auto & column : columns)
|
|
{
|
|
auto value_ref = column->serializeValueIntoArena(n, arena, begin);
|
|
res.data = value_ref.data - res.size;
|
|
res.size += value_ref.size;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
const char * ColumnTuple::deserializeAndInsertFromArena(const char * pos)
|
|
{
|
|
for (auto & column : columns)
|
|
pos = column->deserializeAndInsertFromArena(pos);
|
|
|
|
return pos;
|
|
}
|
|
|
|
void ColumnTuple::updateHashWithValue(size_t n, SipHash & hash) const
|
|
{
|
|
for (auto & column : columns)
|
|
column->updateHashWithValue(n, hash);
|
|
}
|
|
|
|
void ColumnTuple::updateWeakHash32(WeakHash32 & hash) const
|
|
{
|
|
auto s = size();
|
|
|
|
if (hash.getData().size() != s)
|
|
throw Exception("Size of WeakHash32 does not match size of column: column size is " + std::to_string(s) +
|
|
", hash size is " + std::to_string(hash.getData().size()), ErrorCodes::LOGICAL_ERROR);
|
|
|
|
for (auto & column : columns)
|
|
column->updateWeakHash32(hash);
|
|
}
|
|
|
|
void ColumnTuple::insertRangeFrom(const IColumn & src, size_t start, size_t length)
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
columns[i]->insertRangeFrom(
|
|
*assert_cast<const ColumnTuple &>(src).columns[i],
|
|
start, length);
|
|
}
|
|
|
|
ColumnPtr ColumnTuple::filter(const Filter & filt, ssize_t result_size_hint) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
Columns new_columns(tuple_size);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->filter(filt, result_size_hint);
|
|
|
|
return ColumnTuple::create(new_columns);
|
|
}
|
|
|
|
ColumnPtr ColumnTuple::permute(const Permutation & perm, size_t limit) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
Columns new_columns(tuple_size);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->permute(perm, limit);
|
|
|
|
return ColumnTuple::create(new_columns);
|
|
}
|
|
|
|
ColumnPtr ColumnTuple::index(const IColumn & indexes, size_t limit) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
Columns new_columns(tuple_size);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->index(indexes, limit);
|
|
|
|
return ColumnTuple::create(new_columns);
|
|
}
|
|
|
|
ColumnPtr ColumnTuple::replicate(const Offsets & offsets) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
Columns new_columns(tuple_size);
|
|
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
new_columns[i] = columns[i]->replicate(offsets);
|
|
|
|
return ColumnTuple::create(new_columns);
|
|
}
|
|
|
|
MutableColumns ColumnTuple::scatter(ColumnIndex num_columns, const Selector & selector) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
std::vector<MutableColumns> scattered_tuple_elements(tuple_size);
|
|
|
|
for (size_t tuple_element_idx = 0; tuple_element_idx < tuple_size; ++tuple_element_idx)
|
|
scattered_tuple_elements[tuple_element_idx] = columns[tuple_element_idx]->scatter(num_columns, selector);
|
|
|
|
MutableColumns res(num_columns);
|
|
|
|
for (size_t scattered_idx = 0; scattered_idx < num_columns; ++scattered_idx)
|
|
{
|
|
MutableColumns new_columns(tuple_size);
|
|
for (size_t tuple_element_idx = 0; tuple_element_idx < tuple_size; ++tuple_element_idx)
|
|
new_columns[tuple_element_idx] = std::move(scattered_tuple_elements[tuple_element_idx][scattered_idx]);
|
|
res[scattered_idx] = ColumnTuple::create(std::move(new_columns));
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int ColumnTuple::compareAt(size_t n, size_t m, const IColumn & rhs, int nan_direction_hint) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
if (int res = columns[i]->compareAt(n, m, *assert_cast<const ColumnTuple &>(rhs).columns[i], nan_direction_hint))
|
|
return res;
|
|
|
|
return 0;
|
|
}
|
|
|
|
template <bool positive>
|
|
struct ColumnTuple::Less
|
|
{
|
|
TupleColumns columns;
|
|
int nan_direction_hint;
|
|
|
|
Less(const TupleColumns & columns_, int nan_direction_hint_)
|
|
: columns(columns_), nan_direction_hint(nan_direction_hint_)
|
|
{
|
|
}
|
|
|
|
bool operator() (size_t a, size_t b) const
|
|
{
|
|
for (const auto & column : columns)
|
|
{
|
|
int res = column->compareAt(a, b, *column, nan_direction_hint);
|
|
if (res < 0)
|
|
return positive;
|
|
else if (res > 0)
|
|
return !positive;
|
|
}
|
|
return false;
|
|
}
|
|
};
|
|
|
|
void ColumnTuple::getPermutation(bool reverse, size_t limit, int nan_direction_hint, Permutation & res) const
|
|
{
|
|
size_t rows = size();
|
|
res.resize(rows);
|
|
for (size_t i = 0; i < rows; ++i)
|
|
res[i] = i;
|
|
|
|
if (limit >= rows)
|
|
limit = 0;
|
|
|
|
if (limit)
|
|
{
|
|
if (reverse)
|
|
std::partial_sort(res.begin(), res.begin() + limit, res.end(), Less<false>(columns, nan_direction_hint));
|
|
else
|
|
std::partial_sort(res.begin(), res.begin() + limit, res.end(), Less<true>(columns, nan_direction_hint));
|
|
}
|
|
else
|
|
{
|
|
if (reverse)
|
|
std::sort(res.begin(), res.end(), Less<false>(columns, nan_direction_hint));
|
|
else
|
|
std::sort(res.begin(), res.end(), Less<true>(columns, nan_direction_hint));
|
|
}
|
|
}
|
|
|
|
void ColumnTuple::gather(ColumnGathererStream & gatherer)
|
|
{
|
|
gatherer.gather(*this);
|
|
}
|
|
|
|
void ColumnTuple::reserve(size_t n)
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
for (size_t i = 0; i < tuple_size; ++i)
|
|
getColumn(i).reserve(n);
|
|
}
|
|
|
|
size_t ColumnTuple::byteSize() const
|
|
{
|
|
size_t res = 0;
|
|
for (const auto & column : columns)
|
|
res += column->byteSize();
|
|
return res;
|
|
}
|
|
|
|
size_t ColumnTuple::allocatedBytes() const
|
|
{
|
|
size_t res = 0;
|
|
for (const auto & column : columns)
|
|
res += column->allocatedBytes();
|
|
return res;
|
|
}
|
|
|
|
void ColumnTuple::protect()
|
|
{
|
|
for (auto & column : columns)
|
|
column->protect();
|
|
}
|
|
|
|
void ColumnTuple::getExtremes(Field & min, Field & max) const
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
|
|
Tuple min_tuple(tuple_size);
|
|
Tuple max_tuple(tuple_size);
|
|
|
|
for (const auto i : ext::range(0, tuple_size))
|
|
columns[i]->getExtremes(min_tuple[i], max_tuple[i]);
|
|
|
|
min = min_tuple;
|
|
max = max_tuple;
|
|
}
|
|
|
|
void ColumnTuple::forEachSubcolumn(ColumnCallback callback)
|
|
{
|
|
for (auto & column : columns)
|
|
callback(column);
|
|
}
|
|
|
|
bool ColumnTuple::structureEquals(const IColumn & rhs) const
|
|
{
|
|
if (auto rhs_tuple = typeid_cast<const ColumnTuple *>(&rhs))
|
|
{
|
|
const size_t tuple_size = columns.size();
|
|
if (tuple_size != rhs_tuple->columns.size())
|
|
return false;
|
|
|
|
for (const auto i : ext::range(0, tuple_size))
|
|
if (!columns[i]->structureEquals(*rhs_tuple->columns[i]))
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
else
|
|
return false;
|
|
}
|
|
|
|
|
|
}
|