From 075ad3f244166e24066cdb79a1d4c6b9b499bab7 Mon Sep 17 00:00:00 2001
From: Leijurv <leijurv@gmail.com>
Date: Sun, 9 Sep 2018 15:38:59 -0700
Subject: [PATCH] almost forgot crucial performance numbers

---
 src/main/java/baritone/utils/pathing/BetterBlockPos.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/main/java/baritone/utils/pathing/BetterBlockPos.java b/src/main/java/baritone/utils/pathing/BetterBlockPos.java
index 216a8b631..895d982ff 100644
--- a/src/main/java/baritone/utils/pathing/BetterBlockPos.java
+++ b/src/main/java/baritone/utils/pathing/BetterBlockPos.java
@@ -25,7 +25,7 @@ import net.minecraft.util.math.Vec3i;
  * A better BlockPos that has fewer hash collisions (and slightly more performant offsets)
  * <p>
  * Is it really faster to subclass BlockPos and calculate a hash in the constructor like this, taking everything into account?
- * Yes. It's called BETTER BlockPos for a reason. Source:
+ * Yes. 20% faster actually. It's called BETTER BlockPos for a reason. Source:
  * <a href="https://docs.google.com/spreadsheets/d/1GWjOjOZINkg_0MkRgKRPH1kUzxjsnEROD9u3UFh_DJc">Benchmark Spreadsheet</a>
  *
  * @author leijurv