mirror of https://github.com/cabaletta/baritone
convenience methods
This commit is contained in:
parent
fa7a0b3c45
commit
89ad673ae3
|
@ -17,8 +17,8 @@
|
|||
|
||||
package baritone.pathing.calc;
|
||||
|
||||
import baritone.behavior.PathingBehavior;
|
||||
import baritone.api.pathing.goals.Goal;
|
||||
import baritone.behavior.PathingBehavior;
|
||||
import baritone.pathing.path.IPath;
|
||||
import baritone.utils.pathing.BetterBlockPos;
|
||||
import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap;
|
||||
|
@ -163,6 +163,18 @@ public abstract class AbstractNodeCostSearch implements IPathFinder {
|
|||
currentlyRunning = null;
|
||||
}
|
||||
|
||||
public PathNode mostRecentNodeConsidered() {
|
||||
return mostRecentConsidered;
|
||||
}
|
||||
|
||||
public PathNode bestNodeSoFar() {
|
||||
return bestSoFar[0];
|
||||
}
|
||||
|
||||
public PathNode startNode() {
|
||||
return startNode;
|
||||
}
|
||||
|
||||
@Override
|
||||
public Optional<IPath> pathToMostRecentNodeConsidered() {
|
||||
try {
|
||||
|
|
Loading…
Reference in New Issue