2014-03-17 02:01:03 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <DB/Common/HashTable/Hash.h>
|
|
|
|
#include <DB/Common/HashTable/HashTable.h>
|
|
|
|
#include <DB/Common/HashTable/HashTableAllocator.h>
|
|
|
|
|
|
|
|
#include <DB/IO/WriteBuffer.h>
|
|
|
|
#include <DB/IO/WriteHelpers.h>
|
|
|
|
#include <DB/IO/ReadBuffer.h>
|
|
|
|
#include <DB/IO/ReadHelpers.h>
|
|
|
|
#include <DB/IO/VarInt.h>
|
|
|
|
|
|
|
|
|
|
|
|
template
|
|
|
|
<
|
|
|
|
typename Key,
|
|
|
|
typename Hash = DefaultHash<Key>,
|
|
|
|
typename Grower = HashTableGrower,
|
|
|
|
typename Allocator = HashTableAllocator
|
|
|
|
>
|
|
|
|
class HashSet : public HashTable<Key, HashTableCell<Key, Hash>, Hash, Grower, Allocator>
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef HashSet<Key, Hash, Grower, Allocator> Self;
|
|
|
|
typedef HashTableCell<Key, Hash> Cell;
|
|
|
|
|
|
|
|
void merge(const Self & rhs)
|
|
|
|
{
|
2014-04-28 01:48:24 +00:00
|
|
|
if (!this->hasZero() && rhs.hasZero())
|
2014-03-17 02:01:03 +00:00
|
|
|
{
|
2014-04-28 01:48:24 +00:00
|
|
|
this->setHasZero();
|
2014-03-17 02:01:03 +00:00
|
|
|
++this->m_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (size_t i = 0; i < rhs.grower.bufSize(); ++i)
|
2014-04-28 01:48:24 +00:00
|
|
|
if (!rhs.buf[i].isZero(*this))
|
|
|
|
this->insert(Cell::getKey(rhs.buf[i].getValue()));
|
2014-03-17 02:01:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void readAndMerge(DB::ReadBuffer & rb)
|
|
|
|
{
|
2014-04-28 01:48:24 +00:00
|
|
|
Cell::State::read(rb);
|
|
|
|
|
2014-03-17 02:01:03 +00:00
|
|
|
size_t new_size = 0;
|
|
|
|
DB::readVarUInt(new_size, rb);
|
|
|
|
|
|
|
|
this->resize(new_size);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < new_size; ++i)
|
|
|
|
{
|
|
|
|
Cell x;
|
|
|
|
x.read(rb);
|
2014-04-28 01:48:24 +00:00
|
|
|
this->insert(Cell::getKey(x.getValue()));
|
2014-03-17 02:01:03 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|