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

publicize

Browse Source
This commit is contained in:
Leijurv 2018-10-08 21:51:19 -07:00
parent a497a944a6
commit f17ce87e45
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
2 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/baritone/cache/WorldData.java vendored
View File

@ -42,7 +42,7 @@ public class WorldData implements IWorldData {
this.waypoints = new Waypoints(directory.resolve("waypoints")); this.waypoints = new Waypoints(directory.resolve("waypoints"));
} }
void onClose() { public void onClose() {
Baritone.INSTANCE.getExecutor().execute(() -> { Baritone.INSTANCE.getExecutor().execute(() -> {
System.out.println("Started saving the world in a new thread"); System.out.println("Started saving the world in a new thread");
cache.save(); cache.save();

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

@ -30,20 +30,20 @@ public final class PathNode {
/** /**
* The position of this node * The position of this node
*/ */
final int x; public final int x;
final int y; public final int y;
final int z; public final int z;
/** /**
* Cached, should always be equal to goal.heuristic(pos) * Cached, should always be equal to goal.heuristic(pos)
*/ */
final double estimatedCostToGoal; public final double estimatedCostToGoal;
/** /**
* Total cost of getting from start to here * Total cost of getting from start to here
* Mutable and changed by PathFinder * Mutable and changed by PathFinder
*/ */
double cost; public double cost;
/** /**
* Should always be equal to estimatedCosttoGoal + cost * Should always be equal to estimatedCosttoGoal + cost
@ -55,13 +55,13 @@ public final class PathNode {
* In the graph search, what previous node contributed to the cost * In the graph search, what previous node contributed to the cost
* Mutable and changed by PathFinder * Mutable and changed by PathFinder
*/ */
PathNode previous; public PathNode previous;
/** /**
* Is this a member of the open set in A*? (only used during pathfinding) * Is this a member of the open set in A*? (only used during pathfinding)
* Instead of doing a costly member check in the open set, cache membership in each node individually too. * Instead of doing a costly member check in the open set, cache membership in each node individually too.
*/ */
boolean isOpen; public boolean isOpen;
/** /**
* Where is this node in the array flattenization of the binary heap? Needed for decrease-key operations. * Where is this node in the array flattenization of the binary heap? Needed for decrease-key operations.