RepoMirrors
/
baritone
mirror of https://github.com/cabaletta/baritone
1
0
Fork 1
Code Issues Releases Wiki Activity

chunk check optimization

This commit is contained in:
Leijurv 2018-08-29 11:29:26 -07:00
parent 8d1570a11b
commit fb04ec6ff4
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
2 changed files with 14 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
src/main/java/baritone/pathing/calc/AStarPathFinder.java
View File

@ -113,15 +113,18 @@ public class AStarPathFinder extends AbstractNodeCostSearch implements Helper {
continue;
}
BetterBlockPos dest = (BetterBlockPos) movementToGetToNeighbor.getDest();
boolean isPositionCached = false;
if (world != null) {
if (world.isCached(dest)) {
isPositionCached = true;
if (dest.x >> 4 != currentNodePos.x >> 4 || dest.z >> 4 != currentNodePos.z >> 4) {
// only need to check if the destination is a loaded chunk if it's in a different chunk than the start of the movement
boolean isPositionCached = false;
if (world != null) {
if (world.isCached(dest)) {
isPositionCached = true;
}
}
if (!isPositionCached && Minecraft.getMinecraft().world.getChunk(dest) instanceof EmptyChunk) {
numEmptyChunk++;
continue;
}
}
if (!isPositionCached && Minecraft.getMinecraft().world.getChunk(dest) instanceof EmptyChunk) {
numEmptyChunk++;
continue;
}
//long costStart = System.nanoTime();
// TODO cache cost

6
src/main/java/baritone/utils/pathing/BetterBlockPos.java
View File

@ -27,9 +27,9 @@ import net.minecraft.util.math.Vec3i;
* @author leijurv
*/
public class BetterBlockPos extends BlockPos {
private final int x;
private final int y;
private final int z;
public final int x;
public final int y;
public final int z;
private final int hashCode;
public BetterBlockPos(int x, int y, int z) {