EpicKnarvik97/PlotSquared
EpicKnarvik97/PlotSquared
1
0
Fork 0
mirror of https://github.com/IntellectualSites/PlotSquared.git synced 2024-11-22 21:26:45 +01:00
Code Issues Projects Releases Wiki Activity

Fix up queues

Browse Source
This commit is contained in:
dordsor21 2022-01-26 13:35:34 +00:00 committed by Jordan
parent 0d468505bb
commit 9f4bdaef40
3 changed files with 10 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Bukkit/src/main/java/com/plotsquared/bukkit/queue/BukkitQueueCoordinator.java
View File

@ -179,7 +179,7 @@ public class BukkitQueueCoordinator extends BasicQueueCoordinator {
} }
} }
} }
for (int layer = 0; layer < localChunk.getBaseblocks().length; layer++) { for (int layer = 0; layer < localChunk.getBiomes().length; layer++) {
BiomeType[] biomesLayer = localChunk.getBiomes()[layer]; BiomeType[] biomesLayer = localChunk.getBiomes()[layer];
if (biomesLayer == null) { if (biomesLayer == null) {
continue; continue;

2
Core/src/main/java/com/plotsquared/core/queue/LocalChunk.java
View File

@ -54,7 +54,7 @@ public class LocalChunk {
this.x = x; this.x = x;
this.z = z; this.z = z;
this.minSection = parent.getWorld() != null ? (parent.getWorld().getMinY() >> 4) : 0; this.minSection = parent.getWorld() != null ? (parent.getWorld().getMinY() >> 4) : 0;
int sections = parent.getWorld() != null ? (parent.getWorld().getMaxY() >> 4) - minSection : 16; int sections = parent.getWorld() != null ? (parent.getWorld().getMaxY() >> 4) - minSection + 1 : 16;
baseblocks = new BaseBlock[sections][]; baseblocks = new BaseBlock[sections][];
biomes = new BiomeType[sections][]; biomes = new BiomeType[sections][];
} }

19
Core/src/main/java/com/plotsquared/core/util/ChunkUtil.java
View File

@ -47,17 +47,14 @@ public class ChunkUtil {
x_loc = new short[4096]; x_loc = new short[4096];
y_loc = new short[4096]; y_loc = new short[4096];
z_loc = new short[4096]; z_loc = new short[4096];
for (int i = 0; i < 16; i++) { for (int j = 0; j < 4096; j++) {
int i4 = i << 4; int y = j >> 8;
for (int j = 0; j < 4096; j++) { int a = j - ((y & 0xF) << 8);
int y = i4 + (j >> 8); int z1 = a >> 4;
int a = j - ((y & 0xF) << 8); int x1 = a - (z1 << 4);
int z1 = a >> 4; x_loc[j] = (short) x1;
int x1 = a - (z1 << 4); y_loc[j] = (short) y;
x_loc[j] = (short) x1; z_loc[j] = (short) z1;
y_loc[j] = (short) y;
z_loc[j] = (short) z1;
}
} }
CACHE_J = new short[16][16][16]; CACHE_J = new short[16][16][16];
for (int x = 0; x < 16; x++) { for (int x = 0; x < 16; x++) {