2024-02-19 02:02:25 -08:00
|
|
|
package net.minecraft.pathfinding;
|
2024-02-14 20:52:11 -08:00
|
|
|
|
2024-02-19 02:02:25 -08:00
|
|
|
import net.minecraft.entity.Entity;
|
|
|
|
|
import net.minecraft.util.BlockPos;
|
|
|
|
|
import net.minecraft.world.IBlockAccess;
|
|
|
|
|
import net.minecraft.world.pathfinder.NodeProcessor;
|
2024-02-14 20:52:11 -08:00
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* This portion of EaglercraftX contains deobfuscated Minecraft 1.8 source code.
|
|
|
|
|
*
|
|
|
|
|
* Minecraft 1.8.8 bytecode is (c) 2015 Mojang AB. "Do not distribute!"
|
|
|
|
|
* Mod Coder Pack v9.18 deobfuscation configs are (c) Copyright by the MCP Team
|
|
|
|
|
*
|
|
|
|
|
* EaglercraftX 1.8 patch files (c) 2022-2024 lax1dude, ayunami2000. All Rights Reserved.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
|
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
|
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
|
|
|
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
|
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
public class PathFinder {
|
|
|
|
|
/**+
|
|
|
|
|
* The path being generated
|
|
|
|
|
*/
|
|
|
|
|
private Path path = new Path();
|
|
|
|
|
/**+
|
|
|
|
|
* Selection of path points to add to the path
|
|
|
|
|
*/
|
|
|
|
|
private PathPoint[] pathOptions = new PathPoint[32];
|
|
|
|
|
private NodeProcessor nodeProcessor;
|
|
|
|
|
|
|
|
|
|
public PathFinder(NodeProcessor nodeProcessorIn) {
|
|
|
|
|
this.nodeProcessor = nodeProcessorIn;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* Internal implementation of creating a path from an entity to
|
|
|
|
|
* a point
|
|
|
|
|
*/
|
|
|
|
|
public PathEntity createEntityPathTo(IBlockAccess blockaccess, Entity entityFrom, Entity entityTo, float dist) {
|
|
|
|
|
return this.createEntityPathTo(blockaccess, entityFrom, entityTo.posX, entityTo.getEntityBoundingBox().minY,
|
|
|
|
|
entityTo.posZ, dist);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* Internal implementation of creating a path from an entity to
|
|
|
|
|
* a point
|
|
|
|
|
*/
|
|
|
|
|
public PathEntity createEntityPathTo(IBlockAccess blockaccess, Entity entityIn, BlockPos targetPos, float dist) {
|
|
|
|
|
return this.createEntityPathTo(blockaccess, entityIn, (double) ((float) targetPos.getX() + 0.5F),
|
|
|
|
|
(double) ((float) targetPos.getY() + 0.5F), (double) ((float) targetPos.getZ() + 0.5F), dist);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* Internal implementation of creating a path from an entity to
|
|
|
|
|
* a point
|
|
|
|
|
*/
|
|
|
|
|
private PathEntity createEntityPathTo(IBlockAccess blockaccess, Entity entityIn, double x, double y, double z,
|
|
|
|
|
float distance) {
|
|
|
|
|
this.path.clearPath();
|
|
|
|
|
this.nodeProcessor.initProcessor(blockaccess, entityIn);
|
|
|
|
|
PathPoint pathpoint = this.nodeProcessor.getPathPointTo(entityIn);
|
|
|
|
|
PathPoint pathpoint1 = this.nodeProcessor.getPathPointToCoords(entityIn, x, y, z);
|
|
|
|
|
PathEntity pathentity = this.addToPath(entityIn, pathpoint, pathpoint1, distance);
|
|
|
|
|
this.nodeProcessor.postProcess();
|
|
|
|
|
return pathentity;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* Adds a path from start to end and returns the whole path
|
|
|
|
|
*/
|
|
|
|
|
private PathEntity addToPath(Entity entityIn, PathPoint pathpointStart, PathPoint pathpointEnd, float maxDistance) {
|
|
|
|
|
pathpointStart.totalPathDistance = 0.0F;
|
|
|
|
|
pathpointStart.distanceToNext = pathpointStart.distanceToSquared(pathpointEnd);
|
|
|
|
|
pathpointStart.distanceToTarget = pathpointStart.distanceToNext;
|
|
|
|
|
this.path.clearPath();
|
|
|
|
|
this.path.addPoint(pathpointStart);
|
|
|
|
|
PathPoint pathpoint = pathpointStart;
|
|
|
|
|
|
|
|
|
|
while (!this.path.isPathEmpty()) {
|
|
|
|
|
PathPoint pathpoint1 = this.path.dequeue();
|
|
|
|
|
if (pathpoint1.equals(pathpointEnd)) {
|
|
|
|
|
return this.createEntityPath(pathpointStart, pathpointEnd);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (pathpoint1.distanceToSquared(pathpointEnd) < pathpoint.distanceToSquared(pathpointEnd)) {
|
|
|
|
|
pathpoint = pathpoint1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pathpoint1.visited = true;
|
|
|
|
|
int i = this.nodeProcessor.findPathOptions(this.pathOptions, entityIn, pathpoint1, pathpointEnd,
|
|
|
|
|
maxDistance);
|
|
|
|
|
|
|
|
|
|
for (int j = 0; j < i; ++j) {
|
|
|
|
|
PathPoint pathpoint2 = this.pathOptions[j];
|
|
|
|
|
float f = pathpoint1.totalPathDistance + pathpoint1.distanceToSquared(pathpoint2);
|
|
|
|
|
if (f < maxDistance * 2.0F && (!pathpoint2.isAssigned() || f < pathpoint2.totalPathDistance)) {
|
|
|
|
|
pathpoint2.previous = pathpoint1;
|
|
|
|
|
pathpoint2.totalPathDistance = f;
|
|
|
|
|
pathpoint2.distanceToNext = pathpoint2.distanceToSquared(pathpointEnd);
|
|
|
|
|
if (pathpoint2.isAssigned()) {
|
|
|
|
|
this.path.changeDistance(pathpoint2, pathpoint2.totalPathDistance + pathpoint2.distanceToNext);
|
|
|
|
|
} else {
|
|
|
|
|
pathpoint2.distanceToTarget = pathpoint2.totalPathDistance + pathpoint2.distanceToNext;
|
|
|
|
|
this.path.addPoint(pathpoint2);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (pathpoint == pathpointStart) {
|
|
|
|
|
return null;
|
|
|
|
|
} else {
|
|
|
|
|
return this.createEntityPath(pathpointStart, pathpoint);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**+
|
|
|
|
|
* Returns a new PathEntity for a given start and end point
|
|
|
|
|
*/
|
|
|
|
|
private PathEntity createEntityPath(PathPoint start, PathPoint end) {
|
|
|
|
|
int i = 1;
|
|
|
|
|
|
|
|
|
|
for (PathPoint pathpoint = end; pathpoint.previous != null; pathpoint = pathpoint.previous) {
|
|
|
|
|
++i;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
PathPoint[] apathpoint = new PathPoint[i];
|
|
|
|
|
PathPoint pathpoint1 = end;
|
|
|
|
|
--i;
|
|
|
|
|
|
|
|
|
|
for (apathpoint[i] = end; pathpoint1.previous != null; apathpoint[i] = pathpoint1) {
|
|
|
|
|
pathpoint1 = pathpoint1.previous;
|
|
|
|
|
--i;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return new PathEntity(apathpoint);
|
|
|
|
|
}
|
|
|
|
|
}
|