xircon/Hbm-s-Nuclear-Tech-GIT
1
0
Fork 0
mirror of https://github.com/HbmMods/Hbm-s-Nuclear-Tech-GIT.git synced 2026-01-25 10:32:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make veinminer follow diagonals

Browse Source
This commit is contained in:
abel1502 2025-05-08 14:57:49 +03:00
parent ca9b9f7b6c
commit 7d1a164bf7
No known key found for this signature in database
GPG Key ID: 076926596A536338
1 changed files with 28 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
src/main/java/com/hbm/handler/ToolAbility.java
View File

@ -60,24 +60,37 @@ public abstract class ToolAbility {
if(b == Blocks.netherrack && !ToolConfig.recursiveNetherrack) if(b == Blocks.netherrack && !ToolConfig.recursiveNetherrack)
return false; return false;
List<Integer> indices = Arrays.asList(new Integer[] {0, 1, 2, 3, 4, 5});
Collections.shuffle(indices);
pos.clear(); pos.clear();
for(Integer i : indices) { recurse(world, x, y, z, x, y, z, player, tool, 0);
switch(i) {
case 0: breakExtra(world, x + 1, y, z, x, y, z, player, tool, 0); break;
case 1: breakExtra(world, x - 1, y, z, x, y, z, player, tool, 0); break;
case 2: breakExtra(world, x, y + 1, z, x, y, z, player, tool, 0); break;
case 3: breakExtra(world, x, y - 1, z, x, y, z, player, tool, 0); break;
case 4: breakExtra(world, x, y, z + 1, x, y, z, player, tool, 0); break;
case 5: breakExtra(world, x, y, z - 1, x, y, z, player, tool, 0); break;
}
}
return false; return false;
} }
private static final List<ThreeInts> offsets = new ArrayList<>(3*3*3-1);
static {
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
for (int dz = -1; dz <= 1; dz++) {
if (dx != 0 || dy != 0 || dz != 0) {
offsets.add(new ThreeInts(dx, dy, dz));
}
}
}
}
}
private void recurse(World world, int x, int y, int z, int refX, int refY, int refZ, EntityPlayer player, IItemAbility tool, int depth) {
List<ThreeInts> shuffledOffsets = new ArrayList<>(offsets);
Collections.shuffle(shuffledOffsets);
for(ThreeInts offset : shuffledOffsets) {
breakExtra(world, x + offset.x, y + offset.y, z + offset.z, refX, refY, refZ, player, tool, depth);
}
}
private void breakExtra(World world, int x, int y, int z, int refX, int refY, int refZ, EntityPlayer player, IItemAbility tool, int depth) { private void breakExtra(World world, int x, int y, int z, int refX, int refY, int refZ, EntityPlayer player, IItemAbility tool, int depth) {
if(pos.contains(new ThreeInts(x, y, z))) if(pos.contains(new ThreeInts(x, y, z)))
@ -113,19 +126,7 @@ public abstract class ToolAbility {
tool.breakExtraBlock(world, x, y, z, player, refX, refY, refZ); tool.breakExtraBlock(world, x, y, z, player, refX, refY, refZ);
List<Integer> indices = Arrays.asList(new Integer[] {0, 1, 2, 3, 4, 5}); recurse(world, x, y, z, refX, refY, refZ, player, tool, depth);
Collections.shuffle(indices);
for(Integer i : indices) {
switch(i) {
case 0: breakExtra(world, x + 1, y, z, refX, refY, refZ, player, tool, depth); break;
case 1: breakExtra(world, x - 1, y, z, refX, refY, refZ, player, tool, depth); break;
case 2: breakExtra(world, x, y + 1, z, refX, refY, refZ, player, tool, depth); break;
case 3: breakExtra(world, x, y - 1, z, refX, refY, refZ, player, tool, depth); break;
case 4: breakExtra(world, x, y, z + 1, refX, refY, refZ, player, tool, depth); break;
case 5: breakExtra(world, x, y, z - 1, refX, refY, refZ, player, tool, depth); break;
}
}
} }
private boolean isSameBlock(Block b1, Block b2) { private boolean isSameBlock(Block b1, Block b2) {