Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Area Clear? #43

Open
F0xiikk opened this issue Oct 29, 2024 · 5 comments
Open

Area Clear? #43

F0xiikk opened this issue Oct 29, 2024 · 5 comments

Comments

@F0xiikk
Copy link

F0xiikk commented Oct 29, 2024

Hi, would it be possible to make some modification to make it so that I would mark pos1 and pos2 for example 3x3x5 (length/width/height) and when I have it selected I would turn it on and it would automatically start mining until it has all mined? I personally tried to do something but failed. I am loser :DD

@bunnyi116
Copy link
Owner

I once tried to create a branch for development testing, but now I don't have much time to maintain this project (busy with work). I'm sorry~!

@F0xiikk
Copy link
Author

F0xiikk commented Nov 1, 2024

All right, I get it. Actually, I was thinking about some kind of baritone or something, but it never worked. Theoretically you could do it through a macro record or something like that but if you ever have time for that that would be great. Just see if you have any notes, codes you could send? If not, that's totally fine. I was just wondering how you were doing. But I understand the time constraints, but otherwise, good job. Thank you for your quick response. 👍

@bunnyi116
Copy link
Owner

// // 选区模式
// for (TaskSelectionInfo selectionInfo : selectionInfos) {
// int x1 = selectionInfo.pos1.getX();
// int y1 = selectionInfo.pos1.getY();
// int z1 = selectionInfo.pos1.getZ();
// int x2 = selectionInfo.pos2.getX();
// int y2 = selectionInfo.pos2.getY();
// int z2 = selectionInfo.pos2.getZ();
// int minX = Math.min(x1, x2);
// int minY = Math.min(y1, y2);
// int minZ = Math.min(z1, z2);
// int maxX = Math.max(x1, x2);
// int maxY = Math.max(y1, y2);
// int maxZ = Math.max(z1, z2);
// if (blockPos.getX() > minX && blockPos.getX() < maxX
// || blockPos.getY() > minY && blockPos.getY() < maxY
// || blockPos.getZ() > minZ && blockPos.getZ() < maxZ) {
// if (checkIsAllowBlock(world.getBlockState(blockPos).getBlock())) {
// for (var targetBlock : handleTasks) {
// // 检查重复任务
// if (targetBlock.pos.getManhattanDistance(blockPos) == 0) {
// return;
// }
// }
// handleTasks.add(new TaskHandler(world, world.getBlockState(blockPos).getBlock(), blockPos, false));
// }
// }
// }

This is my previous attempt.

https://github.com/bunnyi116/fabric-bedrock-miner/tree/dev-selection

@bunnyi116
Copy link
Owner

This was just my attempt at the time and may not work correctly, but I hope it can give you some ideas.

@F0xiikk
Copy link
Author

F0xiikk commented Nov 2, 2024

Thank you, i will try.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants