Method directPathfind

src/redempt/redlib/misc/LocationUtils.java:377–388

Finds the fastest path between a starting and ending location using A , then removes unneeded steps for straight @param start The starting block @param end The ending block @param max The max number of locations to be checked - use to limit runtime @param filter A filter to determine which b

(Block start, Block end, int max, Predicate<Block> filter)

     * be completed
     */
    public static List<Location> directPathfind(Block start, Block end, int max, Predicate<Block> filter) {
        List<Location> path = new ArrayList<>(pathfind(start, end, max, filter));
        for (int i = 0; i + 2 < path.size(); i += 2) {
            Location first = path.get(i);
            Location second = path.get(i + 2);
            if (Path.getPath(first, second, 0.25).stream().map(Location::getBlock).allMatch(filter)) {
                path.remove(i + 1);
                i -= 2;
            }
        }
        return path;
    }

    /**
     * Finds the fastest path between a starting and ending location using A*, then removes unneeded steps for straight