thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-09-23 18:20:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Applied clang-format [#CLICKHOUSE-2].

Browse Source
This commit is contained in:
Alexey Milovidov 2017-06-28 15:30:23 +03:00
parent 39ddcf1c74
commit 2b67782845
1 changed files with 40 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
dbms/src/Common/tests/space_saving.cpp
View File

@ -1,10 +1,10 @@
#include <iostream>
#include <iomanip>
#include <string>
#include <iostream>
#include <map>
#include <string>
#include <common/StringRef.h>
#include <Common/SpaceSaving.h>
#include <common/StringRef.h>
int main(int argc, char ** argv)
{
@ -14,7 +14,8 @@ int main(int argc, char ** argv)
/* Test biased insertion */
for (int i = 0; i < 200; ++i) {
for (int i = 0; i < 200; ++i)
{
first.insert(i);
int k = i % 5; // Bias towards 0-4
first.insert(k);
@ -23,40 +24,52 @@ int main(int argc, char ** argv)
/* Test whether the biased elements are retained */
std::map<int, UInt64> expect;
for (int i = 0; i < 5; ++i) {
for (int i = 0; i < 5; ++i)
{
expect[i] = 41;
}
for (auto x : first.topK(5)) {
if (expect[x.key] != x.count) {
for (auto x : first.topK(5))
{
if (expect[x.key] != x.count)
{
std::cerr << "key: " << x.key << " value: " << x.count << " expected: " << expect[x.key] << std::endl;
} else {
}
else
{
std::cout << "key: " << x.key << " value: " << x.count << std::endl;
}
expect.erase(x.key);
}
if (!expect.empty()) {
if (!expect.empty())
{
std::cerr << "expected to find all heavy hitters" << std::endl;
}
/* Create another table and test merging */
Cont second(10);
for (int i = 0; i < 200; ++i) {
for (int i = 0; i < 200; ++i)
{
first.insert(i);
}
for (int i = 0; i < 5; ++i) {
for (int i = 0; i < 5; ++i)
{
expect[i] = 42;
}
first.merge(second);
for (auto x : first.topK(5)) {
if (expect[x.key] != x.count) {
for (auto x : first.topK(5))
{
if (expect[x.key] != x.count)
{
std::cerr << "key: " << x.key << " value: " << x.count << " expected: " << expect[x.key] << std::endl;
} else {
}
else
{
std::cout << "key: " << x.key << " value: " << x.count << std::endl;
}
expect.erase(x.key);
@ -69,7 +82,8 @@ int main(int argc, char ** argv)
using Cont = DB::SpaceSaving<StringRef, StringRefHash>;
Cont cont(10);
for (int i = 0; i < 400; ++i) {
for (int i = 0; i < 400; ++i)
{
cont.insert(std::to_string(i));
cont.insert(std::to_string(i % 5)); // Bias towards 0-4
}
@ -77,21 +91,27 @@ int main(int argc, char ** argv)
// The hashing is going to be more lossy
// Expect at least ~ 10% count
std::map<std::string, UInt64> expect;
for (int i = 0; i < 5; ++i) {
for (int i = 0; i < 5; ++i)
{
expect[std::to_string(i)] = 38;
}
for (auto x : cont.topK(5)) {
for (auto x : cont.topK(5))
{
auto key = x.key.toString();
if (x.count < expect[key]) {
if (x.count < expect[key])
{
std::cerr << "key: " << key << " value: " << x.count << " expected: " << expect[key] << std::endl;
} else {
}
else
{
std::cout << "key: " << key << " value: " << x.count << std::endl;
}
expect.erase(key);
}
if (!expect.empty()) {
if (!expect.empty())
{
std::cerr << "expected to find all heavy hitters" << std::endl;
abort();
}