New hash algorithm for Cell and Vector<int> objects
Fixes #160 (closed)
The new algorithm is faster and leads to much fewer collisions. It relies of the fact that cell indices are bounded by the simulation box size.
Edited by Michael Kuron
Fixes #160 (closed)
The new algorithm is faster and leads to much fewer collisions. It relies of the fact that cell indices are bounded by the simulation box size.