113 lines
4.8 KiB
Java
113 lines
4.8 KiB
Java
package net.minecraft.world.level.levelgen.feature.trunkplacers;
|
|
|
|
import com.mojang.datafixers.Products.P3;
|
|
import com.mojang.serialization.Codec;
|
|
import com.mojang.serialization.codecs.RecordCodecBuilder.Instance;
|
|
import com.mojang.serialization.codecs.RecordCodecBuilder.Mu;
|
|
import java.util.List;
|
|
import java.util.function.BiConsumer;
|
|
import java.util.function.Function;
|
|
import net.minecraft.core.BlockPos;
|
|
import net.minecraft.core.registries.BuiltInRegistries;
|
|
import net.minecraft.tags.BlockTags;
|
|
import net.minecraft.util.RandomSource;
|
|
import net.minecraft.world.level.LevelSimulatedReader;
|
|
import net.minecraft.world.level.block.Blocks;
|
|
import net.minecraft.world.level.block.state.BlockState;
|
|
import net.minecraft.world.level.levelgen.feature.Feature;
|
|
import net.minecraft.world.level.levelgen.feature.TreeFeature;
|
|
import net.minecraft.world.level.levelgen.feature.configurations.TreeConfiguration;
|
|
import net.minecraft.world.level.levelgen.feature.foliageplacers.FoliagePlacer;
|
|
|
|
public abstract class TrunkPlacer {
|
|
public static final Codec<TrunkPlacer> CODEC = BuiltInRegistries.TRUNK_PLACER_TYPE.byNameCodec().dispatch(TrunkPlacer::type, TrunkPlacerType::codec);
|
|
private static final int MAX_BASE_HEIGHT = 32;
|
|
private static final int MAX_RAND = 24;
|
|
public static final int MAX_HEIGHT = 80;
|
|
protected final int baseHeight;
|
|
protected final int heightRandA;
|
|
protected final int heightRandB;
|
|
|
|
protected static <P extends TrunkPlacer> P3<Mu<P>, Integer, Integer, Integer> trunkPlacerParts(Instance<P> p_70306_) {
|
|
return p_70306_.group(
|
|
Codec.intRange(0, 32).fieldOf("base_height").forGetter(p_70314_ -> p_70314_.baseHeight),
|
|
Codec.intRange(0, 24).fieldOf("height_rand_a").forGetter(p_70312_ -> p_70312_.heightRandA),
|
|
Codec.intRange(0, 24).fieldOf("height_rand_b").forGetter(p_70308_ -> p_70308_.heightRandB)
|
|
);
|
|
}
|
|
|
|
public TrunkPlacer(int p_70268_, int p_70269_, int p_70270_) {
|
|
this.baseHeight = p_70268_;
|
|
this.heightRandA = p_70269_;
|
|
this.heightRandB = p_70270_;
|
|
}
|
|
|
|
protected abstract TrunkPlacerType<?> type();
|
|
|
|
public abstract List<FoliagePlacer.FoliageAttachment> placeTrunk(
|
|
LevelSimulatedReader p_226157_,
|
|
BiConsumer<BlockPos, BlockState> p_226158_,
|
|
RandomSource p_226159_,
|
|
int p_226160_,
|
|
BlockPos p_226161_,
|
|
TreeConfiguration p_226162_
|
|
);
|
|
|
|
public int getTreeHeight(RandomSource p_226154_) {
|
|
return this.baseHeight + p_226154_.nextInt(this.heightRandA + 1) + p_226154_.nextInt(this.heightRandB + 1);
|
|
}
|
|
|
|
private static boolean isDirt(LevelSimulatedReader p_70296_, BlockPos p_70297_) {
|
|
return p_70296_.isStateAtPosition(p_70297_, p_70304_ -> Feature.isDirt(p_70304_) && !p_70304_.is(Blocks.GRASS_BLOCK) && !p_70304_.is(Blocks.MYCELIUM));
|
|
}
|
|
|
|
protected static void setDirtAt(
|
|
LevelSimulatedReader p_226170_, BiConsumer<BlockPos, BlockState> p_226171_, RandomSource p_226172_, BlockPos p_226173_, TreeConfiguration p_226174_
|
|
) {
|
|
if (p_226174_.forceDirt || !isDirt(p_226170_, p_226173_)) {
|
|
p_226171_.accept(p_226173_, p_226174_.dirtProvider.getState(p_226172_, p_226173_));
|
|
}
|
|
}
|
|
|
|
protected boolean placeLog(
|
|
LevelSimulatedReader p_226188_, BiConsumer<BlockPos, BlockState> p_226189_, RandomSource p_226190_, BlockPos p_226191_, TreeConfiguration p_226192_
|
|
) {
|
|
return this.placeLog(p_226188_, p_226189_, p_226190_, p_226191_, p_226192_, Function.identity());
|
|
}
|
|
|
|
protected boolean placeLog(
|
|
LevelSimulatedReader p_226176_,
|
|
BiConsumer<BlockPos, BlockState> p_226177_,
|
|
RandomSource p_226178_,
|
|
BlockPos p_226179_,
|
|
TreeConfiguration p_226180_,
|
|
Function<BlockState, BlockState> p_226181_
|
|
) {
|
|
if (this.validTreePos(p_226176_, p_226179_)) {
|
|
p_226177_.accept(p_226179_, p_226181_.apply(p_226180_.trunkProvider.getState(p_226178_, p_226179_)));
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
protected void placeLogIfFree(
|
|
LevelSimulatedReader p_226164_,
|
|
BiConsumer<BlockPos, BlockState> p_226165_,
|
|
RandomSource p_226166_,
|
|
BlockPos.MutableBlockPos p_226167_,
|
|
TreeConfiguration p_226168_
|
|
) {
|
|
if (this.isFree(p_226164_, p_226167_)) {
|
|
this.placeLog(p_226164_, p_226165_, p_226166_, p_226167_, p_226168_);
|
|
}
|
|
}
|
|
|
|
protected boolean validTreePos(LevelSimulatedReader p_226155_, BlockPos p_226156_) {
|
|
return TreeFeature.validTreePos(p_226155_, p_226156_);
|
|
}
|
|
|
|
public boolean isFree(LevelSimulatedReader p_226185_, BlockPos p_226186_) {
|
|
return this.validTreePos(p_226185_, p_226186_) || p_226185_.isStateAtPosition(p_226186_, p_226183_ -> p_226183_.is(BlockTags.LOGS));
|
|
}
|
|
} |