thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-10-08 17:40:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed style and compilation error on GCC9

Browse Source
This commit is contained in:
Vasily Nemkov 2019-12-05 16:47:46 +03:00
parent b49e3eae86
commit ae5a4f15d0
1 changed files with 27 additions and 74 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

55
dbms/src/Compression/tests/gtest_compressionCodec.cpp
View File

@ -63,26 +63,6 @@ std::vector<T> operator+(std::vector<T> && left, std::vector<T> && right)
namespace namespace
{ {
template <typename T>
struct AnnotatedHelper
{
const char * annotation;
const T & value;
};
template <typename T>
std::ostream & operator << (std::ostream & ostr, const AnnotatedHelper<T> & helper)
{
return ostr << helper.annotation << helper.value;
}
template <typename T>
AnnotatedHelper<T> Annotate(const char * annotation, const T & value)
{
return AnnotatedHelper<T>{annotation, value};
}
template <typename T> template <typename T>
struct AsHexStringHelper struct AsHexStringHelper
{ {
@ -430,13 +410,7 @@ CodecTestSequence makeSeq(Args && ... args)
template <typename T, typename Generator, typename B = int, typename E = int> template <typename T, typename Generator, typename B = int, typename E = int>
CodecTestSequence generateSeq(Generator gen, const char* gen_name, B Begin = 0, E End = 10000) CodecTestSequence generateSeq(Generator gen, const char* gen_name, B Begin = 0, E End = 10000)
{ {
const auto direction = signbit(End - Begin) ? -1 : 1; const auto direction = std::signbit(End - Begin) ? -1 : 1;
// if constexpr (debug_log_items)
// {
// std::cerr << "Generator: " << gen_name << std::endl;
// }
std::vector<char> data(sizeof(T) * (End - Begin)); std::vector<char> data(sizeof(T) * (End - Begin));
char * write_pos = data.data(); char * write_pos = data.data();
@ -606,8 +580,7 @@ TEST_P(CodecTest_Compatibility, Encoding)
const UInt32 encoded_size = codec->compress(source_data.data(), source_data.size(), encoded.data()); const UInt32 encoded_size = codec->compress(source_data.data(), source_data.size(), encoded.data());
encoded.resize(encoded_size); encoded.resize(encoded_size);
SCOPED_TRACE(Annotate("encoded: ", AsHexString(encoded))); SCOPED_TRACE(::testing::Message("encoded: ") << AsHexString(encoded));
// SCOPED_TRACE(Annotate("original: ", AsHexString(data_sequence.serialized_data)));
ASSERT_TRUE(EqualByteContainersAs<UInt8>(expected, encoded)); ASSERT_TRUE(EqualByteContainersAs<UInt8>(expected, encoded));
} }
@ -1211,26 +1184,6 @@ auto DDCompatibilityTestSequence()
ret.append(generateSeq<ValueType>(G(ddGenerator), p - 4, p + 2)); ret.append(generateSeq<ValueType>(G(ddGenerator), p - 4, p + 2));
} }
// auto s = AsSequenceOf<ValueType>(ret.serialized_data);
// ValueType prev = {};
// decltype(prev - prev) prev_delta = {};
// size_t i = 0;
// while(s)
// {
// const auto v = *s;
// const auto d = v - prev;
// const auto dd = d - prev_delta;
// std::cerr << "\n#" << i << " : " << v << " d: " << d << " dd: " << dd;
// ++s;
// prev_delta = d;
// prev = v;
// ++i;
// }
// std::cerr << std::endl;
return ret; return ret;
} }
@ -1305,6 +1258,8 @@ INSTANTIATE_TEST_CASE_P(DoubleDelta,
// prime numbers in ascending order with some random repitions hit all the cases of Gorilla. // prime numbers in ascending order with some random repitions hit all the cases of Gorilla.
auto PrimesWithMultiplierGenerator = [](int multiplier = 1) auto PrimesWithMultiplierGenerator = [](int multiplier = 1)
{
return [multiplier](auto i)
{ {
static const int vals[] = { static const int vals[] = {
2, 3, 5, 7, 11, 11, 13, 17, 19, 23, 29, 29, 31, 37, 41, 43, 2, 3, 5, 7, 11, 11, 13, 17, 19, 23, 29, 29, 31, 37, 41, 43,
@ -1313,8 +1268,6 @@ auto PrimesWithMultiplierGenerator = [](int multiplier = 1)
}; };
static const size_t count = sizeof(vals)/sizeof(vals[0]); static const size_t count = sizeof(vals)/sizeof(vals[0]);
return [&, multiplier](auto i)
{
using T = decltype(i); using T = decltype(i);
return static_cast<T>(vals[i % count] * static_cast<T>(multiplier)); return static_cast<T>(vals[i % count] * static_cast<T>(multiplier));
}; };