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

convenience methods

Browse Source
This commit is contained in:
Leijurv 2018-09-23 18:44:54 -07:00
parent fa7a0b3c45
commit 89ad673ae3
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
1 changed files with 13 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/main/java/baritone/pathing/calc/AbstractNodeCostSearch.java
View File

@ -17,8 +17,8 @@
package baritone.pathing.calc; package baritone.pathing.calc;
import baritone.behavior.PathingBehavior;
import baritone.api.pathing.goals.Goal; import baritone.api.pathing.goals.Goal;
import baritone.behavior.PathingBehavior;
import baritone.pathing.path.IPath; import baritone.pathing.path.IPath;
import baritone.utils.pathing.BetterBlockPos; import baritone.utils.pathing.BetterBlockPos;
import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap; import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap;
@ -163,6 +163,18 @@ public abstract class AbstractNodeCostSearch implements IPathFinder {
currentlyRunning = null; currentlyRunning = null;
} }
public PathNode mostRecentNodeConsidered() {
return mostRecentConsidered;
}
public PathNode bestNodeSoFar() {
return bestSoFar[0];
}
public PathNode startNode() {
return startNode;
}
@Override @Override
public Optional<IPath> pathToMostRecentNodeConsidered() { public Optional<IPath> pathToMostRecentNodeConsidered() {
try { try {