1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268
use std::convert::TryFrom;
use std::ops::Range;
use std::sync::RwLock;
use fastnbt::IntArray;
use once_cell::sync::OnceCell;
use serde::Deserialize;
use crate::java::AIR;
use crate::{biome::Biome, Block, Chunk, HeightMode};
use crate::{bits_per_block, expand_heightmap, Heightmaps, PackedBits, SectionLike, SectionTower};
/// A Minecraft chunk.
#[derive(Deserialize, Debug)]
#[serde(rename_all = "PascalCase")]
pub struct JavaChunk {
pub data_version: i32,
pub level: Level,
}
impl Chunk for JavaChunk {
fn status(&self) -> String {
self.level.status.clone()
}
fn surface_height(&self, x: usize, z: usize, mode: HeightMode) -> isize {
let mut heightmap = self.level.lazy_heightmap.read().unwrap();
if heightmap.is_none() {
drop(heightmap);
self.recalculate_heightmap(mode);
heightmap = self.level.lazy_heightmap.read().unwrap();
}
heightmap.unwrap()[z * 16 + x] as isize
}
fn biome(&self, x: usize, y: isize, z: usize) -> Option<Biome> {
let biomes = self.level.biomes.as_ref()?;
// After 1.15 Each biome in i32, biomes split into 4-wide cubes, so
// 4x4x4 per section.
// v1.15 was only x/z, i32 per column.
const V1_15: usize = 16 * 16;
match biomes.len() {
V1_15 => {
// 1x1 columns stored z then x.
let i = z * 16 + x;
let biome = biomes[i];
Biome::try_from(biome).ok()
}
_ => {
// Assume latest
let range = self.y_range();
if range.is_empty() {
// Sometimes biomes can be specified, but there's actually
// no blocks.
return None;
}
let y_shifted = (y.clamp(range.start, range.end - 1) - range.start) as usize;
let i = (z / 4) * 4 + (x / 4) + (y_shifted / 4) * 16;
let biome = *biomes.get(i)?;
Biome::try_from(biome).ok()
}
}
}
fn block(&self, x: usize, y: isize, z: usize) -> Option<&Block> {
let sec = self.level.sections.as_ref()?.get_section_for_y(y)?;
// If a section is entirely air, then the block states are missing
// entirely, presumably to save space.
match &sec.block_states {
None => Some(&AIR),
Some(blockstates) => {
let sec_y = (y - sec.y as isize * 16) as usize;
let pal_index = blockstates.state(x, sec_y, z, sec.palette.len());
sec.palette.get(pal_index)
}
}
}
fn y_range(&self) -> std::ops::Range<isize> {
match &self.level.sections {
Some(sections) => Range {
start: sections.y_min(),
end: sections.y_max(),
},
None => Range { start: 0, end: 0 },
}
}
}
/// A level describes the contents of the chunk in the world.
#[derive(Deserialize, Debug)]
#[serde(rename_all = "PascalCase")]
pub struct Level {
#[serde(rename = "xPos")]
pub x_pos: i32,
#[serde(rename = "zPos")]
pub z_pos: i32,
pub biomes: Option<IntArray>,
/// Can be empty if the chunk hasn't been generated properly yet.
pub sections: Option<SectionTower<Pre18Section>>,
pub heightmaps: Option<Heightmaps>,
// Status of the chunk. Typically anything except 'full' means the chunk
// hasn't been fully generated yet. We use this to skip chunks on map edges
// that haven't been fully generated yet.
pub status: String,
#[serde(skip)]
pub(crate) lazy_heightmap: RwLock<Option<[i16; 256]>>,
}
impl JavaChunk {
pub fn recalculate_heightmap(&self, mode: HeightMode) {
// TODO: Find top section and start there, pointless checking 320 down
// if its a 1.16 chunk.
let mut map = [0; 256];
match mode {
HeightMode::Trust => {
let updated = self
.level
.heightmaps
.as_ref()
.and_then(|hm| hm.motion_blocking.as_ref())
.map(|hm| {
// unwrap, if heightmaps exists, sections should... 🤞
let y_min = self.level.sections.as_ref().unwrap().y_min();
expand_heightmap(hm, y_min, self.data_version)
})
.map(|hm| map.copy_from_slice(hm.as_slice()))
.is_some();
if updated {
*self.level.lazy_heightmap.write().unwrap() = Some(map);
return;
}
}
HeightMode::Calculate => {} // fall through to calc mode
}
let y_range = self.y_range();
let y_end = y_range.end;
for z in 0..16 {
for x in 0..16 {
// start at top until we hit a non-air block.
for i in y_range.clone() {
let y = y_end - i;
let block = self.block(x, y - 1, z);
if block.is_none() {
continue;
}
if !["minecraft:air", "minecraft:cave_air"]
.as_ref()
.contains(&block.unwrap().name())
{
map[z * 16 + x] = y as i16;
break;
}
}
}
}
*self.level.lazy_heightmap.write().unwrap() = Some(map);
}
}
/// A vertical section of a chunk (ie a 16x16x16 block cube), for before 1.18.
#[derive(Deserialize, Debug)]
#[serde(rename_all = "PascalCase")]
pub struct Pre18Section {
pub y: i8,
pub block_states: Option<Pre18Blockstates>,
#[serde(default)]
pub palette: Vec<Block>,
}
impl SectionLike for Pre18Section {
fn is_terminator(&self) -> bool {
self.palette.is_empty() && self.block_states.is_none()
}
fn y(&self) -> i8 {
self.y
}
}
#[derive(Debug)]
pub struct Pre18Blockstates {
unpacked: OnceCell<[u16; 16 * 16 * 16]>,
packed: PackedBits,
}
impl Pre18Blockstates {
/// Get the state for the given block at x,y,z, where x, y, and z are
/// relative to the section ie 0..16
#[inline(always)]
pub fn state(&self, x: usize, sec_y: usize, z: usize, pal_len: usize) -> usize {
let unpacked = self.unpacked.get_or_init(|| {
let bits_per_item = bits_per_block(pal_len);
let mut buf = [0u16; 16 * 16 * 16];
self.packed.unpack_blockstates(bits_per_item, &mut buf);
buf
});
let state_index = (sec_y * 16 * 16) + z * 16 + x;
unpacked[state_index] as usize
}
/// Get iterator for the state indicies. This will increase in x, then z,
/// then y. These indicies are used with the relevant palette to get the
/// data for that block.
///
/// The pal_len must be the length of the palette corresponding to these
/// blockstates.
///
/// You can recover the coordinate be enumerating the iterator:
///
/// ```no_run
/// # use fastanvil::pre18::Pre18Blockstates;
/// # fn main() {
/// # let states: Pre18Blockstates = todo!();
/// for (i, block_index) in states.iter_indices(10).enumerate() {
/// let x = i & 0x000F;
/// let y = (i & 0x0F00) >> 8;
/// let z = (i & 0x00F0) >> 4;
/// }
/// # }
/// ```
pub fn iter_indices(&self, pal_len: usize) -> impl Iterator<Item = usize> + '_ {
let unpacked = self.unpacked.get_or_init(|| {
let bits_per_item = bits_per_block(pal_len);
let mut buf = [0u16; 16 * 16 * 16];
self.packed.unpack_blockstates(bits_per_item, &mut buf);
buf
});
unpacked.iter().map(|&i| i as usize)
}
}
impl<'de> Deserialize<'de> for Pre18Blockstates {
fn deserialize<D>(d: D) -> Result<Self, D::Error>
where
D: serde::Deserializer<'de>,
{
let packed: PackedBits = Deserialize::deserialize(d)?;
Ok(Self {
packed,
unpacked: OnceCell::new(),
})
}
}