From 8fa0d63ae5d6ba396210e51343cebc6e725a8e45 Mon Sep 17 00:00:00 2001 From: Leijurv Date: Sun, 9 Sep 2018 15:33:53 -0700 Subject: [PATCH] add link to benchmark --- src/main/java/baritone/utils/pathing/BetterBlockPos.java | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/src/main/java/baritone/utils/pathing/BetterBlockPos.java b/src/main/java/baritone/utils/pathing/BetterBlockPos.java index 3cf47478..574e0250 100644 --- a/src/main/java/baritone/utils/pathing/BetterBlockPos.java +++ b/src/main/java/baritone/utils/pathing/BetterBlockPos.java @@ -23,6 +23,10 @@ import net.minecraft.util.math.Vec3i; /** * A better BlockPos that has fewer hash collisions (and slightly more performant offsets) + *

+ * 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: + * https://docs.google.com/spreadsheets/d/1GWjOjOZINkg_0MkRgKRPH1kUzxjsnEROD9u3UFh_DJc/edit * * @author leijurv */