mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-27 10:02:01 +00:00
469 lines
13 KiB
C++
469 lines
13 KiB
C++
#pragma once
|
||
|
||
#include <string.h>
|
||
|
||
#include <DB/Core/Defines.h>
|
||
|
||
#include <DB/Columns/IColumn.h>
|
||
#include <DB/Columns/ColumnsCommon.h>
|
||
#include <DB/Common/PODArray.h>
|
||
#include <DB/Common/Arena.h>
|
||
#include <DB/Common/SipHash.h>
|
||
#include <DB/Common/memcpySmall.h>
|
||
|
||
|
||
class Collator;
|
||
|
||
|
||
namespace DB
|
||
{
|
||
|
||
namespace ErrorCodes
|
||
{
|
||
extern const int PARAMETER_OUT_OF_BOUND;
|
||
extern const int SIZES_OF_COLUMNS_DOESNT_MATCH;
|
||
}
|
||
|
||
|
||
/** Cтолбeц значений типа "строка".
|
||
*/
|
||
class ColumnString final : public IColumn
|
||
{
|
||
public:
|
||
using Chars_t = PaddedPODArray<UInt8>;
|
||
|
||
private:
|
||
/// По индексу i находится смещение до начала i + 1 -го элемента.
|
||
Offsets_t offsets;
|
||
|
||
/// Байты строк, уложенные подряд. Строки хранятся с завершающим нулевым байтом.
|
||
Chars_t chars;
|
||
|
||
size_t __attribute__((__always_inline__)) offsetAt(size_t i) const { return i == 0 ? 0 : offsets[i - 1]; }
|
||
|
||
/// Размер, включая завершающий нулевой байт.
|
||
size_t __attribute__((__always_inline__)) sizeAt(size_t i) const { return i == 0 ? offsets[0] : (offsets[i] - offsets[i - 1]); }
|
||
|
||
template <bool positive>
|
||
friend struct lessWithCollation;
|
||
|
||
public:
|
||
/** Создать пустой столбец строк */
|
||
ColumnString() {}
|
||
|
||
std::string getName() const override { return "ColumnString"; }
|
||
|
||
size_t size() const override
|
||
{
|
||
return offsets.size();
|
||
}
|
||
|
||
size_t byteSize() const override
|
||
{
|
||
return chars.size() + offsets.size() * sizeof(offsets[0]);
|
||
}
|
||
|
||
size_t allocatedSize() const override
|
||
{
|
||
return chars.allocated_size() + offsets.allocated_size() * sizeof(offsets[0]);
|
||
}
|
||
|
||
ColumnPtr cloneResized(size_t size) const override
|
||
{
|
||
ColumnPtr new_col_holder = std::make_shared<ColumnString>();
|
||
|
||
if (size > 0)
|
||
{
|
||
auto & new_col = static_cast<ColumnString &>(*new_col_holder);
|
||
size_t count = std::min(this->size(), size);
|
||
|
||
/// First create the offsets.
|
||
new_col.offsets.resize(size);
|
||
new_col.offsets.assign(offsets.begin(), offsets.begin() + count);
|
||
|
||
size_t byte_count = new_col.offsets.back();
|
||
|
||
if (size > count)
|
||
{
|
||
/// Create offsets for the (size - count) new empty strings.
|
||
for (size_t i = count; i < size; ++i)
|
||
new_col.offsets[i] = new_col.offsets[i - 1] + 1;
|
||
}
|
||
|
||
/// Then store the strings.
|
||
new_col.chars.resize(new_col.offsets.back());
|
||
new_col.chars.assign(chars.begin(), chars.begin() + byte_count);
|
||
|
||
if (size > count)
|
||
{
|
||
/// Create (size - count) empty strings.
|
||
size_t from = new_col.offsets[count];
|
||
size_t n = new_col.offsets.back() - from;
|
||
memset(&new_col.chars[from], '\0', n);
|
||
}
|
||
}
|
||
|
||
return new_col_holder;
|
||
}
|
||
|
||
Field operator[](size_t n) const override
|
||
{
|
||
return Field(&chars[offsetAt(n)], sizeAt(n) - 1);
|
||
}
|
||
|
||
void get(size_t n, Field & res) const override
|
||
{
|
||
res.assignString(&chars[offsetAt(n)], sizeAt(n) - 1);
|
||
}
|
||
|
||
StringRef getDataAt(size_t n) const override
|
||
{
|
||
return StringRef(&chars[offsetAt(n)], sizeAt(n) - 1);
|
||
}
|
||
|
||
StringRef getDataAtWithTerminatingZero(size_t n) const override
|
||
{
|
||
return StringRef(&chars[offsetAt(n)], sizeAt(n));
|
||
}
|
||
|
||
void insert(const Field & x) override
|
||
{
|
||
const String & s = DB::get<const String &>(x);
|
||
const size_t old_size = chars.size();
|
||
const size_t size_to_append = s.size() + 1;
|
||
const size_t new_size = old_size + size_to_append;
|
||
|
||
chars.resize(new_size);
|
||
memcpy(&chars[old_size], s.c_str(), size_to_append);
|
||
offsets.push_back(new_size);
|
||
}
|
||
|
||
void insertFrom(const IColumn & src_, size_t n) override
|
||
{
|
||
const ColumnString & src = static_cast<const ColumnString &>(src_);
|
||
|
||
if (n != 0)
|
||
{
|
||
const size_t size_to_append = src.offsets[n] - src.offsets[n - 1];
|
||
|
||
if (size_to_append == 1)
|
||
{
|
||
/// shortcut for empty string
|
||
chars.push_back(0);
|
||
offsets.push_back(chars.size());
|
||
}
|
||
else
|
||
{
|
||
const size_t old_size = chars.size();
|
||
const size_t offset = src.offsets[n - 1];
|
||
const size_t new_size = old_size + size_to_append;
|
||
|
||
chars.resize(new_size);
|
||
memcpySmallAllowReadWriteOverflow15(&chars[old_size], &src.chars[offset], size_to_append);
|
||
offsets.push_back(new_size);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
const size_t old_size = chars.size();
|
||
const size_t size_to_append = src.offsets[0];
|
||
const size_t new_size = old_size + size_to_append;
|
||
|
||
chars.resize(new_size);
|
||
memcpySmallAllowReadWriteOverflow15(&chars[old_size], &src.chars[0], size_to_append);
|
||
offsets.push_back(new_size);
|
||
}
|
||
}
|
||
|
||
void insertData(const char * pos, size_t length) override
|
||
{
|
||
const size_t old_size = chars.size();
|
||
const size_t new_size = old_size + length + 1;
|
||
|
||
chars.resize(new_size);
|
||
memcpy(&chars[old_size], pos, length);
|
||
chars[old_size + length] = 0;
|
||
offsets.push_back(new_size);
|
||
}
|
||
|
||
void insertDataWithTerminatingZero(const char * pos, size_t length) override
|
||
{
|
||
const size_t old_size = chars.size();
|
||
const size_t new_size = old_size + length;
|
||
|
||
chars.resize(new_size);
|
||
memcpy(&chars[old_size], pos, length);
|
||
offsets.push_back(new_size);
|
||
}
|
||
|
||
void popBack(size_t n) override
|
||
{
|
||
size_t nested_n = offsets.back() - offsetAt(offsets.size() - n);
|
||
chars.resize(chars.size() - nested_n);
|
||
offsets.resize_assume_reserved(offsets.size() - n);
|
||
}
|
||
|
||
StringRef serializeValueIntoArena(size_t n, Arena & arena, char const *& begin) const override
|
||
{
|
||
size_t string_size = sizeAt(n);
|
||
size_t offset = offsetAt(n);
|
||
|
||
StringRef res;
|
||
res.size = sizeof(string_size) + string_size;
|
||
char * pos = arena.allocContinue(res.size, begin);
|
||
memcpy(pos, &string_size, sizeof(string_size));
|
||
memcpy(pos + sizeof(string_size), &chars[offset], string_size);
|
||
res.data = pos;
|
||
|
||
return res;
|
||
}
|
||
|
||
const char * deserializeAndInsertFromArena(const char * pos) override
|
||
{
|
||
const size_t string_size = *reinterpret_cast<const size_t *>(pos);
|
||
pos += sizeof(string_size);
|
||
|
||
const size_t old_size = chars.size();
|
||
const size_t new_size = old_size + string_size;
|
||
chars.resize(new_size);
|
||
memcpy(&chars[old_size], pos, string_size);
|
||
|
||
offsets.push_back(new_size);
|
||
return pos + string_size;
|
||
}
|
||
|
||
void updateHashWithValue(size_t n, SipHash & hash) const override
|
||
{
|
||
size_t string_size = sizeAt(n);
|
||
size_t offset = offsetAt(n);
|
||
|
||
hash.update(reinterpret_cast<const char *>(&string_size), sizeof(string_size));
|
||
hash.update(reinterpret_cast<const char *>(&chars[offset]), string_size);
|
||
}
|
||
|
||
void insertRangeFrom(const IColumn & src, size_t start, size_t length) override
|
||
{
|
||
if (length == 0)
|
||
return;
|
||
|
||
const ColumnString & src_concrete = static_cast<const ColumnString &>(src);
|
||
|
||
if (start + length > src_concrete.offsets.size())
|
||
throw Exception("Parameter out of bound in IColumnString::insertRangeFrom method.",
|
||
ErrorCodes::PARAMETER_OUT_OF_BOUND);
|
||
|
||
size_t nested_offset = src_concrete.offsetAt(start);
|
||
size_t nested_length = src_concrete.offsets[start + length - 1] - nested_offset;
|
||
|
||
size_t old_chars_size = chars.size();
|
||
chars.resize(old_chars_size + nested_length);
|
||
memcpy(&chars[old_chars_size], &src_concrete.chars[nested_offset], nested_length);
|
||
|
||
if (start == 0 && offsets.empty())
|
||
{
|
||
offsets.assign(src_concrete.offsets.begin(), src_concrete.offsets.begin() + length);
|
||
}
|
||
else
|
||
{
|
||
size_t old_size = offsets.size();
|
||
size_t prev_max_offset = old_size ? offsets.back() : 0;
|
||
offsets.resize(old_size + length);
|
||
|
||
for (size_t i = 0; i < length; ++i)
|
||
offsets[old_size + i] = src_concrete.offsets[start + i] - nested_offset + prev_max_offset;
|
||
}
|
||
}
|
||
|
||
ColumnPtr filter(const Filter & filt, ssize_t result_size_hint) const override
|
||
{
|
||
if (offsets.size() == 0)
|
||
return std::make_shared<ColumnString>();
|
||
|
||
auto res = std::make_shared<ColumnString>();
|
||
|
||
Chars_t & res_chars = res->chars;
|
||
Offsets_t & res_offsets = res->offsets;
|
||
|
||
filterArraysImpl<UInt8>(chars, offsets, res_chars, res_offsets, filt, result_size_hint);
|
||
return res;
|
||
}
|
||
|
||
ColumnPtr permute(const Permutation & perm, size_t limit) const override
|
||
{
|
||
size_t size = offsets.size();
|
||
|
||
if (limit == 0)
|
||
limit = size;
|
||
else
|
||
limit = std::min(size, limit);
|
||
|
||
if (perm.size() < limit)
|
||
throw Exception("Size of permutation is less than required.", ErrorCodes::SIZES_OF_COLUMNS_DOESNT_MATCH);
|
||
|
||
if (limit == 0)
|
||
return std::make_shared<ColumnString>();
|
||
|
||
std::shared_ptr<ColumnString> res = std::make_shared<ColumnString>();
|
||
|
||
Chars_t & res_chars = res->chars;
|
||
Offsets_t & res_offsets = res->offsets;
|
||
|
||
if (limit == size)
|
||
res_chars.resize(chars.size());
|
||
else
|
||
{
|
||
size_t new_chars_size = 0;
|
||
for (size_t i = 0; i < limit; ++i)
|
||
new_chars_size += sizeAt(perm[i]);
|
||
res_chars.resize(new_chars_size);
|
||
}
|
||
|
||
res_offsets.resize(limit);
|
||
|
||
Offset_t current_new_offset = 0;
|
||
|
||
for (size_t i = 0; i < limit; ++i)
|
||
{
|
||
size_t j = perm[i];
|
||
size_t string_offset = j == 0 ? 0 : offsets[j - 1];
|
||
size_t string_size = offsets[j] - string_offset;
|
||
|
||
memcpySmallAllowReadWriteOverflow15(&res_chars[current_new_offset], &chars[string_offset], string_size);
|
||
|
||
current_new_offset += string_size;
|
||
res_offsets[i] = current_new_offset;
|
||
}
|
||
|
||
return res;
|
||
}
|
||
|
||
void insertDefault() override
|
||
{
|
||
chars.push_back(0);
|
||
offsets.push_back(offsets.size() == 0 ? 1 : (offsets.back() + 1));
|
||
}
|
||
|
||
int compareAt(size_t n, size_t m, const IColumn & rhs_, int nan_direction_hint) const override
|
||
{
|
||
const ColumnString & rhs = static_cast<const ColumnString &>(rhs_);
|
||
|
||
/** Для производительности, строки сравниваются до первого нулевого байта.
|
||
* (если нулевой байт в середине строки, то то, что после него - игнорируется)
|
||
* Замечу, что завершающий нулевой байт всегда есть.
|
||
*/
|
||
return strcmp(
|
||
reinterpret_cast<const char *>(&chars[offsetAt(n)]),
|
||
reinterpret_cast<const char *>(&rhs.chars[rhs.offsetAt(m)]));
|
||
}
|
||
|
||
/// Версия compareAt для locale-sensitive сравнения строк
|
||
int compareAtWithCollation(size_t n, size_t m, const IColumn & rhs_, const Collator & collator) const;
|
||
|
||
template <bool positive>
|
||
struct less
|
||
{
|
||
const ColumnString & parent;
|
||
less(const ColumnString & parent_) : parent(parent_) {}
|
||
bool operator()(size_t lhs, size_t rhs) const
|
||
{
|
||
int res = strcmp(
|
||
reinterpret_cast<const char *>(&parent.chars[parent.offsetAt(lhs)]),
|
||
reinterpret_cast<const char *>(&parent.chars[parent.offsetAt(rhs)]));
|
||
|
||
return positive ? (res < 0) : (res > 0);
|
||
}
|
||
};
|
||
|
||
void getPermutation(bool reverse, size_t limit, Permutation & res) const override
|
||
{
|
||
size_t s = offsets.size();
|
||
res.resize(s);
|
||
for (size_t i = 0; i < s; ++i)
|
||
res[i] = i;
|
||
|
||
if (limit >= s)
|
||
limit = 0;
|
||
|
||
if (limit)
|
||
{
|
||
if (reverse)
|
||
std::partial_sort(res.begin(), res.begin() + limit, res.end(), less<false>(*this));
|
||
else
|
||
std::partial_sort(res.begin(), res.begin() + limit, res.end(), less<true>(*this));
|
||
}
|
||
else
|
||
{
|
||
if (reverse)
|
||
std::sort(res.begin(), res.end(), less<false>(*this));
|
||
else
|
||
std::sort(res.begin(), res.end(), less<true>(*this));
|
||
}
|
||
}
|
||
|
||
/// Сортировка с учетом Collation
|
||
void getPermutationWithCollation(const Collator & collator, bool reverse, size_t limit, Permutation & res) const;
|
||
|
||
ColumnPtr replicate(const Offsets_t & replicate_offsets) const override
|
||
{
|
||
size_t col_size = size();
|
||
if (col_size != replicate_offsets.size())
|
||
throw Exception("Size of offsets doesn't match size of column.", ErrorCodes::SIZES_OF_COLUMNS_DOESNT_MATCH);
|
||
|
||
std::shared_ptr<ColumnString> res = std::make_shared<ColumnString>();
|
||
|
||
if (0 == col_size)
|
||
return res;
|
||
|
||
Chars_t & res_chars = res->chars;
|
||
Offsets_t & res_offsets = res->offsets;
|
||
res_chars.reserve(chars.size() / col_size * replicate_offsets.back());
|
||
res_offsets.reserve(replicate_offsets.back());
|
||
|
||
Offset_t prev_replicate_offset = 0;
|
||
Offset_t prev_string_offset = 0;
|
||
Offset_t current_new_offset = 0;
|
||
|
||
for (size_t i = 0; i < col_size; ++i)
|
||
{
|
||
size_t size_to_replicate = replicate_offsets[i] - prev_replicate_offset;
|
||
size_t string_size = offsets[i] - prev_string_offset;
|
||
|
||
for (size_t j = 0; j < size_to_replicate; ++j)
|
||
{
|
||
current_new_offset += string_size;
|
||
res_offsets.push_back(current_new_offset);
|
||
|
||
res_chars.resize(res_chars.size() + string_size);
|
||
memcpySmallAllowReadWriteOverflow15(
|
||
&res_chars[res_chars.size() - string_size], &chars[prev_string_offset], string_size);
|
||
}
|
||
|
||
prev_replicate_offset = replicate_offsets[i];
|
||
prev_string_offset = offsets[i];
|
||
}
|
||
|
||
return res;
|
||
}
|
||
|
||
void reserve(size_t n) override
|
||
{
|
||
offsets.reserve(n);
|
||
chars.reserve(n * DBMS_APPROX_STRING_SIZE);
|
||
}
|
||
|
||
Chars_t & getChars() { return chars; }
|
||
const Chars_t & getChars() const { return chars; }
|
||
|
||
Offsets_t & getOffsets() { return offsets; }
|
||
const Offsets_t & getOffsets() const { return offsets; }
|
||
|
||
void getExtremes(Field & min, Field & max) const override
|
||
{
|
||
min = String();
|
||
max = String();
|
||
}
|
||
};
|
||
|
||
|
||
}
|