Optimize Tile id calculation

[RamType0]

public static ulong CalculateTileId(int zoom)

Both .NET Framework 4.8(x64) and .NET 9.0 can optimize divide by 3 to idiv less.
So this implementation would be faster in most of environment.

public static ulong CalculateTileId(int zoom, int x, int y)

Use bit shift directly to reduce instructions.

public static (int x, int y, int zoom) CalculateTile(ulong id)

Don't use iteration to find zoom level.
Don't use slow integer division operators.

[RamType0]

Note: this implementation does not handle overflow.
But the original implementation also has overflow issue in exactly same case.
So this would never be regression.

[RamType0]

ulong id could represent up to 31 zoom level.
int tile index could represent up to 31 zoom level.
And tile id calculation supports zoom level of up to 31.
So id calculation never overflow unless tile is valid.