Windy/cubiomes
1
0
Fork 0
mirror of https://github.com/Cubitect/cubiomes.git synced 2025-04-04 22:33:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

optimised mapIsland

Browse Source
This commit is contained in:
Cubitect 2018-03-21 21:30:55 +00:00
parent b28bfa5286
commit b6a9b2d2b3
1 changed files with 26 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
layers.c
View File

@ -133,12 +133,26 @@ void mapNull(Layer *l, int * __restrict out, int x, int z, int w, int h)
void mapIsland(Layer *l, int * __restrict out, int areaX, int areaZ, int areaWidth, int areaHeight)
{
register int x, z;
const long ws = l->worldSeed;
const long ss = ws * (ws * 6364136223846793005L + 1442695040888963407L);
for(z = 0; z < areaHeight; z++)
{
for(x = 0; x < areaWidth; x++)
{
setChunkSeed(l, (long)(areaX + x), (long)(areaZ + z));
out[x + z*areaWidth] = mcNextInt(l, 10) == 0 ? 1 : 0;
const long chunkX = (long)(x + areaX);
const long chunkZ = (long)(z + areaZ);
register long cs = ss;
cs += chunkX;
cs *= cs * 6364136223846793005L + 1442695040888963407L;
cs += chunkZ;
cs *= cs * 6364136223846793005L + 1442695040888963407L;
cs += chunkX;
cs *= cs * 6364136223846793005L + 1442695040888963407L;
cs += chunkZ;
out[x + z*areaWidth] = (cs >> 24) % 10 == 0;
}
}
@ -210,16 +224,16 @@ void mapZoom(Layer *l, int * __restrict out, int areaX, int areaZ, int areaWidth
else
{
//selectModeOrRandom
if (a1 == b && b == b1) buf[idx + newWidth] = a1;
else if(a == a1 && a == b ) buf[idx + newWidth] = a;
else if(a == a1 && a == b1) buf[idx + newWidth] = a;
else if(a == b && a == b1) buf[idx + newWidth] = a;
else if(a == a1 && b != b1) buf[idx + newWidth] = a;
else if(a == b && a1 != b1) buf[idx + newWidth] = a;
else if(a == b1 && a1 != b ) buf[idx + newWidth] = a;
else if(a1 == b && a != b1) buf[idx + newWidth] = a1;
else if(a1 == b1 && a != b ) buf[idx + newWidth] = a1;
else if(b == b1 && a != a1) buf[idx + newWidth] = b;
if (a1 == b && b == b1) buf[idx + newWidth] = a1;
else if (a == a1 && a == b ) buf[idx + newWidth] = a;
else if (a == a1 && a == b1) buf[idx + newWidth] = a;
else if (a == b && a == b1) buf[idx + newWidth] = a;
else if (a == a1 && b != b1) buf[idx + newWidth] = a;
else if (a == b && a1 != b1) buf[idx + newWidth] = a;
else if (a == b1 && a1 != b ) buf[idx + newWidth] = a;
else if (a1 == b && a != b1) buf[idx + newWidth] = a1;
else if (a1 == b1 && a != b ) buf[idx + newWidth] = a1;
else if (b == b1 && a != a1) buf[idx + newWidth] = b;
else
{
cs *= cs * 1284865837 + 4150755663;