From 5926369a56fb853788774ec45223d87beed42cb5 Mon Sep 17 00:00:00 2001
From: ZacSharp <68165024+ZacSharp@users.noreply.github.com>
Date: Wed, 10 Feb 2021 10:15:14 +0100
Subject: [PATCH] formatting and comments

---
 src/api/java/baritone/api/pathing/goals/GoalNear.java    | 4 ++--
 src/api/java/baritone/api/pathing/goals/GoalRunAway.java | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/api/java/baritone/api/pathing/goals/GoalNear.java b/src/api/java/baritone/api/pathing/goals/GoalNear.java
index 1897d7743..6a8226fb4 100644
--- a/src/api/java/baritone/api/pathing/goals/GoalNear.java
+++ b/src/api/java/baritone/api/pathing/goals/GoalNear.java
@@ -56,7 +56,7 @@ public class GoalNear implements Goal, IGoalRenderPos {
     @Override
     public double heuristic() {// TODO less hacky solution
         int range = (int) Math.ceil(Math.sqrt(rangeSq));
-        DoubleOpenHashSet maybeAlwaysInside = new DoubleOpenHashSet();
+        DoubleOpenHashSet maybeAlwaysInside = new DoubleOpenHashSet(); // see pull request #1978
         double minOutside = Double.POSITIVE_INFINITY;
         for (int dx = -range; dx <= range; dx++) {
             for (int dy = -range; dy <= range; dy++) {
@@ -72,7 +72,7 @@ public class GoalNear implements Goal, IGoalRenderPos {
         }
         double maxInside = Double.NEGATIVE_INFINITY;
         DoubleIterator it = maybeAlwaysInside.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             double inside = it.nextDouble();
             if (inside < minOutside) {
                 maxInside = Math.max(maxInside, inside);
diff --git a/src/api/java/baritone/api/pathing/goals/GoalRunAway.java b/src/api/java/baritone/api/pathing/goals/GoalRunAway.java
index b85cb23ee..a1b2fe1cd 100644
--- a/src/api/java/baritone/api/pathing/goals/GoalRunAway.java
+++ b/src/api/java/baritone/api/pathing/goals/GoalRunAway.java
@@ -99,7 +99,7 @@ public class GoalRunAway implements Goal {
             maxY = Math.max(minY, p.getY() + distance);
             maxZ = Math.max(minZ, p.getZ() + distance);
         }
-        DoubleOpenHashSet maybeAlwaysInside = new DoubleOpenHashSet();
+        DoubleOpenHashSet maybeAlwaysInside = new DoubleOpenHashSet(); // see pull request #1978
         double minOutside = Double.POSITIVE_INFINITY;
         for (int x = minX; x <= maxX; x++) {
             for (int y = minY; y <= maxY; y++) {
@@ -115,7 +115,7 @@ public class GoalRunAway implements Goal {
         }
         double maxInside = Double.NEGATIVE_INFINITY;
         DoubleIterator it = maybeAlwaysInside.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             double inside = it.nextDouble();
             if (inside < minOutside) {
                 maxInside = Math.max(maxInside, inside);