Miko/baritone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

debug

Browse Source
This commit is contained in:
Leijurv
2021-08-24 10:51:38 -07:00
parent 33082428f3
commit bcd22dc91c
1 changed files with 8 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
src/main/java/baritone/builder/GreedySolver.java
View File

@@ -115,7 +115,11 @@ public class GreedySolver {
}
private void updateNeighbor(Node node, WorldState worldState, long newPlayerPosition, long blockPlacement, int edgeCost) {
updateNeighbor(node, getNode(newPlayerPosition, node, worldState, blockPlacement), edgeCost);
Node neighbor = getNode(newPlayerPosition, node, worldState, blockPlacement);
if (Main.SLOW_DEBUG && blockPlacement != -1 && !neighbor.coalesceState(this).blockExists(blockPlacement)) { // only in slow_debug because this force-allocates a WorldState for every neighbor of every node!
throw new IllegalStateException();
}
updateNeighbor(node, neighbor, edgeCost);
}
private void updateNeighbor(Node node, Node neighbor, int edgeCost) {
@@ -127,6 +131,9 @@ public class GreedySolver {
neighbor.previous = node;
neighbor.cost = offeredCost;
neighbor.combinedCost = offeredCost + neighbor.heuristic;
if (Main.DEBUG && neighbor.combinedCost < Integer.MIN_VALUE / 2) { // simple attempt to catch obvious overflow
throw new IllegalStateException();
}
if (neighbor.inHeap()) {
heap.update(neighbor);
} else {