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

reformat

This commit is contained in:
Leijurv 2018-12-21 17:54:16 -08:00
parent b9b25e7e6b
commit 4d7e74365b
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
4 changed files with 3 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/api/java/baritone/api/pathing/calc/IPathFinder.java
View File

@ -36,7 +36,6 @@ public interface IPathFinder {
* *
* @param primaryTimeout If a path is found, the path finder will stop after this amount of time * @param primaryTimeout If a path is found, the path finder will stop after this amount of time
* @param failureTimeout If a path isn't found, the path finder will continue for this amount of time * @param failureTimeout If a path isn't found, the path finder will continue for this amount of time
*
* @return The final path * @return The final path
*/ */
PathCalculationResult calculate(long primaryTimeout, long failureTimeout); PathCalculationResult calculate(long primaryTimeout, long failureTimeout);

2
src/api/java/baritone/api/pathing/goals/Goal.java
View File

@ -33,7 +33,6 @@ public interface Goal {
* @param x The goal X position * @param x The goal X position
* @param y The goal Y position * @param y The goal Y position
* @param z The goal Z position * @param z The goal Z position
*
* @return Whether or not it satisfies this goal * @return Whether or not it satisfies this goal
*/ */
boolean isInGoal(int x, int y, int z); boolean isInGoal(int x, int y, int z);
@ -44,7 +43,6 @@ public interface Goal {
* @param x The goal X position * @param x The goal X position
* @param y The goal Y position * @param y The goal Y position
* @param z The goal Z position * @param z The goal Z position
*
* @return The estimate number of ticks to satisfy the goal * @return The estimate number of ticks to satisfy the goal
*/ */
double heuristic(int x, int y, int z); double heuristic(int x, int y, int z);

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

@ -136,11 +136,10 @@ public abstract class AbstractNodeCostSearch implements IPathFinder {
* for the node mapped to the specified pos. If no node is found, * for the node mapped to the specified pos. If no node is found,
* a new node is created. * a new node is created.
* *
* @param x The x position of the node * @param x The x position of the node
* @param y The y position of the node * @param y The y position of the node
* @param z The z position of the node * @param z The z position of the node
* @param hashCode The hash code of the node, provided by {@link BetterBlockPos#longHash(int, int, int)} * @param hashCode The hash code of the node, provided by {@link BetterBlockPos#longHash(int, int, int)}
*
* @return The associated node * @return The associated node
* @see <a href="https://github.com/cabaletta/baritone/issues/107">Issue #107</a> * @see <a href="https://github.com/cabaletta/baritone/issues/107">Issue #107</a>
*/ */

1
src/main/java/baritone/utils/player/PrimaryPlayerContext.java
View File

@ -23,7 +23,6 @@ import baritone.api.utils.IPlayerContext;
import baritone.api.utils.IPlayerController; import baritone.api.utils.IPlayerController;
import baritone.utils.Helper; import baritone.utils.Helper;
import net.minecraft.client.entity.EntityPlayerSP; import net.minecraft.client.entity.EntityPlayerSP;
import net.minecraft.client.multiplayer.PlayerControllerMP;
import net.minecraft.util.math.RayTraceResult; import net.minecraft.util.math.RayTraceResult;
import net.minecraft.world.World; import net.minecraft.world.World;