Minestom/src/main/java/net/minestom/server/collision/ShapeImpl.java

115 lines
4.5 KiB
Java
Raw Normal View History

2022-03-09 19:08:42 +01:00
package net.minestom.server.collision;
import net.minestom.server.coordinate.Point;
import net.minestom.server.coordinate.Vec;
import net.minestom.server.item.Material;
import org.jetbrains.annotations.NotNull;
import java.util.ArrayList;
import java.util.List;
import java.util.function.Supplier;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
final class ShapeImpl implements Shape {
private final List<BoundingBox> blockSections;
private final Supplier<Material> block;
ShapeImpl(List<BoundingBox> boundingBoxes, Supplier<Material> block) {
this.blockSections = boundingBoxes;
this.block = block;
}
static ShapeImpl parseBlockFromRegistry(String str, Supplier<Material> block) {
final String regex = "\\d.\\d{1,3}";
final Pattern pattern = Pattern.compile(regex, Pattern.MULTILINE);
final Matcher matcher = pattern.matcher(str);
ArrayList<Double> vals = new ArrayList<>();
while (matcher.find()) {
double newVal = Double.parseDouble(matcher.group());
vals.add(newVal);
}
List<BoundingBox> boundingBoxes = new ArrayList<>();
final int count = vals.size() / 6;
for (int i = 0; i < count; ++i) {
final double boundXSize = vals.get(3 + 6 * i) - vals.get(0 + 6 * i);
final double boundYSize = vals.get(4 + 6 * i) - vals.get(1 + 6 * i);
final double boundZSize = vals.get(5 + 6 * i) - vals.get(2 + 6 * i);
final double minX, minY, minZ;
minX = vals.get(0 + 6 * i);
minY = vals.get(1 + 6 * i);
minZ = vals.get(2 + 6 * i);
final BoundingBox bb = new BoundingBox(boundXSize, boundYSize, boundZSize, new Vec(minX, minY, minZ));
assert bb.minX() == minX;
assert bb.minY() == minY;
assert bb.minZ() == minZ;
boundingBoxes.add(bb);
}
return new ShapeImpl(boundingBoxes, block);
}
@Override
public @NotNull Point relativeStart() {
double minX = 1, minY = 1, minZ = 1;
for (BoundingBox blockSection : blockSections) {
if (blockSection.minX() < minX) minX = blockSection.minX();
if (blockSection.minY() < minY) minY = blockSection.minY();
if (blockSection.minZ() < minZ) minZ = blockSection.minZ();
}
return new Vec(minX, minY, minZ);
}
@Override
public @NotNull Point relativeEnd() {
double maxX = 1, maxY = 1, maxZ = 1;
for (BoundingBox blockSection : blockSections) {
if (blockSection.maxX() < maxX) maxX = blockSection.maxX();
if (blockSection.maxY() < maxY) maxY = blockSection.maxY();
if (blockSection.maxZ() < maxZ) maxZ = blockSection.maxZ();
}
return new Vec(maxX, maxY, maxZ);
}
@Override
public boolean intersectBox(@NotNull Point position, @NotNull BoundingBox boundingBox) {
return blockSections.stream().anyMatch(section -> boundingBox.intersectBox(position, section));
}
@Override
public boolean intersectBoxSwept(@NotNull Point rayStart, @NotNull Point rayDirection, @NotNull Point shapePos, @NotNull BoundingBox moving, @NotNull SweepResult finalResult) {
List<BoundingBox> collidables = blockSections.stream().filter(blockSection -> {
// Fast check to see if a collision happens
// Uses minkowski sum
return RayUtils.BoundingBoxIntersectionCheck(
moving, rayStart, rayDirection,
blockSection,
shapePos
);
}).toList();
boolean hitBlock = false;
SweepResult tempResult = new SweepResult(1, 0, 0, 0, null);
for (BoundingBox bb : collidables) {
// Longer check to get result of collision
RayUtils.SweptAABB(moving, rayStart, rayDirection, bb, shapePos, tempResult);
// Update final result if the temp result collision is sooner than the current final result
if (tempResult.res < finalResult.res) {
finalResult.res = tempResult.res;
finalResult.normalX = tempResult.normalX;
finalResult.normalY = tempResult.normalY;
finalResult.normalZ = tempResult.normalZ;
finalResult.collidedShapePosition = shapePos;
finalResult.collidedShape = this;
finalResult.blockType = block.get().block();
}
hitBlock = true;
}
return hitBlock;
}
}