spaghetti to export list of canWalkThrough and canWalkOn

.circleci/config.yml

@@ -0,0 +1,43 @@
+# Java Gradle CircleCI 2.0 configuration file
+#
+# Check https://circleci.com/docs/2.0/language-java/ for more details
+#
+version: 2
+jobs:
+  build:
+    docker:
+    # specify the version you desire here
+    - image: circleci/openjdk:8-jdk
+
+    # Specify service dependencies here if necessary
+    # CircleCI maintains a library of pre-built images
+    # documented at https://circleci.com/docs/2.0/circleci-images/
+    # - image: circleci/postgres:9.4
+
+    working_directory: ~/repo
+
+    environment:
+      # Customize the JVM maximum heap limit
+      JVM_OPTS: -Xmx3200m
+      TERM: dumb
+
+    steps:
+    - checkout
+
+    # Download and cache dependencies
+    - restore_cache:
+        keys:
+        - v1-dependencies-{{ checksum "build.gradle" }}
+        # fallback to using the latest cache if no exact match is found
+        - v1-dependencies-
+
+    - run: gradle dependencies
+
+    - save_cache:
+        paths:
+        - ~/.gradle
+        key: v1-dependencies-{{ checksum "build.gradle" }}
+
+    # run tests!
+    - run: gradle test
+

.gitignore

@@ -2,7 +2,6 @@
 **/*.swp
 
 run/
-autotest/
 
 # Gradle
 build/

.idea/copyright/Baritone.xml

@@ -1,7 +1,6 @@
 <component name="CopyrightManager">
   <copyright>
-    <option name="keyword" value="This file is part of Baritone" />
-    <option name="notice" value="This file is part of Baritone.&#10;&#10;Baritone is free software: you can redistribute it and/or modify&#10;it under the terms of the GNU Lesser General Public License as published by&#10;the Free Software Foundation, either version 3 of the License, or&#10;(at your option) any later version.&#10;&#10;Baritone is distributed in the hope that it will be useful,&#10;but WITHOUT ANY WARRANTY; without even the implied warranty of&#10;MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the&#10;GNU Lesser General Public License for more details.&#10;&#10;You should have received a copy of the GNU Lesser General Public License&#10;along with Baritone.  If not, see &lt;https://www.gnu.org/licenses/&gt;." />
+    <option name="notice" value="This file is part of Baritone.&#10;&#10;Baritone is free software: you can redistribute it and/or modify&#10;it under the terms of the GNU General Public License as published by&#10;the Free Software Foundation, either version 3 of the License, or&#10;(at your option) any later version.&#10;&#10;Baritone is distributed in the hope that it will be useful,&#10;but WITHOUT ANY WARRANTY; without even the implied warranty of&#10;MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the&#10;GNU General Public License for more details.&#10;&#10;You should have received a copy of the GNU General Public License&#10;along with Baritone.  If not, see &lt;https://www.gnu.org/licenses/&gt;." />
     <option name="myName" value="Baritone" />
   </copyright>
 </component>

.travis.yml

@@ -1,28 +0,0 @@
-language: java
-
-sudo: required
-
-services:
-- docker
-
-install:
-- travis_retry docker build -t cabaletta/baritone .
-
-script:
-- docker run --name baritone cabaletta/baritone /bin/sh -c "set -e; /sbin/start-stop-daemon --start --quiet --pidfile /tmp/custom_xvfb_99.pid --make-pidfile --background --exec /usr/bin/Xvfb -- :99 -screen 0 128x128x24 -ac +extension GLX +render; sh scripts/build.sh; DISPLAY=:99 BARITONE_AUTO_TEST=true ./gradlew runClient"
-- docker cp baritone:/code/dist dist
-- ls dist
-- cat dist/checksums.txt
-
-deploy:
-  provider: releases
-  api_key:
-    secure: YOuiXoJNpB4bW89TQoY2IGXg0tqOKls55YMXsSPU6Mx8WzRu8CjjO/A8KA9nGfNrKM+NucjiKr/h53O2Dp2uyy0i0SLvav/G0MaBMeB1NlPRwFopi6tVPNaoZsvr8NW4BIURhspckYLpOTYWnfmOkIv8q7AxrjUZWPKDlq0dte20UxEqUE6msHJ7U9XlKo/4fX40kvWMfwGI2hTyAtL0cRT1QPsd+uW3OQjAPcQj+jKaWld46V8pBK8g9Qde9mo8HC9NBv97zw1bBF1EFkynW569kElHvaS2Opl2QLGaf66guDbpnqDpGHMhQrDdxsZHJ4RksyITn+8A9UArmbkU35BxKqBeQqOWxod2+M0axdLh1pvX43Q1t9n7RiZBf7GvV8vkXL5Sjf8v6Y4LqkJGhvQkTUwpH+0knwrE761DMCtBC34AiWG70D4u7msmhurkflr9kmRHSj/3lyJ1Q2lkt8L+FOAlQBVs64vXTsfgc6Yge7N0O3UD5hCkrDNoz3BzhNBdCkbdxdKCGip71UZgUNkPy9o3ui8jATNj9ypx3+U8ovqP0XWlJqUZmyeXyNGW9NrLeCkRLTlLnZ/dv6OPONa1oAu4TwF1w5A+TGRFZcZjH/PnZKZDQ1OYQOR6drLKRYdr2unvuf5KUKUGqZ7aYtLGhP0rBvGWddRV7DSmX/s=
-  all_branches: true
-  file_glob: true
-  file:
-  - dist/*
-  skip_cleanup: true
-  on:
-    tags: true
-    repo: cabaletta/baritone

Dockerfile

@@ -1,26 +0,0 @@
-FROM debian:jessie
-
-RUN echo 'deb http://deb.debian.org/debian jessie-backports main' > /etc/apt/sources.list.d/jessie-backports.list
-
-ENV DEBIAN_FRONTEND noninteractive
-
-RUN apt update -y
-
-RUN apt install --target-release jessie-backports \
-          openjdk-8-jdk \
-          ca-certificates-java \
-          --assume-yes
-
-RUN apt install -qq --force-yes mesa-utils libgl1-mesa-glx libxcursor1 libxrandr2 libxxf86vm1 x11-xserver-utils xfonts-base xserver-common
-
-RUN apt install -qq --force-yes unzip wget
-
-COPY . /code
-
-# this .deb is specially patched to support lwjgl
-# source: https://github.com/tectonicus/tectonicus/issues/60#issuecomment-154239173
-RUN dpkg -i /code/scripts/xvfb_1.16.4-1_amd64.deb
-
-WORKDIR /code
-
-RUN ./gradlew build

FEATURES.md

@@ -1,52 +0,0 @@
-# Pathing features
-- **Long distance pathing and splicing** Baritone calculates paths in segments, and precalculates the next segment when the current one is about to end, so that it's moving towards the goal at all times.
-- **Chunk caching** Baritone simplifies chunks to a compacted internal 2-bit representation (AIR, SOLID, WATER, AVOID) and stores them in RAM for better very-long-distance pathing. There is also an option to save these cached chunks to disk. <a href="https://www.youtube.com/watch?v=dyfYKSubhdc">Example</a>
-- **Block breaking** Baritone considers breaking blocks as part of its path. It also takes into account your current tool set and hot bar. For example, if you have a Eff V diamond pick, it may choose to mine through a stone barrier, while if you only had a wood pick it might be faster to climb over it.
-- **Block placing** Baritone considers placing blocks as part of its path. This includes sneak-back-placing, pillaring, etc. It has a configurable penalty of placing a block (set to 1 second by default), to conserve its resources. The list of acceptable throwaway blocks is also configurable, and is cobble, dirt, or netherrack by default. <a href="https://www.youtube.com/watch?v=F6FbI1L9UmU">Example</a>
-- **Falling** Baritone will fall up to 3 blocks onto solid ground (configurable, if you have Feather Falling and/or don't mind taking a little damage). If you have a water bucket on your hotbar, it will fall up to 23 blocks and place the bucket beneath it. It will fall an unlimited distance into existing still water.
-- **Vines and ladders** Baritone understands how to climb and descend vines and ladders. There is experimental support for more advanced maneuvers, like strafing to a different ladder / vine column in midair (off by default, setting named `allowVines`).
-- **Opening fence gates and doors**
-- **Slabs and stairs**
-- **Falling blocks** Baritone understands the costs of breaking blocks with falling blocks on top, and includes all of their break costs. Additionally, since it avoids breaking any blocks touching a liquid, it won't break the bottom of a gravel stack below a lava lake (anymore).
-- **Avoiding dangerous blocks** Obviously, it knows not to walk through fire or on magma, not to corner over lava (that deals some damage), not to break any blocks touching a liquid (it might drown), etc.
-- **Parkour** Sprint jumping over 1, 2, or 3 block gaps
-- **Parkour place** Sprint jumping over a 3 block gap and placing the block to land on while executing the jump. It's really cool.
-
-# Pathing method
-Baritone uses A*, with some modifications: 
-
-- **Segmented calculation** Traditional A* calculates until the most promising node is in the goal, however in the environment of Minecraft with a limited render distance, we don't know the environment all the way to our goal. Baritone has three possible ways for path calculation to end: finding a path all the way to the goal, running out of time, or getting to the render distance. In the latter two scenarios, the selection of which segment to actually execute falls to the next item (incremental cost backoff). Whenever the path calculation thread finds that the best / most promising node is at the edge of loaded chunks, it increments a counter. If this happens more than 50 times (configurable), path calculation exits early. This happens with very low render distances. Otherwise, calculation continues until the timeout is hit (also configurable) or we find a path all the way to the goal.
-- **Incremental cost backoff** When path calculation exits early without getting all the way to the goal, Baritone it needs to select a segment to execute first (assuming it will calculate the next segment at the end of this one). It uses incremental cost backoff to select the best node by varying metrics, then paths to that node. This is unchanged from MineBot and I made a <a href="https://docs.google.com/document/d/1WVHHXKXFdCR1Oz__KtK8sFqyvSwJN_H4lftkHFgmzlc/edit">write-up</a> that still applies. In essence, it keeps track of the best node by various increasing coefficients, then picks the node with the least coefficient that goes at least 5 blocks from the starting position.
-- **Minimum improvement repropagation** The pathfinder ignores alternate routes that provide minimal improvements (less than 0.01 ticks of improvement), because the calculation cost of repropagating this to all connected nodes is much higher than the half-millisecond path time improvement it would get.
-- **Backtrack cost favoring** While calculating the next segment, Baritone favors backtracking its current segment. The cost is decreased heavily, but is still positive (this won't cause it to backtrack if it doesn't need to). This allows it to splice and jump onto the next segment as early as possible, if the next segment begins with a backtrack of the current one. <a href="https://www.youtube.com/watch?v=CGiMcb8-99Y">Example</a>
-- **Backtrack detection and pausing** While path calculation happens on a separate thread, the main game thread has access to the latest node considered, and the best path so far (those are rendered light blue and dark blue respectively). When the current best path (rendered dark blue) passes through the player's current position on the current path segment, path execution is paused (if it's safe to do so), because there's no point continuing forward if we're about to turn around and go back that same way. Note that the current best path as reported by the path calculation thread takes into account the incremental cost backoff system, so it's accurate to what the path calculation thread will actually pick once it finishes.
-
-# Configuring Baritone
-All the settings and documentation are <a href="https://github.com/cabaletta/baritone/blob/master/src/api/java/baritone/api/Settings.java">here</a>.
-To change a boolean setting, just say its name in chat (for example saying `allowBreak` toggles whether Baritone will consider breaking blocks). For a numeric setting, say its name then the new value (like `pathTimeoutMS 250`). It's case insensitive.
-
-# Goals
-The pathing goal can be set to any of these options:
-- **GoalBlock** one specific block that the player should stand inside at foot level
-- **GoalXZ** an X and a Z coordinate, used for long distance pathing
-- **GoalYLevel** a Y coordinate
-- **GoalTwoBlocks** a block position that the player should stand in, either at foot or eye level
-- **GoalGetToBlock** a block position that the player should stand adjacent to, below, or on top of
-- **GoalNear** a block position that the player should get within a certain radius of, used for following entities
-- **GoalAxis** a block position on an axis or diagonal axis (so x=0, z=0, or x=z), and y=120 (configurable)
-
-And finally `GoalComposite`. `GoalComposite` is a list of other goals, any one of which satisfies the goal. For example, `mine diamond_ore` creates a `GoalComposite` of `GoalTwoBlocks`s for every diamond ore location it knows of.
-
-
-# Future features
-Things it doesn't have yet
-- Trapdoors
-- Sprint jumping in a 1x2 corridor
-
-See <a href="https://github.com/cabaletta/baritone/issues">issues</a> for more.
-
-Things it may not ever have, from most likely to least likely =(
-- Pigs
-- Boats
-- Horses (2x3 path instead of 1x2)
-- Elytra

IMPACT.md

@@ -1,91 +0,0 @@
-# Integration between Baritone and Impact
-Impact 4.4 will have Baritone included on release, however, if you're impatient, you can install Baritone into Impact 4.3 right now!
-
-## An Introduction
-There are some basic steps to getting Baritone setup with Impact.
-- Acquiring a build of Baritone
-- Placing Baritone in the libraries directory
-- Modifying the Impact Profile JSON to run baritone
-- How to use Baritone
-
-## Acquiring a build of Baritone
-There are 3 methods of acquiring a build of Baritone (While it is still in development)
-
-### Official Release (Not always up to date)
-https://github.com/cabaletta/baritone/releases
-
-For Impact 4.3, there is no Baritone integration yet, so you will want `baritone-standalone-X.Y.Z.jar`.
-
-Any official release will be GPG signed by leijurv (44A3EA646EADAC6A) and ZeroMemes (73A788379A197567). Please verify that the hash of the file you download is in `checksums.txt` and that `checksums_signed.asc` is a valid signature by those two public keys of `checksums.txt`. 
-
-The build for `baritone-unoptimized-X.Y.Z.jar` is deterministic, and you can verify Travis did it properly by running `scripts/build.sh` yourself and comparing the shasum. The proguarded files (api and standalone) aren't yet reproducible, because proguard annoyingly includes the current timestamp into the final jar.
-
-### Building Baritone yourself
-There are a few steps to this
-- Clone this repository
-- Setup the project as instructed in the README
-- Run the ``build`` gradle task. You can either do this using IntelliJ's gradle UI or through a
-command line
-  - Windows: ``gradlew build``
-  - Mac/Linux: ``./gradlew build``
-- The build should be exported into ``/build/libs/baritone-X.Y.Z.jar``
-
-### Cutting Edge Release
-If you want to trust @Plutie#9079, you can download an automatically generated build of the latest commit
-from his Jenkins server, found <a href="https://plutiejenkins.leijurv.com/job/baritone/lastSuccessfulBuild/">here</a>.
-
-## Placing Baritone in the libraries directory
-``/libraries`` is a neat directory in your <a href="https://minecraft.gamepedia.com/.minecraft">Minecraft Installation Directory</a>
-that contains all of the dependencies that are required from the game and some mods. This is where we will be
-putting baritone.
-- Locate the ``libraries`` folder, it should be in the Minecraft Installation Directory
-- Create 3 new subdirectories starting from ``libraries``
-  - ``cabaletta``
-    - ``baritone``
-      - ``X.Y.Z``
- - Copy the build of Baritone that was acquired earlier, and place it into the ``X.Y.Z`` folder
-   - The full path should look like ``<Minecraft>/libraries/cabaletta/baritone/X.Y.Z/baritone-X.Y.Z.jar``
-
-## Modifying the Impact Profile JSON to run baritone
-The final step is "registering" the Baritone library with Impact, so that it loads on launch.
-- Ensure your Minecraft launcher is closed
-- Navigate back to the Minecraft Installation Directory
-- Find the ``versions`` directory, and open in
-- In here there should be a ``1.12.2-Impact_4.3`` folder.
-  - If you don't have any Impact folder or have a version older than 4.3, you can download Impact <a href="https://impactdevelopment.github.io">here</a>.
-- Open the folder and inside there should be a file called ``1.12.2-Impact_4.3.json``
-- Open the JSON file with a text editor that supports your system's line endings
-  - For example, Notepad on Windows likely will NOT work for this. You should instead use a Text Editor like
-  <a href="https://notepad-plus-plus.org/">Notepad++</a> if you're on Windows. (For other systems, I'm not sure
-  what would work the best so you may have to do some research.)
-- Find the ``libraries`` array in the JSON. It should look something like this.
-    ```
-    "libraries": [
-        {
-            "name": "net.minecraft:launchwrapper:1.12"
-        },
-        {
-            "name": "com.github.ImpactDevelopment:Impact:4.3-1.12.2",
-            "url": "https://impactdevelopment.github.io/maven/"
-        },
-        {
-            "name": "com.github.ImpactDeveloment:ClientAPI:3.0.2",
-            "url": "https://impactdevelopment.github.io/maven/"
-        },
-        ...
-    ```
-- Create a new object in the array, between the ``Impact`` and ``ClientAPI`` dependencies preferably.
-    ```
-    {
-        "name": "cabaletta:baritone:X.Y.Z"
-    },
-    ```
-- Now find the ``"minecraftArguments": "..."`` text near the top.
-- At the very end of the quotes where it says ``--tweakClass clientapi.load.ClientTweaker"``, add on the following so it looks like:
-  - ``--tweakClass clientapi.load.ClientTweaker --tweakClass baritone.launch.BaritoneTweakerOptifine"``
-- If you didn't close your launcher for this step, restart it now.
-- You can now launch Impact 4.3 as normal, and Baritone should start up
- 
- ## How to use Baritone
- Instructions on how to use Baritone are limited, and you may have to read a little bit of code (Really nothing much
-  just plain English), you can view that <a href="https://github.com/cabaletta/baritone#chat-control">here</a>.

LICENSE

@@ -1,165 +0,0 @@
-                   GNU LESSER GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-
-  This version of the GNU Lesser General Public License incorporates
-the terms and conditions of version 3 of the GNU General Public
-License, supplemented by the additional permissions listed below.
-
-  0. Additional Definitions.
-
-  As used herein, "this License" refers to version 3 of the GNU Lesser
-General Public License, and the "GNU GPL" refers to version 3 of the GNU
-General Public License.
-
-  "The Library" refers to a covered work governed by this License,
-other than an Application or a Combined Work as defined below.
-
-  An "Application" is any work that makes use of an interface provided
-by the Library, but which is not otherwise based on the Library.
-Defining a subclass of a class defined by the Library is deemed a mode
-of using an interface provided by the Library.
-
-  A "Combined Work" is a work produced by combining or linking an
-Application with the Library.  The particular version of the Library
-with which the Combined Work was made is also called the "Linked
-Version".
-
-  The "Minimal Corresponding Source" for a Combined Work means the
-Corresponding Source for the Combined Work, excluding any source code
-for portions of the Combined Work that, considered in isolation, are
-based on the Application, and not on the Linked Version.
-
-  The "Corresponding Application Code" for a Combined Work means the
-object code and/or source code for the Application, including any data
-and utility programs needed for reproducing the Combined Work from the
-Application, but excluding the System Libraries of the Combined Work.
-
-  1. Exception to Section 3 of the GNU GPL.
-
-  You may convey a covered work under sections 3 and 4 of this License
-without being bound by section 3 of the GNU GPL.
-
-  2. Conveying Modified Versions.
-
-  If you modify a copy of the Library, and, in your modifications, a
-facility refers to a function or data to be supplied by an Application
-that uses the facility (other than as an argument passed when the
-facility is invoked), then you may convey a copy of the modified
-version:
-
-   a) under this License, provided that you make a good faith effort to
-   ensure that, in the event an Application does not supply the
-   function or data, the facility still operates, and performs
-   whatever part of its purpose remains meaningful, or
-
-   b) under the GNU GPL, with none of the additional permissions of
-   this License applicable to that copy.
-
-  3. Object Code Incorporating Material from Library Header Files.
-
-  The object code form of an Application may incorporate material from
-a header file that is part of the Library.  You may convey such object
-code under terms of your choice, provided that, if the incorporated
-material is not limited to numerical parameters, data structure
-layouts and accessors, or small macros, inline functions and templates
-(ten or fewer lines in length), you do both of the following:
-
-   a) Give prominent notice with each copy of the object code that the
-   Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the object code with a copy of the GNU GPL and this license
-   document.
-
-  4. Combined Works.
-
-  You may convey a Combined Work under terms of your choice that,
-taken together, effectively do not restrict modification of the
-portions of the Library contained in the Combined Work and reverse
-engineering for debugging such modifications, if you also do each of
-the following:
-
-   a) Give prominent notice with each copy of the Combined Work that
-   the Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the Combined Work with a copy of the GNU GPL and this license
-   document.
-
-   c) For a Combined Work that displays copyright notices during
-   execution, include the copyright notice for the Library among
-   these notices, as well as a reference directing the user to the
-   copies of the GNU GPL and this license document.
-
-   d) Do one of the following:
-
-       0) Convey the Minimal Corresponding Source under the terms of this
-       License, and the Corresponding Application Code in a form
-       suitable for, and under terms that permit, the user to
-       recombine or relink the Application with a modified version of
-       the Linked Version to produce a modified Combined Work, in the
-       manner specified by section 6 of the GNU GPL for conveying
-       Corresponding Source.
-
-       1) Use a suitable shared library mechanism for linking with the
-       Library.  A suitable mechanism is one that (a) uses at run time
-       a copy of the Library already present on the user's computer
-       system, and (b) will operate properly with a modified version
-       of the Library that is interface-compatible with the Linked
-       Version.
-
-   e) Provide Installation Information, but only if you would otherwise
-   be required to provide such information under section 6 of the
-   GNU GPL, and only to the extent that such information is
-   necessary to install and execute a modified version of the
-   Combined Work produced by recombining or relinking the
-   Application with a modified version of the Linked Version. (If
-   you use option 4d0, the Installation Information must accompany
-   the Minimal Corresponding Source and Corresponding Application
-   Code. If you use option 4d1, you must provide the Installation
-   Information in the manner specified by section 6 of the GNU GPL
-   for conveying Corresponding Source.)
-
-  5. Combined Libraries.
-
-  You may place library facilities that are a work based on the
-Library side by side in a single library together with other library
-facilities that are not Applications and are not covered by this
-License, and convey such a combined library under terms of your
-choice, if you do both of the following:
-
-   a) Accompany the combined library with a copy of the same work based
-   on the Library, uncombined with any other library facilities,
-   conveyed under the terms of this License.
-
-   b) Give prominent notice with the combined library that part of it
-   is a work based on the Library, and explaining where to find the
-   accompanying uncombined form of the same work.
-
-  6. Revised Versions of the GNU Lesser General Public License.
-
-  The Free Software Foundation may publish revised and/or new versions
-of the GNU Lesser General Public License from time to time. Such new
-versions will be similar in spirit to the present version, but may
-differ in detail to address new problems or concerns.
-
-  Each version is given a distinguishing version number. If the
-Library as you received it specifies that a certain numbered version
-of the GNU Lesser General Public License "or any later version"
-applies to it, you have the option of following the terms and
-conditions either of that published version or of any later version
-published by the Free Software Foundation. If the Library as you
-received it does not specify a version number of the GNU Lesser
-General Public License, you may choose any version of the GNU Lesser
-General Public License ever published by the Free Software Foundation.
-
-  If the Library as you received it specifies that a proxy can decide
-whether future versions of the GNU Lesser General Public License shall
-apply, that proxy's public statement of acceptance of any version is
-permanent authorization for you to choose that version for the
-Library.

LICENSE.txt

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    Baritone  Copyright (C) 2018  Cabaletta
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

README.md

@@ -1,71 +1,3 @@
 # Baritone
-[![Build Status](https://travis-ci.com/cabaletta/baritone.svg?branch=master)](https://travis-ci.com/cabaletta/baritone)
-[![License](https://img.shields.io/github/license/cabaletta/baritone.svg)](LICENSE)
-[![Codacy Badge](https://api.codacy.com/project/badge/Grade/7150d8ccf6094057b1782aa7a8f92d7d)](https://www.codacy.com/app/leijurv/baritone?utm_source=github.com&utm_medium=referral&utm_content=cabaletta/baritone&utm_campaign=Badge_Grade)
-
-Unofficial Jenkins: [![Build Status](https://plutiejenkins.leijurv.com/job/baritone/badge/icon)](https://plutiejenkins.leijurv.com/job/baritone/lastSuccessfulBuild/)
-
-A Minecraft pathfinder bot. This project is an updated version of [MineBot](https://github.com/leijurv/MineBot/),
-the original version of the bot for Minecraft 1.8, rebuilt for 1.12.2. Baritone focuses on reliability and particularly performance (it's over [29x faster](https://github.com/cabaletta/baritone/pull/180#issuecomment-423822928) than MineBot at calculating paths).
-
-Here are some links to help to get started:
-
-- [Features](FEATURES.md)
-
-- [Baritone + Impact](IMPACT.md)
-
-There's also some useful information down below
-
-# Setup
-
-## IntelliJ's Gradle UI
-- Open the project in IntelliJ as a Gradle project
-- Run the Gradle task `setupDecompWorkspace`
-- Run the Gradle task `genIntellijRuns`
-- Refresh the Gradle project (or just restart IntelliJ)
-- Select the "Minecraft Client" launch config and run
-
-## Command Line
-On Mac OSX and Linux, use `./gradlew` instead of `gradlew`.
-
-Running Baritone:
-
-```
-$ gradlew run
-```
-
-Setting up for IntelliJ:
-```
-$ gradlew setupDecompWorkspace
-$ gradlew --refresh-dependencies
-$ gradlew genIntellijRuns
-```
-
-# Chat control
-[Defined Here](src/main/java/baritone/utils/ExampleBaritoneControl.java)
-
-Quick start example: `thisway 1000` or `goal 70` to set the goal, `path` to actually start pathing. Also try `mine diamond_ore`. `cancel` to cancel.
-
-# API example
-
-```
-BaritoneAPI.getSettings().allowSprint.value = true;
-BaritoneAPI.getSettings().pathTimeoutMS.value = 2000L;
-
-BaritoneAPI.getPathingBehavior().setGoal(new GoalXZ(10000, 20000));
-BaritoneAPI.getPathingBehavior().path();
-```
-
-# FAQ
-
-## Can I use Baritone as a library in my hacked client?
-
-Sure! (As long as usage is in compliance with the LGPL 3 License)
-
-## How is it so fast?
-
-Magic. (Hours of [Leijurv](https://github.com/leijurv) enduring excruciating pain)
-
-## Why is it called Baritone?
-
-It's named for FitMC's deep sultry voice. 
+A Minecraft bot. This project is an updated version of [Minebot](https://github.com/leijurv/MineBot/),
+the original version of the bot for Minecraft 1.8, rebuilt for 1.12.2.

build.gradle

@@ -1,26 +1,22 @@
-import java.util.jar.JarEntry
-import java.util.jar.JarFile
-import java.util.jar.JarOutputStream
-
 /*
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
 group 'baritone'
-version '0.0.7'
+version '1.0'
 
 buildscript {
     repositories {
@@ -42,19 +38,14 @@ buildscript {
 }
 
 apply plugin: 'java'
-apply plugin: 'net.minecraftforge.gradle.tweaker-client'
-apply plugin: 'org.spongepowered.mixin'
 
 sourceCompatibility = targetCompatibility = '1.8'
 compileJava {
     sourceCompatibility = targetCompatibility = '1.8'
 }
 
-sourceSets {
-    launch {
-        compileClasspath += main.compileClasspath + main.runtimeClasspath + main.output
-    }
-}
+apply plugin: 'net.minecraftforge.gradle.tweaker-client'
+apply plugin: 'org.spongepowered.mixin'
 
 minecraft {
     version = '1.12.2'
@@ -74,7 +65,7 @@ repositories {
 }
 
 dependencies {
-    runtime launchCompile('org.spongepowered:mixin:0.7.11-SNAPSHOT') {
+    implementation ('org.spongepowered:mixin:0.7.11-SNAPSHOT') {
         // Mixin includes a lot of dependencies that are too up-to-date
         exclude module: 'launchwrapper'
         exclude module: 'guava'
@@ -84,44 +75,3 @@ dependencies {
     }
     testImplementation 'junit:junit:4.12'
 }
-
-mixin {
-    defaultObfuscationEnv notch
-    add sourceSets.launch, 'mixins.baritone.refmap.json'
-}
-
-jar {
-    from sourceSets.launch.output, sourceSets.api.output
-    preserveFileTimestamps = false
-    reproducibleFileOrder = true
-}
-
-build {
-    // while "jar" supports preserveFileTimestamps false
-    // reobfJar doesn't, it just sets all the last modified times to that instant where it runs the reobfuscator
-    // so we have to set all those last modified times back to zero
-    doLast {
-        File jarFile = new File("build/libs/baritone-" + version + ".jar")
-        JarFile jf = new JarFile(jarFile)
-        JarOutputStream jos = new JarOutputStream(new FileOutputStream(new File("temp.jar")))
-        jf.entries().unique { it.name }.sort { it.name }.each {
-            if (it.name != "META-INF/fml_cache_annotation.json" && it.name != "META-INF/fml_cache_class_versions.json") {
-                JarEntry clone = new JarEntry(it)
-                clone.time = 0
-                jos.putNextEntry(clone)
-                copy(jf.getInputStream(it), jos)
-            }
-        }
-        jos.finish()
-        jf.close()
-        file("temp.jar").renameTo(jarFile)
-    }
-}
-
-void copy(InputStream is, OutputStream os) {
-    byte[] buffer = new byte[1024]
-    int len = 0
-    while ((len = is.read(buffer)) != -1) {
-        os.write(buffer, 0, len)
-    }
-}

scripts/build.sh

@@ -1,26 +0,0 @@
-set -e # this makes the whole script fail immediately if any one of these commands fails
-./gradlew build
-export VERSION=$(cat build.gradle | grep "version '" | cut -d "'" -f 2-2)
-
-wget -nv https://downloads.sourceforge.net/project/proguard/proguard/6.0/proguard6.0.3.zip
-unzip proguard6.0.3.zip 2>&1 > /dev/null
-cd build/libs
-echo "-injars 'baritone-$VERSION.jar'" >> api.pro # insert current version
-cat ../../scripts/proguard.pro | grep -v "this is the rt jar" | grep -v "\-injars" >> api.pro # remove default rt jar and injar lines
-echo "-libraryjars '$(java -verbose 2>/dev/null | sed -ne '1 s/\[Opened \(.*\)\]/\1/p')'" >> api.pro # insert correct rt.jar location
-tail api.pro # debug, print out what the previous two commands generated
-cat api.pro | grep -v "\-keep class baritone.api" > standalone.pro # standalone doesn't keep baritone api
-
-#instead of downloading these jars from my dropbox in a zip, just assume gradle's already got them for us
-mkdir -p tempLibraries
-cat ../../scripts/proguard.pro | grep tempLibraries | grep .jar | cut -d "/" -f 2- | cut -d "'" -f -1 | xargs -n1 -I{} bash -c "find ~/.gradle -name {}" | tee /dev/stderr | xargs -n1 -I{} cp {} tempLibraries
-
-mkdir ../../dist
-java -jar ../../proguard6.0.3/lib/proguard.jar @api.pro
-mv Obfuscated/baritone-$VERSION.jar ../../dist/baritone-api-$VERSION.jar
-java -jar ../../proguard6.0.3/lib/proguard.jar @standalone.pro
-mv Obfuscated/baritone-$VERSION.jar ../../dist/baritone-standalone-$VERSION.jar
-mv baritone-$VERSION.jar ../../dist/baritone-unoptimized-$VERSION.jar
-cd ../../dist
-shasum * | tee checksums.txt
-cd ..

scripts/proguard.pro

@@ -1,369 +0,0 @@
--injars baritone-0.0.7.jar
--outjars Obfuscated
-
-
--keepattributes Signature
--keepattributes *Annotation*
-
--optimizationpasses 5
--verbose
-
--allowaccessmodification # anything not kept can be changed from public to private and inlined etc
--overloadaggressively
--dontusemixedcaseclassnames
-
-# instead of renaming to a, b, c, rename to baritone.a, baritone.b, baritone.c so as to not conflict with minecraft's obfd classes
--flattenpackagehierarchy
--repackageclasses 'baritone'
-
--keep class baritone.api.** { *; }
--keep class baritone.BaritoneProvider
-
-# setting names are reflected from field names, so keep field names
--keepclassmembers class baritone.api.Settings {
-    public <fields>;    
-}
-
-# need to keep mixin names
--keep class baritone.launch.** { *; }
-
-# copy all necessary libraries into tempLibraries to build
--libraryjars '/Library/Internet Plug-Ins/JavaAppletPlugin.plugin/Contents/Home/lib/rt.jar' # this is the rt jar
-
--libraryjars 'tempLibraries/minecraft-1.12.2.jar'
-
--libraryjars 'tempLibraries/authlib-1.5.25.jar'
--libraryjars 'tempLibraries/codecjorbis-20101023.jar'
--libraryjars 'tempLibraries/codecwav-20101023.jar'
--libraryjars 'tempLibraries/commons-codec-1.10.jar'
--libraryjars 'tempLibraries/commons-compress-1.8.1.jar'
--libraryjars 'tempLibraries/commons-io-2.5.jar'
--libraryjars 'tempLibraries/commons-lang3-3.5.jar'
--libraryjars 'tempLibraries/commons-logging-1.1.3.jar'
--libraryjars 'tempLibraries/fastutil-7.1.0.jar'
--libraryjars 'tempLibraries/gson-2.8.0.jar'
--libraryjars 'tempLibraries/guava-21.0.jar'
--libraryjars 'tempLibraries/httpclient-4.3.3.jar'
--libraryjars 'tempLibraries/httpcore-4.3.2.jar'
--libraryjars 'tempLibraries/icu4j-core-mojang-51.2.jar'
--libraryjars 'tempLibraries/java-objc-bridge-1.0.0.jar'
--libraryjars 'tempLibraries/jinput-2.0.5.jar'
--libraryjars 'tempLibraries/jna-4.4.0.jar'
--libraryjars 'tempLibraries/jopt-simple-5.0.3.jar'
--libraryjars 'tempLibraries/jsr305-3.0.1.jar'
--libraryjars 'tempLibraries/jutils-1.0.0.jar'
--libraryjars 'tempLibraries/libraryjavasound-20101123.jar'
--libraryjars 'tempLibraries/librarylwjglopenal-20100824.jar'
--libraryjars 'tempLibraries/log4j-api-2.8.1.jar'
--libraryjars 'tempLibraries/log4j-core-2.8.1.jar'
-
-# linux / travis
--libraryjars 'tempLibraries/lwjgl-2.9.4-nightly-20150209.jar'
--libraryjars 'tempLibraries/lwjgl_util-2.9.4-nightly-20150209.jar'
-
-# mac
-#-libraryjars 'tempLibraries/lwjgl_util-2.9.2-nightly-20140822.jar'
-#-libraryjars 'tempLibraries/lwjgl-2.9.2-nightly-20140822.jar'
-
--libraryjars 'tempLibraries/netty-all-4.1.9.Final.jar'
--libraryjars 'tempLibraries/oshi-core-1.1.jar'
--libraryjars 'tempLibraries/patchy-1.1.jar'
--libraryjars 'tempLibraries/platform-3.4.0.jar'
--libraryjars 'tempLibraries/realms-1.10.22.jar'
--libraryjars 'tempLibraries/soundsystem-20120107.jar'
--libraryjars 'tempLibraries/text2speech-1.10.3.jar'
-
--libraryjars 'tempLibraries/mixin-0.7.11-SNAPSHOT.jar'
--libraryjars 'tempLibraries/launchwrapper-1.11.jar' # TODO why does only 1.11.jar exist?
-
-
-
-
-# Keep - Applications. Keep all application classes, along with their 'main'
-# methods.
--keepclasseswithmembers public class * {
-    public static void main(java.lang.String[]);
-}
-
-# Also keep - Enumerations. Keep the special static methods that are required in
-# enumeration classes.
--keepclassmembers enum  * {
-    public static **[] values();
-    public static ** valueOf(java.lang.String);
-}
-
-# Also keep - Database drivers. Keep all implementations of java.sql.Driver.
--keep class * extends java.sql.Driver
-
-# Also keep - Swing UI L&F. Keep all extensions of javax.swing.plaf.ComponentUI,
-# along with the special 'createUI' method.
--keep class * extends javax.swing.plaf.ComponentUI {
-    public static javax.swing.plaf.ComponentUI createUI(javax.swing.JComponent);
-}
-
-# Keep names - Native method names. Keep all native class/method names.
--keepclasseswithmembers,includedescriptorclasses,allowshrinking class * {
-    native <methods>;
-}
-
-# Remove - System method calls. Remove all invocations of System
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.System {
-    public static long currentTimeMillis();
-    static java.lang.Class getCallerClass();
-    public static int identityHashCode(java.lang.Object);
-    public static java.lang.SecurityManager getSecurityManager();
-    public static java.util.Properties getProperties();
-    public static java.lang.String getProperty(java.lang.String);
-    public static java.lang.String getenv(java.lang.String);
-    public static java.lang.String mapLibraryName(java.lang.String);
-    public static java.lang.String getProperty(java.lang.String,java.lang.String);
-}
-
-# Remove - Math method calls. Remove all invocations of Math
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.Math {
-    public static double sin(double);
-    public static double cos(double);
-    public static double tan(double);
-    public static double asin(double);
-    public static double acos(double);
-    public static double atan(double);
-    public static double toRadians(double);
-    public static double toDegrees(double);
-    public static double exp(double);
-    public static double log(double);
-    public static double log10(double);
-    public static double sqrt(double);
-    public static double cbrt(double);
-    public static double IEEEremainder(double,double);
-    public static double ceil(double);
-    public static double floor(double);
-    public static double rint(double);
-    public static double atan2(double,double);
-    public static double pow(double,double);
-    public static int round(float);
-    public static long round(double);
-    public static double random();
-    public static int abs(int);
-    public static long abs(long);
-    public static float abs(float);
-    public static double abs(double);
-    public static int max(int,int);
-    public static long max(long,long);
-    public static float max(float,float);
-    public static double max(double,double);
-    public static int min(int,int);
-    public static long min(long,long);
-    public static float min(float,float);
-    public static double min(double,double);
-    public static double ulp(double);
-    public static float ulp(float);
-    public static double signum(double);
-    public static float signum(float);
-    public static double sinh(double);
-    public static double cosh(double);
-    public static double tanh(double);
-    public static double hypot(double,double);
-    public static double expm1(double);
-    public static double log1p(double);
-}
-
-# Remove - Number method calls. Remove all invocations of Number
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.* extends java.lang.Number {
-    public static java.lang.String toString(byte);
-    public static java.lang.Byte valueOf(byte);
-    public static byte parseByte(java.lang.String);
-    public static byte parseByte(java.lang.String,int);
-    public static java.lang.Byte valueOf(java.lang.String,int);
-    public static java.lang.Byte valueOf(java.lang.String);
-    public static java.lang.Byte decode(java.lang.String);
-    public int compareTo(java.lang.Byte);
-    public static java.lang.String toString(short);
-    public static short parseShort(java.lang.String);
-    public static short parseShort(java.lang.String,int);
-    public static java.lang.Short valueOf(java.lang.String,int);
-    public static java.lang.Short valueOf(java.lang.String);
-    public static java.lang.Short valueOf(short);
-    public static java.lang.Short decode(java.lang.String);
-    public static short reverseBytes(short);
-    public int compareTo(java.lang.Short);
-    public static java.lang.String toString(int,int);
-    public static java.lang.String toHexString(int);
-    public static java.lang.String toOctalString(int);
-    public static java.lang.String toBinaryString(int);
-    public static java.lang.String toString(int);
-    public static int parseInt(java.lang.String,int);
-    public static int parseInt(java.lang.String);
-    public static java.lang.Integer valueOf(java.lang.String,int);
-    public static java.lang.Integer valueOf(java.lang.String);
-    public static java.lang.Integer valueOf(int);
-    public static java.lang.Integer getInteger(java.lang.String);
-    public static java.lang.Integer getInteger(java.lang.String,int);
-    public static java.lang.Integer getInteger(java.lang.String,java.lang.Integer);
-    public static java.lang.Integer decode(java.lang.String);
-    public static int highestOneBit(int);
-    public static int lowestOneBit(int);
-    public static int numberOfLeadingZeros(int);
-    public static int numberOfTrailingZeros(int);
-    public static int bitCount(int);
-    public static int rotateLeft(int,int);
-    public static int rotateRight(int,int);
-    public static int reverse(int);
-    public static int signum(int);
-    public static int reverseBytes(int);
-    public int compareTo(java.lang.Integer);
-    public static java.lang.String toString(long,int);
-    public static java.lang.String toHexString(long);
-    public static java.lang.String toOctalString(long);
-    public static java.lang.String toBinaryString(long);
-    public static java.lang.String toString(long);
-    public static long parseLong(java.lang.String,int);
-    public static long parseLong(java.lang.String);
-    public static java.lang.Long valueOf(java.lang.String,int);
-    public static java.lang.Long valueOf(java.lang.String);
-    public static java.lang.Long valueOf(long);
-    public static java.lang.Long decode(java.lang.String);
-    public static java.lang.Long getLong(java.lang.String);
-    public static java.lang.Long getLong(java.lang.String,long);
-    public static java.lang.Long getLong(java.lang.String,java.lang.Long);
-    public static long highestOneBit(long);
-    public static long lowestOneBit(long);
-    public static int numberOfLeadingZeros(long);
-    public static int numberOfTrailingZeros(long);
-    public static int bitCount(long);
-    public static long rotateLeft(long,int);
-    public static long rotateRight(long,int);
-    public static long reverse(long);
-    public static int signum(long);
-    public static long reverseBytes(long);
-    public int compareTo(java.lang.Long);
-    public static java.lang.String toString(float);
-    public static java.lang.String toHexString(float);
-    public static java.lang.Float valueOf(java.lang.String);
-    public static java.lang.Float valueOf(float);
-    public static float parseFloat(java.lang.String);
-    public static boolean isNaN(float);
-    public static boolean isInfinite(float);
-    public static int floatToIntBits(float);
-    public static int floatToRawIntBits(float);
-    public static float intBitsToFloat(int);
-    public static int compare(float,float);
-    public boolean isNaN();
-    public boolean isInfinite();
-    public int compareTo(java.lang.Float);
-    public static java.lang.String toString(double);
-    public static java.lang.String toHexString(double);
-    public static java.lang.Double valueOf(java.lang.String);
-    public static java.lang.Double valueOf(double);
-    public static double parseDouble(java.lang.String);
-    public static boolean isNaN(double);
-    public static boolean isInfinite(double);
-    public static long doubleToLongBits(double);
-    public static long doubleToRawLongBits(double);
-    public static double longBitsToDouble(long);
-    public static int compare(double,double);
-    public boolean isNaN();
-    public boolean isInfinite();
-    public int compareTo(java.lang.Double);
-    public byte byteValue();
-    public short shortValue();
-    public int intValue();
-    public long longValue();
-    public float floatValue();
-    public double doubleValue();
-    public int compareTo(java.lang.Object);
-    public boolean equals(java.lang.Object);
-    public int hashCode();
-    public java.lang.String toString();
-}
-
-# Remove - String method calls. Remove all invocations of String
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.String {
-    public static java.lang.String copyValueOf(char[]);
-    public static java.lang.String copyValueOf(char[],int,int);
-    public static java.lang.String valueOf(boolean);
-    public static java.lang.String valueOf(char);
-    public static java.lang.String valueOf(char[]);
-    public static java.lang.String valueOf(char[],int,int);
-    public static java.lang.String valueOf(double);
-    public static java.lang.String valueOf(float);
-    public static java.lang.String valueOf(int);
-    public static java.lang.String valueOf(java.lang.Object);
-    public static java.lang.String valueOf(long);
-    public boolean contentEquals(java.lang.StringBuffer);
-    public boolean endsWith(java.lang.String);
-    public boolean equalsIgnoreCase(java.lang.String);
-    public boolean equals(java.lang.Object);
-    public boolean matches(java.lang.String);
-    public boolean regionMatches(boolean,int,java.lang.String,int,int);
-    public boolean regionMatches(int,java.lang.String,int,int);
-    public boolean startsWith(java.lang.String);
-    public boolean startsWith(java.lang.String,int);
-    public byte[] getBytes();
-    public byte[] getBytes(java.lang.String);
-    public char charAt(int);
-    public char[] toCharArray();
-    public int compareToIgnoreCase(java.lang.String);
-    public int compareTo(java.lang.Object);
-    public int compareTo(java.lang.String);
-    public int hashCode();
-    public int indexOf(int);
-    public int indexOf(int,int);
-    public int indexOf(java.lang.String);
-    public int indexOf(java.lang.String,int);
-    public int lastIndexOf(int);
-    public int lastIndexOf(int,int);
-    public int lastIndexOf(java.lang.String);
-    public int lastIndexOf(java.lang.String,int);
-    public int length();
-    public java.lang.CharSequence subSequence(int,int);
-    public java.lang.String concat(java.lang.String);
-    public java.lang.String replaceAll(java.lang.String,java.lang.String);
-    public java.lang.String replace(char,char);
-    public java.lang.String replaceFirst(java.lang.String,java.lang.String);
-    public java.lang.String[] split(java.lang.String);
-    public java.lang.String[] split(java.lang.String,int);
-    public java.lang.String substring(int);
-    public java.lang.String substring(int,int);
-    public java.lang.String toLowerCase();
-    public java.lang.String toLowerCase(java.util.Locale);
-    public java.lang.String toString();
-    public java.lang.String toUpperCase();
-    public java.lang.String toUpperCase(java.util.Locale);
-    public java.lang.String trim();
-}
-
-# Remove - StringBuffer method calls. Remove all invocations of StringBuffer
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.StringBuffer {
-    public java.lang.String toString();
-    public char charAt(int);
-    public int capacity();
-    public int codePointAt(int);
-    public int codePointBefore(int);
-    public int indexOf(java.lang.String,int);
-    public int lastIndexOf(java.lang.String);
-    public int lastIndexOf(java.lang.String,int);
-    public int length();
-    public java.lang.String substring(int);
-    public java.lang.String substring(int,int);
-}
-
-# Remove - StringBuilder method calls. Remove all invocations of StringBuilder
-# methods without side effects whose return values are not used.
--assumenosideeffects public class java.lang.StringBuilder {
-    public java.lang.String toString();
-    public char charAt(int);
-    public int capacity();
-    public int codePointAt(int);
-    public int codePointBefore(int);
-    public int indexOf(java.lang.String,int);
-    public int lastIndexOf(java.lang.String);
-    public int lastIndexOf(java.lang.String,int);
-    public int length();
-    public java.lang.String substring(int);
-    public java.lang.String substring(int,int);
-}

settings.gradle

@@ -2,16 +2,16 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 

src/api/java/baritone/api/BaritoneAPI.java

@@ -1,86 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api;
-
-import baritone.api.behavior.*;
-import baritone.api.cache.IWorldProvider;
-import baritone.api.cache.IWorldScanner;
-import baritone.api.event.listener.IGameEventListener;
-import baritone.api.utils.SettingsUtil;
-
-import java.util.Iterator;
-import java.util.ServiceLoader;
-
-/**
- * API exposure for various things implemented in Baritone.
- * <p>
- * W.I.P
- *
- * @author Brady
- * @since 9/23/2018
- */
-public final class BaritoneAPI {
-
-    private final static IBaritoneProvider baritone;
-    private final static Settings settings;
-
-    static {
-        ServiceLoader<IBaritoneProvider> baritoneLoader = ServiceLoader.load(IBaritoneProvider.class);
-        Iterator<IBaritoneProvider> instances = baritoneLoader.iterator();
-        baritone = instances.next();
-
-        settings = new Settings();
-        SettingsUtil.readAndApply(settings);
-    }
-
-    public static IFollowBehavior getFollowBehavior() {
-        return baritone.getFollowBehavior();
-    }
-
-    public static ILookBehavior getLookBehavior() {
-        return baritone.getLookBehavior();
-    }
-
-    public static IMemoryBehavior getMemoryBehavior() {
-        return baritone.getMemoryBehavior();
-    }
-
-    public static IMineBehavior getMineBehavior() {
-        return baritone.getMineBehavior();
-    }
-
-    public static IPathingBehavior getPathingBehavior() {
-        return baritone.getPathingBehavior();
-    }
-
-    public static Settings getSettings() {
-        return settings;
-    }
-
-    public static IWorldProvider getWorldProvider() {
-        return baritone.getWorldProvider();
-    }
-
-    public static IWorldScanner getWorldScanner() {
-        return baritone.getWorldScanner();
-    }
-
-    public static void registerEventListener(IGameEventListener listener) {
-        baritone.registerEventListener(listener);
-    }
-}

src/api/java/baritone/api/IBaritoneProvider.java

@@ -1,86 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api;
-
-import baritone.api.behavior.*;
-import baritone.api.cache.IWorldProvider;
-import baritone.api.cache.IWorldScanner;
-import baritone.api.event.listener.IGameEventListener;
-
-/**
- * @author Brady
- * @since 9/29/2018
- */
-public interface IBaritoneProvider {
-
-    /**
-     * @see IFollowBehavior
-     *
-     * @return The {@link IFollowBehavior} instance
-     */
-    IFollowBehavior getFollowBehavior();
-
-    /**
-     * @see ILookBehavior
-     *
-     * @return The {@link ILookBehavior} instance
-     */
-    ILookBehavior getLookBehavior();
-
-    /**
-     * @see IMemoryBehavior
-     *
-     * @return The {@link IMemoryBehavior} instance
-     */
-    IMemoryBehavior getMemoryBehavior();
-
-    /**
-     * @see IMineBehavior
-     *
-     * @return The {@link IMineBehavior} instance
-     */
-    IMineBehavior getMineBehavior();
-
-    /**
-     * @see IPathingBehavior
-     *
-     * @return The {@link IPathingBehavior} instance
-     */
-    IPathingBehavior getPathingBehavior();
-
-    /**
-     * @see IWorldProvider
-     *
-     * @return The {@link IWorldProvider} instance
-     */
-    IWorldProvider getWorldProvider();
-
-    /**
-     * @see IWorldScanner
-     *
-     * @return The {@link IWorldScanner} instance
-     */
-    IWorldScanner getWorldScanner();
-
-    /**
-     * Registers a {@link IGameEventListener} with Baritone's "event bus".
-     *
-     * @param listener The listener
-     */
-    void registerEventListener(IGameEventListener listener);
-}

src/api/java/baritone/api/Settings.java

@@ -1,571 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api;
-
-import net.minecraft.client.Minecraft;
-import net.minecraft.init.Blocks;
-import net.minecraft.item.Item;
-import net.minecraft.util.text.ITextComponent;
-
-import java.awt.*;
-import java.lang.reflect.Field;
-import java.util.*;
-import java.util.List;
-import java.util.function.Consumer;
-
-/**
- * Baritone's settings
- *
- * @author leijurv
- */
-public class Settings {
-
-    /**
-     * Allow Baritone to break blocks
-     */
-    public Setting<Boolean> allowBreak = new Setting<>(true);
-
-    /**
-     * Allow Baritone to sprint
-     */
-    public Setting<Boolean> allowSprint = new Setting<>(true);
-
-    /**
-     * Allow Baritone to place blocks
-     */
-    public Setting<Boolean> allowPlace = new Setting<>(true);
-
-    /**
-     * It doesn't actually take twenty ticks to place a block, this cost is so high
-     * because we want to generally conserve blocks which might be limited
-     */
-    public Setting<Double> blockPlacementPenalty = new Setting<>(20D);
-
-    /**
-     * This is just a tiebreaker to make it less likely to break blocks if it can avoid it.
-     * For example, fire has a break cost of 0, this makes it nonzero, so all else being equal
-     * it will take an otherwise equivalent route that doesn't require it to put out fire.
-     */
-    public Setting<Double> blockBreakAdditionalPenalty = new Setting<>(2D);
-
-    /**
-     * Allow Baritone to fall arbitrary distances and place a water bucket beneath it.
-     * Reliability: questionable.
-     */
-    public Setting<Boolean> allowWaterBucketFall = new Setting<>(true);
-
-    /**
-     * Allow Baritone to assume it can walk on still water just like any other block.
-     * This functionality is assumed to be provided by a separate library that might have imported Baritone.
-     */
-    public Setting<Boolean> assumeWalkOnWater = new Setting<>(false);
-
-    /**
-     * Assume step functionality; don't jump on an Ascend.
-     */
-    public Setting<Boolean> assumeStep = new Setting<>(false);
-
-    /**
-     * Assume safe walk functionality; don't sneak on a backplace traverse.
-     * <p>
-     * Warning: if you do something janky like sneak-backplace from an ender chest, if this is true
-     * it won't sneak right click, it'll just right click, which means it'll open the chest instead of placing
-     * against it. That's why this defaults to off.
-     */
-    public Setting<Boolean> assumeSafeWalk = new Setting<>(false);
-
-    /**
-     * Blocks that Baritone is allowed to place (as throwaway, for sneak bridging, pillaring, etc.)
-     */
-    public Setting<List<Item>> acceptableThrowawayItems = new Setting<>(new ArrayList<>(Arrays.asList(
-            Item.getItemFromBlock(Blocks.DIRT),
-            Item.getItemFromBlock(Blocks.COBBLESTONE),
-            Item.getItemFromBlock(Blocks.NETHERRACK)
-    )));
-
-    /**
-     * Enables some more advanced vine features. They're honestly just gimmicks and won't ever be needed in real
-     * pathing scenarios. And they can cause Baritone to get trapped indefinitely in a strange scenario.
-     */
-    public Setting<Boolean> allowVines = new Setting<>(false);
-
-    /**
-     * Slab behavior is complicated, disable this for higher path reliability. Leave enabled if you have bottom slabs
-     * everywhere in your base.
-     */
-    public Setting<Boolean> allowWalkOnBottomSlab = new Setting<>(true);
-
-    /**
-     * You know what it is
-     * <p>
-     * But it's very unreliable and falls off when cornering like all the time so.
-     */
-    public Setting<Boolean> allowParkour = new Setting<>(false);
-
-    /**
-     * Like parkour, but even more unreliable!
-     */
-    public Setting<Boolean> allowParkourPlace = new Setting<>(false);
-
-    /**
-     * For example, if you have Mining Fatigue or Haste, adjust the costs of breaking blocks accordingly.
-     */
-    public Setting<Boolean> considerPotionEffects = new Setting<>(true);
-
-    /**
-     * This is the big A* setting.
-     * As long as your cost heuristic is an *underestimate*, it's guaranteed to find you the best path.
-     * 3.5 is always an underestimate, even if you are sprinting.
-     * If you're walking only (with allowSprint off) 4.6 is safe.
-     * Any value below 3.5 is never worth it. It's just more computation to find the same path, guaranteed.
-     * (specifically, it needs to be strictly slightly less than ActionCosts.WALK_ONE_BLOCK_COST, which is about 3.56)
-     * <p>
-     * Setting it at 3.57 or above with sprinting, or to 4.64 or above without sprinting, will result in
-     * faster computation, at the cost of a suboptimal path. Any value above the walk / sprint cost will result
-     * in it going straight at its goal, and not investigating alternatives, because the combined cost / heuristic
-     * metric gets better and better with each block, instead of slightly worse.
-     * <p>
-     * Finding the optimal path is worth it, so it's the default.
-     */
-    public Setting<Double> costHeuristic = new Setting<>(3.5D);
-
-    // a bunch of obscure internal A* settings that you probably don't want to change
-    /**
-     * The maximum number of times it will fetch outside loaded or cached chunks before assuming that
-     * pathing has reached the end of the known area, and should therefore stop.
-     */
-    public Setting<Integer> pathingMaxChunkBorderFetch = new Setting<>(50);
-
-    /**
-     * Set to 1.0 to effectively disable this feature
-     *
-     * @see <a href="https://github.com/cabaletta/baritone/issues/18">Issue #18</a>
-     */
-    public Setting<Double> backtrackCostFavoringCoefficient = new Setting<>(0.1);
-
-    /**
-     * Don't repropagate cost improvements below 0.01 ticks. They're all just floating point inaccuracies,
-     * and there's no point.
-     */
-    public Setting<Boolean> minimumImprovementRepropagation = new Setting<>(true);
-
-    /**
-     * After calculating a path (potentially through cached chunks), artificially cut it off to just the part that is
-     * entirely within currently loaded chunks. Improves path safety because cached chunks are heavily simplified.
-     *
-     * @see <a href="https://github.com/cabaletta/baritone/issues/144">Issue #144</a>
-     */
-    public Setting<Boolean> cutoffAtLoadBoundary = new Setting<>(false);
-
-    /**
-     * If a movement's cost increases by more than this amount between calculation and execution (due to changes
-     * in the environment / world), cancel and recalculate
-     */
-    public Setting<Double> maxCostIncrease = new Setting<>(10D);
-
-    /**
-     * Stop 5 movements before anything that made the path COST_INF.
-     * For example, if lava has spread across the path, don't walk right up to it then recalculate, it might
-     * still be spreading lol
-     */
-    public Setting<Integer> costVerificationLookahead = new Setting<>(5);
-
-    /**
-     * Static cutoff factor. 0.9 means cut off the last 10% of all paths, regardless of chunk load state
-     */
-    public Setting<Double> pathCutoffFactor = new Setting<>(0.9);
-
-    /**
-     * Only apply static cutoff for paths of at least this length (in terms of number of movements)
-     */
-    public Setting<Integer> pathCutoffMinimumLength = new Setting<>(30);
-
-    /**
-     * Start planning the next path once the remaining movements tick estimates sum up to less than this value
-     */
-    public Setting<Integer> planningTickLookAhead = new Setting<>(150);
-
-    /**
-     * Default size of the Long2ObjectOpenHashMap used in pathing
-     */
-    public Setting<Integer> pathingMapDefaultSize = new Setting<>(1024);
-
-    /**
-     * Load factor coefficient for the Long2ObjectOpenHashMap used in pathing
-     * <p>
-     * Decrease for faster map operations, but higher memory usage
-     */
-    public Setting<Float> pathingMapLoadFactor = new Setting<>(0.75f);
-
-    /**
-     * How far are you allowed to fall onto solid ground (without a water bucket)?
-     * 3 won't deal any damage. But if you just want to get down the mountain quickly and you have
-     * Feather Falling IV, you might set it a bit higher, like 4 or 5.
-     */
-    public Setting<Integer> maxFallHeightNoWater = new Setting<>(3);
-
-    /**
-     * How far are you allowed to fall onto solid ground (with a water bucket)?
-     * It's not that reliable, so I've set it below what would kill an unarmored player (23)
-     */
-    public Setting<Integer> maxFallHeightBucket = new Setting<>(20);
-
-    /**
-     * Is it okay to sprint through a descend followed by a diagonal?
-     * The player overshoots the landing, but not enough to fall off. And the diagonal ensures that there isn't
-     * lava or anything that's !canWalkInto in that space, so it's technically safe, just a little sketchy.
-     */
-    public Setting<Boolean> allowOvershootDiagonalDescend = new Setting<>(true);
-
-    /**
-     * If your goal is a GoalBlock in an unloaded chunk, assume it's far enough away that the Y coord
-     * doesn't matter yet, and replace it with a GoalXZ to the same place before calculating a path.
-     * Once a segment ends within chunk load range of the GoalBlock, it will go back to normal behavior
-     * of considering the Y coord. The reasoning is that if your X and Z are 10,000 blocks away,
-     * your Y coordinate's accuracy doesn't matter at all until you get much much closer.
-     */
-    public Setting<Boolean> simplifyUnloadedYCoord = new Setting<>(true);
-
-    /**
-     * If a movement takes this many ticks more than its initial cost estimate, cancel it
-     */
-    public Setting<Integer> movementTimeoutTicks = new Setting<>(100);
-
-    /**
-     * Pathing can never take longer than this
-     */
-    public Setting<Long> pathTimeoutMS = new Setting<>(2000L);
-
-    /**
-     * Planning ahead while executing a segment can never take longer than this
-     */
-    public Setting<Long> planAheadTimeoutMS = new Setting<>(4000L);
-
-    /**
-     * For debugging, consider nodes much much slower
-     */
-    public Setting<Boolean> slowPath = new Setting<>(false);
-
-    /**
-     * Milliseconds between each node
-     */
-    public Setting<Long> slowPathTimeDelayMS = new Setting<>(100L);
-
-    /**
-     * The alternative timeout number when slowPath is on
-     */
-    public Setting<Long> slowPathTimeoutMS = new Setting<>(40000L);
-
-    /**
-     * The big one. Download all chunks in simplified 2-bit format and save them for better very-long-distance pathing.
-     */
-    public Setting<Boolean> chunkCaching = new Setting<>(true);
-
-    /**
-     * Print all the debug messages to chat
-     */
-    public Setting<Boolean> chatDebug = new Setting<>(true);
-
-    /**
-     * Allow chat based control of Baritone. Most likely should be disabled when Baritone is imported for use in
-     * something else
-     */
-    public Setting<Boolean> chatControl = new Setting<>(true);
-
-    /**
-     * A second override over chatControl to force it on
-     */
-    public Setting<Boolean> removePrefix = new Setting<>(false);
-
-    /**
-     * Render the path
-     */
-    public Setting<Boolean> renderPath = new Setting<>(true);
-
-    /**
-     * Render the goal
-     */
-    public Setting<Boolean> renderGoal = new Setting<>(true);
-
-    /**
-     * Ignore depth when rendering the goal
-     */
-    public Setting<Boolean> renderGoalIgnoreDepth = new Setting<>(false);
-
-    /**
-     * Line width of the path when rendered, in pixels
-     */
-    public Setting<Float> pathRenderLineWidthPixels = new Setting<>(5F);
-
-    /**
-     * Line width of the goal when rendered, in pixels
-     */
-    public Setting<Float> goalRenderLineWidthPixels = new Setting<>(3F);
-
-    /**
-     * Start fading out the path at 20 movements ahead, and stop rendering it entirely 30 movements ahead.
-     * Improves FPS.
-     */
-    public Setting<Boolean> fadePath = new Setting<>(false);
-
-    /**
-     * Move without having to force the client-sided rotations
-     */
-    public Setting<Boolean> freeLook = new Setting<>(true);
-
-    /**
-     * Will cause some minor behavioral differences to ensure that Baritone works on anticheats.
-     * <p>
-     * At the moment this will silently set the player's rotations when using freeLook so you're not sprinting in
-     * directions other than forward, which is picken up by more "advanced" anticheats like AAC, but not NCP.
-     */
-    public Setting<Boolean> antiCheatCompatibility = new Setting<>(true);
-
-    /**
-     * Exclusively use cached chunks for pathing
-     */
-    public Setting<Boolean> pathThroughCachedOnly = new Setting<>(false);
-
-    /**
-     * Whether or not to use the "#" command prefix
-     */
-    public Setting<Boolean> prefix = new Setting<>(false);
-
-    /**
-     * {@code true}: can mine blocks when in inventory, chat, or tabbed away in ESC menu
-     * <p>
-     * {@code false}: works on cosmic prisons
-     * <p>
-     * LOL
-     */
-    public Setting<Boolean> leftClickWorkaround = new Setting<>(true);
-
-    /**
-     * Don't stop walking forward when you need to break blocks in your way
-     */
-    public Setting<Boolean> walkWhileBreaking = new Setting<>(true);
-
-    /**
-     * Rescan for the goal once every 5 ticks.
-     * Set to 0 to disable.
-     */
-    public Setting<Integer> mineGoalUpdateInterval = new Setting<>(5);
-
-    /**
-     * Cancel the current path if the goal has changed, and the path originally ended in the goal but doesn't anymore.
-     * <p>
-     * Currently only runs when either MineBehavior or FollowBehavior is active.
-     * <p>
-     * For example, if Baritone is doing "mine iron_ore", the instant it breaks the ore (and it becomes air), that location
-     * is no longer a goal. This means that if this setting is true, it will stop there. If this setting were off, it would
-     * continue with its path, and walk into that location. The tradeoff is if this setting is true, it mines ores much faster
-     * since it doesn't waste any time getting into locations that no longer contain ores, but on the other hand, it misses
-     * some drops, and continues on without ever picking them up.
-     * <p>
-     * Also on cosmic prisons this should be set to true since you don't actually mine the ore it just gets replaced with stone.
-     */
-    public Setting<Boolean> cancelOnGoalInvalidation = new Setting<>(true);
-
-    /**
-     * The "axis" command (aka GoalAxis) will go to a axis, or diagonal axis, at this Y level.
-     */
-    public Setting<Integer> axisHeight = new Setting<>(120);
-
-    /**
-     * When mining block of a certain type, try to mine two at once instead of one.
-     * If the block above is also a goal block, set GoalBlock instead of GoalTwoBlocks
-     * If the block below is also a goal block, set GoalBlock to the position one down instead of GoalTwoBlocks
-     */
-    public Setting<Boolean> forceInternalMining = new Setting<>(true);
-
-    /**
-     * Modification to the previous setting, only has effect if forceInternalMining is true
-     * If true, only apply the previous setting if the block adjacent to the goal isn't air.
-     */
-    public Setting<Boolean> internalMiningAirException = new Setting<>(true);
-
-    /**
-     * The actual GoalNear is set this distance away from the entity you're following
-     * <p>
-     * For example, set followOffsetDistance to 5 and followRadius to 0 to always stay precisely 5 blocks north of your follow target.
-     */
-    public Setting<Double> followOffsetDistance = new Setting<>(0D);
-
-    /**
-     * The actual GoalNear is set in this direction from the entity you're following
-     */
-    public Setting<Float> followOffsetDirection = new Setting<>(0F);
-
-    /**
-     * The radius (for the GoalNear) of how close to your target position you actually have to be
-     */
-    public Setting<Integer> followRadius = new Setting<>(3);
-
-    /**
-     * Cached chunks (regardless of if they're in RAM or saved to disk) expire and are deleted after this number of seconds
-     * -1 to disable
-     * <p>
-     * I would highly suggest leaving this setting disabled (-1).
-     * <p>
-     * The only valid reason I can think of enable this setting is if you are extremely low on disk space and you play on multiplayer,
-     * and can't take (average) 300kb saved for every 512x512 area. (note that more complicated terrain is less compressible and will take more space)
-     * <p>
-     * However, simply discarding old chunks because they are old is inadvisable. Baritone is extremely good at correcting
-     * itself and its paths as it learns new information, as new chunks load. There is no scenario in which having an
-     * incorrect cache can cause Baritone to get stuck, take damage, or perform any action it wouldn't otherwise, everything
-     * is rechecked once the real chunk is in range.
-     * <p>
-     * Having a robust cache greatly improves long distance pathfinding, as it's able to go around large scale obstacles
-     * before they're in render distance. In fact, when the chunkCaching setting is disabled and Baritone starts anew
-     * every time, or when you enter a completely new and very complicated area, it backtracks far more often because it
-     * has to build up that cache from scratch. But after it's gone through an area just once, the next time will have zero
-     * backtracking, since the entire area is now known and cached.
-     */
-    public Setting<Long> cachedChunksExpirySeconds = new Setting<>(-1L);
-
-    /**
-     * The function that is called when Baritone will log to chat. This function can be added to
-     * via {@link Consumer#andThen(Consumer)} or it can completely be overriden via setting
-     * {@link Setting#value};
-     */
-    public Setting<Consumer<ITextComponent>> logger = new Setting<>(Minecraft.getMinecraft().ingameGUI.getChatGUI()::printChatMessage);
-
-    /**
-     * The color of the current path
-     */
-    public Setting<Color> colorCurrentPath = new Setting<>(Color.RED);
-
-    /**
-     * The color of the next path
-     */
-    public Setting<Color> colorNextPath = new Setting<>(Color.MAGENTA);
-
-    /**
-     * The color of the blocks to break
-     */
-    public Setting<Color> colorBlocksToBreak = new Setting<>(Color.RED);
-
-    /**
-     * The color of the blocks to place
-     */
-    public Setting<Color> colorBlocksToPlace = new Setting<>(Color.GREEN);
-
-    /**
-     * The color of the blocks to walk into
-     */
-    public Setting<Color> colorBlocksToWalkInto = new Setting<>(Color.MAGENTA);
-
-    /**
-     * The color of the best path so far
-     */
-    public Setting<Color> colorBestPathSoFar = new Setting<>(Color.BLUE);
-
-    /**
-     * The color of the path to the most recent considered node
-     */
-    public Setting<Color> colorMostRecentConsidered = new Setting<>(Color.CYAN);
-
-    /**
-     * The color of the goal box
-     */
-    public Setting<Color> colorGoalBox = new Setting<>(Color.GREEN);
-
-    /**
-     * A map of lowercase setting field names to their respective setting
-     */
-    public final Map<String, Setting<?>> byLowerName;
-
-    /**
-     * A list of all settings
-     */
-    public final List<Setting<?>> allSettings;
-
-    public class Setting<T> {
-        public T value;
-        public final T defaultValue;
-        private String name;
-        private final Class<T> klass;
-
-        @SuppressWarnings("unchecked")
-        private Setting(T value) {
-            if (value == null) {
-                throw new IllegalArgumentException("Cannot determine value type class from null");
-            }
-            this.value = value;
-            this.defaultValue = value;
-            this.klass = (Class<T>) value.getClass();
-        }
-
-        @SuppressWarnings("unchecked")
-        public final <K extends T> K get() {
-            return (K) value;
-        }
-
-        public final String getName() {
-            return name;
-        }
-
-        public Class<T> getValueClass() {
-            return klass;
-        }
-
-        public String toString() {
-            return name + ": " + value;
-        }
-    }
-
-    // here be dragons
-
-    {
-        Field[] temp = getClass().getFields();
-        HashMap<String, Setting<?>> tmpByName = new HashMap<>();
-        List<Setting<?>> tmpAll = new ArrayList<>();
-        try {
-            for (Field field : temp) {
-                if (field.getType().equals(Setting.class)) {
-                    Setting<?> setting = (Setting<?>) field.get(this);
-                    String name = field.getName();
-                    setting.name = name;
-                    name = name.toLowerCase();
-                    if (tmpByName.containsKey(name)) {
-                        throw new IllegalStateException("Duplicate setting name");
-                    }
-                    tmpByName.put(name, setting);
-                    tmpAll.add(setting);
-                }
-            }
-        } catch (IllegalAccessException e) {
-            throw new IllegalStateException(e);
-        }
-        byLowerName = Collections.unmodifiableMap(tmpByName);
-        allSettings = Collections.unmodifiableList(tmpAll);
-    }
-
-    @SuppressWarnings("unchecked")
-    public <T> List<Setting<T>> getAllValuesByType(Class<T> klass) {
-        List<Setting<T>> result = new ArrayList<>();
-        for (Setting<?> setting : allSettings) {
-            if (setting.getValueClass().equals(klass)) {
-                result.add((Setting<T>) setting);
-            }
-        }
-        return result;
-    }
-
-    Settings() { }
-}

src/api/java/baritone/api/behavior/IBehavior.java

@@ -1,27 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import baritone.api.event.listener.AbstractGameEventListener;
-import baritone.api.utils.interfaces.Toggleable;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IBehavior extends AbstractGameEventListener, Toggleable {}

src/api/java/baritone/api/behavior/IFollowBehavior.java

@@ -1,44 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import net.minecraft.entity.Entity;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IFollowBehavior extends IBehavior {
-
-    /**
-     * Set the follow target to the specified entity;
-     *
-     * @param entity The entity to follow
-     */
-    void follow(Entity entity);
-
-    /**
-     * @return The entity that is currently being followed
-     */
-    Entity following();
-
-    /**
-     * Cancels the follow behavior, this will clear the current follow target.
-     */
-    void cancel();
-}

src/api/java/baritone/api/behavior/ILookBehavior.java

@@ -1,39 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import baritone.api.utils.Rotation;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface ILookBehavior extends IBehavior {
-
-    /**
-     * Updates the current {@link ILookBehavior} target to target
-     * the specified rotations on the next tick. If force is {@code true},
-     * then freeLook will be overriden and angles will be set regardless.
-     * If any sort of block interaction is required, force should be {@code true},
-     * otherwise, it should be {@code false};
-     *
-     * @param rotation The target rotations
-     * @param force Whether or not to "force" the rotations
-     */
-    void updateTarget(Rotation rotation, boolean force);
-}

src/api/java/baritone/api/behavior/IMemoryBehavior.java

@@ -1,45 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import baritone.api.behavior.memory.IRememberedInventory;
-import net.minecraft.util.math.BlockPos;
-
-import java.util.Map;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IMemoryBehavior extends IBehavior {
-
-    /**
-     * Gets a remembered inventory by its block position.
-     *
-     * @param pos The position of the container block
-     * @return The remembered inventory
-     */
-    IRememberedInventory getInventoryByPos(BlockPos pos);
-
-    /**
-     * Gets the map of all block positions to their remembered inventories.
-     *
-     * @return Map of block positions to their respective remembered inventories
-     */
-    Map<BlockPos, IRememberedInventory> getRememberedInventories();
-}

src/api/java/baritone/api/behavior/IMineBehavior.java

@@ -1,70 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import net.minecraft.block.Block;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IMineBehavior extends IBehavior {
-
-    /**
-     * Begin to search for and mine the specified blocks until
-     * the number of specified items to get from the blocks that
-     * are mined. This is based on the first target block to mine.
-     *
-     * @param quantity The number of items to get from blocks mined
-     * @param blocks The blocks to mine
-     */
-    void mine(int quantity, String... blocks);
-
-    /**
-     * Begin to search for and mine the specified blocks until
-     * the number of specified items to get from the blocks that
-     * are mined. This is based on the first target block to mine.
-     *
-     * @param quantity The number of items to get from blocks mined
-     * @param blocks The blocks to mine
-     */
-    void mine(int quantity, Block... blocks);
-
-    /**
-     * Begin to search for and mine the specified blocks.
-     *
-     * @param blocks The blocks to mine
-     */
-    default void mine(String... blocks) {
-        this.mine(0, blocks);
-    }
-
-    /**
-     * Begin to search for and mine the specified blocks.
-     *
-     * @param blocks The blocks to mine
-     */
-    default void mine(Block... blocks) {
-        this.mine(0, blocks);
-    }
-
-    /**
-     * Cancels the current mining task
-     */
-    void cancel();
-}

src/api/java/baritone/api/behavior/IPathingBehavior.java

@@ -1,68 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior;
-
-import baritone.api.pathing.goals.Goal;
-
-import java.util.Optional;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IPathingBehavior extends IBehavior {
-
-    /**
-     * Returns the estimated remaining ticks in the current pathing
-     * segment. Given that the return type is an optional, {@link Optional#empty()}
-     * will be returned in the case that there is no current segment being pathed.
-     *
-     * @return The estimated remaining ticks in the current segment.
-     */
-    Optional<Double> ticksRemainingInSegment();
-
-    /**
-     * Sets the pathing goal.
-     *
-     * @param goal The pathing goal
-     */
-    void setGoal(Goal goal);
-
-    /**
-     * @return The current pathing goal
-     */
-    Goal getGoal();
-
-    /**
-     * Begins pathing. Calculation will start in a new thread, and once completed,
-     * movement will commence. Returns whether or not the operation was successful.
-     *
-     * @return Whether or not the operation was successful
-     */
-    boolean path();
-
-    /**
-     * @return Whether or not a path is currently being executed.
-     */
-    boolean isPathing();
-
-    /**
-     * Cancels the pathing behavior or the current path calculation.
-     */
-    void cancel();
-}

src/api/java/baritone/api/behavior/memory/IRememberedInventory.java

@@ -1,39 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.behavior.memory;
-
-import net.minecraft.item.ItemStack;
-
-import java.util.List;
-
-/**
- * @author Brady
- * @since 9/23/2018
- */
-public interface IRememberedInventory {
-
-    /**
-     * @return The contents of this inventory
-     */
-    List<ItemStack> getContents();
-
-    /**
-     * @return The number of slots in this inventory
-     */
-    int getSize();
-}

src/api/java/baritone/api/cache/ICachedRegion.java

@@ -1,49 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-/**
- * @author Brady
- * @since 9/24/2018
- */
-public interface ICachedRegion extends IBlockTypeAccess {
-
-    /**
-     * Returns whether or not the block at the specified X and Z coordinates
-     * is cached in this world. Similar to {@link ICachedWorld#isCached(int, int)},
-     * however, the block coordinates should in on a scale from 0 to 511 (inclusive)
-     * because region sizes are 512x512 blocks.
-     *
-     * @see ICachedWorld#isCached(int, int)
-     *
-     * @param blockX The block X coordinate
-     * @param blockZ The block Z coordinate
-     * @return Whether or not the specified XZ location is cached
-     */
-    boolean isCached(int blockX, int blockZ);
-
-    /**
-     * The X coordinate of this region
-     */
-    int getX();
-
-    /**
-     * The Z coordinate of this region
-     */
-    int getZ();
-}

src/api/java/baritone/api/cache/ICachedWorld.java

@@ -1,82 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-import net.minecraft.util.math.BlockPos;
-import net.minecraft.world.chunk.Chunk;
-
-import java.util.LinkedList;
-
-/**
- * @author Brady
- * @since 9/24/2018
- */
-public interface ICachedWorld {
-
-    /**
-     * Returns the region at the specified region coordinates
-     *
-     * @param regionX The region X coordinate
-     * @param regionZ The region Z coordinate
-     * @return The region located at the specified coordinates
-     */
-    ICachedRegion getRegion(int regionX, int regionZ);
-
-    /**
-     * Queues the specified chunk for packing. This entails reading the contents
-     * of the chunk, then packing the data into the 2-bit format, and storing that
-     * in this cached world.
-     *
-     * @param chunk The chunk to pack and store
-     */
-    void queueForPacking(Chunk chunk);
-
-    /**
-     * Returns whether or not the block at the specified X and Z coordinates
-     * is cached in this world.
-     *
-     * @param blockX The block X coordinate
-     * @param blockZ The block Z coordinate
-     * @return Whether or not the specified XZ location is cached
-     */
-    boolean isCached(int blockX, int blockZ);
-
-    /**
-     * Scans the cached chunks for location of the specified special block. The
-     * information that is returned by this method may not be up to date, because
-     * older cached chunks can contain data that is much more likely to have changed.
-     *
-     * @param block The special block to search for
-     * @param maximum The maximum number of position results to receive
-     * @param maxRegionDistanceSq The maximum region distance, squared
-     * @return The locations found that match the special block
-     */
-    LinkedList<BlockPos> getLocationsOf(String block, int maximum, int maxRegionDistanceSq);
-
-    /**
-     * Reloads all of the cached regions in this world from disk. Anything that is not saved
-     * will be lost. This operation does not execute in a new thread by default.
-     */
-    void reloadAllFromDisk();
-
-    /**
-     * Saves all of the cached regions in this world to disk. This operation does not execute
-     * in a new thread by default.
-     */
-    void save();
-}

src/api/java/baritone/api/cache/IWaypoint.java

@@ -1,111 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-import net.minecraft.util.math.BlockPos;
-import org.apache.commons.lang3.ArrayUtils;
-
-import java.util.Arrays;
-import java.util.Collections;
-import java.util.List;
-
-/**
- * A marker for a position in the world.
- *
- * @author Brady
- * @since 9/24/2018
- */
-public interface IWaypoint {
-
-    /**
-     * @return The label for this waypoint
-     */
-    String getName();
-
-    /**
-     * Returns the tag for this waypoint. The tag is a category
-     * for the waypoint in a sense, it describes the source of
-     * the waypoint.
-     *
-     * @return The waypoint tag
-     */
-    Tag getTag();
-
-    /**
-     * Returns the unix epoch time in milliseconds that this waypoint
-     * was created. This value should only be set once, when the waypoint
-     * is initially created, and not when it is being loaded from file.
-     *
-     * @return The unix epoch milliseconds that this waypoint was created
-     */
-    long getCreationTimestamp();
-
-    /**
-     * Returns the actual block position of this waypoint.
-     *
-     * @return The block position of this waypoint
-     */
-    BlockPos getLocation();
-
-    enum Tag {
-
-        /**
-         * Tag indicating a position explictly marked as a home base
-         */
-        HOME("home", "base"),
-
-        /**
-         * Tag indicating a position that the local player has died at
-         */
-        DEATH("death"),
-
-        /**
-         * Tag indicating a bed position
-         */
-        BED("bed", "spawn"),
-
-        /**
-         * Tag indicating that the waypoint was user-created
-         */
-        USER("user");
-
-        /**
-         * A list of all of the
-         */
-        private static final List<Tag> TAG_LIST = Collections.unmodifiableList(Arrays.asList(Tag.values()));
-
-        /**
-         * The names for the tag, anything that the tag can be referred to as.
-         */
-        private final String[] names;
-
-        Tag(String... names) {
-            this.names = names;
-        }
-
-        /**
-         * Finds a tag from one of the names that could be used to identify said tag.
-         *
-         * @param name The name of the tag
-         * @return The tag, if one is found, otherwise, {@code null}
-         */
-        public static Tag fromString(String name) {
-            return TAG_LIST.stream().filter(tag -> ArrayUtils.contains(tag.names, name.toLowerCase())).findFirst().orElse(null);
-        }
-    }
-}

src/api/java/baritone/api/cache/IWaypointCollection.java

@@ -1,68 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-import java.util.Set;
-
-/**
- * @author Brady
- * @since 9/24/2018
- */
-public interface IWaypointCollection {
-
-    /**
-     * Adds a waypoint to this collection
-     *
-     * @param waypoint The waypoint
-     */
-    void addWaypoint(IWaypoint waypoint);
-
-    /**
-     * Removes a waypoint from this collection
-     *
-     * @param waypoint The waypoint
-     */
-    void removeWaypoint(IWaypoint waypoint);
-
-    /**
-     * Gets the most recently created waypoint by the specified {@link IWaypoint.Tag}
-     *
-     * @param tag The tag
-     * @return The most recently created waypoint with the specified tag
-     */
-    IWaypoint getMostRecentByTag(IWaypoint.Tag tag);
-
-    /**
-     * Gets all of the waypoints that have the specified tag
-     *
-     * @see IWaypointCollection#getAllWaypoints()
-     *
-     * @param tag The tag
-     * @return All of the waypoints with the specified tag
-     */
-    Set<IWaypoint> getByTag(IWaypoint.Tag tag);
-
-    /**
-     * Gets all of the waypoints in this collection, regardless of the tag.
-     *
-     * @see IWaypointCollection#getByTag(IWaypoint.Tag)
-     *
-     * @return All of the waypoints in this collection
-     */
-    Set<IWaypoint> getAllWaypoints();
-}

src/api/java/baritone/api/cache/IWorldData.java

@@ -1,39 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-/**
- * @author Brady
- * @since 9/24/2018
- */
-public interface IWorldData {
-
-    /**
-     * Returns the cached world for this world. A cached world is a simplified format
-     * of a regular world, intended for use on multiplayer servers where chunks are not
-     * traditionally stored to disk, allowing for long distance pathing with minimal disk usage.
-     */
-    ICachedWorld getCachedWorld();
-
-    /**
-     * Returns the waypoint collection for this world.
-     *
-     * @return The waypoint collection for this world
-     */
-    IWaypointCollection getWaypoints();
-}

src/api/java/baritone/api/cache/IWorldScanner.java

@@ -1,42 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.cache;
-
-import net.minecraft.block.Block;
-import net.minecraft.util.math.BlockPos;
-
-import java.util.List;
-
-/**
- * @author Brady
- * @since 10/6/2018
- */
-public interface IWorldScanner {
-
-    /**
-     * Scans the world, up to the specified max chunk radius, for the specified blocks.
-     *
-     * @param blocks          The blocks to scan for
-     * @param max             The maximum number of blocks to scan before cutoff
-     * @param yLevelThreshold If a block is found within this Y level, the current result will be
-     *                        returned, if the value is negative, then this condition doesn't apply.
-     * @param maxSearchRadius The maximum chunk search radius
-     * @return The matching block positions
-     */
-    List<BlockPos> scanLoadedChunks(List<Block> blocks, int max, int yLevelThreshold, int maxSearchRadius);
-}

src/api/java/baritone/api/event/events/BlockInteractEvent.java

@@ -1,69 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.event.events;
-
-import net.minecraft.util.math.BlockPos;
-
-/**
- * @author Brady
- * @since 8/22/2018
- */
-public final class BlockInteractEvent {
-
-    /**
-     * The position of the block interacted with
-     */
-    private final BlockPos pos;
-
-    /**
-     * The type of interaction that occurred
-     */
-    private final Type type;
-
-    public BlockInteractEvent(BlockPos pos, Type type) {
-        this.pos = pos;
-        this.type = type;
-    }
-
-    /**
-     * @return The position of the block interacted with
-     */
-    public final BlockPos getPos() {
-        return this.pos;
-    }
-
-    /**
-     * @return The type of interaction with the target block
-     */
-    public final Type getType() {
-        return this.type;
-    }
-
-    public enum Type {
-
-        /**
-         * We're breaking the target block.
-         */
-        BREAK,
-
-        /**
-         * We're right clicking on the target block. Either placing or interacting with.
-         */
-        USE
-    }
-}

src/api/java/baritone/api/event/events/PathEvent.java

@@ -1,33 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.event.events;
-
-public enum PathEvent {
-    CALC_STARTED,
-    CALC_FINISHED_NOW_EXECUTING,
-    CALC_FAILED,
-    NEXT_SEGMENT_CALC_STARTED,
-    NEXT_SEGMENT_CALC_FINISHED,
-    CONTINUING_ONTO_PLANNED_NEXT,
-    SPLICING_ONTO_NEXT_EARLY,
-    AT_GOAL,
-    PATH_FINISHED_NEXT_STILL_CALCULATING,
-    NEXT_CALC_FAILED,
-    DISCARD_NEXT,
-    CANCELED;
-}

src/api/java/baritone/api/event/events/PlayerUpdateEvent.java

@@ -1,43 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.event.events;
-
-import baritone.api.event.events.type.EventState;
-
-/**
- * @author Brady
- * @since 8/21/2018
- */
-public final class PlayerUpdateEvent {
-
-    /**
-     * The state of the event
-     */
-    private final EventState state;
-
-    public PlayerUpdateEvent(EventState state) {
-        this.state = state;
-    }
-
-    /**
-     * @return The state of the event
-     */
-    public final EventState getState() {
-        return this.state;
-    }
-}

src/api/java/baritone/api/event/events/RotationMoveEvent.java

@@ -1,75 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.event.events;
-
-import baritone.api.event.events.type.EventState;
-import net.minecraft.entity.Entity;
-import net.minecraft.entity.EntityLivingBase;
-
-/**
- * @author Brady
- * @since 8/21/2018
- */
-public final class RotationMoveEvent {
-
-    /**
-     * The type of event
-     */
-    private final Type type;
-
-    /**
-     * The state of the event
-     */
-    private final EventState state;
-
-    public RotationMoveEvent(EventState state, Type type) {
-        this.state = state;
-        this.type = type;
-    }
-
-    /**
-     * @return The state of the event
-     */
-    public final EventState getState() {
-        return this.state;
-    }
-
-    /**
-     * @return The type of the event
-     */
-    public final Type getType() {
-        return this.type;
-    }
-
-    public enum Type {
-
-        /**
-         * Called when the player's motion is updated.
-         *
-         * @see Entity#moveRelative(float, float, float, float)
-         */
-        MOTION_UPDATE,
-
-        /**
-         * Called when the player jumps.
-         *
-         * @see EntityLivingBase#jump
-         */
-        JUMP
-    }
-}

src/api/java/baritone/api/pathing/goals/GoalAxis.java

@@ -1,49 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.pathing.goals;
-
-import baritone.api.BaritoneAPI;
-
-public class GoalAxis implements Goal {
-
-    private static final double SQRT_2_OVER_2 = Math.sqrt(2) / 2;
-
-    @Override
-    public boolean isInGoal(int x, int y, int z) {
-        return y == BaritoneAPI.getSettings().axisHeight.get() && (x == 0 || z == 0 || Math.abs(x) == Math.abs(z));
-    }
-
-    @Override
-    public double heuristic(int x0, int y, int z0) {
-        int x = Math.abs(x0);
-        int z = Math.abs(z0);
-
-        int shrt = Math.min(x, z);
-        int lng = Math.max(x, z);
-        int diff = lng - shrt;
-
-        double flatAxisDistance = Math.min(x, Math.min(z, diff * SQRT_2_OVER_2));
-
-        return flatAxisDistance * BaritoneAPI.getSettings().costHeuristic.get() + GoalYLevel.calculate(BaritoneAPI.getSettings().axisHeight.get(), y);
-    }
-
-    @Override
-    public String toString() {
-        return "GoalAxis";
-    }
-}

src/api/java/baritone/api/pathing/goals/GoalBlock.java

@@ -1,92 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.pathing.goals;
-
-import baritone.api.utils.interfaces.IGoalRenderPos;
-import net.minecraft.util.math.BlockPos;
-
-/**
- * A specific BlockPos goal
- *
- * @author leijurv
- */
-public class GoalBlock implements Goal, IGoalRenderPos {
-
-    /**
-     * The X block position of this goal
-     */
-    private final int x;
-
-    /**
-     * The Y block position of this goal
-     */
-    private final int y;
-
-    /**
-     * The Z block position of this goal
-     */
-    private final int z;
-
-    public GoalBlock(BlockPos pos) {
-        this(pos.getX(), pos.getY(), pos.getZ());
-    }
-
-    public GoalBlock(int x, int y, int z) {
-        this.x = x;
-        this.y = y;
-        this.z = z;
-    }
-
-    @Override
-    public boolean isInGoal(int x, int y, int z) {
-        return x == this.x && y == this.y && z == this.z;
-    }
-
-    @Override
-    public double heuristic(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
-        return calculate(xDiff, yDiff, zDiff);
-    }
-
-    @Override
-    public String toString() {
-        return "GoalBlock{x=" + x + ",y=" + y + ",z=" + z + "}";
-    }
-
-    /**
-     * @return The position of this goal as a {@link BlockPos}
-     */
-    @Override
-    public BlockPos getGoalPos() {
-        return new BlockPos(x, y, z);
-    }
-
-    public static double calculate(double xDiff, int yDiff, double zDiff) {
-        double heuristic = 0;
-
-        // if yDiff is 1 that means that pos.getY()-this.y==1 which means that we're 1 block below where we should be
-        // therefore going from 0,0,0 to a GoalYLevel of pos.getY()-this.y is accurate
-        heuristic += GoalYLevel.calculate(yDiff, 0);
-
-        //use the pythagorean and manhattan mixture from GoalXZ
-        heuristic += GoalXZ.calculate(xDiff, zDiff);
-        return heuristic;
-    }
-}

src/api/java/baritone/api/pathing/goals/GoalGetToBlock.java

@@ -1,69 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.pathing.goals;
-
-import baritone.api.utils.interfaces.IGoalRenderPos;
-import net.minecraft.util.math.BlockPos;
-
-
-/**
- * Don't get into the block, but get directly adjacent to it. Useful for chests.
- *
- * @author avecowa
- */
-public class GoalGetToBlock implements Goal, IGoalRenderPos {
-
-    private final int x;
-    private final int y;
-    private final int z;
-
-    public GoalGetToBlock(BlockPos pos) {
-        this.x = pos.getX();
-        this.y = pos.getY();
-        this.z = pos.getZ();
-    }
-
-    @Override
-    public BlockPos getGoalPos() {
-        return new BlockPos(x, y, z);
-    }
-
-    @Override
-    public boolean isInGoal(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
-        if (yDiff < 0) {
-            yDiff++;
-        }
-        return Math.abs(xDiff) + Math.abs(yDiff) + Math.abs(zDiff) <= 1;
-    }
-
-    @Override
-    public double heuristic(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
-        return GoalBlock.calculate(xDiff, yDiff, zDiff);
-    }
-
-    @Override
-    public String toString() {
-        return "GoalGetToBlock{x=" + x + ",y=" + y + ",z=" + z + "}";
-    }
-}

src/api/java/baritone/api/pathing/goals/GoalNear.java

@@ -1,66 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.pathing.goals;
-
-import baritone.api.utils.interfaces.IGoalRenderPos;
-import net.minecraft.util.math.BlockPos;
-
-public class GoalNear implements Goal, IGoalRenderPos {
-    private final int x;
-    private final int y;
-    private final int z;
-    private final int rangeSq;
-
-    public GoalNear(BlockPos pos, int range) {
-        this.x = pos.getX();
-        this.y = pos.getY();
-        this.z = pos.getZ();
-        this.rangeSq = range * range;
-    }
-
-    @Override
-    public boolean isInGoal(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
-        return xDiff * xDiff + yDiff * yDiff + zDiff * zDiff <= rangeSq;
-    }
-
-    @Override
-    public double heuristic(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
-        return GoalBlock.calculate(xDiff, yDiff, zDiff);
-    }
-
-    @Override
-    public BlockPos getGoalPos() {
-        return new BlockPos(x, y, z);
-    }
-
-    @Override
-    public String toString() {
-        return "GoalNear{" +
-                "x=" + x +
-                ", y=" + y +
-                ", z=" + z +
-                ", rangeSq=" + rangeSq +
-                '}';
-    }
-}

src/api/java/baritone/api/utils/Rotation.java

@@ -1,112 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.utils;
-
-/**
- * @author Brady
- * @since 9/25/2018
- */
-public class Rotation {
-
-    /**
-     * The yaw angle of this Rotation
-     */
-    private float yaw;
-
-    /**
-     * The pitch angle of this Rotation
-     */
-    private float pitch;
-
-    public Rotation(float yaw, float pitch) {
-        this.yaw = yaw;
-        this.pitch = pitch;
-    }
-
-    /**
-     * @return The yaw of this rotation
-     */
-    public float getYaw() {
-        return this.yaw;
-    }
-
-    /**
-     * @return The pitch of this rotation
-     */
-    public float getPitch() {
-        return this.pitch;
-    }
-
-    /**
-     * Adds the yaw/pitch of the specified rotations to this
-     * rotation's yaw/pitch, and returns the result.
-     *
-     * @param other Another rotation
-     * @return The result from adding the other rotation to this rotation
-     */
-    public Rotation add(Rotation other) {
-        return new Rotation(
-                this.yaw + other.yaw,
-                this.pitch + other.pitch
-        );
-    }
-
-    /**
-     * Subtracts the yaw/pitch of the specified rotations from this
-     * rotation's yaw/pitch, and returns the result.
-     *
-     * @param other Another rotation
-     * @return The result from subtracting the other rotation from this rotation
-     */
-    public Rotation subtract(Rotation other) {
-        return new Rotation(
-                this.yaw - other.yaw,
-                this.pitch - other.pitch
-        );
-    }
-
-    /**
-     * @return A copy of this rotation with the pitch clamped
-     */
-    public Rotation clamp() {
-        return new Rotation(
-                this.yaw,
-                RotationUtils.clampPitch(this.pitch)
-        );
-    }
-
-    /**
-     * @return A copy of this rotation with the yaw normalized
-     */
-    public Rotation normalize() {
-        return new Rotation(
-                RotationUtils.normalizeYaw(this.yaw),
-                this.pitch
-        );
-    }
-
-    /**
-     * @return A copy of this rotation with the pitch clamped and the yaw normalized
-     */
-    public Rotation normalizeAndClamp() {
-        return new Rotation(
-                RotationUtils.normalizeYaw(this.yaw),
-                RotationUtils.clampPitch(this.pitch)
-        );
-    }
-}

src/api/java/baritone/api/utils/RotationUtils.java

@@ -1,54 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.utils;
-
-/**
- * @author Brady
- * @since 9/25/2018
- */
-public final class RotationUtils {
-
-    private RotationUtils() {}
-
-    /**
-     * Clamps the specified pitch value between -90 and 90.
-     *
-     * @param pitch The input pitch
-     * @return The clamped pitch
-     */
-    public static float clampPitch(float pitch) {
-        return Math.max(-90, Math.min(90, pitch));
-    }
-
-    /**
-     * Normalizes the specified yaw value between -180 and 180.
-     *
-     * @param yaw The input yaw
-     * @return The normalized yaw
-     */
-    public static float normalizeYaw(float yaw) {
-        float newYaw = yaw % 360F;
-        if (newYaw < -180F) {
-            newYaw += 360F;
-        }
-        if (newYaw >= 180F) {
-            newYaw -= 360F;
-        }
-        return newYaw;
-    }
-}

src/api/java/baritone/api/utils/SettingsUtil.java

@@ -1,140 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.utils;
-
-import baritone.api.Settings;
-import net.minecraft.client.Minecraft;
-import net.minecraft.item.Item;
-import net.minecraft.util.ResourceLocation;
-
-import java.awt.*;
-import java.io.File;
-import java.io.FileOutputStream;
-import java.util.*;
-import java.util.function.Function;
-import java.util.stream.Collectors;
-import java.util.stream.Stream;
-
-public class SettingsUtil {
-    private static final File settingsFile = new File(new File(Minecraft.getMinecraft().gameDir, "baritone"), "settings.txt");
-
-    private static final Map<Class<?>, SettingsIO> map;
-
-    public static void readAndApply(Settings settings) {
-        try (Scanner scan = new Scanner(settingsFile)) {
-            while (scan.hasNextLine()) {
-                String line = scan.nextLine();
-                if (line.isEmpty()) {
-                    continue;
-                }
-                if (line.startsWith("#") || line.startsWith("//")) {
-                    continue;
-                }
-                int space = line.indexOf(" ");
-                if (space == -1) {
-                    System.out.println("Skipping invalid line with no space: " + line);
-                    continue;
-                }
-                String settingName = line.substring(0, space).trim().toLowerCase();
-                String settingValue = line.substring(space).trim();
-                try {
-                    parseAndApply(settings, settingName, settingValue);
-                } catch (Exception ex) {
-                    ex.printStackTrace();
-                    System.out.println("Unable to parse line " + line);
-                }
-            }
-        } catch (Exception ex) {
-            ex.printStackTrace();
-            System.out.println("Exception while reading Baritone settings, some settings may be reset to default values!");
-        }
-    }
-
-    public static synchronized void save(Settings settings) {
-        try (FileOutputStream out = new FileOutputStream(settingsFile)) {
-            for (Settings.Setting setting : settings.allSettings) {
-                if (setting.get() == null) {
-                    System.out.println("NULL SETTING?" + setting.getName());
-                    continue;
-                }
-                if (setting.getName().equals("logger")) {
-                    continue; // NO
-                }
-                if (setting.value == setting.defaultValue) {
-                    continue;
-                }
-                SettingsIO io = map.get(setting.getValueClass());
-                if (io == null) {
-                    throw new IllegalStateException("Missing " + setting.getValueClass() + " " + setting + " " + setting.getName());
-                }
-                out.write((setting.getName() + " " + io.toString.apply(setting.get()) + "\n").getBytes());
-            }
-        } catch (Exception ex) {
-            ex.printStackTrace();
-            System.out.println("Exception while saving Baritone settings!");
-        }
-    }
-
-    private static void parseAndApply(Settings settings, String settingName, String settingValue) throws IllegalStateException, NumberFormatException {
-        Settings.Setting setting = settings.byLowerName.get(settingName);
-        if (setting == null) {
-            throw new IllegalStateException("No setting by that name");
-        }
-        Class intendedType = setting.getValueClass();
-        SettingsIO ioMethod = map.get(intendedType);
-        Object parsed = ioMethod.parser.apply(settingValue);
-        if (!intendedType.isInstance(parsed)) {
-            throw new IllegalStateException(ioMethod + " parser returned incorrect type, expected " + intendedType + " got " + parsed + " which is " + parsed.getClass());
-        }
-        setting.value = parsed;
-    }
-
-    private enum SettingsIO {
-        DOUBLE(Double.class, Double::parseDouble),
-        BOOLEAN(Boolean.class, Boolean::parseBoolean),
-        INTEGER(Integer.class, Integer::parseInt),
-        FLOAT(Float.class, Float::parseFloat),
-        LONG(Long.class, Long::parseLong),
-
-        ITEM_LIST(ArrayList.class, str -> Stream.of(str.split(",")).map(Item::getByNameOrId).collect(Collectors.toCollection(ArrayList::new)), list -> ((ArrayList<Item>) list).stream().map(Item.REGISTRY::getNameForObject).map(ResourceLocation::toString).collect(Collectors.joining(","))),
-        COLOR(Color.class, str -> new Color(Integer.parseInt(str.split(",")[0]), Integer.parseInt(str.split(",")[1]), Integer.parseInt(str.split(",")[2])), color -> color.getRed() + "," + color.getGreen() + "," + color.getBlue());
-
-
-        Class<?> klass;
-        Function<String, Object> parser;
-        Function<Object, String> toString;
-
-        <T> SettingsIO(Class<T> klass, Function<String, T> parser) {
-            this(klass, parser, Object::toString);
-        }
-
-        <T> SettingsIO(Class<T> klass, Function<String, T> parser, Function<T, String> toString) {
-            this.klass = klass;
-            this.parser = parser::apply;
-            this.toString = x -> toString.apply((T) x);
-        }
-    }
-
-    static {
-        HashMap<Class<?>, SettingsIO> tempMap = new HashMap<>();
-        for (SettingsIO type : SettingsIO.values()) {
-            tempMap.put(type.klass, type);
-        }
-        map = Collections.unmodifiableMap(tempMap);
-    }
-}

src/api/java/baritone/api/utils/interfaces/IGoalRenderPos.java

@@ -1,24 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.utils.interfaces;
-
-import net.minecraft.util.math.BlockPos;
-
-public interface IGoalRenderPos {
-    BlockPos getGoalPos();
-}

src/api/java/baritone/api/utils/interfaces/Toggleable.java

@@ -1,54 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.api.utils.interfaces;
-
-/**
- * @author Brady
- * @since 8/20/2018
- */
-public interface Toggleable {
-
-    /**
-     * Toggles the enabled state of this {@link Toggleable}.
-     *
-     * @return The new state.
-     */
-    boolean toggle();
-
-    /**
-     * Sets the enabled state of this {@link Toggleable}.
-     *
-     * @return The new state.
-     */
-    boolean setEnabled(boolean enabled);
-
-    /**
-     * @return Whether or not this {@link Toggleable} object is enabled
-     */
-    boolean isEnabled();
-
-    /**
-     * Called when the state changes from disabled to enabled
-     */
-    default void onEnable() {}
-
-    /**
-     * Called when the state changes from enabled to disabled
-     */
-    default void onDisable() {}
-}

src/launch/java/baritone/launch/mixins/MixinAnvilChunkLoader.java

@@ -1,41 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.launch.mixins;
-
-import baritone.utils.accessor.IAnvilChunkLoader;
-import net.minecraft.world.chunk.storage.AnvilChunkLoader;
-import org.spongepowered.asm.mixin.Final;
-import org.spongepowered.asm.mixin.Mixin;
-import org.spongepowered.asm.mixin.Shadow;
-
-import java.io.File;
-
-/**
- * @author Brady
- * @since 9/4/2018
- */
-@Mixin(AnvilChunkLoader.class)
-public class MixinAnvilChunkLoader implements IAnvilChunkLoader {
-
-    @Shadow @Final private File chunkSaveLocation;
-
-    @Override
-    public File getChunkSaveLocation() {
-        return this.chunkSaveLocation;
-    }
-}

src/launch/java/baritone/launch/mixins/MixinBlockPos.java

@@ -1,43 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.launch.mixins;
-
-import com.google.common.base.MoreObjects;
-import net.minecraft.util.math.BlockPos;
-import net.minecraft.util.math.Vec3i;
-import org.spongepowered.asm.mixin.Mixin;
-
-import javax.annotation.Nonnull;
-
-/**
- * @author Brady
- * @since 8/25/2018
- */
-@Mixin(BlockPos.class)
-public class MixinBlockPos extends Vec3i {
-
-    public MixinBlockPos(int xIn, int yIn, int zIn) {
-        super(xIn, yIn, zIn);
-    }
-
-    @Override
-    @Nonnull
-    public String toString() {
-        return MoreObjects.toStringHelper("BlockPos").add("x", this.getX()).add("y", this.getY()).add("z", this.getZ()).toString();
-    }
-}

src/launch/java/baritone/launch/mixins/MixinChunkProviderServer.java

@@ -1,40 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.launch.mixins;
-
-import baritone.utils.accessor.IChunkProviderServer;
-import net.minecraft.world.chunk.storage.IChunkLoader;
-import net.minecraft.world.gen.ChunkProviderServer;
-import org.spongepowered.asm.mixin.Final;
-import org.spongepowered.asm.mixin.Mixin;
-import org.spongepowered.asm.mixin.Shadow;
-
-/**
- * @author Brady
- * @since 9/4/2018
- */
-@Mixin(ChunkProviderServer.class)
-public class MixinChunkProviderServer implements IChunkProviderServer {
-
-    @Shadow @Final private IChunkLoader chunkLoader;
-
-    @Override
-    public IChunkLoader getChunkLoader() {
-        return this.chunkLoader;
-    }
-}

src/launch/java/baritone/launch/mixins/MixinEntity.java

@@ -1,56 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.launch.mixins;
-
-import baritone.Baritone;
-import baritone.api.event.events.RotationMoveEvent;
-import baritone.api.event.events.type.EventState;
-import net.minecraft.client.Minecraft;
-import net.minecraft.entity.Entity;
-import org.spongepowered.asm.mixin.Mixin;
-import org.spongepowered.asm.mixin.injection.At;
-import org.spongepowered.asm.mixin.injection.Inject;
-import org.spongepowered.asm.mixin.injection.callback.CallbackInfo;
-
-/**
- * @author Brady
- * @since 8/21/2018
- */
-@Mixin(Entity.class)
-public class MixinEntity {
-
-    @Inject(
-            method = "moveRelative",
-            at = @At("HEAD")
-    )
-    private void preMoveRelative(float strafe, float up, float forward, float friction, CallbackInfo ci) {
-        Entity _this = (Entity) (Object) this;
-        if (_this == Minecraft.getMinecraft().player)
-            Baritone.INSTANCE.getGameEventHandler().onPlayerRotationMove(new RotationMoveEvent(EventState.PRE, RotationMoveEvent.Type.MOTION_UPDATE));
-    }
-
-    @Inject(
-            method = "moveRelative",
-            at = @At("RETURN")
-    )
-    private void postMoveRelative(float strafe, float up, float forward, float friction, CallbackInfo ci) {
-        Entity _this = (Entity) (Object) this;
-        if (_this == Minecraft.getMinecraft().player)
-            Baritone.INSTANCE.getGameEventHandler().onPlayerRotationMove(new RotationMoveEvent(EventState.POST, RotationMoveEvent.Type.MOTION_UPDATE));
-    }
-}

src/launch/java/baritone/launch/mixins/MixinEntityLivingBase.java

@@ -1,57 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.launch.mixins;
-
-import baritone.Baritone;
-import baritone.api.event.events.RotationMoveEvent;
-import baritone.api.event.events.type.EventState;
-import net.minecraft.client.Minecraft;
-import net.minecraft.entity.Entity;
-import net.minecraft.entity.EntityLivingBase;
-import org.spongepowered.asm.mixin.Mixin;
-import org.spongepowered.asm.mixin.injection.At;
-import org.spongepowered.asm.mixin.injection.Inject;
-import org.spongepowered.asm.mixin.injection.callback.CallbackInfo;
-
-/**
- * @author Brady
- * @since 9/10/2018
- */
-@Mixin(EntityLivingBase.class)
-public class MixinEntityLivingBase {
-
-    @Inject(
-            method = "jump",
-            at = @At("HEAD")
-    )
-    private void preJump(CallbackInfo ci) {
-        Entity _this = (Entity) (Object) this;
-        if (_this == Minecraft.getMinecraft().player)
-            Baritone.INSTANCE.getGameEventHandler().onPlayerRotationMove(new RotationMoveEvent(EventState.PRE, RotationMoveEvent.Type.JUMP));
-    }
-
-    @Inject(
-            method = "jump",
-            at = @At("RETURN")
-    )
-    private void postJump(CallbackInfo ci) {
-        Entity _this = (Entity) (Object) this;
-        if (_this == Minecraft.getMinecraft().player)
-            Baritone.INSTANCE.getGameEventHandler().onPlayerRotationMove(new RotationMoveEvent(EventState.POST, RotationMoveEvent.Type.JUMP));
-    }
-}

src/main/java/baritone/Baritone.java

@@ -1,149 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone;
-
-import baritone.api.BaritoneAPI;
-import baritone.api.Settings;
-import baritone.api.event.listener.IGameEventListener;
-import baritone.behavior.*;
-import baritone.event.GameEventHandler;
-import baritone.utils.BaritoneAutoTest;
-import baritone.utils.InputOverrideHandler;
-import net.minecraft.client.Minecraft;
-
-import java.io.File;
-import java.io.IOException;
-import java.nio.file.Files;
-import java.util.ArrayList;
-import java.util.List;
-import java.util.concurrent.Executor;
-import java.util.concurrent.SynchronousQueue;
-import java.util.concurrent.ThreadPoolExecutor;
-import java.util.concurrent.TimeUnit;
-
-/**
- * @author Brady
- * @since 7/31/2018 10:50 PM
- */
-public enum Baritone {
-
-    /**
-     * Singleton instance of this class
-     */
-    INSTANCE;
-
-    /**
-     * Whether or not {@link Baritone#init()} has been called yet
-     */
-    private boolean initialized;
-
-    private GameEventHandler gameEventHandler;
-    private InputOverrideHandler inputOverrideHandler;
-    private Settings settings;
-    private List<Behavior> behaviors;
-    private File dir;
-    private ThreadPoolExecutor threadPool;
-
-    /**
-     * Whether or not Baritone is active
-     */
-    private boolean active;
-
-    Baritone() {
-        this.gameEventHandler = new GameEventHandler();
-    }
-
-    public synchronized void init() {
-        if (initialized) {
-            return;
-        }
-        this.threadPool = new ThreadPoolExecutor(4, Integer.MAX_VALUE, 60L, TimeUnit.SECONDS, new SynchronousQueue<>());
-        this.inputOverrideHandler = new InputOverrideHandler();
-
-        // Acquire the "singleton" instance of the settings directly from the API
-        // We might want to change this...
-        this.settings = BaritoneAPI.getSettings();
-
-        this.behaviors = new ArrayList<>();
-        {
-            registerBehavior(PathingBehavior.INSTANCE);
-            registerBehavior(LookBehavior.INSTANCE);
-            registerBehavior(MemoryBehavior.INSTANCE);
-            registerBehavior(LocationTrackingBehavior.INSTANCE);
-            registerBehavior(FollowBehavior.INSTANCE);
-            registerBehavior(MineBehavior.INSTANCE);
-        }
-        if (BaritoneAutoTest.ENABLE_AUTO_TEST) {
-            registerEventListener(BaritoneAutoTest.INSTANCE);
-        }
-        this.dir = new File(Minecraft.getMinecraft().gameDir, "baritone");
-        if (!Files.exists(dir.toPath())) {
-            try {
-                Files.createDirectories(dir.toPath());
-            } catch (IOException ignored) {}
-        }
-
-        this.active = true;
-        this.initialized = true;
-    }
-
-    public boolean isInitialized() {
-        return this.initialized;
-    }
-
-    public IGameEventListener getGameEventHandler() {
-        return this.gameEventHandler;
-    }
-
-    public InputOverrideHandler getInputOverrideHandler() {
-        return this.inputOverrideHandler;
-    }
-
-    public List<Behavior> getBehaviors() {
-        return this.behaviors;
-    }
-
-    public Executor getExecutor() {
-        return threadPool;
-    }
-
-    public void registerBehavior(Behavior behavior) {
-        this.behaviors.add(behavior);
-        this.registerEventListener(behavior);
-    }
-
-    public void registerEventListener(IGameEventListener listener) {
-        this.gameEventHandler.registerEventListener(listener);
-    }
-
-    public boolean isActive() {
-        return this.active;
-    }
-
-    public Settings getSettings() {
-        return this.settings;
-    }
-
-    public static Settings settings() {
-        return Baritone.INSTANCE.settings; // yolo
-    }
-
-    public File getDir() {
-        return this.dir;
-    }
-}

src/main/java/baritone/BaritoneProvider.java

@@ -1,74 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone;
-
-import baritone.api.IBaritoneProvider;
-import baritone.api.behavior.*;
-import baritone.api.cache.IWorldProvider;
-import baritone.api.cache.IWorldScanner;
-import baritone.api.event.listener.IGameEventListener;
-import baritone.behavior.*;
-import baritone.cache.WorldProvider;
-import baritone.cache.WorldScanner;
-
-/**
- * @author Brady
- * @since 9/29/2018
- */
-public final class BaritoneProvider implements IBaritoneProvider {
-
-    @Override
-    public IFollowBehavior getFollowBehavior() {
-        return FollowBehavior.INSTANCE;
-    }
-
-    @Override
-    public ILookBehavior getLookBehavior() {
-        return LookBehavior.INSTANCE;
-    }
-
-    @Override
-    public IMemoryBehavior getMemoryBehavior() {
-        return MemoryBehavior.INSTANCE;
-    }
-
-    @Override
-    public IMineBehavior getMineBehavior() {
-        return MineBehavior.INSTANCE;
-    }
-
-    @Override
-    public IPathingBehavior getPathingBehavior() {
-        return PathingBehavior.INSTANCE;
-    }
-
-    @Override
-    public IWorldProvider getWorldProvider() {
-        return WorldProvider.INSTANCE;
-    }
-
-    @Override
-    public IWorldScanner getWorldScanner() {
-        return WorldScanner.INSTANCE;
-    }
-
-    @Override
-    public void registerEventListener(IGameEventListener listener) {
-        Baritone.INSTANCE.registerEventListener(listener);
-    }
-}

src/main/java/baritone/behavior/Behavior.java

@@ -1,70 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.api.behavior.IBehavior;
-
-/**
- * A type of game event listener that can be toggled.
- *
- * @author Brady
- * @since 8/1/2018 6:29 PM
- */
-public class Behavior implements IBehavior {
-
-    /**
-     * Whether or not this behavior is enabled
-     */
-    private boolean enabled = true;
-
-    /**
-     * Toggles the enabled state of this {@link Behavior}.
-     *
-     * @return The new state.
-     */
-    @Override
-    public final boolean toggle() {
-        return this.setEnabled(!this.isEnabled());
-    }
-
-    /**
-     * Sets the enabled state of this {@link Behavior}.
-     *
-     * @return The new state.
-     */
-    @Override
-    public final boolean setEnabled(boolean enabled) {
-        if (enabled == this.enabled) {
-            return this.enabled;
-        }
-        if (this.enabled = enabled) {
-            this.onEnable();
-        } else {
-            this.onDisable();
-        }
-        return this.enabled;
-    }
-
-    /**
-     * @return Whether or not this {@link Behavior} is active.
-     */
-    @Override
-    public final boolean isEnabled() {
-        return this.enabled;
-    }
-}

src/main/java/baritone/behavior/FollowBehavior.java

@@ -1,79 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.Baritone;
-import baritone.api.behavior.IFollowBehavior;
-import baritone.api.event.events.TickEvent;
-import baritone.api.pathing.goals.GoalNear;
-import baritone.api.pathing.goals.GoalXZ;
-import baritone.utils.Helper;
-import net.minecraft.entity.Entity;
-import net.minecraft.util.math.BlockPos;
-
-/**
- * Follow an entity
- *
- * @author leijurv
- */
-public final class FollowBehavior extends Behavior implements IFollowBehavior, Helper {
-
-    public static final FollowBehavior INSTANCE = new FollowBehavior();
-
-    private Entity following;
-
-    private FollowBehavior() {}
-
-    @Override
-    public void onTick(TickEvent event) {
-        if (event.getType() == TickEvent.Type.OUT) {
-            following = null;
-            return;
-        }
-        if (following == null) {
-            return;
-        }
-        // lol this is trashy but it works
-        BlockPos pos;
-        if (Baritone.settings().followOffsetDistance.get() == 0) {
-            pos = following.getPosition();
-        } else {
-            GoalXZ g = GoalXZ.fromDirection(following.getPositionVector(), Baritone.settings().followOffsetDirection.get(), Baritone.settings().followOffsetDistance.get());
-            pos = new BlockPos(g.getX(), following.posY, g.getZ());
-        }
-        PathingBehavior.INSTANCE.setGoal(new GoalNear(pos, Baritone.settings().followRadius.get()));
-        PathingBehavior.INSTANCE.revalidateGoal();
-        PathingBehavior.INSTANCE.path();
-    }
-
-    @Override
-    public void follow(Entity entity) {
-        this.following = entity;
-    }
-
-    @Override
-    public Entity following() {
-        return this.following;
-    }
-
-    @Override
-    public void cancel() {
-        PathingBehavior.INSTANCE.cancel();
-        follow(null);
-    }
-}

src/main/java/baritone/behavior/LocationTrackingBehavior.java

@@ -1,53 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.api.event.events.BlockInteractEvent;
-import baritone.cache.Waypoint;
-import baritone.cache.WorldProvider;
-import baritone.utils.BlockStateInterface;
-import baritone.utils.Helper;
-import net.minecraft.block.BlockBed;
-
-/**
- * A collection of event methods that are used to interact with Baritone's
- * waypoint system. This class probably needs a better name.
- *
- * @see Waypoint
- *
- * @author Brady
- * @since 8/22/2018
- */
-public final class LocationTrackingBehavior extends Behavior implements Helper {
-
-    public static final LocationTrackingBehavior INSTANCE = new LocationTrackingBehavior();
-
-    private LocationTrackingBehavior() {}
-
-    @Override
-    public void onBlockInteract(BlockInteractEvent event) {
-        if (event.getType() == BlockInteractEvent.Type.USE && BlockStateInterface.getBlock(event.getPos()) instanceof BlockBed) {
-            WorldProvider.INSTANCE.getCurrentWorld().getWaypoints().addWaypoint(new Waypoint("bed", Waypoint.Tag.BED, event.getPos()));
-        }
-    }
-
-    @Override
-    public void onPlayerDeath() {
-        WorldProvider.INSTANCE.getCurrentWorld().getWaypoints().addWaypoint(new Waypoint("death", Waypoint.Tag.DEATH, playerFeet()));
-    }
-}

src/main/java/baritone/behavior/LookBehavior.java

@@ -1,128 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.Baritone;
-import baritone.api.Settings;
-import baritone.api.behavior.ILookBehavior;
-import baritone.api.event.events.PlayerUpdateEvent;
-import baritone.api.event.events.RotationMoveEvent;
-import baritone.api.utils.Rotation;
-import baritone.utils.Helper;
-
-public final class LookBehavior extends Behavior implements ILookBehavior, Helper {
-
-    public static final LookBehavior INSTANCE = new LookBehavior();
-
-    /**
-     * Target's values are as follows:
-     * <p>
-     * getFirst() -> yaw
-     * getSecond() -> pitch
-     */
-    private Rotation target;
-
-    /**
-     * Whether or not rotations are currently being forced
-     */
-    private boolean force;
-
-    /**
-     * The last player yaw angle. Used when free looking
-     *
-     * @see Settings#freeLook
-     */
-    private float lastYaw;
-
-    private LookBehavior() {}
-
-    @Override
-    public void updateTarget(Rotation target, boolean force) {
-        this.target = target;
-        this.force = force || !Baritone.settings().freeLook.get();
-    }
-
-    @Override
-    public void onPlayerUpdate(PlayerUpdateEvent event) {
-        if (this.target == null) {
-            return;
-        }
-
-        // Whether or not we're going to silently set our angles
-        boolean silent = Baritone.settings().antiCheatCompatibility.get();
-
-        switch (event.getState()) {
-            case PRE: {
-                if (this.force) {
-                    player().rotationYaw = this.target.getYaw();
-                    float oldPitch = player().rotationPitch;
-                    float desiredPitch = this.target.getPitch();
-                    player().rotationPitch = desiredPitch;
-                    if (desiredPitch == oldPitch) {
-                        nudgeToLevel();
-                    }
-                    this.target = null;
-                } else if (silent) {
-                    this.lastYaw = player().rotationYaw;
-                    player().rotationYaw = this.target.getYaw();
-                }
-                break;
-            }
-            case POST: {
-                if (!this.force && silent) {
-                    player().rotationYaw = this.lastYaw;
-                    this.target = null;
-                }
-                break;
-            }
-            default:
-                break;
-        }
-    }
-
-    @Override
-    public void onPlayerRotationMove(RotationMoveEvent event) {
-        if (this.target != null && !this.force) {
-            switch (event.getState()) {
-                case PRE:
-                    this.lastYaw = player().rotationYaw;
-                    player().rotationYaw = this.target.getYaw();
-                    break;
-                case POST:
-                    player().rotationYaw = this.lastYaw;
-
-                    // If we have antiCheatCompatibility on, we're going to use the target value later in onPlayerUpdate()
-                    // Also the type has to be MOTION_UPDATE because that is called after JUMP
-                    if (!Baritone.settings().antiCheatCompatibility.get() && event.getType() == RotationMoveEvent.Type.MOTION_UPDATE) {
-                        this.target = null;
-                    }
-                    break;
-                default:
-                    break;
-            }
-        }
-    }
-
-    private void nudgeToLevel() {
-        if (player().rotationPitch < -20) {
-            player().rotationPitch++;
-        } else if (player().rotationPitch > 10) {
-            player().rotationPitch--;
-        }
-    }
-}

src/main/java/baritone/behavior/MemoryBehavior.java

@@ -1,225 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.api.behavior.IMemoryBehavior;
-import baritone.api.behavior.memory.IRememberedInventory;
-import baritone.api.cache.IWorldData;
-import baritone.api.event.events.PacketEvent;
-import baritone.api.event.events.PlayerUpdateEvent;
-import baritone.api.event.events.type.EventState;
-import baritone.cache.WorldProvider;
-import baritone.utils.Helper;
-import net.minecraft.item.ItemStack;
-import net.minecraft.network.Packet;
-import net.minecraft.network.play.client.CPacketCloseWindow;
-import net.minecraft.network.play.client.CPacketPlayerTryUseItemOnBlock;
-import net.minecraft.network.play.server.SPacketCloseWindow;
-import net.minecraft.network.play.server.SPacketOpenWindow;
-import net.minecraft.tileentity.TileEntity;
-import net.minecraft.tileentity.TileEntityLockable;
-import net.minecraft.util.math.BlockPos;
-
-import java.util.*;
-
-/**
- * @author Brady
- * @since 8/6/2018 9:47 PM
- */
-public final class MemoryBehavior extends Behavior implements IMemoryBehavior, Helper {
-
-    public static MemoryBehavior INSTANCE = new MemoryBehavior();
-
-    private final Map<IWorldData, WorldDataContainer> worldDataContainers = new HashMap<>();
-
-    private MemoryBehavior() {}
-
-    @Override
-    public synchronized void onPlayerUpdate(PlayerUpdateEvent event) {
-        if (event.getState() == EventState.PRE) {
-            updateInventory();
-        }
-    }
-
-    @Override
-    public synchronized void onSendPacket(PacketEvent event) {
-        Packet p = event.getPacket();
-
-        if (event.getState() == EventState.PRE) {
-            if (p instanceof CPacketPlayerTryUseItemOnBlock) {
-                CPacketPlayerTryUseItemOnBlock packet = event.cast();
-
-                TileEntity tileEntity = world().getTileEntity(packet.getPos());
-
-                // Ensure the TileEntity is a container of some sort
-                if (tileEntity instanceof TileEntityLockable) {
-
-                    TileEntityLockable lockable = (TileEntityLockable) tileEntity;
-                    int size = lockable.getSizeInventory();
-
-                    this.getCurrentContainer().futureInventories.add(new FutureInventory(System.nanoTime() / 1000000L, size, lockable.getGuiID(), tileEntity.getPos()));
-                }
-            }
-
-            if (p instanceof CPacketCloseWindow) {
-                updateInventory();
-            }
-        }
-    }
-
-    @Override
-    public synchronized void onReceivePacket(PacketEvent event) {
-        Packet p = event.getPacket();
-
-        if (event.getState() == EventState.PRE) {
-            if (p instanceof SPacketOpenWindow) {
-                SPacketOpenWindow packet = event.cast();
-
-                WorldDataContainer container = this.getCurrentContainer();
-
-                // Remove any entries that were created over a second ago, this should make up for INSANE latency
-                container.futureInventories.removeIf(i -> System.nanoTime() / 1000000L - i.time > 1000);
-
-                container.futureInventories.stream()
-                        .filter(i -> i.type.equals(packet.getGuiId()) && i.slots == packet.getSlotCount())
-                        .findFirst().ifPresent(matched -> {
-                    // Remove the future inventory
-                    container.futureInventories.remove(matched);
-
-                    // Setup the remembered inventory
-                    RememberedInventory inventory = container.rememberedInventories.computeIfAbsent(matched.pos, pos -> new RememberedInventory());
-                    inventory.windowId = packet.getWindowId();
-                    inventory.size = packet.getSlotCount();
-                });
-            }
-
-            if (p instanceof SPacketCloseWindow) {
-                updateInventory();
-            }
-        }
-    }
-
-    private Optional<RememberedInventory> getInventoryFromWindow(int windowId) {
-        return this.getCurrentContainer().rememberedInventories.values().stream().filter(i -> i.windowId == windowId).findFirst();
-    }
-
-    private void updateInventory() {
-        getInventoryFromWindow(player().openContainer.windowId).ifPresent(inventory -> {
-            inventory.items.clear();
-            inventory.items.addAll(player().openContainer.getInventory().subList(0, inventory.size));
-        });
-    }
-
-    private WorldDataContainer getCurrentContainer() {
-        return this.worldDataContainers.computeIfAbsent(WorldProvider.INSTANCE.getCurrentWorld(), data -> new WorldDataContainer());
-    }
-
-    @Override
-    public final synchronized RememberedInventory getInventoryByPos(BlockPos pos) {
-        return this.getCurrentContainer().rememberedInventories.get(pos);
-    }
-
-    @Override
-    public final synchronized Map<BlockPos, IRememberedInventory> getRememberedInventories() {
-        // make a copy since this map is modified from the packet thread
-        return new HashMap<>(this.getCurrentContainer().rememberedInventories);
-    }
-
-    private static final class WorldDataContainer {
-
-        /**
-         * Possible future inventories that we will be able to remember
-         */
-        private final List<FutureInventory> futureInventories = new ArrayList<>();
-
-        /**
-         * The current remembered inventories
-         */
-        private final Map<BlockPos, RememberedInventory> rememberedInventories = new HashMap<>();
-    }
-
-    /**
-     * An inventory that we are not yet fully aware of, but are expecting to exist at some point in the future.
-     */
-    private static final class FutureInventory {
-
-        /**
-         * The time that we initially expected the inventory to be provided, in milliseconds
-         */
-        private final long time;
-
-        /**
-         * The amount of slots in the inventory
-         */
-        private final int slots;
-
-        /**
-         * The type of inventory
-         */
-        private final String type;
-
-        /**
-         * The position of the inventory container
-         */
-        private final BlockPos pos;
-
-        private FutureInventory(long time, int slots, String type, BlockPos pos) {
-            this.time = time;
-            this.slots = slots;
-            this.type = type;
-            this.pos = pos;
-        }
-    }
-
-    /**
-     * An inventory that we are aware of.
-     * <p>
-     * Associated with a {@link BlockPos} in {@link WorldDataContainer#rememberedInventories}.
-     */
-    public static class RememberedInventory implements IRememberedInventory {
-
-        /**
-         * The list of items in the inventory
-         */
-        private final List<ItemStack> items;
-
-        /**
-         * The last known window ID of the inventory
-         */
-        private int windowId;
-
-        /**
-         * The size of the inventory
-         */
-        private int size;
-
-        private RememberedInventory() {
-            this.items = new ArrayList<>();
-        }
-
-        @Override
-        public final List<ItemStack> getContents() {
-            return Collections.unmodifiableList(this.items);
-        }
-
-        @Override
-        public final int getSize() {
-            return this.size;
-        }
-    }
-}

src/main/java/baritone/behavior/MineBehavior.java

@@ -1,195 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.Baritone;
-import baritone.api.behavior.IMineBehavior;
-import baritone.api.event.events.PathEvent;
-import baritone.api.event.events.TickEvent;
-import baritone.api.pathing.goals.Goal;
-import baritone.cache.CachedChunk;
-import baritone.cache.ChunkPacker;
-import baritone.cache.WorldProvider;
-import baritone.cache.WorldScanner;
-import baritone.api.pathing.goals.GoalBlock;
-import baritone.api.pathing.goals.GoalComposite;
-import baritone.api.pathing.goals.GoalTwoBlocks;
-import baritone.utils.BlockStateInterface;
-import baritone.utils.Helper;
-import net.minecraft.block.Block;
-import net.minecraft.init.Blocks;
-import net.minecraft.item.Item;
-import net.minecraft.item.ItemStack;
-import net.minecraft.util.math.BlockPos;
-import net.minecraft.world.chunk.EmptyChunk;
-
-import java.util.*;
-import java.util.stream.Collectors;
-
-/**
- * Mine blocks of a certain type
- *
- * @author leijurv
- */
-public final class MineBehavior extends Behavior implements IMineBehavior, Helper {
-
-    public static final MineBehavior INSTANCE = new MineBehavior();
-
-    private List<Block> mining;
-    private List<BlockPos> locationsCache;
-    private int quantity;
-
-    private MineBehavior() {}
-
-    @Override
-    public void onTick(TickEvent event) {
-        if (event.getType() == TickEvent.Type.OUT) {
-            cancel();
-            return;
-        }
-        if (mining == null) {
-            return;
-        }
-        if (quantity > 0) {
-            Item item = mining.get(0).getItemDropped(mining.get(0).getDefaultState(), new Random(), 0);
-            int curr = player().inventory.mainInventory.stream().filter(stack -> item.equals(stack.getItem())).mapToInt(ItemStack::getCount).sum();
-            System.out.println("Currently have " + curr + " " + item);
-            if (curr >= quantity) {
-                logDirect("Have " + curr + " " + item.getItemStackDisplayName(new ItemStack(item, 1)));
-                cancel();
-                return;
-            }
-        }
-        int mineGoalUpdateInterval = Baritone.settings().mineGoalUpdateInterval.get();
-        if (mineGoalUpdateInterval != 0) {
-            if (event.getCount() % mineGoalUpdateInterval == 0) {
-                Baritone.INSTANCE.getExecutor().execute(this::updateGoal);
-            }
-        }
-        PathingBehavior.INSTANCE.revalidateGoal();
-    }
-
-    @Override
-    public void onPathEvent(PathEvent event) {
-        updateGoal();
-    }
-
-    private void updateGoal() {
-        if (mining == null) {
-            return;
-        }
-        if (!locationsCache.isEmpty()) {
-            locationsCache = prune(new ArrayList<>(locationsCache), mining, 64);
-            PathingBehavior.INSTANCE.setGoal(coalesce(locationsCache));
-            PathingBehavior.INSTANCE.path();
-        }
-        List<BlockPos> locs = scanFor(mining, 64);
-        if (locs.isEmpty()) {
-            logDebug("No locations for " + mining + " known, cancelling");
-            cancel();
-            return;
-        }
-        locationsCache = locs;
-        PathingBehavior.INSTANCE.setGoal(coalesce(locs));
-        PathingBehavior.INSTANCE.path();
-    }
-
-    public GoalComposite coalesce(List<BlockPos> locs) {
-        return new GoalComposite(locs.stream().map(loc -> {
-            if (!Baritone.settings().forceInternalMining.get()) {
-                return new GoalTwoBlocks(loc);
-            }
-
-            boolean upwardGoal = locs.contains(loc.up()) || (Baritone.settings().internalMiningAirException.get() && BlockStateInterface.getBlock(loc.up()) == Blocks.AIR);
-            boolean downwardGoal = locs.contains(loc.down()) || (Baritone.settings().internalMiningAirException.get() && BlockStateInterface.getBlock(loc.up()) == Blocks.AIR);
-            if (upwardGoal) {
-                if (downwardGoal) {
-                    return new GoalTwoBlocks(loc);
-                } else {
-                    return new GoalBlock(loc);
-                }
-            } else {
-                if (downwardGoal) {
-                    return new GoalBlock(loc.down());
-                } else {
-                    return new GoalTwoBlocks(loc);
-                }
-            }
-        }).toArray(Goal[]::new));
-    }
-
-    public List<BlockPos> scanFor(List<Block> mining, int max) {
-        List<BlockPos> locs = new ArrayList<>();
-        List<Block> uninteresting = new ArrayList<>();
-        //long b = System.currentTimeMillis();
-        for (Block m : mining) {
-            if (CachedChunk.BLOCKS_TO_KEEP_TRACK_OF.contains(m)) {
-                locs.addAll(WorldProvider.INSTANCE.getCurrentWorld().getCachedWorld().getLocationsOf(ChunkPacker.blockToString(m), 1, 1));
-            } else {
-                uninteresting.add(m);
-            }
-        }
-        //System.out.println("Scan of cached chunks took " + (System.currentTimeMillis() - b) + "ms");
-        if (locs.isEmpty()) {
-            uninteresting = mining;
-        }
-        if (!uninteresting.isEmpty()) {
-            //long before = System.currentTimeMillis();
-            locs.addAll(WorldScanner.INSTANCE.scanLoadedChunks(uninteresting, max, 10, 26));
-            //System.out.println("Scan of loaded chunks took " + (System.currentTimeMillis() - before) + "ms");
-        }
-        return prune(locs, mining, max);
-    }
-
-    public List<BlockPos> prune(List<BlockPos> locs, List<Block> mining, int max) {
-        BlockPos playerFeet = MineBehavior.INSTANCE.playerFeet();
-        locs.sort(Comparator.comparingDouble(playerFeet::distanceSq));
-
-        // remove any that are within loaded chunks that aren't actually what we want
-        locs.removeAll(locs.stream()
-                .filter(pos -> !(MineBehavior.INSTANCE.world().getChunk(pos) instanceof EmptyChunk))
-                .filter(pos -> !mining.contains(BlockStateInterface.get(pos).getBlock()))
-                .collect(Collectors.toList()));
-        if (locs.size() > max) {
-            return locs.subList(0, max);
-        }
-        return locs;
-    }
-
-    @Override
-    public void mine(int quantity, String... blocks) {
-        this.mining = blocks == null || blocks.length == 0 ? null : Arrays.stream(blocks).map(ChunkPacker::stringToBlock).collect(Collectors.toList());
-        this.quantity = quantity;
-        this.locationsCache = new ArrayList<>();
-        updateGoal();
-    }
-
-    @Override
-    public void mine(int quantity, Block... blocks) {
-        this.mining = blocks == null || blocks.length == 0 ? null : Arrays.asList(blocks);
-        this.quantity = quantity;
-        this.locationsCache = new ArrayList<>();
-        updateGoal();
-    }
-
-    @Override
-    public void cancel() {
-        mine(0, (String[]) null);
-        PathingBehavior.INSTANCE.cancel();
-    }
-}

src/main/java/baritone/behavior/PathingBehavior.java

@@ -1,397 +0,0 @@
-/*
- * This file is part of Baritone.
- *
- * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * Baritone is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
- */
-
-package baritone.behavior;
-
-import baritone.Baritone;
-import baritone.api.behavior.IPathingBehavior;
-import baritone.api.event.events.PathEvent;
-import baritone.api.event.events.PlayerUpdateEvent;
-import baritone.api.event.events.RenderEvent;
-import baritone.api.event.events.TickEvent;
-import baritone.api.pathing.goals.Goal;
-import baritone.api.pathing.goals.GoalXZ;
-import baritone.api.utils.interfaces.IGoalRenderPos;
-import baritone.pathing.calc.AStarPathFinder;
-import baritone.pathing.calc.AbstractNodeCostSearch;
-import baritone.pathing.calc.IPathFinder;
-import baritone.pathing.movement.MovementHelper;
-import baritone.pathing.path.IPath;
-import baritone.pathing.path.PathExecutor;
-import baritone.utils.BlockBreakHelper;
-import baritone.utils.BlockStateInterface;
-import baritone.utils.Helper;
-import baritone.utils.PathRenderer;
-import baritone.utils.pathing.BetterBlockPos;
-import net.minecraft.init.Blocks;
-import net.minecraft.util.math.BlockPos;
-import net.minecraft.world.chunk.EmptyChunk;
-
-import java.util.Collection;
-import java.util.HashSet;
-import java.util.Optional;
-import java.util.stream.Collectors;
-
-public final class PathingBehavior extends Behavior implements IPathingBehavior, Helper {
-
-    public static final PathingBehavior INSTANCE = new PathingBehavior();
-
-    private PathExecutor current;
-    private PathExecutor next;
-
-    private Goal goal;
-
-    private volatile boolean isPathCalcInProgress;
-    private final Object pathCalcLock = new Object();
-
-    private final Object pathPlanLock = new Object();
-
-    private boolean lastAutoJump;
-
-    private PathingBehavior() {}
-
-    private void dispatchPathEvent(PathEvent event) {
-        Baritone.INSTANCE.getExecutor().execute(() -> Baritone.INSTANCE.getGameEventHandler().onPathEvent(event));
-    }
-
-    @Override
-    public void onTick(TickEvent event) {
-        if (event.getType() == TickEvent.Type.OUT) {
-            this.cancel();
-            return;
-        }
-        mc.playerController.setPlayerCapabilities(mc.player);
-        if (current == null) {
-            return;
-        }
-        boolean safe = current.onTick(event);
-        synchronized (pathPlanLock) {
-            if (current.failed() || current.finished()) {
-                current = null;
-                if (goal == null || goal.isInGoal(playerFeet())) {
-                    logDebug("All done. At " + goal);
-                    dispatchPathEvent(PathEvent.AT_GOAL);
-                    next = null;
-                    return;
-                }
-                if (next != null && !next.getPath().positions().contains(playerFeet())) {
-                    // if the current path failed, we may not actually be on the next one, so make sure
-                    logDebug("Discarding next path as it does not contain current position");
-                    // for example if we had a nicely planned ahead path that starts where current ends
-                    // that's all fine and good
-                    // but if we fail in the middle of current
-                    // we're nowhere close to our planned ahead path
-                    // so need to discard it sadly.
-                    dispatchPathEvent(PathEvent.DISCARD_NEXT);
-                    next = null;
-                }
-                if (next != null) {
-                    logDebug("Continuing on to planned next path");
-                    dispatchPathEvent(PathEvent.CONTINUING_ONTO_PLANNED_NEXT);
-                    current = next;
-                    next = null;
-                    return;
-                }
-                // at this point, current just ended, but we aren't in the goal and have no plan for the future
-                synchronized (pathCalcLock) {
-                    if (isPathCalcInProgress) {
-                        dispatchPathEvent(PathEvent.PATH_FINISHED_NEXT_STILL_CALCULATING);
-                        // if we aren't calculating right now
-                        return;
-                    }
-                    dispatchPathEvent(PathEvent.CALC_STARTED);
-                    findPathInNewThread(pathStart(), true, Optional.empty());
-                }
-                return;
-            }
-            // at this point, we know current is in progress
-            if (safe) {
-                // a movement just ended
-                if (next != null) {
-                    if (next.getPath().positions().contains(playerFeet())) {
-                        // jump directly onto the next path
-                        logDebug("Splicing into planned next path early...");
-                        dispatchPathEvent(PathEvent.SPLICING_ONTO_NEXT_EARLY);
-                        current = next;
-                        next = null;
-                        return;
-                    }
-                }
-            }
-            synchronized (pathCalcLock) {
-                if (isPathCalcInProgress) {
-                    // if we aren't calculating right now
-                    return;
-                }
-                if (next != null) {
-                    // and we have no plan for what to do next
-                    return;
-                }
-                if (goal == null || goal.isInGoal(current.getPath().getDest())) {
-                    // and this path dosen't get us all the way there
-                    return;
-                }
-                if (ticksRemainingInSegment().get() < Baritone.settings().planningTickLookAhead.get()) {
-                    // and this path has 5 seconds or less left
-                    logDebug("Path almost over. Planning ahead...");
-                    dispatchPathEvent(PathEvent.NEXT_SEGMENT_CALC_STARTED);
-                    findPathInNewThread(current.getPath().getDest(), false, Optional.of(current.getPath()));
-                }
-            }
-        }
-    }
-
-    @Override
-    public void onPlayerUpdate(PlayerUpdateEvent event) {
-        if (current != null) {
-            switch (event.getState()) {
-                case PRE:
-                    lastAutoJump = mc.gameSettings.autoJump;
-                    mc.gameSettings.autoJump = false;
-                    break;
-                case POST:
-                    mc.gameSettings.autoJump = lastAutoJump;
-                    break;
-                default:
-                    break;
-            }
-        }
-    }
-
-    @Override
-    public Optional<Double> ticksRemainingInSegment() {
-        if (current == null) {
-            return Optional.empty();
-        }
-        return Optional.of(current.getPath().ticksRemainingFrom(current.getPosition()));
-    }
-
-    @Override
-    public void setGoal(Goal goal) {
-        this.goal = goal;
-    }
-
-    @Override
-    public Goal getGoal() {
-        return goal;
-    }
-
-    public PathExecutor getCurrent() {
-        return current;
-    }
-
-    public PathExecutor getNext() {
-        return next;
-    }
-
-    // TODO: Expose this method in the API?
-    // In order to do so, we'd need to move over IPath which has a whole lot of references to other
-    // things that may not need to be exposed necessarily, so we'll need to figure that out.
-    public Optional<IPath> getPath() {
-        return Optional.ofNullable(current).map(PathExecutor::getPath);
-    }
-
-    @Override
-    public boolean isPathing() {
-        return this.current != null;
-    }
-
-    @Override
-    public void cancel() {
-        dispatchPathEvent(PathEvent.CANCELED);
-        current = null;
-        next = null;
-        Baritone.INSTANCE.getInputOverrideHandler().clearAllKeys();
-        AbstractNodeCostSearch.getCurrentlyRunning().ifPresent(AbstractNodeCostSearch::cancel);
-        BlockBreakHelper.stopBreakingBlock();
-    }
-
-    public void forceCancel() { // NOT exposed on public api
-        isPathCalcInProgress = false;
-    }
-
-    /**
-     * Start calculating a path if we aren't already
-     *
-     * @return true if this call started path calculation, false if it was already calculating or executing a path
-     */
-    @Override
-    public boolean path() {
-        if (goal == null) {
-            return false;
-        }
-        if (goal.isInGoal(playerFeet())) {
-            return false;
-        }
-        synchronized (pathPlanLock) {
-            if (current != null) {
-                return false;
-            }
-            synchronized (pathCalcLock) {
-                if (isPathCalcInProgress) {
-                    return false;
-                }
-                dispatchPathEvent(PathEvent.CALC_STARTED);
-                findPathInNewThread(pathStart(), true, Optional.empty());
-                return true;
-            }
-        }
-    }
-
-    /**
-     * @return The starting {@link BlockPos} for a new path
-     */
-    private BlockPos pathStart() {
-        BetterBlockPos feet = playerFeet();
-        if (BlockStateInterface.get(feet.down()).getBlock().equals(Blocks.AIR) && MovementHelper.canWalkOn(feet.down().down())) {
-            return feet.down();
-        }
-        return feet;
-    }
-
-    /**
-     * In a new thread, pathfind to target blockpos
-     *
-     * @param start
-     * @param talkAboutIt
-     */
-    private void findPathInNewThread(final BlockPos start, final boolean talkAboutIt, final Optional<IPath> previous) {
-        synchronized (pathCalcLock) {
-            if (isPathCalcInProgress) {
-                throw new IllegalStateException("Already doing it");
-            }
-            isPathCalcInProgress = true;
-        }
-        Baritone.INSTANCE.getExecutor().execute(() -> {
-            if (talkAboutIt) {
-                logDebug("Starting to search for path from " + start + " to " + goal);
-            }
-
-            Optional<IPath> path = findPath(start, previous);
-            if (Baritone.settings().cutoffAtLoadBoundary.get()) {
-                path = path.map(IPath::cutoffAtLoadedChunks);
-            }
-            Optional<PathExecutor> executor = path.map(p -> p.staticCutoff(goal)).map(PathExecutor::new);
-            synchronized (pathPlanLock) {
-                if (current == null) {
-                    if (executor.isPresent()) {
-                        dispatchPathEvent(PathEvent.CALC_FINISHED_NOW_EXECUTING);
-                        current = executor.get();
-                    } else {
-                        dispatchPathEvent(PathEvent.CALC_FAILED);
-                    }
-                } else {
-                    if (next == null) {
-                        if (executor.isPresent()) {
-                            dispatchPathEvent(PathEvent.NEXT_SEGMENT_CALC_FINISHED);
-                            next = executor.get();
-                        } else {
-                            dispatchPathEvent(PathEvent.NEXT_CALC_FAILED);
-                        }
-                    } else {
-                        throw new IllegalStateException("I have no idea what to do with this path");
-                    }
-                }
-            }
-
-            if (talkAboutIt && current != null && current.getPath() != null) {
-                if (goal == null || goal.isInGoal(current.getPath().getDest())) {
-                    logDebug("Finished finding a path from " + start + " to " + goal + ". " + current.getPath().getNumNodesConsidered() + " nodes considered");
-                } else {
-                    logDebug("Found path segment from " + start + " towards " + goal + ". " + current.getPath().getNumNodesConsidered() + " nodes considered");
-
-                }
-            }
-            synchronized (pathCalcLock) {
-                isPathCalcInProgress = false;
-            }
-        });
-    }
-
-    /**
-     * Actually do the pathing
-     *
-     * @param start
-     * @return
-     */
-    private Optional<IPath> findPath(BlockPos start, Optional<IPath> previous) {
-        Goal goal = this.goal;
-        if (goal == null) {
-            logDebug("no goal");
-            return Optional.empty();
-        }
-        if (Baritone.settings().simplifyUnloadedYCoord.get()) {
-            BlockPos pos = null;
-            if (goal instanceof IGoalRenderPos) {
-                pos = ((IGoalRenderPos) goal).getGoalPos();
-            }
-
-            if (pos != null && world().getChunk(pos) instanceof EmptyChunk) {
-                logDebug("Simplifying " + goal.getClass() + " to GoalXZ due to distance");
-                goal = new GoalXZ(pos.getX(), pos.getZ());
-            }
-        }
-        long timeout;
-        if (current == null) {
-            timeout = Baritone.settings().pathTimeoutMS.<Long>get();
-        } else {
-            timeout = Baritone.settings().planAheadTimeoutMS.<Long>get();
-        }
-        Optional<HashSet<Long>> favoredPositions;
-        if (Baritone.settings().backtrackCostFavoringCoefficient.get() == 1D) {
-            favoredPositions = Optional.empty();
-        } else {
-            favoredPositions = previous.map(IPath::positions).map(Collection::stream).map(x -> x.map(BetterBlockPos::longHash)).map(x -> x.collect(Collectors.toList())).map(HashSet::new); // <-- okay this is EPIC
-        }
-        try {
-            IPathFinder pf = new AStarPathFinder(start.getX(), start.getY(), start.getZ(), goal, favoredPositions);
-            return pf.calculate(timeout);
-        } catch (Exception e) {
-            logDebug("Pathing exception: " + e);
-            e.printStackTrace();
-            return Optional.empty();
-        }
-    }
-
-    public void revalidateGoal() {
-        if (!Baritone.settings().cancelOnGoalInvalidation.get()) {
-            return;
-        }
-        synchronized (pathPlanLock) {
-            if (current == null || goal == null) {
-                return;
-            }
-            Goal intended = current.getPath().getGoal();
-            BlockPos end = current.getPath().getDest();
-            if (intended.isInGoal(end) && !goal.isInGoal(end)) {
-                // this path used to end in the goal
-                // but the goal has changed, so there's no reason to continue...
-                cancel();
-            }
-        }
-    }
-
-    @Override
-    public void onRenderPass(RenderEvent event) {
-        PathRenderer.render(event, this);
-    }
-
-    @Override
-    public void onDisable() {
-        Baritone.INSTANCE.getInputOverrideHandler().clearAllKeys();
-    }
-}

src/main/java/baritone/bot/Baritone.java

@@ -0,0 +1,142 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot;
+
+import baritone.bot.behavior.Behavior;
+import baritone.bot.behavior.impl.LookBehavior;
+import baritone.bot.behavior.impl.MemoryBehavior;
+import baritone.bot.behavior.impl.PathingBehavior;
+import baritone.bot.event.GameEventHandler;
+import baritone.bot.pathing.movement.MovementHelper;
+import baritone.bot.utils.InputOverrideHandler;
+import net.minecraft.block.Block;
+import net.minecraft.block.state.IBlockState;
+import net.minecraft.init.Blocks;
+
+import java.lang.reflect.Field;
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * @author Brady
+ * @since 7/31/2018 10:50 PM
+ */
+public enum Baritone {
+
+    /**
+     * Singleton instance of this class
+     */
+    INSTANCE;
+
+    /**
+     * Whether or not {@link Baritone#init()} has been called yet
+     */
+    private boolean initialized;
+
+    private GameEventHandler gameEventHandler;
+    private InputOverrideHandler inputOverrideHandler;
+    private Settings settings;
+    private List<Behavior> behaviors;
+
+    /**
+     * Whether or not Baritone is active
+     */
+    private boolean active;
+
+    public synchronized void init() {
+        if (initialized) {
+            return;
+        }
+        this.gameEventHandler = new GameEventHandler();
+        this.inputOverrideHandler = new InputOverrideHandler();
+        this.settings = new Settings();
+        this.behaviors = new ArrayList<>();
+        behaviors.add(PathingBehavior.INSTANCE);
+        behaviors.add(LookBehavior.INSTANCE);
+        behaviors.add(MemoryBehavior.INSTANCE);
+
+        this.active = true;
+        this.initialized = true;
+        Field[] temp = Blocks.class.getFields();
+        try {
+            for (Field field : temp) {
+                if (field.getType().equals(Block.class)) {
+                    Block block = (Block) field.get(null);
+                    System.out.print(block);
+                    IBlockState state = block.getDefaultState();
+                    System.out.print(',');
+                    try {
+                        if (MovementHelper.canWalkThrough(null, state)) {
+                            System.out.print("true");
+                        } else {
+                            System.out.print("false");
+                        }
+                    } catch (Exception e) {
+                        System.out.print("unknown");
+                    }
+                    System.out.print(',');
+                    try {
+                        if (MovementHelper.canWalkOn(null, state)) {
+                            System.out.print("true");
+                        } else {
+                            System.out.print("false");
+                        }
+                    } catch (Exception e) {
+                        System.out.print("unknown");
+                    }
+
+                    System.out.println();
+                }
+            }
+        } catch (IllegalAccessException e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public final boolean isInitialized() {
+        return this.initialized;
+    }
+
+    public final GameEventHandler getGameEventHandler() {
+        return this.gameEventHandler;
+    }
+
+    public final InputOverrideHandler getInputOverrideHandler() {
+        return this.inputOverrideHandler;
+    }
+
+    public final List<Behavior> getBehaviors() {
+        return this.behaviors;
+    }
+
+    public void registerBehavior(Behavior behavior) {
+        this.behaviors.add(behavior);
+    }
+
+    public final boolean isActive() {
+        return this.active;
+    }
+
+    public final Settings getSettings() {
+        return this.settings;
+    }
+
+    public static Settings settings() {
+        return Baritone.INSTANCE.settings; // yolo
+    }
+}

src/main/java/baritone/bot/Settings.java

@@ -0,0 +1,133 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot;
+
+import net.minecraft.init.Blocks;
+import net.minecraft.item.Item;
+
+import java.lang.reflect.Field;
+import java.util.*;
+
+/**
+ * Baritone's settings
+ *
+ * @author leijurv
+ */
+public class Settings {
+    public Setting<Boolean> allowBreak = new Setting<>(true);
+    public Setting<Boolean> allowPlaceThrowaway = new Setting<>(true);
+    /**
+     * It doesn't actually take twenty ticks to place a block, this cost is so high
+     * because we want to generally conserve blocks which might be limited
+     */
+    public Setting<Double> blockPlacementPenalty = new Setting<>(20D);
+    public Setting<Boolean> allowSprint = new Setting<>(true);
+    public Setting<Double> costHeuristic = new <Double>Setting<Double>(4D);
+    public Setting<Boolean> chuckCaching = new Setting<>(false);
+    public Setting<Boolean> allowWaterBucketFall = new Setting<>(true);
+    public Setting<Integer> planningTickLookAhead = new Setting<>(150);
+    public Setting<Boolean> chatDebug = new Setting<>(true);
+    public Setting<Boolean> chatControl = new Setting<>(true); // probably false in impact
+    public Setting<Boolean> renderPath = new Setting<>(true);
+    public Setting<Boolean> fadePath = new Setting<>(false); // give this a better name in the UI, like "better path fps" idk
+    public Setting<Number> pathTimeoutMS = new Setting<>(4000L);
+    public Setting<Boolean> slowPath = new Setting<>(false);
+    public Setting<Number> slowPathTimeDelayMS = new Setting<>(100L);
+    public Setting<Number> slowPathTimeoutMS = new Setting<>(40000L);
+    public Setting<List<Item>> acceptableThrowawayItems = new Setting<>(Arrays.asList(
+            Item.getItemFromBlock(Blocks.DIRT),
+            Item.getItemFromBlock(Blocks.COBBLESTONE),
+            Item.getItemFromBlock(Blocks.NETHERRACK)
+    ));
+    public Setting<Boolean> renderGoal = new Setting<>(true);
+    public Setting<Integer> pathingMaxChunkBorderFetch = new Setting<>(50);
+    public Setting<Double> backtrackCostFavoringCoefficient = new Setting<>(0.9);  // see issue #18
+    public Setting<Float> pathRenderLineWidth = new Setting<>(5F);
+    public Setting<Float> goalRenderLineWidth = new Setting<>(3F);
+
+    public final Map<String, Setting<?>> byName;
+    public final List<Setting<?>> allSettings;
+
+    public class Setting<T> {
+        public T value;
+        private String name;
+        private final Class<T> klass;
+
+        private Setting(T value) {
+            if (value == null) {
+                throw new IllegalArgumentException("Cannot determine value type class from null");
+            }
+            this.value = value;
+            this.klass = (Class<T>) value.getClass();
+        }
+
+        public final <K extends T> K get() {
+            return (K) value;
+        }
+
+        public final String getName() {
+            return name;
+        }
+
+        public Class<T> getValueClass() {
+            return klass;
+        }
+
+        public String toString() {
+            return name + ": " + value;
+        }
+    }
+
+    // here be dragons
+
+    {
+        Field[] temp = getClass().getFields();
+        HashMap<String, Setting<?>> tmpByName = new HashMap<>();
+        List<Setting<?>> tmpAll = new ArrayList<>();
+        try {
+            for (Field field : temp) {
+                if (field.getType().equals(Setting.class)) {
+                    Setting<?> setting = (Setting<? extends Object>) field.get(this);
+                    String name = field.getName();
+                    setting.name = name;
+                    if (tmpByName.containsKey(name)) {
+                        throw new IllegalStateException("Duplicate setting name");
+                    }
+                    tmpByName.put(name, setting);
+                    tmpAll.add(setting);
+                }
+            }
+        } catch (IllegalAccessException e) {
+            throw new RuntimeException(e);
+        }
+        byName = Collections.unmodifiableMap(tmpByName);
+        allSettings = Collections.unmodifiableList(tmpAll);
+    }
+
+    public <T> List<Setting<T>> getByValueType(Class<T> klass) {
+        ArrayList<Setting<T>> result = new ArrayList<>();
+        for (Setting<?> setting : allSettings) {
+            if (setting.klass.equals(klass)) {
+                result.add((Setting<T>) setting);
+            }
+        }
+        return result;
+    }
+
+    Settings() { }
+}

src/main/java/baritone/bot/behavior/Behavior.java

@@ -0,0 +1,95 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.behavior;
+
+import baritone.bot.event.listener.AbstractGameEventListener;
+import baritone.bot.utils.Helper;
+
+/**
+ * A generic bot behavior.
+ *
+ * @author Brady
+ * @since 8/1/2018 6:29 PM
+ */
+public class Behavior implements AbstractGameEventListener, Helper {
+
+    /**
+     * Whether or not this behavior is enabled
+     */
+    private boolean enabled = true;
+
+    /**
+     * Toggles the enabled state of this {@link Behavior}.
+     *
+     * @return The new state.
+     */
+    public final boolean toggle() {
+        return this.setEnabled(!this.enabled);
+    }
+
+    /**
+     * Sets the enabled state of this {@link Behavior}.
+     *
+     * @return The new state.
+     */
+    public final boolean setEnabled(boolean enabled) {
+        boolean newState = getNewState(this.enabled, enabled);
+        if (newState == this.enabled)
+            return this.enabled;
+
+        if (this.enabled = newState) {
+            onStart();
+        } else {
+            onCancel();
+        }
+
+        return this.enabled;
+    }
+
+    /**
+     * Function to determine what the new enabled state of this
+     * {@link Behavior} should be given the old state, and the
+     * proposed state. Intended to be overridden by behaviors
+     * that should always be active, given that the bot itself is
+     * active.
+     *
+     * @param oldState      The old state
+     * @param proposedState The proposed state
+     * @return The new  state
+     */
+    public boolean getNewState(boolean oldState, boolean proposedState) {
+        return proposedState;
+    }
+
+    /**
+     * @return Whether or not this {@link Behavior} is active.
+     */
+    public final boolean isEnabled() {
+        return this.enabled;
+    }
+
+    /**
+     * Called when the state changes from disabled to enabled
+     */
+    public void onStart() {}
+
+    /**
+     * Called when the state changes from enabled to disabled
+     */
+    public void onCancel() {}
+}

src/main/java/baritone/bot/behavior/impl/LookBehavior.java

@@ -0,0 +1,62 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.behavior.impl;
+
+import baritone.bot.behavior.Behavior;
+import baritone.bot.utils.Rotation;
+
+public class LookBehavior extends Behavior {
+
+    public static final LookBehavior INSTANCE = new LookBehavior();
+
+    private LookBehavior() {}
+
+    /**
+     * Target's values are as follows:
+     * <p>
+     * getFirst() -> yaw
+     * getSecond() -> pitch
+     */
+    private Rotation target;
+
+    public void updateTarget(Rotation target) {
+        this.target = target;
+    }
+
+    @Override
+    public void onPlayerUpdate() {
+        if (target != null) {
+            player().rotationYaw = target.getFirst();
+            float oldPitch = player().rotationPitch;
+            float desiredPitch = target.getSecond();
+            player().rotationPitch = desiredPitch;
+            if (desiredPitch == oldPitch) {
+                nudgeToLevel();
+            }
+            target = null;
+        }
+    }
+
+    private void nudgeToLevel() {
+        if (player().rotationPitch < -20) {
+            player().rotationPitch++;
+        } else if (player().rotationPitch > 10) {
+            player().rotationPitch--;
+        }
+    }
+}

src/main/java/baritone/bot/behavior/impl/LookBehaviorUtils.java

@@ -2,33 +2,32 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.behavior;
+package baritone.bot.behavior.impl;
 
-import baritone.api.utils.Rotation;
-import baritone.utils.BlockStateInterface;
-import baritone.utils.Helper;
-import baritone.utils.RayTraceUtils;
-import baritone.utils.Utils;
+import baritone.bot.utils.BlockStateInterface;
+import baritone.bot.utils.Helper;
+import baritone.bot.utils.Rotation;
+import baritone.bot.utils.Utils;
 import net.minecraft.block.BlockFire;
 import net.minecraft.block.state.IBlockState;
 import net.minecraft.util.math.*;
 
 import java.util.Optional;
 
-import static baritone.utils.Utils.DEG_TO_RAD;
+import static baritone.bot.utils.Utils.DEG_TO_RAD;
 
 public final class LookBehaviorUtils implements Helper {
 
@@ -51,10 +50,10 @@ public final class LookBehaviorUtils implements Helper {
      * @return vector of the rotation
      */
     public static Vec3d calcVec3dFromRotation(Rotation rotation) {
-        float f = MathHelper.cos(-rotation.getYaw() * (float) DEG_TO_RAD - (float) Math.PI);
-        float f1 = MathHelper.sin(-rotation.getYaw() * (float) DEG_TO_RAD - (float) Math.PI);
-        float f2 = -MathHelper.cos(-rotation.getPitch() * (float) DEG_TO_RAD);
-        float f3 = MathHelper.sin(-rotation.getPitch() * (float) DEG_TO_RAD);
+        float f = MathHelper.cos(-rotation.getFirst() * (float) DEG_TO_RAD - (float) Math.PI);
+        float f1 = MathHelper.sin(-rotation.getFirst() * (float) DEG_TO_RAD - (float) Math.PI);
+        float f2 = -MathHelper.cos(-rotation.getSecond() * (float) DEG_TO_RAD);
+        float f3 = MathHelper.sin(-rotation.getSecond() * (float) DEG_TO_RAD);
         return new Vec3d((double) (f1 * f2), (double) f3, (double) (f * f2));
     }
 
@@ -71,10 +70,9 @@ public final class LookBehaviorUtils implements Helper {
             return Optional.of(new Rotation(mc.player.rotationYaw, mc.player.rotationPitch + 0.0001f));
         }
         Optional<Rotation> possibleRotation = reachableCenter(pos);
-        //System.out.println("center: " + possibleRotation);
-        if (possibleRotation.isPresent()) {
+        System.out.println("center: " + possibleRotation);
+        if (possibleRotation.isPresent())
             return possibleRotation;
-        }
 
         IBlockState state = BlockStateInterface.get(pos);
         AxisAlignedBB aabb = state.getBoundingBox(mc.world, pos);
@@ -83,13 +81,24 @@ public final class LookBehaviorUtils implements Helper {
             double yDiff = aabb.minY * sideOffset.y + aabb.maxY * (1 - sideOffset.y);
             double zDiff = aabb.minZ * sideOffset.z + aabb.maxZ * (1 - sideOffset.z);
             possibleRotation = reachableOffset(pos, new Vec3d(pos).add(xDiff, yDiff, zDiff));
-            if (possibleRotation.isPresent()) {
+            if (possibleRotation.isPresent())
                 return possibleRotation;
-            }
         }
         return Optional.empty();
     }
 
+    private static RayTraceResult rayTraceTowards(Rotation rotation) {
+        double blockReachDistance = mc.playerController.getBlockReachDistance();
+        Vec3d start = mc.player.getPositionEyes(1.0F);
+        Vec3d direction = calcVec3dFromRotation(rotation);
+        Vec3d end = start.add(
+                direction.x * blockReachDistance,
+                direction.y * blockReachDistance,
+                direction.z * blockReachDistance
+        );
+        return mc.world.rayTraceBlocks(start, end, false, false, true);
+    }
+
     /**
      * Checks if coordinate is reachable with the given block-face rotation offset
      *
@@ -99,7 +108,7 @@ public final class LookBehaviorUtils implements Helper {
      */
     protected static Optional<Rotation> reachableOffset(BlockPos pos, Vec3d offsetPos) {
         Rotation rotation = Utils.calcRotationFromVec3d(mc.player.getPositionEyes(1.0F), offsetPos);
-        RayTraceResult result = RayTraceUtils.rayTraceTowards(rotation);
+        RayTraceResult result = rayTraceTowards(rotation);
         System.out.println(result);
         if (result != null && result.typeOfHit == RayTraceResult.Type.BLOCK) {
             if (result.getBlockPos().equals(pos)) {

src/main/java/baritone/bot/behavior/impl/MemoryBehavior.java

@@ -0,0 +1,185 @@
+package baritone.bot.behavior.impl;
+
+import baritone.bot.behavior.Behavior;
+import baritone.bot.event.events.PacketEvent;
+import net.minecraft.item.ItemStack;
+import net.minecraft.network.Packet;
+import net.minecraft.network.play.client.CPacketCloseWindow;
+import net.minecraft.network.play.client.CPacketPlayerTryUseItemOnBlock;
+import net.minecraft.network.play.server.SPacketCloseWindow;
+import net.minecraft.network.play.server.SPacketOpenWindow;
+import net.minecraft.tileentity.TileEntity;
+import net.minecraft.tileentity.TileEntityLockable;
+import net.minecraft.util.math.BlockPos;
+
+import java.util.*;
+
+/**
+ * @author Brady
+ * @since 8/6/2018 9:47 PM
+ */
+public class MemoryBehavior extends Behavior {
+
+    public static MemoryBehavior INSTANCE = new MemoryBehavior();
+
+    private MemoryBehavior() {}
+
+    /**
+     * Possible future inventories that we will be able to remember
+     */
+    private final List<FutureInventory> futureInventories = new ArrayList<>();
+
+    /**
+     * The current remembered inventories
+     */
+    private final Map<BlockPos, RememberedInventory> rememberedInventories = new HashMap<>();
+
+    @Override
+    public void onPlayerUpdate() {
+        updateInventory();
+    }
+
+    @Override
+    public void onSendPacket(PacketEvent event) {
+        Packet p = event.getPacket();
+
+        switch (event.getState()) {
+            case PRE: {
+                if (p instanceof CPacketPlayerTryUseItemOnBlock) {
+                    CPacketPlayerTryUseItemOnBlock packet = event.cast();
+
+                    TileEntity tileEntity = world().getTileEntity(packet.getPos());
+
+                    // Ensure the TileEntity is a container of some sort
+                    if (tileEntity instanceof TileEntityLockable) {
+
+                        TileEntityLockable lockable = (TileEntityLockable) tileEntity;
+                        int size = lockable.getSizeInventory();
+
+                        this.futureInventories.add(new FutureInventory(System.currentTimeMillis(), size, lockable.getGuiID(), tileEntity.getPos()));
+                    }
+                }
+
+                if (p instanceof CPacketCloseWindow) {
+                    updateInventory();
+                }
+                break;
+            }
+        }
+    }
+
+    @Override
+    public void onReceivePacket(PacketEvent event) {
+        Packet p = event.getPacket();
+
+        switch (event.getState()) {
+            case PRE: {
+                if (p instanceof SPacketOpenWindow) {
+                    SPacketOpenWindow packet = event.cast();
+
+                    // Remove any entries that were created over a second ago, this should make up for INSANE latency
+                    this.futureInventories.removeIf(i -> System.currentTimeMillis() - i.time > 1000);
+
+                    this.futureInventories.stream()
+                            .filter(i -> i.type.equals(packet.getGuiId()) && i.slots == packet.getSlotCount())
+                            .findFirst().ifPresent(matched -> {
+                                // Remove the future inventory
+                                this.futureInventories.remove(matched);
+
+                                // Setup the remembered inventory
+                                RememberedInventory inventory = this.rememberedInventories.computeIfAbsent(matched.pos, pos -> new RememberedInventory());
+                                inventory.windowId = packet.getWindowId();
+                                inventory.size = packet.getSlotCount();
+                    });
+                }
+
+                if (p instanceof SPacketCloseWindow) {
+                    updateInventory();
+                }
+                break;
+            }
+        }
+    }
+
+    private Optional<RememberedInventory> getInventoryFromWindow(int windowId) {
+        return this.rememberedInventories.values().stream().filter(i -> i.windowId == windowId).findFirst();
+    }
+
+    private void updateInventory() {
+        getInventoryFromWindow(player().openContainer.windowId).ifPresent(inventory -> {
+            inventory.items.clear();
+            inventory.items.addAll(player().openContainer.getInventory().subList(0, inventory.size));
+        });
+    }
+
+    public final RememberedInventory getInventoryByPos(BlockPos pos) {
+        return this.rememberedInventories.get(pos);
+    }
+
+    /**
+     * An inventory that we are not yet fully aware of, but are expecting to exist at some point in the future.
+     */
+    private static final class FutureInventory {
+
+        /**
+         * The time that we initially expected the inventory to be provided, in milliseconds
+         */
+        private final long time;
+
+        /**
+         * The amount of slots in the inventory
+         */
+        private final int slots;
+
+        /**
+         * The type of inventory
+         */
+        private final String type;
+
+        /**
+         * The position of the inventory container
+         */
+        private final BlockPos pos;
+
+        private FutureInventory(long time, int slots, String type, BlockPos pos) {
+            this.time = time;
+            this.slots = slots;
+            this.type = type;
+            this.pos = pos;
+        }
+    }
+
+    /**
+     * An inventory that we are aware of.
+     * <p>
+     * Associated with a {@link BlockPos} in {@link MemoryBehavior#rememberedInventories}.
+     */
+    public static class RememberedInventory {
+
+        /**
+         * The list of items in the inventory
+         */
+        private final List<ItemStack> items;
+
+        /**
+         * The last known window ID of the inventory
+         */
+        private int windowId;
+
+        /**
+         * The size of the inventory
+         */
+        private int size;
+
+        private RememberedInventory() {
+            this.items = new ArrayList<>();
+        }
+
+        /**
+         * @return The list of items in the inventory
+         */
+        public final List<ItemStack> getItems() {
+            return this.items;
+        }
+    }
+}

src/main/java/baritone/bot/behavior/impl/PathingBehavior.java

@@ -0,0 +1,295 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.behavior.impl;
+
+import baritone.bot.Baritone;
+import baritone.bot.behavior.Behavior;
+import baritone.bot.event.events.RenderEvent;
+import baritone.bot.event.events.TickEvent;
+import baritone.bot.pathing.calc.AStarPathFinder;
+import baritone.bot.pathing.calc.AbstractNodeCostSearch;
+import baritone.bot.pathing.calc.IPathFinder;
+import baritone.bot.pathing.goals.Goal;
+import baritone.bot.pathing.path.IPath;
+import baritone.bot.pathing.path.PathExecutor;
+import baritone.bot.utils.PathRenderer;
+import net.minecraft.util.math.BlockPos;
+
+import java.awt.*;
+import java.util.Collections;
+import java.util.Optional;
+
+public class PathingBehavior extends Behavior {
+
+    public static final PathingBehavior INSTANCE = new PathingBehavior();
+
+    private PathingBehavior() {
+    }
+
+    private PathExecutor current;
+    private PathExecutor next;
+
+    private Goal goal;
+
+    private volatile boolean isPathCalcInProgress;
+    private final Object pathCalcLock = new Object();
+
+    private final Object pathPlanLock = new Object();
+
+    @Override
+    public void onTick(TickEvent event) {
+        if (event.getType() == TickEvent.Type.OUT) {
+            current = null;
+            next = null;
+            return;
+        }
+        if (current == null) {
+            return;
+        }
+        boolean safe = current.onTick(event);
+        synchronized (pathPlanLock) {
+            if (current.failed() || current.finished()) {
+                current = null;
+                if (goal == null || goal.isInGoal(playerFeet())) {
+                    displayChatMessageRaw("All done. At " + goal);
+                    next = null;
+                    return;
+                }
+                if (next != null && !next.getPath().positions().contains(playerFeet())) {
+                    // if the current path failed, we may not actually be on the next one, so make sure
+                    displayChatMessageRaw("Discarding next path as it does not contain current position");
+                    // for example if we had a nicely planned ahead path that starts where current ends
+                    // that's all fine and good
+                    // but if we fail in the middle of current
+                    // we're nowhere close to our planned ahead path
+                    // so need to discard it sadly.
+                    next = null;
+                }
+                if (next != null) {
+                    displayChatMessageRaw("Continuing on to planned next path");
+                    current = next;
+                    next = null;
+                    return;
+                }
+                // at this point, current just ended, but we aren't in the goal and have no plan for the future
+                synchronized (pathCalcLock) {
+                    if (isPathCalcInProgress) {
+                        // if we aren't calculating right now
+                        return;
+                    }
+                    findPathInNewThread(playerFeet(), true, Optional.empty());
+                }
+                return;
+            }
+            // at this point, we know current is in progress
+            if (safe) {
+                // a movement just ended
+                if (next != null) {
+                    if (next.getPath().positions().contains(playerFeet())) {
+                        // jump directly onto the next path
+                        displayChatMessageRaw("Splicing into planned next path early...");
+                        current = next;
+                        next = null;
+                        return;
+                    }
+                }
+            }
+            synchronized (pathCalcLock) {
+                if (isPathCalcInProgress) {
+                    // if we aren't calculating right now
+                    return;
+                }
+                if (next != null) {
+                    // and we have no plan for what to do next
+                    return;
+                }
+                if (goal == null || goal.isInGoal(current.getPath().getDest())) {
+                    // and this path dosen't get us all the way there
+                    return;
+                }
+                if (ticksRemainingInSegment().get() < Baritone.settings().planningTickLookAhead.get()) {
+                    // and this path has 5 seconds or less left
+                    displayChatMessageRaw("Path almost over. Planning ahead...");
+                    findPathInNewThread(current.getPath().getDest(), false, Optional.of(current.getPath()));
+                }
+            }
+        }
+    }
+
+    public Optional<Double> ticksRemainingInSegment() {
+        if (current == null) {
+            return Optional.empty();
+        }
+        return Optional.of(current.getPath().ticksRemainingFrom(current.getPosition()));
+    }
+
+    public void setGoal(Goal goal) {
+        this.goal = goal;
+    }
+
+    public PathExecutor getCurrent() {
+        return current;
+    }
+
+    public PathExecutor getNext() {return next;}
+
+    public Optional<IPath> getPath() {
+        return Optional.ofNullable(current).map(PathExecutor::getPath);
+    }
+
+    public void cancel() {
+        current = null;
+        next = null;
+        Baritone.INSTANCE.getInputOverrideHandler().clearAllKeys();
+    }
+
+    public void path() {
+        synchronized (pathPlanLock) {
+            if (current != null) {
+                displayChatMessageRaw("Currently executing a path. Please cancel it first.");
+                return;
+            }
+            synchronized (pathCalcLock) {
+                if (isPathCalcInProgress) {
+                    return;
+                }
+                findPathInNewThread(playerFeet(), true, Optional.empty());
+            }
+        }
+    }
+
+    /**
+     * In a new thread, pathfind to target blockpos
+     *
+     * @param start
+     * @param talkAboutIt
+     */
+    private void findPathInNewThread(final BlockPos start, final boolean talkAboutIt, final Optional<IPath> previous) {
+        synchronized (pathCalcLock) {
+            if (isPathCalcInProgress) {
+                throw new IllegalStateException("Already doing it");
+            }
+            isPathCalcInProgress = true;
+        }
+        new Thread(() -> {
+            if (talkAboutIt) {
+                displayChatMessageRaw("Starting to search for path from " + start + " to " + goal);
+            }
+
+            findPath(start, previous).map(IPath::cutoffAtLoadedChunks).map(PathExecutor::new).ifPresent(path -> {
+                synchronized (pathPlanLock) {
+                    if (current == null) {
+                        current = path;
+                    } else {
+                        if (next == null) {
+                            next = path;
+                        } else {
+                            throw new IllegalStateException("I have no idea what to do with this path");
+                        }
+                    }
+                }
+            });
+            if (talkAboutIt && current != null && current.getPath() != null) {
+                if (goal == null || goal.isInGoal(current.getPath().getDest())) {
+                    displayChatMessageRaw("Finished finding a path from " + start + " to " + goal + ". " + current.getPath().getNumNodesConsidered() + " nodes considered");
+                } else {
+                    displayChatMessageRaw("Found path segment from " + start + " towards " + goal + ". " + current.getPath().getNumNodesConsidered() + " nodes considered");
+
+                }
+            }
+            synchronized (pathCalcLock) {
+                isPathCalcInProgress = false;
+            }
+        }).start();
+    }
+
+    /**
+     * Actually do the pathing
+     *
+     * @param start
+     * @return
+     */
+    private Optional<IPath> findPath(BlockPos start, Optional<IPath> previous) {
+        if (goal == null) {
+            displayChatMessageRaw("no goal");
+            return Optional.empty();
+        }
+        try {
+            IPathFinder pf = new AStarPathFinder(start, goal, previous.map(IPath::positions));
+            return pf.calculate();
+        } catch (Exception e) {
+            displayChatMessageRaw("Exception: " + e);
+            e.printStackTrace();
+            return Optional.empty();
+        }
+    }
+
+    @Override
+    public void onRenderPass(RenderEvent event) {
+        // System.out.println("Render passing");
+        // System.out.println(event.getPartialTicks());
+        float partialTicks = event.getPartialTicks();
+        if (goal != null && Baritone.settings().renderGoal.value) {
+            PathRenderer.drawLitDankGoalBox(player(), goal, partialTicks, Color.GREEN);
+        }
+        if (!Baritone.settings().renderPath.get()) {
+            return;
+        }
+
+        long start = System.nanoTime();
+
+
+        PathExecutor current = this.current; // this should prevent most race conditions?
+        PathExecutor next = this.next; // like, now it's not possible for current!=null to be true, then suddenly false because of another thread
+        // TODO is this enough, or do we need to acquire a lock here?
+        // TODO benchmark synchronized in render loop
+
+        // Render the current path, if there is one
+        if (current != null && current.getPath() != null) {
+            int renderBegin = Math.max(current.getPosition() - 3, 0);
+            PathRenderer.drawPath(current.getPath(), renderBegin, player(), partialTicks, Color.RED, Baritone.settings().fadePath.get(), 10, 20);
+        }
+        if (next != null && next.getPath() != null) {
+            PathRenderer.drawPath(next.getPath(), 0, player(), partialTicks, Color.GREEN, Baritone.settings().fadePath.get(), 10, 20);
+        }
+
+        long split = System.nanoTime();
+        if (current != null) {
+            PathRenderer.drawManySelectionBoxes(player(), current.toBreak(), partialTicks, Color.RED);
+            PathRenderer.drawManySelectionBoxes(player(), current.toPlace(), partialTicks, Color.GREEN);
+            PathRenderer.drawManySelectionBoxes(player(), current.toWalkInto(), partialTicks, Color.MAGENTA);
+        }
+
+        // If there is a path calculation currently running, render the path calculation process
+        AbstractNodeCostSearch.getCurrentlyRunning().ifPresent(currentlyRunning -> {
+            currentlyRunning.bestPathSoFar().ifPresent(p -> {
+                PathRenderer.drawPath(p, 0, player(), partialTicks, Color.BLUE, Baritone.settings().fadePath.get(), 10, 20);
+                currentlyRunning.pathToMostRecentNodeConsidered().ifPresent(mr -> {
+
+                    PathRenderer.drawPath(mr, 0, player(), partialTicks, Color.CYAN, Baritone.settings().fadePath.get(), 10, 20);
+                    PathRenderer.drawManySelectionBoxes(player(), Collections.singletonList(mr.getDest()), partialTicks, Color.CYAN);
+                });
+            });
+        });
+        long end = System.nanoTime();
+        //System.out.println((end - split) + " " + (split - start));
+        // if (end - start > 0)
+        //   System.out.println("Frame took " + (split - start) + " " + (end - split));
+
+    }
+}

src/main/java/baritone/bot/chunk/CachedChunk.java

@@ -0,0 +1,131 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.chunk;
+
+import baritone.bot.utils.pathing.IBlockTypeAccess;
+import baritone.bot.utils.pathing.PathingBlockType;
+
+import java.util.BitSet;
+
+/**
+ * @author Brady
+ * @since 8/3/2018 1:04 AM
+ */
+public final class CachedChunk implements IBlockTypeAccess {
+
+    /**
+     * The size of the chunk data in bits. Equal to 16 KiB.
+     * <p>
+     * Chunks are 16x16x256, each block requires 2 bits.
+     */
+    public static final int SIZE = 2 * 16 * 16 * 256;
+
+    /**
+     * The size of the chunk data in bytes. Equal to 16 KiB.
+     */
+    public static final int SIZE_IN_BYTES = SIZE / 8;
+
+    /**
+     * An array of just 0s with the length of {@link CachedChunk#SIZE_IN_BYTES}
+     */
+    public static final byte[] EMPTY_CHUNK = new byte[SIZE_IN_BYTES];
+
+    /**
+     * The chunk x coordinate
+     */
+    private final int x;
+
+    /**
+     * The chunk z coordinate
+     */
+    private final int z;
+
+    /**
+     * The actual raw data of this packed chunk.
+     * <p>
+     * Each block is expressed as 2 bits giving a total of 16 KiB
+     */
+    private final BitSet data;
+
+    CachedChunk(int x, int z, BitSet data) {
+        validateSize(data);
+
+        this.x = x;
+        this.z = z;
+        this.data = data;
+    }
+
+    @Override
+    public final PathingBlockType getBlockType(int x, int y, int z) {
+        int index = getPositionIndex(x, y, z);
+        return PathingBlockType.fromBits(data.get(index), data.get(index + 1));
+    }
+
+    void updateContents(BitSet data) {
+        validateSize(data);
+
+        for (int i = 0; i < data.length(); i++)
+            this.data.set(i, data.get(i));
+    }
+
+    /**
+     * @return Thee chunk x coordinat
+     */
+    public final int getX() {
+        return this.x;
+    }
+
+    /**
+     * @return The chunk z coordinate
+     */
+    public final int getZ() {
+        return this.z;
+    }
+
+    /**
+     * @return Returns the raw packed chunk data as a byte array
+     */
+    public final byte[] toByteArray() {
+        return this.data.toByteArray();
+    }
+
+    /**
+     * Returns the raw bit index of the specified position
+     *
+     * @param x The x position
+     * @param y The y position
+     * @param z The z position
+     * @return The bit index
+     */
+    public static int getPositionIndex(int x, int y, int z) {
+        return (x + (z << 4) + (y << 8)) * 2;
+    }
+
+    /**
+     * Validates the size of an input {@link BitSet} containing the raw
+     * packed chunk data. Sizes that exceed {@link CachedChunk#SIZE} are
+     * considered invalid, and thus, an exception will be thrown.
+     *
+     * @param data The raw data
+     * @throws IllegalArgumentException if the bitset size exceeds the maximum size
+     */
+    private static void validateSize(BitSet data) {
+        if (data.size() > SIZE)
+            throw new IllegalArgumentException("BitSet of invalid length provided");
+    }
+}

src/main/java/baritone/bot/chunk/CachedRegion.java

@@ -0,0 +1,180 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.chunk;
+
+import baritone.bot.utils.pathing.PathingBlockType;
+import baritone.bot.utils.GZIPUtils;
+
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.Arrays;
+import java.util.BitSet;
+import java.util.function.Consumer;
+import java.util.zip.GZIPOutputStream;
+
+/**
+ * @author Brady
+ * @since 8/3/2018 9:35 PM
+ */
+public final class CachedRegion implements ICachedChunkAccess {
+
+    /**
+     * All of the chunks in this region: A 32x32 array of them.
+     */
+    private final CachedChunk[][] chunks = new CachedChunk[32][32];
+
+    /**
+     * The region x coordinate
+     */
+    private final int x;
+
+    /**
+     * The region z coordinate
+     */
+    private final int z;
+
+    CachedRegion(int x, int z) {
+        this.x = x;
+        this.z = z;
+    }
+
+    @Override
+    public final PathingBlockType getBlockType(int x, int y, int z) {
+        CachedChunk chunk = this.getChunk(x >> 4, z >> 4);
+        if (chunk != null) {
+            return chunk.getBlockType(x & 15, y, z & 15);
+        }
+        return null;
+    }
+
+    @Override
+    public final void updateCachedChunk(int chunkX, int chunkZ, BitSet data) {
+        CachedChunk chunk = this.getChunk(chunkX, chunkZ);
+        if (chunk == null) {
+            this.chunks[chunkX][chunkZ] = new CachedChunk(chunkX, chunkZ, data);
+        } else {
+            chunk.updateContents(data);
+        }
+    }
+
+    private CachedChunk getChunk(int chunkX, int chunkZ) {
+        return this.chunks[chunkX][chunkZ];
+    }
+
+    public void forEachChunk(Consumer<CachedChunk> consumer) {
+        for (int x = 0; x < 32; x++) {
+            for (int z = 0; z < 32; z++) {
+                CachedChunk chunk = getChunk(x, z);
+                if (chunk != null) {
+                    consumer.accept(chunk);
+                }
+            }
+        }
+    }
+
+    public final void save(String directory) {
+        try {
+            Path path = Paths.get(directory);
+            if (!Files.exists(path))
+                Files.createDirectories(path);
+
+            Path regionFile = getRegionFile(path, this.x, this.z);
+            if (!Files.exists(regionFile))
+                Files.createFile(regionFile);
+            try (FileOutputStream fileOut = new FileOutputStream(regionFile.toFile()); GZIPOutputStream out = new GZIPOutputStream(fileOut)) {
+                for (int z = 0; z < 32; z++) {
+                    for (int x = 0; x < 32; x++) {
+                        CachedChunk chunk = this.chunks[x][z];
+                        if (chunk == null) {
+                            out.write(CachedChunk.EMPTY_CHUNK);
+                        } else {
+                            byte[] chunkBytes = chunk.toByteArray();
+                            out.write(chunkBytes);
+                            // Messy, but fills the empty 0s that should be trailing to fill up the space.
+                            out.write(new byte[CachedChunk.SIZE_IN_BYTES - chunkBytes.length]);
+                        }
+                    }
+                }
+            }
+        } catch (IOException ignored) {}
+    }
+
+    public void load(String directory) {
+        try {
+            Path path = Paths.get(directory);
+            if (!Files.exists(path))
+                Files.createDirectories(path);
+
+            Path regionFile = getRegionFile(path, this.x, this.z);
+            if (!Files.exists(regionFile))
+                return;
+
+            byte[] decompressed;
+            try (FileInputStream in = new FileInputStream(regionFile.toFile())) {
+                decompressed = GZIPUtils.decompress(in);
+            }
+
+            if (decompressed == null)
+                return;
+
+            for (int z = 0; z < 32; z++) {
+                for (int x = 0; x < 32; x++) {
+                    int index = (x + (z << 5)) * CachedChunk.SIZE_IN_BYTES;
+                    byte[] bytes = Arrays.copyOfRange(decompressed, index, index + CachedChunk.SIZE_IN_BYTES);
+                    if (isAllZeros(bytes)) {
+                        this.chunks[x][z] = null;
+                    } else {
+                        BitSet bits = BitSet.valueOf(bytes);
+                        updateCachedChunk(x, z, bits);
+                    }
+                }
+            }
+        } catch (IOException ignored) {}
+    }
+
+    private static boolean isAllZeros(final byte[] array) {
+        for (byte b : array) {
+            if (b != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    /**
+     * @return The region x coordinate
+     */
+    public final int getX() {
+        return this.x;
+    }
+
+    /**
+     * @return The region z coordinate
+     */
+    public final int getZ() {
+        return this.z;
+    }
+
+    private static Path getRegionFile(Path cacheDir, int regionX, int regionZ) {
+        return Paths.get(cacheDir.toString(), "r." + regionX + "." + regionZ + ".bcr");
+    }
+}

src/main/java/baritone/bot/chunk/CachedWorld.java

@@ -0,0 +1,144 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.chunk;
+
+import baritone.bot.utils.pathing.PathingBlockType;
+import it.unimi.dsi.fastutil.longs.Long2ObjectMap;
+import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap;
+
+import java.util.BitSet;
+import java.util.function.Consumer;
+
+/**
+ * @author Brady
+ * @since 8/4/2018 12:02 AM
+ */
+public final class CachedWorld implements ICachedChunkAccess {
+
+    /**
+     * The maximum number of regions in any direction from (0,0)
+     */
+    private static final int REGION_MAX = 117188;
+
+    /**
+     * A map of all of the cached regions.
+     */
+    private Long2ObjectMap<CachedRegion> cachedRegions = new Long2ObjectOpenHashMap<>();
+
+    /**
+     * The directory that the cached region files are saved to
+     */
+    private final String directory;
+
+    public CachedWorld(String directory) {
+        this.directory = directory;
+        // Insert an invalid region element
+        cachedRegions.put(0, null);
+    }
+
+    @Override
+    public final PathingBlockType getBlockType(int x, int y, int z) {
+        CachedRegion region = getRegion(x >> 9, z >> 9);
+        if (region != null) {
+            return region.getBlockType(x & 511, y, z & 511);
+        }
+        return null;
+    }
+
+    @Override
+    public final void updateCachedChunk(int chunkX, int chunkZ, BitSet data) {
+        CachedRegion region = getOrCreateRegion(chunkX >> 5, chunkZ >> 5);
+        if (region != null) {
+            region.updateCachedChunk(chunkX & 31, chunkZ & 31, data);
+        }
+    }
+
+    public final void save() {
+        this.cachedRegions.values().forEach(region -> {
+            if (region != null)
+                region.save(this.directory);
+        });
+    }
+
+    public final void load() {
+        this.cachedRegions.values().forEach(region -> {
+            if (region != null)
+                region.load(this.directory);
+        });
+    }
+
+    /**
+     * Returns the region at the specified region coordinates
+     *
+     * @param regionX The region X coordinate
+     * @param regionZ The region Z coordinate
+     * @return The region located at the specified coordinates
+     */
+    public final CachedRegion getRegion(int regionX, int regionZ) {
+        return cachedRegions.get(getRegionID(regionX, regionZ));
+    }
+
+    /**
+     * Returns the region at the specified region coordinates. If a
+     * region is not found, then a new one is created.
+     *
+     * @param regionX The region X coordinate
+     * @param regionZ The region Z coordinate
+     * @return The region located at the specified coordinates
+     */
+    CachedRegion getOrCreateRegion(int regionX, int regionZ) {
+        return cachedRegions.computeIfAbsent(getRegionID(regionX, regionZ), id -> {
+            CachedRegion newRegion = new CachedRegion(regionX, regionZ);
+            newRegion.load(this.directory);
+            return newRegion;
+        });
+    }
+
+    public void forEachRegion(Consumer<CachedRegion> consumer) {
+        this.cachedRegions.forEach((id, r) -> {
+            if (r != null)
+                consumer.accept(r);
+        });
+    }
+
+    /**
+     * Returns the region ID based on the region coordinates. 0 will be
+     * returned if the specified region coordinates are out of bounds.
+     *
+     * @param regionX The region X coordinate
+     * @param regionZ The region Z coordinate
+     * @return The region ID
+     */
+    private long getRegionID(int regionX, int regionZ) {
+        if (!isRegionInWorld(regionX, regionZ))
+            return 0;
+
+        return (long) regionX & 0xFFFFFFFFL | ((long) regionZ & 0xFFFFFFFFL) << 32;
+    }
+
+    /**
+     * Returns whether or not the specified region coordinates is within the world bounds.
+     *
+     * @param regionX The region X coordinate
+     * @param regionZ The region Z coordinate
+     * @return Whether or not the region is in world bounds
+     */
+    private boolean isRegionInWorld(int regionX, int regionZ) {
+        return regionX <= REGION_MAX && regionX >= -REGION_MAX && regionZ <= REGION_MAX && regionZ >= -REGION_MAX;
+    }
+}

src/main/java/baritone/bot/chunk/CachedWorldProvider.java

@@ -0,0 +1,98 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.chunk;
+
+import baritone.bot.utils.Helper;
+import baritone.launch.mixins.accessor.IAnvilChunkLoader;
+import baritone.launch.mixins.accessor.IChunkProviderServer;
+import net.minecraft.client.multiplayer.WorldClient;
+import net.minecraft.server.integrated.IntegratedServer;
+import net.minecraft.world.WorldServer;
+
+import java.io.File;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.HashMap;
+import java.util.Map;
+import java.util.function.Consumer;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+
+/**
+ * @author Brady
+ * @since 8/4/2018 11:06 AM
+ */
+public enum CachedWorldProvider implements Helper {
+
+    INSTANCE;
+
+    private static final Pattern REGION_REGEX = Pattern.compile("r\\.(-?[0-9]+)\\.(-?[0-9]+)\\.bcr");
+
+    private final Map<String, CachedWorld> singlePlayerWorldCache = new HashMap<>();
+
+    private CachedWorld currentWorld;
+
+    public final CachedWorld getCurrentWorld() {
+        return this.currentWorld;
+    }
+
+    public final void initWorld(WorldClient world) {
+        IntegratedServer integratedServer;
+        if ((integratedServer = mc.getIntegratedServer()) != null) {
+
+            WorldServer localServerWorld = integratedServer.getWorld(world.provider.getDimensionType().getId());
+            IChunkProviderServer provider = (IChunkProviderServer) localServerWorld.getChunkProvider();
+            IAnvilChunkLoader loader = (IAnvilChunkLoader) provider.getChunkLoader();
+
+            Path dir = new File(new File(loader.getChunkSaveLocation(), "region"), "cache").toPath();
+            if (!Files.exists(dir)) {
+                try {
+                    Files.createDirectories(dir);
+                } catch (IOException ignored) {}
+            }
+
+            this.currentWorld = this.singlePlayerWorldCache.computeIfAbsent(dir.toString(), CachedWorld::new);
+
+            try {
+                Files.list(dir).forEach(path -> {
+                    String file = path.getFileName().toString();
+                    Matcher matcher = REGION_REGEX.matcher(file);
+                    if (matcher.matches()) {
+                        int rx = Integer.parseInt(matcher.group(1));
+                        int ry = Integer.parseInt(matcher.group(2));
+                        // Recognize the region for when we load from file
+                        this.currentWorld.getOrCreateRegion(rx, ry);
+                    }
+                });
+            } catch (Exception ignored) {}
+
+            this.currentWorld.load();
+        }
+        // TODO: Store server worlds
+    }
+
+    public final void closeWorld() {
+        this.currentWorld = null;
+    }
+
+    public final void ifWorldLoaded(Consumer<CachedWorld> currentWorldConsumer) {
+        if (this.currentWorld != null)
+            currentWorldConsumer.accept(this.currentWorld);
+    }
+}

src/main/java/baritone/bot/chunk/ChunkPacker.java

@@ -0,0 +1,78 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.chunk;
+
+import baritone.bot.pathing.movement.MovementHelper;
+import baritone.bot.utils.pathing.PathingBlockType;
+import baritone.bot.utils.BlockStateInterface;
+import baritone.bot.utils.Helper;
+import net.minecraft.block.Block;
+import net.minecraft.block.BlockAir;
+import net.minecraft.block.state.IBlockState;
+import net.minecraft.util.math.BlockPos;
+import net.minecraft.world.chunk.Chunk;
+
+import java.util.BitSet;
+
+import static net.minecraft.block.Block.NULL_AABB;
+
+/**
+ * @author Brady
+ * @since 8/3/2018 1:09 AM
+ */
+public final class ChunkPacker implements Helper {
+
+    private ChunkPacker() {}
+
+    public static BitSet createPackedChunk(Chunk chunk) {
+        BitSet bitSet = new BitSet(CachedChunk.SIZE);
+        try {
+            for (int y = 0; y < 256; y++) {
+                for (int z = 0; z < 16; z++) {
+                    for (int x = 0; x < 16; x++) {
+                        int index = CachedChunk.getPositionIndex(x, y, z);
+                        boolean[] bits = getPathingBlockType(new BlockPos(x, y, z), chunk.getBlockState(x, y, z)).getBits();
+                        bitSet.set(index, bits[0]);
+                        bitSet.set(index + 1, bits[1]);
+                    }
+                }
+            }
+        } catch (Exception e) {
+            e.printStackTrace();
+        }
+        return bitSet;
+    }
+
+    private static PathingBlockType getPathingBlockType(BlockPos pos, IBlockState state) {
+        Block block = state.getBlock();
+
+        if (BlockStateInterface.isWater(block)) {
+            return PathingBlockType.WATER;
+        }
+
+        if (MovementHelper.avoidWalkingInto(block)) {
+            return PathingBlockType.AVOID;
+        }
+
+        if (block instanceof BlockAir || state.getCollisionBoundingBox(mc.world, pos) == NULL_AABB) {
+            return PathingBlockType.AIR;
+        }
+
+        return PathingBlockType.SOLID;
+    }
+}

src/main/java/baritone/bot/chunk/ICachedChunkAccess.java

@@ -2,31 +2,30 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.cache;
+package baritone.bot.chunk;
+
+import baritone.bot.utils.pathing.IBlockTypeAccess;
+
+import java.util.BitSet;
 
 /**
  * @author Brady
- * @since 9/24/2018
+ * @since 8/4/2018 1:10 AM
  */
-public interface IWorldProvider {
+public interface ICachedChunkAccess extends IBlockTypeAccess {
 
-    /**
-     * Returns the data of the currently loaded world
-     *
-     * @return The current world data
-     */
-    IWorldData getCurrentWorld();
+    void updateCachedChunk(int chunkX, int chunkZ, BitSet data);
 }

src/main/java/baritone/bot/event/GameEventHandler.java

@@ -0,0 +1,189 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.event;
+
+import baritone.bot.Baritone;
+import baritone.bot.behavior.Behavior;
+import baritone.bot.chunk.CachedWorld;
+import baritone.bot.chunk.CachedWorldProvider;
+import baritone.bot.chunk.ChunkPacker;
+import baritone.bot.event.events.*;
+import baritone.bot.event.events.type.EventState;
+import baritone.bot.event.listener.IGameEventListener;
+import baritone.bot.utils.Helper;
+import baritone.bot.utils.InputOverrideHandler;
+import net.minecraft.client.renderer.BufferBuilder;
+import net.minecraft.client.renderer.GlStateManager;
+import net.minecraft.client.renderer.Tessellator;
+import net.minecraft.client.renderer.vertex.DefaultVertexFormats;
+import net.minecraft.client.settings.KeyBinding;
+import org.lwjgl.input.Keyboard;
+
+import java.util.function.Consumer;
+
+/**
+ * @author Brady
+ * @since 7/31/2018 11:04 PM
+ */
+public final class GameEventHandler implements IGameEventListener, Helper {
+
+    @Override
+    public final void onTick(TickEvent event) {
+        dispatch(behavior -> behavior.onTick(event));
+    }
+
+    @Override
+    public void onPlayerUpdate() {
+        dispatch(Behavior::onPlayerUpdate);
+    }
+
+    @Override
+    public void onProcessKeyBinds() {
+        InputOverrideHandler inputHandler = Baritone.INSTANCE.getInputOverrideHandler();
+
+        // Simulate the key being held down this tick
+        for (InputOverrideHandler.Input input : InputOverrideHandler.Input.values()) {
+            KeyBinding keyBinding = input.getKeyBinding();
+
+            if (inputHandler.isInputForcedDown(keyBinding) && !keyBinding.isKeyDown()) {
+                int keyCode = keyBinding.getKeyCode();
+
+                if (keyCode < Keyboard.KEYBOARD_SIZE)
+                    KeyBinding.onTick(keyCode < 0 ? keyCode + 100 : keyCode);
+            }
+        }
+
+        dispatch(Behavior::onProcessKeyBinds);
+    }
+
+    @Override
+    public void onSendChatMessage(ChatEvent event) {
+        dispatch(behavior -> behavior.onSendChatMessage(event));
+    }
+
+    @Override
+    public void onChunkEvent(ChunkEvent event) {
+        EventState state = event.getState();
+        ChunkEvent.Type type = event.getType();
+
+        boolean isPostPopulate = state == EventState.POST
+                && type == ChunkEvent.Type.POPULATE;
+
+        // Whenever the server sends us to another dimension, chunks are unloaded
+        // technically after the new world has been loaded, so we perform a check
+        // to make sure the chunk being unloaded is already loaded.
+        boolean isPreUnload = state == EventState.PRE
+                && type == ChunkEvent.Type.UNLOAD
+                && mc.world.getChunkProvider().isChunkGeneratedAt(event.getX(), event.getZ());
+
+        if (Baritone.settings().chuckCaching.get()) {
+            if (isPostPopulate || isPreUnload) {
+                CachedWorldProvider.INSTANCE.ifWorldLoaded(world ->
+                        world.updateCachedChunk(event.getX(), event.getZ(),
+                                ChunkPacker.createPackedChunk(mc.world.getChunk(event.getX(), event.getZ()))));
+            }
+        }
+
+        dispatch(behavior -> behavior.onChunkEvent(event));
+    }
+
+    @Override
+    public void onRenderPass(RenderEvent event) {
+        /*
+        CachedWorldProvider.INSTANCE.ifWorldLoaded(world -> world.forEachRegion(region -> region.forEachChunk(chunk -> {
+            drawChunkLine(region.getX() * 512 + chunk.getX() * 16, region.getZ() * 512 + chunk.getZ() * 16, event.getPartialTicks());
+        })));
+        */
+
+        dispatch(behavior -> behavior.onRenderPass(event));
+    }
+
+    @Override
+    public void onWorldEvent(WorldEvent event) {
+        if (Baritone.settings().chuckCaching.get()) {
+            CachedWorldProvider cache = CachedWorldProvider.INSTANCE;
+
+            switch (event.getState()) {
+                case PRE:
+                    cache.ifWorldLoaded(CachedWorld::save);
+                    break;
+                case POST:
+                    cache.closeWorld();
+                    if (event.getWorld() != null)
+                        cache.initWorld(event.getWorld());
+                    break;
+            }
+        }
+
+        dispatch(behavior -> behavior.onWorldEvent(event));
+    }
+
+    @Override
+    public void onSendPacket(PacketEvent event) {
+        dispatch(behavior -> behavior.onSendPacket(event));
+    }
+
+    @Override
+    public void onReceivePacket(PacketEvent event) {
+        dispatch(behavior -> behavior.onReceivePacket(event));
+    }
+
+    private void dispatch(Consumer<Behavior> dispatchFunction) {
+        Baritone.INSTANCE.getBehaviors().stream().filter(Behavior::isEnabled).forEach(dispatchFunction);
+    }
+
+    private void drawChunkLine(int posX, int posZ, float partialTicks) {
+        GlStateManager.enableBlend();
+        GlStateManager.tryBlendFuncSeparate(770, 771, 1, 0);
+        GlStateManager.color(1.0F, 1.0F, 0.0F, 0.4F);
+        GlStateManager.glLineWidth(2.0F);
+        GlStateManager.disableTexture2D();
+
+        Tessellator tessellator = Tessellator.getInstance();
+        BufferBuilder buffer = tessellator.getBuffer();
+        double d0 = mc.getRenderManager().viewerPosX;
+        double d1 = mc.getRenderManager().viewerPosY;
+        double d2 = mc.getRenderManager().viewerPosZ;
+        buffer.begin(3, DefaultVertexFormats.POSITION);
+        buffer.pos(posX - d0, 0 - d1, posZ - d2).endVertex();
+        buffer.pos(posX - d0, 256 - d1, posZ - d2).endVertex();
+        tessellator.draw();
+
+        GlStateManager.enableDepth();
+        GlStateManager.depthMask(true);
+        GlStateManager.enableTexture2D();
+        GlStateManager.disableBlend();
+    }
+}

src/main/java/baritone/bot/event/events/ChatEvent.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
-import baritone.api.event.events.type.Cancellable;
+import baritone.bot.event.events.type.Cancellable;
 
 /**
  * @author Brady

src/main/java/baritone/bot/event/events/ChunkEvent.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
-import baritone.api.event.events.type.EventState;
+import baritone.bot.event.events.type.EventState;
 
 /**
  * @author Brady

src/main/java/baritone/bot/event/events/PacketEvent.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
-import baritone.api.event.events.type.EventState;
+import baritone.bot.event.events.type.EventState;
 import net.minecraft.network.Packet;
 
 /**

src/main/java/baritone/bot/event/events/RenderEvent.java

@@ -2,20 +2,20 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
 /**
  * @author Brady

src/main/java/baritone/bot/event/events/TickEvent.java

@@ -2,43 +2,31 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
-import baritone.api.event.events.type.EventState;
+import baritone.bot.event.events.type.EventState;
 
 public final class TickEvent {
 
     private final EventState state;
     private final Type type;
-    private final int count;
-
-    private static int overallTickCount;
 
     public TickEvent(EventState state, Type type) {
         this.state = state;
         this.type = type;
-        this.count = incrementCount();
-    }
-
-    private static synchronized int incrementCount() {
-        return overallTickCount++;
-    }
-
-    public int getCount() {
-        return count;
     }
 
     public Type getType() {

src/main/java/baritone/bot/event/events/WorldEvent.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events;
+package baritone.bot.event.events;
 
-import baritone.api.event.events.type.EventState;
+import baritone.bot.event.events.type.EventState;
 import net.minecraft.client.multiplayer.WorldClient;
 
 /**

src/main/java/baritone/bot/event/events/type/Cancellable.java

@@ -2,20 +2,20 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events.type;
+package baritone.bot.event.events.type;
 
 /**
  * @author Brady

src/main/java/baritone/bot/event/events/type/EventState.java

@@ -2,20 +2,20 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.events.type;
+package baritone.bot.event.events.type;
 
 /**
  * @author Brady
@@ -31,7 +31,7 @@ public enum EventState {
 
     /**
      * Indicates that whatever movement the event is being
-     * dispatched as a result of has already occurred.
+     * dispatched as a result of has already occured.
      */
     POST
 }

src/main/java/baritone/bot/event/listener/AbstractGameEventListener.java

@@ -2,30 +2,48 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.listener;
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
 
-import baritone.api.event.events.*;
+package baritone.bot.event.listener;
+
+import baritone.bot.event.events.*;
 
 /**
  * An implementation of {@link IGameEventListener} that has all methods
  * overridden with empty bodies, allowing inheritors of this class to choose
  * which events they would like to listen in on.
  *
- * @author Brady
  * @see IGameEventListener
+ *
+ * @author Brady
  * @since 8/1/2018 6:29 PM
  */
 public interface AbstractGameEventListener extends IGameEventListener {
@@ -34,7 +52,7 @@ public interface AbstractGameEventListener extends IGameEventListener {
     default void onTick(TickEvent event) {}
 
     @Override
-    default void onPlayerUpdate(PlayerUpdateEvent event) {}
+    default void onPlayerUpdate() {}
 
     @Override
     default void onProcessKeyBinds() {}
@@ -56,16 +74,4 @@ public interface AbstractGameEventListener extends IGameEventListener {
 
     @Override
     default void onReceivePacket(PacketEvent event) {}
-
-    @Override
-    default void onPlayerRotationMove(RotationMoveEvent event) {}
-
-    @Override
-    default void onBlockInteract(BlockInteractEvent event) {}
-
-    @Override
-    default void onPlayerDeath() {}
-
-    @Override
-    default void onPathEvent(PathEvent event) {}
 }

src/main/java/baritone/bot/event/listener/IGameEventListener.java

@@ -2,34 +2,47 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.event.listener;
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
 
-import baritone.api.event.events.*;
+package baritone.bot.event.listener;
+
+import baritone.bot.event.events.*;
 import io.netty.util.concurrent.GenericFutureListener;
 import net.minecraft.client.Minecraft;
 import net.minecraft.client.entity.EntityPlayerSP;
-import net.minecraft.client.gui.GuiGameOver;
 import net.minecraft.client.multiplayer.WorldClient;
 import net.minecraft.client.renderer.EntityRenderer;
 import net.minecraft.client.settings.GameSettings;
-import net.minecraft.entity.Entity;
-import net.minecraft.entity.EntityLivingBase;
 import net.minecraft.network.NetworkManager;
 import net.minecraft.network.Packet;
-import net.minecraft.util.text.ITextComponent;
 
 /**
  * @author Brady
@@ -45,11 +58,10 @@ public interface IGameEventListener {
     void onTick(TickEvent event);
 
     /**
-     * Run once per game tick from before and after the player rotation is sent to the server.
-     *
+     * Run once per game tick from before the player rotation is sent to the server.
      * @see EntityPlayerSP#onUpdate()
      */
-    void onPlayerUpdate(PlayerUpdateEvent event);
+    void onPlayerUpdate();
 
     /**
      * Run once per game tick from before keybinds are processed.
@@ -92,8 +104,6 @@ public interface IGameEventListener {
      * Runs before a outbound packet is sent
      *
      * @see NetworkManager#dispatchPacket(Packet, GenericFutureListener[])
-     * @see Packet
-     * @see GenericFutureListener
      */
     void onSendPacket(PacketEvent event);
 
@@ -101,40 +111,8 @@ public interface IGameEventListener {
      * Runs before an inbound packet is processed
      *
      * @see NetworkManager#dispatchPacket(Packet, GenericFutureListener[])
-     * @see Packet
-     * @see GenericFutureListener
      */
     void onReceivePacket(PacketEvent event);
 
-    /**
-     * Run once per game tick from before and after the player's moveRelative method is called
-     * and before and after the player jumps.
-     *
-     * @see Entity#moveRelative(float, float, float, float)
-     * @see EntityLivingBase#jump()
-     */
-    void onPlayerRotationMove(RotationMoveEvent event);
 
-    /**
-     * Called when the local player interacts with a block, whether it is breaking or opening/placing.
-     *
-     * @see Minecraft#clickMouse()
-     * @see Minecraft#rightClickMouse()
-     */
-    void onBlockInteract(BlockInteractEvent event);
-
-    /**
-     * Called when the local player dies, as indicated by the creation of the {@link GuiGameOver} screen.
-     *
-     * @see GuiGameOver(ITextComponent)
-     * @see ITextComponent
-     */
-    void onPlayerDeath();
-
-    /**
-     * When the pathfinder's state changes
-     *
-     * @param event
-     */
-    void onPathEvent(PathEvent event);
 }

src/main/java/baritone/bot/pathing/calc/AStarPathFinder.java

@@ -0,0 +1,252 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.pathing.calc;
+
+import baritone.bot.Baritone;
+import baritone.bot.chunk.CachedWorldProvider;
+import baritone.bot.pathing.calc.openset.BinaryHeapOpenSet;
+import baritone.bot.pathing.calc.openset.IOpenSet;
+import baritone.bot.pathing.goals.Goal;
+import baritone.bot.pathing.movement.ActionCosts;
+import baritone.bot.pathing.movement.CalculationContext;
+import baritone.bot.pathing.movement.Movement;
+import baritone.bot.pathing.movement.MovementHelper;
+import baritone.bot.pathing.movement.movements.*;
+import baritone.bot.pathing.path.IPath;
+import baritone.bot.utils.Helper;
+import baritone.bot.utils.pathing.BetterBlockPos;
+import net.minecraft.client.Minecraft;
+import net.minecraft.util.EnumFacing;
+import net.minecraft.util.math.BlockPos;
+import net.minecraft.world.chunk.EmptyChunk;
+
+import java.util.Collection;
+import java.util.HashSet;
+import java.util.Optional;
+import java.util.Random;
+
+/**
+ * The actual A* pathfinding
+ *
+ * @author leijurv
+ */
+public class AStarPathFinder extends AbstractNodeCostSearch implements Helper {
+
+    private final Optional<HashSet<BetterBlockPos>> favoredPositions;
+
+    public AStarPathFinder(BlockPos start, Goal goal, Optional<Collection<BetterBlockPos>> favoredPositions) {
+        super(start, goal);
+        this.favoredPositions = favoredPositions.map(HashSet::new); // <-- okay this is epic
+    }
+
+    @Override
+    protected Optional<IPath> calculate0() {
+        startNode = getNodeAtPosition(start);
+        startNode.cost = 0;
+        startNode.combinedCost = startNode.estimatedCostToGoal;
+        IOpenSet openSet = new BinaryHeapOpenSet();
+        openSet.insert(startNode);
+        startNode.isOpen = true;
+        bestSoFar = new PathNode[COEFFICIENTS.length];//keep track of the best node by the metric of (estimatedCostToGoal + cost / COEFFICIENTS[i])
+        double[] bestHeuristicSoFar = new double[COEFFICIENTS.length];
+        for (int i = 0; i < bestHeuristicSoFar.length; i++) {
+            bestHeuristicSoFar[i] = Double.MAX_VALUE;
+        }
+        CalculationContext calcContext = new CalculationContext();
+        HashSet<BetterBlockPos> favored = favoredPositions.orElse(null);
+        currentlyRunning = this;
+        long startTime = System.currentTimeMillis();
+        boolean slowPath = Baritone.settings().slowPath.get();
+        long timeoutTime = startTime + (slowPath ? Baritone.settings().slowPathTimeoutMS : Baritone.settings().pathTimeoutMS).<Long>get();
+        long lastPrintout = 0;
+        int numNodes = 0;
+        int numEmptyChunk = 0;
+        boolean favoring = favoredPositions.isPresent(); // grab all settings beforehand so that changing settings during pathing doesn't cause a crash or unpredictable behavior
+        boolean cache = Baritone.settings().chuckCaching.get();
+        int pathingMaxChunkBorderFetch = Baritone.settings().pathingMaxChunkBorderFetch.get();
+        double favorCoeff = Baritone.settings().backtrackCostFavoringCoefficient.get();
+        while (!openSet.isEmpty() && numEmptyChunk < pathingMaxChunkBorderFetch && System.currentTimeMillis() < timeoutTime) {
+            if (slowPath) {
+                try {
+                    Thread.sleep(Baritone.settings().slowPathTimeDelayMS.<Long>get());
+                } catch (InterruptedException ex) {
+                }
+            }
+            PathNode currentNode = openSet.removeLowest();
+            currentNode.isOpen = false;
+            mostRecentConsidered = currentNode;
+            BetterBlockPos currentNodePos = currentNode.pos;
+            numNodes++;
+            if (System.currentTimeMillis() > lastPrintout + 1000) {//print once a second
+                System.out.println("searching... at " + currentNodePos + ", considered " + numNodes + " nodes so far");
+                lastPrintout = System.currentTimeMillis();
+            }
+            if (goal.isInGoal(currentNodePos)) {
+                currentlyRunning = null;
+                return Optional.of(new Path(startNode, currentNode, numNodes));
+            }
+            //long constructStart = System.nanoTime();
+            Movement[] possibleMovements = getConnectedPositions(currentNodePos, calcContext);//movement that we could take that start at currentNodePos, in random order
+            shuffle(possibleMovements);
+            //long constructEnd = System.nanoTime();
+            //System.out.println(constructEnd - constructStart);
+            for (Movement movementToGetToNeighbor : possibleMovements) {
+                if (movementToGetToNeighbor == null) {
+                    continue;
+                }
+                BetterBlockPos dest = (BetterBlockPos) movementToGetToNeighbor.getDest();
+                boolean isPositionCached = false;
+                if (cache) {
+                    if (CachedWorldProvider.INSTANCE.getCurrentWorld() != null) {
+                        if (CachedWorldProvider.INSTANCE.getCurrentWorld().getBlockType(dest) != null) {
+                            isPositionCached = true;
+                        }
+                    }
+                }
+                if (!isPositionCached && Minecraft.getMinecraft().world.getChunk(dest) instanceof EmptyChunk) {
+                    numEmptyChunk++;
+                    continue;
+                }
+                //long costStart = System.nanoTime();
+                // TODO cache cost
+                double actionCost = movementToGetToNeighbor.getCost(calcContext);
+                //long costEnd = System.nanoTime();
+                //System.out.println(movementToGetToNeighbor.getClass() + "" + (costEnd - costStart));
+                if (actionCost >= ActionCosts.COST_INF) {
+                    continue;
+                }
+                if (actionCost <= 0) {
+                    throw new IllegalStateException(movementToGetToNeighbor.getClass() + " " + movementToGetToNeighbor + " calculated implausible cost " + actionCost);
+                }
+                if (favoring && favored.contains(dest)) {
+                    // see issue #18
+                    actionCost *= favorCoeff;
+                }
+                PathNode neighbor = getNodeAtPosition(dest);
+                double tentativeCost = currentNode.cost + actionCost;
+                if (tentativeCost < neighbor.cost) {
+                    if (tentativeCost < 0) {
+                        throw new IllegalStateException(movementToGetToNeighbor.getClass() + " " + movementToGetToNeighbor + " overflowed into negative " + actionCost + " " + neighbor.cost + " " + tentativeCost);
+                    }
+                    neighbor.previous = currentNode;
+                    neighbor.previousMovement = movementToGetToNeighbor;
+                    neighbor.cost = tentativeCost;
+                    neighbor.combinedCost = tentativeCost + neighbor.estimatedCostToGoal;
+                    if (neighbor.isOpen) {
+                        openSet.update(neighbor);
+                    } else {
+                        openSet.insert(neighbor);//dont double count, dont insert into open set if it's already there
+                        neighbor.isOpen = true;
+                    }
+                    for (int i = 0; i < bestSoFar.length; i++) {
+                        double heuristic = neighbor.estimatedCostToGoal + neighbor.cost / COEFFICIENTS[i];
+                        if (heuristic < bestHeuristicSoFar[i]) {
+                            bestHeuristicSoFar[i] = heuristic;
+                            bestSoFar[i] = neighbor;
+                        }
+                    }
+                }
+            }
+        }
+        double bestDist = 0;
+        for (int i = 0; i < bestSoFar.length; i++) {
+            if (bestSoFar[i] == null) {
+                continue;
+            }
+            double dist = getDistFromStartSq(bestSoFar[i]);
+            if (dist > bestDist) {
+                bestDist = dist;
+            }
+            if (dist > MIN_DIST_PATH * MIN_DIST_PATH) { // square the comparison since distFromStartSq is squared
+                displayChatMessageRaw("A* cost coefficient " + COEFFICIENTS[i]);
+                if (COEFFICIENTS[i] >= 3) {
+                    System.out.println("Warning: cost coefficient is greater than three! Probably means that");
+                    System.out.println("the path I found is pretty terrible (like sneak-bridging for dozens of blocks)");
+                    System.out.println("But I'm going to do it anyway, because yolo");
+                }
+                System.out.println("Path goes for " + dist + " blocks");
+                currentlyRunning = null;
+                return Optional.of(new Path(startNode, bestSoFar[i], numNodes));
+            }
+        }
+        displayChatMessageRaw("Even with a cost coefficient of " + COEFFICIENTS[COEFFICIENTS.length - 1] + ", I couldn't get more than " + bestDist + " blocks =(");
+        displayChatMessageRaw("No path found =(");
+        currentlyRunning = null;
+        return Optional.empty();
+    }
+
+
+    private static Movement[] getConnectedPositions(BetterBlockPos pos, CalculationContext calcContext) {
+        int x = pos.getX();
+        int y = pos.getY();
+        int z = pos.getZ();
+        BetterBlockPos east = new BetterBlockPos(x + 1, y, z);
+        BetterBlockPos west = new BetterBlockPos(x - 1, y, z);
+        BetterBlockPos south = new BetterBlockPos(x, y, z + 1);
+        BetterBlockPos north = new BetterBlockPos(x, y, z - 1);
+        return new Movement[]{
+                new MovementTraverse(pos, east),
+                new MovementTraverse(pos, west),
+                new MovementTraverse(pos, north),
+                new MovementTraverse(pos, south),
+                new MovementAscend(pos, new BetterBlockPos(x + 1, y + 1, z)),
+                new MovementAscend(pos, new BetterBlockPos(x - 1, y + 1, z)),
+                new MovementAscend(pos, new BetterBlockPos(x, y + 1, z + 1)),
+                new MovementAscend(pos, new BetterBlockPos(x, y + 1, z - 1)),
+                MovementHelper.generateMovementFallOrDescend(pos, east, calcContext),
+                MovementHelper.generateMovementFallOrDescend(pos, west, calcContext),
+                MovementHelper.generateMovementFallOrDescend(pos, north, calcContext),
+                MovementHelper.generateMovementFallOrDescend(pos, south, calcContext),
+                new MovementDownward(pos, new BetterBlockPos(x, y - 1, z)),
+                new MovementDiagonal(pos, EnumFacing.NORTH, EnumFacing.WEST),
+                new MovementDiagonal(pos, EnumFacing.NORTH, EnumFacing.EAST),
+                new MovementDiagonal(pos, EnumFacing.SOUTH, EnumFacing.WEST),
+                new MovementDiagonal(pos, EnumFacing.SOUTH, EnumFacing.EAST),
+                new MovementPillar(pos, new BetterBlockPos(x, y + 1, z))
+        };
+    }
+
+    private final Random random = new Random();
+
+    private <T> void shuffle(T[] list) {
+        int len = list.length;
+        for (int i = 0; i < len; i++) {
+            int j = random.nextInt(len);
+            T t = list[j];
+            list[j] = list[i];
+            list[i] = t;
+        }
+    }
+}

src/main/java/baritone/bot/pathing/calc/AbstractNodeCostSearch.java

@@ -0,0 +1,142 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.pathing.calc;
+
+import baritone.bot.pathing.goals.Goal;
+import baritone.bot.pathing.path.IPath;
+import baritone.bot.utils.pathing.BetterBlockPos;
+import net.minecraft.util.math.BlockPos;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Optional;
+
+/**
+ * Any pathfinding algorithm that keeps track of nodes recursively by their cost (e.g. A*, dijkstra)
+ *
+ * @author leijurv
+ */
+public abstract class AbstractNodeCostSearch implements IPathFinder {
+
+    /**
+     * The currently running search task
+     */
+    protected static AbstractNodeCostSearch currentlyRunning = null;
+
+    protected final BetterBlockPos start;
+
+    protected final Goal goal;
+
+    protected final Map<BetterBlockPos, PathNode> map;
+
+    protected PathNode startNode;
+
+    protected PathNode mostRecentConsidered;
+
+    protected PathNode[] bestSoFar;
+
+    private volatile boolean isFinished;
+
+    /**
+     * This is really complicated and hard to explain. I wrote a comment in the old version of MineBot but it was so
+     * long it was easier as a Google Doc (because I could insert charts).
+     *
+     * @see <a href="https://docs.google.com/document/d/1WVHHXKXFdCR1Oz__KtK8sFqyvSwJN_H4lftkHFgmzlc/edit"></a>
+     */
+    protected static final double[] COEFFICIENTS = {1.25, 1.5, 2, 2.5, 3, 4, 5, 10}; // big TODO tune
+    /**
+     * If a path goes less than 5 blocks and doesn't make it to its goal, it's not worth considering.
+     */
+    protected final static double MIN_DIST_PATH = 5;
+
+    AbstractNodeCostSearch(BlockPos start, Goal goal) {
+        this.start = new BetterBlockPos(start.getX(), start.getY(), start.getZ());
+        this.goal = goal;
+        this.map = new HashMap<>();
+    }
+
+    public synchronized Optional<IPath> calculate() {
+        if (isFinished) {
+            throw new IllegalStateException("Path Finder is currently in use, and cannot be reused!");
+        }
+        Optional<IPath> path = calculate0();
+        isFinished = true;
+        return path;
+    }
+
+    protected abstract Optional<IPath> calculate0();
+
+    /**
+     * Determines the distance squared from the specified node to the start
+     * node. Intended for use in distance comparison, rather than anything that
+     * considers the real distance value, hence the "sq".
+     *
+     * @param n A node
+     * @return The distance, squared
+     */
+    protected double getDistFromStartSq(PathNode n) {
+        int xDiff = n.pos.getX() - start.getX();
+        int yDiff = n.pos.getY() - start.getY();
+        int zDiff = n.pos.getZ() - start.getZ();
+        return xDiff * xDiff + yDiff * yDiff + zDiff * zDiff;
+    }
+
+    /**
+     * Attempts to search the {@link BlockPos} to {@link PathNode} map
+     * for the node mapped to the specified pos. If no node is found,
+     * a new node is created.
+     *
+     * @param pos The pos to lookup
+     * @return The associated node
+     */
+    protected PathNode getNodeAtPosition(BetterBlockPos pos) {
+        return map.computeIfAbsent(pos, p -> new PathNode(p, goal));
+    }
+
+    @Override
+    public Optional<IPath> pathToMostRecentNodeConsidered() {
+        return Optional.ofNullable(mostRecentConsidered).map(node -> new Path(startNode, node, 0));
+    }
+
+    @Override
+    public Optional<IPath> bestPathSoFar() {
+        if (startNode == null || bestSoFar[0] == null)
+            return Optional.empty();
+
+        return Optional.of(new Path(startNode, bestSoFar[0], 0));
+    }
+
+    @Override
+    public final boolean isFinished() {
+        return isFinished;
+    }
+
+    @Override
+    public final Goal getGoal() {
+        return goal;
+    }
+
+    @Override
+    public final BlockPos getStart() {
+        return start;
+    }
+
+    public static Optional<AbstractNodeCostSearch> getCurrentlyRunning() {
+        return Optional.ofNullable(currentlyRunning);
+    }
+}

src/main/java/baritone/bot/pathing/calc/IPathFinder.java

@@ -2,23 +2,24 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc;
+package baritone.bot.pathing.calc;
 
-import baritone.api.pathing.goals.Goal;
-import baritone.pathing.path.IPath;
+import baritone.bot.pathing.goals.Goal;
+import baritone.bot.pathing.path.IPath;
+import net.minecraft.util.math.BlockPos;
 
 import java.util.Optional;
 
@@ -29,6 +30,8 @@ import java.util.Optional;
  */
 public interface IPathFinder {
 
+    BlockPos getStart();
+
     Goal getGoal();
 
     /**
@@ -36,7 +39,7 @@ public interface IPathFinder {
      *
      * @return The final path
      */
-    Optional<IPath> calculate(long timeout);
+    Optional<IPath> calculate();
 
     /**
      * Intended to be called concurrently with calculatePath from a different thread to tell if it's finished yet

src/main/java/baritone/bot/pathing/calc/Path.java

@@ -2,26 +2,24 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc;
+package baritone.bot.pathing.calc;
 
-import baritone.api.pathing.goals.Goal;
-import baritone.pathing.movement.Movement;
-import baritone.pathing.movement.Moves;
-import baritone.pathing.path.IPath;
-import baritone.utils.pathing.BetterBlockPos;
+import baritone.bot.pathing.movement.Movement;
+import baritone.bot.pathing.path.IPath;
+import baritone.bot.utils.pathing.BetterBlockPos;
 import net.minecraft.util.math.BlockPos;
 
 import java.util.ArrayList;
@@ -39,40 +37,31 @@ class Path implements IPath {
     /**
      * The start position of this path
      */
-    private final BetterBlockPos start;
+    final BetterBlockPos start;
 
     /**
      * The end position of this path
      */
-    private final BetterBlockPos end;
+    final BetterBlockPos end;
 
     /**
      * The blocks on the path. Guaranteed that path.get(0) equals start and
      * path.get(path.size()-1) equals end
      */
-    private final List<BetterBlockPos> path;
+    final List<BetterBlockPos> path;
 
-    private final List<Movement> movements;
-
-    private final Goal goal;
+    final List<Movement> movements;
 
     private final int numNodes;
 
-    private volatile boolean verified;
-
-    Path(PathNode start, PathNode end, int numNodes, Goal goal) {
-        this.start = new BetterBlockPos(start.x, start.y, start.z);
-        this.end = new BetterBlockPos(end.x, end.y, end.z);
+    Path(PathNode start, PathNode end, int numNodes) {
+        this.start = start.pos;
+        this.end = end.pos;
         this.numNodes = numNodes;
         this.path = new ArrayList<>();
         this.movements = new ArrayList<>();
-        this.goal = goal;
         assemblePath(start, end);
-    }
-
-    @Override
-    public Goal getGoal() {
-        return goal;
+        sanityCheck();
     }
 
     /**
@@ -86,18 +75,19 @@ class Path implements IPath {
             throw new IllegalStateException();
         }
         PathNode current = end;
-        LinkedList<BetterBlockPos> tempPath = new LinkedList<>();
-        // Repeatedly inserting to the beginning of an arraylist is O(n^2)
-        // Instead, do it into a linked list, then convert at the end
+        LinkedList<BetterBlockPos> tempPath = new LinkedList<>(); // Repeatedly inserting to the beginning of an arraylist is O(n^2)
+        LinkedList<Movement> tempMovements = new LinkedList<>(); // Instead, do it into a linked list, then convert at the end
         while (!current.equals(start)) {
-            tempPath.addFirst(new BetterBlockPos(current.x, current.y, current.z));
+            tempPath.addFirst(current.pos);
+            tempMovements.addFirst(current.previousMovement);
             current = current.previous;
         }
-        tempPath.addFirst(this.start);
+        tempPath.addFirst(start.pos);
         // Can't directly convert from the PathNode pseudo linked list to an array because we don't know how long it is
         // inserting into a LinkedList<E> keeps track of length, then when we addall (which calls .toArray) it's able
         // to performantly do that conversion since it knows the length.
         path.addAll(tempPath);
+        movements.addAll(tempMovements);
     }
 
     /**
@@ -126,45 +116,8 @@ class Path implements IPath {
         }
     }
 
-    private void assembleMovements() {
-        if (path.isEmpty() || !movements.isEmpty()) {
-            throw new IllegalStateException();
-        }
-        for (int i = 0; i < path.size() - 1; i++) {
-            movements.add(runBackwards(path.get(i), path.get(i + 1)));
-        }
-    }
-
-    private static Movement runBackwards(BetterBlockPos src, BetterBlockPos dest) { // TODO this is horrifying
-        for (Moves moves : Moves.values()) {
-            Movement move = moves.apply0(src);
-            if (move.getDest().equals(dest)) {
-                // TODO instead of recalculating here, could we take pathNode.cost - pathNode.prevNode.cost to get the cost as-calculated?
-                move.recalculateCost(); // have to calculate the cost at calculation time so we can accurately judge whether a cost increase happened between cached calculation and real execution
-                return move;
-            }
-        }
-        // this is no longer called from bestPathSoFar, now it's in postprocessing
-        throw new IllegalStateException("Movement became impossible during calculation " + src + " " + dest + " " + dest.subtract(src));
-    }
-
-    @Override
-    public void postprocess() {
-        if (verified) {
-            throw new IllegalStateException();
-        }
-        verified = true;
-        assembleMovements();
-        // more post processing here
-        movements.forEach(Movement::checkLoadedChunk);
-        sanityCheck();
-    }
-
     @Override
     public List<Movement> movements() {
-        if (!verified) {
-            throw new IllegalStateException();
-        }
         return Collections.unmodifiableList(movements);
     }
 

src/main/java/baritone/bot/pathing/calc/PathNode.java

@@ -2,37 +2,41 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc;
+package baritone.bot.pathing.calc;
 
-import baritone.api.pathing.goals.Goal;
-import baritone.api.pathing.movement.ActionCosts;
+import baritone.bot.pathing.goals.Goal;
+import baritone.bot.pathing.movement.Movement;
+import baritone.bot.utils.pathing.BetterBlockPos;
 
 /**
  * A node in the path, containing the cost and steps to get to it.
  *
  * @author leijurv
  */
-public final class PathNode {
+public class PathNode {
 
     /**
      * The position of this node
      */
-    final int x;
-    final int y;
-    final int z;
+    final BetterBlockPos pos;
+
+    /**
+     * The goal it's going towards
+     */
+    final Goal goal;
 
     /**
      * Cached, should always be equal to goal.heuristic(pos)
@@ -57,6 +61,12 @@ public final class PathNode {
      */
     PathNode previous;
 
+    /**
+     * In the graph search, what previous movement (edge) was taken to get to here
+     * Mutable and changed by PathFinder
+     */
+    Movement previousMovement;
+
     /**
      * 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.
@@ -68,14 +78,14 @@ public final class PathNode {
      */
     public int heapPosition;
 
-    public PathNode(int x, int y, int z, Goal goal) {
+    public PathNode(BetterBlockPos pos, Goal goal) {
+        this.pos = pos;
         this.previous = null;
-        this.cost = ActionCosts.COST_INF;
-        this.estimatedCostToGoal = goal.heuristic(x, y, z);
+        this.cost = Short.MAX_VALUE;
+        this.goal = goal;
+        this.estimatedCostToGoal = goal.heuristic(pos);
+        this.previousMovement = null;
         this.isOpen = false;
-        this.x = x;
-        this.y = y;
-        this.z = z;
     }
 
     /**
@@ -85,7 +95,7 @@ public final class PathNode {
      */
     @Override
     public int hashCode() {
-        return (int) AbstractNodeCostSearch.posHash(x, y, z);
+        throw new IllegalStateException();
     }
 
     @Override
@@ -93,13 +103,11 @@ public final class PathNode {
         // GOTTA GO FAST
         // ALL THESE CHECKS ARE FOR PEOPLE WHO WANT SLOW CODE
         // SKRT SKRT
-        //if (obj == null || !(obj instanceof PathNode)) {
+        //if (obj == null || !(obj instanceof PathNode))
         //    return false;
-        //}
 
-        final PathNode other = (PathNode) obj;
+        //final PathNode other = (PathNode) obj;
         //return Objects.equals(this.pos, other.pos) && Objects.equals(this.goal, other.goal);
-
-        return x == other.x && y == other.y && z == other.z;
+        return this.pos.equals(((PathNode) obj).pos);
     }
 }

src/main/java/baritone/bot/pathing/calc/openset/BinaryHeapOpenSet.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc.openset;
+package baritone.bot.pathing.calc.openset;
 
-import baritone.pathing.calc.PathNode;
+import baritone.bot.pathing.calc.PathNode;
 
 import java.util.Arrays;
 
@@ -26,7 +26,7 @@ import java.util.Arrays;
  *
  * @author leijurv
  */
-public final class BinaryHeapOpenSet implements IOpenSet {
+public class BinaryHeapOpenSet implements IOpenSet {
 
     /**
      * The initial capacity of the heap (2^10)
@@ -52,45 +52,28 @@ public final class BinaryHeapOpenSet implements IOpenSet {
         this.array = new PathNode[size];
     }
 
-    public int size() {
-        return size;
-    }
-
     @Override
-    public final void insert(PathNode value) {
+    public void insert(PathNode value) {
         if (size >= array.length - 1) {
             array = Arrays.copyOf(array, array.length * 2);
         }
         size++;
         value.heapPosition = size;
         array[size] = value;
-        update(value);
+        upHeap(size);
+    }
+
+    public void update(PathNode node) {
+        upHeap(node.heapPosition);
     }
 
     @Override
-    public final void update(PathNode val) {
-        int index = val.heapPosition;
-        int parentInd = index >>> 1;
-        double cost = val.combinedCost;
-        PathNode parentNode = array[parentInd];
-        while (index > 1 && parentNode.combinedCost > cost) {
-            array[index] = parentNode;
-            array[parentInd] = val;
-            val.heapPosition = parentInd;
-            parentNode.heapPosition = index;
-            index = parentInd;
-            parentInd = index >>> 1;
-            parentNode = array[parentInd];
-        }
-    }
-
-    @Override
-    public final boolean isEmpty() {
+    public boolean isEmpty() {
         return size == 0;
     }
 
     @Override
-    public final PathNode removeLowest() {
+    public PathNode removeLowest() {
         if (size == 0) {
             throw new IllegalStateException();
         }
@@ -108,13 +91,14 @@ public final class BinaryHeapOpenSet implements IOpenSet {
         int smallerChild = 2;
         double cost = val.combinedCost;
         do {
+            int right = smallerChild + 1;
             PathNode smallerChildNode = array[smallerChild];
             double smallerChildCost = smallerChildNode.combinedCost;
-            if (smallerChild < size) {
-                PathNode rightChildNode = array[smallerChild + 1];
+            if (right <= size) {
+                PathNode rightChildNode = array[right];
                 double rightChildCost = rightChildNode.combinedCost;
                 if (smallerChildCost > rightChildCost) {
-                    smallerChild++;
+                    smallerChild = right;
                     smallerChildCost = rightChildCost;
                     smallerChildNode = rightChildNode;
                 }
@@ -127,7 +111,24 @@ public final class BinaryHeapOpenSet implements IOpenSet {
             val.heapPosition = smallerChild;
             smallerChildNode.heapPosition = index;
             index = smallerChild;
-        } while ((smallerChild <<= 1) <= size);
+            smallerChild = index << 1;
+        } while (smallerChild <= size);
         return result;
     }
+
+    private void upHeap(int index) {
+        int parentInd = index >>> 1;
+        PathNode val = array[index];
+        double cost = val.combinedCost;
+        PathNode parentNode = array[parentInd];
+        while (index > 1 && parentNode.combinedCost > cost) {
+            array[index] = parentNode;
+            array[parentInd] = val;
+            val.heapPosition = parentInd;
+            parentNode.heapPosition = index;
+            index = parentInd;
+            parentInd = index >>> 1;
+            parentNode = array[parentInd];
+        }
+    }
 }

src/main/java/baritone/bot/pathing/calc/openset/IOpenSet.java

@@ -2,22 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc.openset;
+package baritone.bot.pathing.calc.openset;
 
-import baritone.pathing.calc.PathNode;
+import baritone.bot.pathing.calc.PathNode;
 
 /**
  * An open set for A* or similar graph search algorithm

src/main/java/baritone/bot/pathing/calc/openset/LinkedListOpenSet.java

@@ -2,31 +2,30 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.pathing.calc.openset;
+package baritone.bot.pathing.calc.openset;
 
-import baritone.pathing.calc.PathNode;
+import baritone.bot.pathing.calc.PathNode;
 
 /**
  * A linked list implementation of an open set. This is the original implementation from MineBot.
  * It has incredibly fast insert performance, at the cost of O(n) removeLowest.
- * It sucks. BinaryHeapOpenSet results in more than 10x more nodes considered in 4 seconds.
  *
  * @author leijurv
  */
-class LinkedListOpenSet implements IOpenSet {
+public class LinkedListOpenSet implements IOpenSet {
     private Node first = null;
 
     @Override
@@ -83,7 +82,7 @@ class LinkedListOpenSet implements IOpenSet {
     }
 
     public static class Node { //wrapper with next
-        private Node nextOpen;
-        private PathNode val;
+        Node nextOpen;
+        PathNode val;
     }
 }

src/main/java/baritone/bot/pathing/goals/Goal.java

@@ -2,21 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
+package baritone.bot.pathing.goals;
 
+import baritone.bot.pathing.movement.ActionCosts;
 import net.minecraft.util.math.BlockPos;
 
 /**
@@ -24,28 +25,22 @@ import net.minecraft.util.math.BlockPos;
  *
  * @author leijurv
  */
-public interface Goal {
+public interface Goal extends ActionCosts {
 
     /**
      * Returns whether or not the specified position
      * meets the requirement for this goal based.
      *
+     * @param pos The position
      * @return Whether or not it satisfies this goal
      */
-    boolean isInGoal(int x, int y, int z);
+    boolean isInGoal(BlockPos pos);
 
     /**
      * Estimate the number of ticks it will take to get to the goal
      *
+     * @param pos The
      * @return The estimate number of ticks to satisfy the goal
      */
-    double heuristic(int x, int y, int z);
-
-    default boolean isInGoal(BlockPos pos) {
-        return isInGoal(pos.getX(), pos.getY(), pos.getZ());
-    }
-
-    default double heuristic(BlockPos pos) {
-        return heuristic(pos.getX(), pos.getY(), pos.getZ());
-    }
+    double heuristic(BlockPos pos);
 }

src/main/java/baritone/bot/pathing/goals/GoalBlock.java

@@ -0,0 +1,111 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.pathing.goals;
+
+import net.minecraft.util.math.BlockPos;
+
+/**
+ * A specific BlockPos goal
+ *
+ * @author leijurv
+ */
+public class GoalBlock implements Goal {
+
+    /**
+     * The X block position of this goal
+     */
+    private final int x;
+
+    /**
+     * The Y block position of this goal
+     */
+    private final int y;
+
+    /**
+     * The Z block position of this goal
+     */
+    private final int z;
+
+    public GoalBlock(BlockPos pos) {
+        this(pos.getX(), pos.getY(), pos.getZ());
+    }
+
+    public GoalBlock(int x, int y, int z) {
+        this.x = x;
+        this.y = y;
+        this.z = z;
+    }
+
+    @Override
+    public boolean isInGoal(BlockPos pos) {
+        return pos.getX() == this.x && pos.getY() == this.y && pos.getZ() == this.z;
+    }
+
+    /**
+     * The min range value over which to begin considering Y coordinate in the heuristic
+     */
+    private static final double MIN = 20;
+
+    /**
+     * The max range value over which to begin considering Y coordinate in the heuristic
+     */
+    private static final double MAX = 150;
+
+    @Override
+    public double heuristic(BlockPos pos) {
+        int xDiff = pos.getX() - this.x;
+        int yDiff = pos.getY() - this.y;
+        int zDiff = pos.getZ() - this.z;
+        return calculate(xDiff, yDiff, zDiff);
+    }
+
+    @Override
+    public String toString() {
+        return "Goal{x=" + x + ",y=" + y + ",z=" + z + "}";
+    }
+
+    /**
+     * @return The position of this goal as a {@link BlockPos}
+     */
+    public BlockPos getGoalPos() {
+        return new BlockPos(x, y, z);
+    }
+
+    public static double calculate(double xDiff, int yDiff, double zDiff) {
+        double pythaDist = Math.sqrt(xDiff * xDiff + zDiff * zDiff);
+        double heuristic = 0;
+        if (pythaDist < MAX) {//if we are more than MAX away, ignore the Y coordinate. It really doesn't matter how far away your Y coordinate is if you X coordinate is 1000 blocks away.
+            //as we get closer, slowly reintroduce the Y coordinate as a heuristic cost
+            double multiplier;
+            if (pythaDist < MIN) {
+                multiplier = 1;
+            } else {
+                multiplier = 1 - (pythaDist - MIN) / (MAX - MIN);
+            }
+
+            // if yDiff is 1 that means that pos.getY()-this.y==1 which means that we're 1 block below where we should be
+            // therefore going from 0,0,0 to a GoalYLevel of pos.getY()-this.y is accurate
+            heuristic += new GoalYLevel(yDiff).heuristic(new BlockPos(0, 0, 0));
+
+            heuristic *= multiplier;
+        }
+        //use the pythagorean and manhattan mixture from GoalXZ
+        heuristic += GoalXZ.calculate(xDiff, zDiff);
+        return heuristic;
+    }
+}

src/main/java/baritone/bot/pathing/goals/GoalComposite.java

@@ -2,25 +2,24 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
-
-import net.minecraft.util.math.BlockPos;
+package baritone.bot.pathing.goals;
 
 import java.util.Arrays;
 import java.util.Collection;
+import net.minecraft.util.math.BlockPos;
 
 /**
  * A composite of many goals, any one of which satisfies the composite.
@@ -34,7 +33,7 @@ public class GoalComposite implements Goal {
     /**
      * An array of goals that any one of must be satisfied
      */
-    private final Goal[] goals;
+    public final Goal[] goals;
 
     public GoalComposite(Goal... goals) {
         this.goals = goals;
@@ -49,21 +48,15 @@ public class GoalComposite implements Goal {
     }
 
     @Override
-    public boolean isInGoal(int x, int y, int z) {
-        for (Goal goal : goals) {
-            if (goal.isInGoal(x, y, z)) {
-                return true;
-            }
-        }
-        return false;
+    public boolean isInGoal(BlockPos pos) {
+        return Arrays.stream(this.goals).anyMatch(goal -> goal.isInGoal(pos));
     }
 
     @Override
-    public double heuristic(int x, int y, int z) {
+    public double heuristic(BlockPos pos) {
         double min = Double.MAX_VALUE;
         for (Goal g : goals) {
-            // TODO technically this isn't admissible...?
-            min = Math.min(min, g.heuristic(x, y, z)); // whichever is closest
+            min = Math.min(min, g.heuristic(pos)); // whichever is closest
         }
         return min;
     }

src/main/java/baritone/bot/pathing/goals/GoalGetToBlock.java

@@ -0,0 +1,41 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.pathing.goals;
+
+import net.minecraft.util.EnumFacing;
+import net.minecraft.util.math.BlockPos;
+
+/**
+ * Don't get into the block, but get directly adjacent to it. Useful for chests.
+ *
+ * @author avecowa
+ */
+public class GoalGetToBlock extends GoalComposite {
+
+    public GoalGetToBlock(BlockPos pos) {
+        super(adjacentBlocks(pos));
+    }
+
+    private static BlockPos[] adjacentBlocks(BlockPos pos) {
+        BlockPos[] sides = new BlockPos[6];
+        for (int i = 0; i < 6; i++) {
+            sides[i] = pos.offset(EnumFacing.values()[i]);
+        }
+        return sides;
+    }
+}

src/main/java/baritone/bot/pathing/goals/GoalRunAway.java

@@ -2,35 +2,33 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
-
-import net.minecraft.util.math.BlockPos;
+package baritone.bot.pathing.goals;
 
 import java.util.Arrays;
+import net.minecraft.util.math.BlockPos;
 
 /**
  * Useful for automated combat (retreating specifically)
- *
  * @author leijurv
  */
 public class GoalRunAway implements Goal {
 
-    private final BlockPos[] from;
+    public final BlockPos[] from;
 
-    private final double distanceSq;
+    final double distanceSq;
 
     public GoalRunAway(double distance, BlockPos... from) {
         if (from.length == 0) {
@@ -41,10 +39,10 @@ public class GoalRunAway implements Goal {
     }
 
     @Override
-    public boolean isInGoal(int x, int y, int z) {
+    public boolean isInGoal(BlockPos pos) {
         for (BlockPos p : from) {
-            int diffX = x - p.getX();
-            int diffZ = z - p.getZ();
+            int diffX = pos.getX() - p.getX();
+            int diffZ = pos.getZ() - p.getZ();
             double distSq = diffX * diffX + diffZ * diffZ;
             if (distSq < distanceSq) {
                 return false;
@@ -54,10 +52,10 @@ public class GoalRunAway implements Goal {
     }
 
     @Override
-    public double heuristic(int x, int y, int z) {//mostly copied from GoalBlock
+    public double heuristic(BlockPos pos) {//mostly copied from GoalBlock
         double min = Double.MAX_VALUE;
         for (BlockPos p : from) {
-            double h = GoalXZ.calculate(p.getX() - x, p.getZ() - z);
+            double h = GoalXZ.calculate(p.getX() - pos.getX(), p.getZ() - pos.getZ());
             if (h < min) {
                 min = h;
             }
@@ -67,6 +65,6 @@ public class GoalRunAway implements Goal {
 
     @Override
     public String toString() {
-        return "GoalRunAwayFrom" + Arrays.asList(from);
+        return "GoalRunAwayFrom[" + Arrays.asList(from) + "]";
     }
 }

src/main/java/baritone/bot/pathing/goals/GoalTwoBlocks.java

@@ -2,22 +2,21 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
+package baritone.bot.pathing.goals;
 
-import baritone.api.utils.interfaces.IGoalRenderPos;
 import net.minecraft.util.math.BlockPos;
 
 /**
@@ -26,7 +25,7 @@ import net.minecraft.util.math.BlockPos;
  *
  * @author leijurv
  */
-public class GoalTwoBlocks implements Goal, IGoalRenderPos {
+public class GoalTwoBlocks implements Goal {
 
     /**
      * The X block position of this goal
@@ -54,26 +53,21 @@ public class GoalTwoBlocks implements Goal, IGoalRenderPos {
     }
 
     @Override
-    public boolean isInGoal(int x, int y, int z) {
-        return x == this.x && (y == this.y || y == this.y - 1) && z == this.z;
+    public boolean isInGoal(BlockPos pos) {
+        return pos.getX() == this.x && (pos.getY() == this.y || pos.getY() == this.y - 1) && pos.getZ() == this.z;
     }
 
     @Override
-    public double heuristic(int x, int y, int z) {
-        int xDiff = x - this.x;
-        int yDiff = y - this.y;
-        int zDiff = z - this.z;
+    public double heuristic(BlockPos pos) {
+        double xDiff = pos.getX() - this.x;
+        int yDiff = pos.getY() - this.y;
         if (yDiff < 0) {
             yDiff++;
         }
+        double zDiff = pos.getZ() - this.z;
         return GoalBlock.calculate(xDiff, yDiff, zDiff);
     }
 
-    @Override
-    public BlockPos getGoalPos() {
-        return new BlockPos(x, y, z);
-    }
-
     @Override
     public String toString() {
         return "GoalTwoBlocks{x=" + x + ",y=" + y + ",z=" + z + "}";

src/main/java/baritone/bot/pathing/goals/GoalXZ.java

@@ -2,23 +2,24 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
+package baritone.bot.pathing.goals;
 
-import baritone.api.BaritoneAPI;
-import net.minecraft.util.math.MathHelper;
+import baritone.bot.Baritone;
+import baritone.bot.utils.Utils;
+import net.minecraft.util.math.BlockPos;
 import net.minecraft.util.math.Vec3d;
 
 /**
@@ -46,20 +47,20 @@ public class GoalXZ implements Goal {
     }
 
     @Override
-    public boolean isInGoal(int x, int y, int z) {
-        return x == this.x && z == this.z;
+    public boolean isInGoal(BlockPos pos) {
+        return pos.getX() == x && pos.getZ() == z;
     }
 
     @Override
-    public double heuristic(int x, int y, int z) {//mostly copied from GoalBlock
-        int xDiff = x - this.x;
-        int zDiff = z - this.z;
+    public double heuristic(BlockPos pos) {//mostly copied from GoalBlock
+        double xDiff = pos.getX() - this.x;
+        double zDiff = pos.getZ() - this.z;
         return calculate(xDiff, zDiff);
     }
 
     @Override
     public String toString() {
-        return "GoalXZ{x=" + x + ",z=" + z + "}";
+        return "Goal{x=" + x + ",z=" + z + "}";
     }
 
     public static double calculate(double xDiff, double zDiff) {
@@ -80,13 +81,13 @@ public class GoalXZ implements Goal {
             diagonal = z;
         }
         diagonal *= SQRT_2;
-        return (diagonal + straight) * BaritoneAPI.getSettings().costHeuristic.get(); // big TODO tune
+        return (diagonal + straight) * Baritone.settings().costHeuristic.get(); // big TODO tune
     }
 
     public static GoalXZ fromDirection(Vec3d origin, float yaw, double distance) {
-        float theta = (float) Math.toRadians(yaw);
-        double x = origin.x - MathHelper.sin(theta) * distance;
-        double z = origin.z + MathHelper.cos(theta) * distance;
+        double theta = Utils.degToRad(yaw);
+        double x = origin.x - Math.sin(theta) * distance;
+        double z = origin.z + Math.cos(theta) * distance;
         return new GoalXZ((int) x, (int) z);
     }
 

src/main/java/baritone/bot/pathing/goals/GoalYLevel.java

@@ -2,29 +2,29 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.goals;
+package baritone.bot.pathing.goals;
 
-import baritone.api.pathing.movement.ActionCosts;
+import net.minecraft.util.math.BlockPos;
 
 /**
  * Useful for mining (getting to diamond / iron level)
  *
  * @author leijurv
  */
-public class GoalYLevel implements Goal, ActionCosts {
+public class GoalYLevel implements Goal {
 
     /**
      * The target Y level
@@ -36,29 +36,25 @@ public class GoalYLevel implements Goal, ActionCosts {
     }
 
     @Override
-    public boolean isInGoal(int x, int y, int z) {
-        return y == level;
+    public boolean isInGoal(BlockPos pos) {
+        return pos.getY() == level;
     }
 
     @Override
-    public double heuristic(int x, int y, int z) {
-        return calculate(level, y);
-    }
-
-    public static double calculate(int goalY, int currentY) {
-        if (currentY > goalY) {
+    public double heuristic(BlockPos pos) {
+        if (pos.getY() > level) {
             // need to descend
-            return FALL_N_BLOCKS_COST[2] / 2 * (currentY - goalY);
+            return FALL_N_BLOCKS_COST[pos.getY() - level];
         }
-        if (currentY < goalY) {
+        if (pos.getY() < level) {
             // need to ascend
-            return (goalY - currentY) * JUMP_ONE_BLOCK_COST;
+            return (level - pos.getY()) * JUMP_ONE_BLOCK_COST;
         }
         return 0;
     }
 
     @Override
     public String toString() {
-        return "GoalYLevel{y=" + level + "}";
+        return "Goal{y=" + level + "}";
     }
 }

src/main/java/baritone/bot/pathing/movement/ActionCosts.java

@@ -0,0 +1,46 @@
+/*
+ * This file is part of Baritone.
+ *
+ * Baritone is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * Baritone is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+package baritone.bot.pathing.movement;
+
+public interface ActionCosts extends ActionCostsButOnlyTheOnesThatMakeMickeyDieInside {
+
+    /**
+     * These costs are measured roughly in ticks btw
+     */
+    double WALK_ONE_BLOCK_COST = 20 / 4.317; // 4.633
+    double WALK_ONE_IN_WATER_COST = 20 / 2.2;
+    double WALK_ONE_OVER_SOUL_SAND_COST = WALK_ONE_IN_WATER_COST; // TODO issue #7
+    double LADDER_UP_ONE_COST = 20 / 2.35;
+    double LADDER_DOWN_ONE_COST = 20 / 3.0;
+    double SNEAK_ONE_BLOCK_COST = 20 / 1.3;
+    double SPRINT_ONE_BLOCK_COST = 20 / 5.612; // 3.564
+    /**
+     * To walk off an edge you need to walk 0.5 to the edge then 0.3 to start falling off
+     */
+    double WALK_OFF_BLOCK_COST = WALK_ONE_BLOCK_COST * 0.8;
+    /**
+     * To walk the rest of the way to be centered on the new block
+     */
+    double CENTER_AFTER_FALL_COST = WALK_ONE_BLOCK_COST - WALK_OFF_BLOCK_COST;
+
+    /**
+     * don't make this Double.MAX_VALUE because it's added to other things, maybe other COST_INFs,
+     * and that would make it overflow to negative
+     */
+    double COST_INF = 1000000;
+}

src/main/java/baritone/bot/pathing/movement/ActionCostsButOnlyTheOnesThatMakeMickeyDieInside.java

@@ -2,49 +2,22 @@
  * This file is part of Baritone.
  *
  * Baritone is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
+ * it under the terms of the GNU General Public License as published by
  * the Free Software Foundation, either version 3 of the License, or
  * (at your option) any later version.
  *
  * Baritone is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU General Public License for more details.
  *
- * You should have received a copy of the GNU Lesser General Public License
+ * You should have received a copy of the GNU General Public License
  * along with Baritone.  If not, see <https://www.gnu.org/licenses/>.
  */
 
-package baritone.api.pathing.movement;
-
-public interface ActionCosts {
-
-    /**
-     * These costs are measured roughly in ticks btw
-     */
-    double WALK_ONE_BLOCK_COST = 20 / 4.317; // 4.633
-    double WALK_ONE_IN_WATER_COST = 20 / 2.2; // 9.091
-    double WALK_ONE_OVER_SOUL_SAND_COST = WALK_ONE_BLOCK_COST * 2; // 0.4 in BlockSoulSand but effectively about half
-    double LADDER_UP_ONE_COST = 20 / 2.35; // 8.511
-    double LADDER_DOWN_ONE_COST = 20 / 3.0; // 6.667
-    double SNEAK_ONE_BLOCK_COST = 20 / 1.3; // 15.385
-    double SPRINT_ONE_BLOCK_COST = 20 / 5.612; // 3.564
-    double SPRINT_MULTIPLIER = SPRINT_ONE_BLOCK_COST / WALK_ONE_BLOCK_COST; // 0.769
-    /**
-     * To walk off an edge you need to walk 0.5 to the edge then 0.3 to start falling off
-     */
-    double WALK_OFF_BLOCK_COST = WALK_ONE_BLOCK_COST * 0.8; // 3.706
-    /**
-     * To walk the rest of the way to be centered on the new block
-     */
-    double CENTER_AFTER_FALL_COST = WALK_ONE_BLOCK_COST - WALK_OFF_BLOCK_COST; // 0.927
-
-    /**
-     * don't make this Double.MAX_VALUE because it's added to other things, maybe other COST_INFs,
-     * and that would make it overflow to negative
-     */
-    double COST_INF = 1000000;
+package baritone.bot.pathing.movement;
 
+public interface ActionCostsButOnlyTheOnesThatMakeMickeyDieInside {
     double[] FALL_N_BLOCKS_COST = generateFallNBlocksCost();
 
     double FALL_1_25_BLOCKS_COST = distanceToTicks(1.25);
@@ -84,15 +57,16 @@ public interface ActionCosts {
         if (distance == 0) {
             return 0; // Avoid 0/0 NaN
         }
-        double tmpDistance = distance;
         int tickCount = 0;
         while (true) {
             double fallDistance = velocity(tickCount);
-            if (tmpDistance <= fallDistance) {
-                return tickCount + tmpDistance / fallDistance;
+            if (distance <= fallDistance) {
+                return tickCount + distance / fallDistance;
             }
-            tmpDistance -= fallDistance;
+            distance -= fallDistance;
             tickCount++;
         }
     }
+
+
 }