thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-11-10 09:32:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update HashTable.h

Browse Source
This commit is contained in:
alexey-milovidov 2020-12-12 03:30:12 +03:00 committed by GitHub
parent 6e7366f921
commit 7e2bc1e7a6
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 10 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
src/Common/HashTable/HashTable.h
View File

@ -958,19 +958,18 @@ public:
return const_cast<std::decay_t<decltype(*this)> *>(this)->find(x, hash_value);
}
template<typename = std::enable_if<Grower::performs_linear_probing_with_single_step, void>>
template <typename = std::enable_if<Grower::performs_linear_probing_with_single_step, void>>
void ALWAYS_INLINE erase(const Key & x)
{
/*
Deletion of open address hash table without tombstones
https://en.wikipedia.org/wiki/Linear_probing
https://en.wikipedia.org/wiki/Open_addressing
Algorithm without recomputing hash but keep probes difference value (difference of natural cell position and inserted one)
in cell https://arxiv.org/ftp/arxiv/papers/0909/0909.2547.pdf
Currently we use algorithm with hash recomputing on each step from https://en.wikipedia.org/wiki/Open_addressing.
*/
/** Deletion from open addressing hash table without tombstones
*
* https://en.wikipedia.org/wiki/Linear_probing
* https://en.wikipedia.org/wiki/Open_addressing
* Algorithm without recomputing hash but keep probes difference value (difference of natural cell position and inserted one)
* in cell https://arxiv.org/ftp/arxiv/papers/0909/0909.2547.pdf
*
* Currently we use algorithm with hash recomputing on each step from https://en.wikipedia.org/wiki/Open_addressing
*/
if (Cell::isZero(x, *this))
{