package com.villagervoice.util; import net.minecraft.block.BlockState; import net.minecraft.registry.tag.BlockTags; import net.minecraft.util.math.BlockPos; import net.minecraft.world.World; import java.util.HashSet; import java.util.LinkedList; import java.util.Queue; import java.util.Set; public class TreeFinder { public static BlockPos findNearestTree(World world, BlockPos center, int searchRadius) { for (int radius = 0; radius <= searchRadius; radius++) { for (int x = -radius; x <= radius; x++) { for (int z = -radius; z <= radius; z++) { for (int y = -5; y <= 5; y++) { BlockPos pos = center.add(x, y, z); if (isLog(world, pos)) { return findTreeBase(world, pos); } } } } } return null; } private static BlockPos findTreeBase(World world, BlockPos logPos) { BlockPos current = logPos; while (isLog(world, current.down())) { current = current.down(); } return current; } public static Set getTreeBlocks(World world, BlockPos basePos, boolean includeLeaves) { Set treeBlocks = new HashSet<>(); Set visited = new HashSet<>(); Queue queue = new LinkedList<>(); queue.offer(basePos); visited.add(basePos); while (!queue.isEmpty() && treeBlocks.size() < 2000) { BlockPos current = queue.poll(); if (isLog(world, current)) { treeBlocks.add(current); // Check all adjacent blocks 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) continue; BlockPos neighbor = current.add(dx, dy, dz); if (!visited.contains(neighbor)) { visited.add(neighbor); if (isLog(world, neighbor)) { queue.offer(neighbor); } else if (includeLeaves && isLeaves(world, neighbor)) { treeBlocks.add(neighbor); } } } } } } } // Add leaves connected to logs if (includeLeaves) { Set leafBlocks = new HashSet<>(); for (BlockPos logPos : treeBlocks) { findConnectedLeaves(world, logPos, leafBlocks, 5); } treeBlocks.addAll(leafBlocks); } return treeBlocks; } private static void findConnectedLeaves(World world, BlockPos center, Set leafBlocks, int radius) { for (int x = -radius; x <= radius; x++) { for (int y = -radius; y <= radius; y++) { for (int z = -radius; z <= radius; z++) { BlockPos pos = center.add(x, y, z); if (isLeaves(world, pos) && !leafBlocks.contains(pos)) { leafBlocks.add(pos); } } } } } private static boolean isLog(World world, BlockPos pos) { BlockState state = world.getBlockState(pos); return state.isIn(BlockTags.LOGS); } private static boolean isLeaves(World world, BlockPos pos) { BlockState state = world.getBlockState(pos); return state.isIn(BlockTags.LEAVES); } }