Robert Kelly

Sounds good. I'm interested and would like to know what your thoughts are on this.

You should change the authors to whom you copied this code from. This code bears a **striking** resemblance replete with bugs and deficiencies to [this ](http://www.cs.tau.ac.il/~multi/2015a/chhm_files/Source_Code/CPP/fine%20grained/hopscotch.hpp)and [this](http://www.cs.tau.ac.il/~multi/2015a/chhm_files/Source_Code/CPP/fine%20grained/hopscotch.cpp). The header **clearly**...

Another issue is that the paper you link starts off by describing Hopscotch Hashing with each bucket having a fixed size neighbourhood (`unsigned int volatile _hop_info;`), which is a bit-mask...

> @LeoSko > We don't see what paper you exactly want us to consider looking at. Sorry, I didn't explain it very well. Here's a more thorough explanation: There are...

@LeoSko > As fas as I understand for the first kind of realisation ("first version"), if it happened so that 32 items were added into the same bucket, then we...

@Dron642 It's not correct. You should check out this [link](https://sites.google.com/site/cconcurrencypackage/hopscotch-hashing). This algorithm is superior to the bitmask neighbourhood bucket version too.

### Underlying algorithm. The underlying algorithm that you use in your implementation is the inferior, fixed-sized neighbourhood version. Someone else submitted the same algorithm a while back (you linked it...