Add hashing for coordinate class

[JoshEliades]

Added hash algorithm for Coordinate object using XOR, bit shifts and prime multiplication

[nhatdongdang]

I think the hash collisions are still high. You can refer to this code

#include <bits/stdc++.h>

std::size_t getHash1(int x, int y, int z)
{
    return (std::hash<int>()(x) * 31) ^
           ((std::hash<int>()(y) * 37) << 8) ^
           ((std::hash<int>()(z) * 41) << 16);
}

std::size_t getHash2(int x, int y, int z)
{
    // Minecraft coordinate bounds
    int lower = -3e7, upper = 3e7;
    size_t base = upper - lower + 1;

    // Make x,y,z non negative
    size_t nx = x - lower, ny = y - lower, nz = z - lower;

    // Use overflow instead of modding
    size_t hash = nx * base * base + ny * base + nz;
    return hash;
}

int main()
{

    std::set<std::size_t> visited1, visited2;

    int startX = 0, endX = 1000;
    int startY = 0, endY = 20;
    int startZ = 0, endZ = 1000;

    for (int x = startX; x <= endX; x++)
    {
        for (int y = startY; y <= endY; y++)
        {
            for (int z = startZ; z <= endZ; z++)
            {
                visited1.insert(getHash1(x, y, z));
                visited2.insert(getHash2(x, y, z));
            }
        }
    }

    int expectedSize = (endX - startX + 1) * (endY - startY + 1) * (endZ - startZ + 1);
    std::cout << "getHash1 collisions: " << expectedSize - (int)visited1.size() << "\n";
    std::cout << "getHash2 collisions: " << expectedSize - (int)visited2.size() << "\n";
}

[JoshEliades]

Looks good to me, lets go with that then

[rozukke]

Would be great to get a solution with minimal collisions. Additionally, some sort of testing would be nice to make sure this compiles and runs on all systems. In any case, this is delayed until next release.

[rozukke]

@JoshEliades are you willing to write some tests for this implementation? If not maybe @nhatdongdang can do it

[JoshEliades]

I can write some tests for the implementation