ClickHouse/src/Parsers/ASTLiteral.cpp

46 lines
1.4 KiB
C++
Raw Normal View History

#include <Common/SipHash.h>
#include <Common/FieldVisitors.h>
#include <Parsers/ASTLiteral.h>
#include <IO/WriteHelpers.h>
namespace DB
{
void ASTLiteral::updateTreeHashImpl(SipHash & hash_state) const
{
const char * prefix = "Literal_";
hash_state.update(prefix, strlen(prefix));
applyVisitor(FieldVisitorHash(hash_state), value);
}
void ASTLiteral::appendColumnNameImpl(WriteBuffer & ostr) const
{
2020-03-19 01:15:01 +00:00
/// 100 - just arbitrary value.
2020-03-24 15:56:46 +00:00
constexpr auto min_elements_for_hashing = 100;
2020-03-19 01:15:01 +00:00
/// Special case for very large arrays and tuples. Instead of listing all elements, will use hash of them.
/// (Otherwise column name will be too long, that will lead to significant slowdown of expression analysis.)
2020-03-19 01:15:01 +00:00
auto type = value.getType();
2020-03-24 15:56:46 +00:00
if ((type == Field::Types::Array && value.get<const Array &>().size() > min_elements_for_hashing)
|| (type == Field::Types::Tuple && value.get<const Tuple &>().size() > min_elements_for_hashing))
{
SipHash hash;
applyVisitor(FieldVisitorHash(hash), value);
UInt64 low, high;
hash.get128(low, high);
2020-03-19 01:15:01 +00:00
writeCString(type == Field::Types::Array ? "__array_" : "__tuple_", ostr);
writeText(low, ostr);
ostr.write('_');
writeText(high, ostr);
}
else
{
String column_name = applyVisitor(FieldVisitorToString(), value);
writeString(column_name, ostr);
}
}
}