Struct EstNormCache 

pub struct EstNormCache { /* private fields */ }

Per-column solid/air bitset grid covering a 2D bounding region — (x1 - x0 + 2*RAD) × (y1 - y0 + 2*RAD) columns. Decoding each column to a bitset once turns the estnorm 5×5×5 neighbourhood query into O(1) bit tests. A 448×448 bake (extending to 452×452 with padding) needs about 6.4 MB.

Implementations

impl EstNormCache

pub fn build( world_data: &[u8], column_offsets: &[u32], vsid: u32, x0: i32, y0: i32, x1: i32, y1: i32, ) -> Self

Build the bit-grid cache covering the bounding region [x0..x1) × [y0..y1) extended by ESTNORMRAD padding on each side. Calling Self::estnorm for any (x, y) inside the original [x0..x1) × [y0..y1) box is then a pure read.

Wraps Self::build_with_reader with a flat-table closure.

pub fn build_with_reader<'r>( column_reader: impl Fn(i32, i32) -> Option<&'r [u8]>, x0: i32, y0: i32, x1: i32, y1: i32, ) -> Self

S4B.4.b: chunk-aware cache build. The closure column_reader(x, y) returns the slab bytes of the column at world-or-grid-local position (x, y), or None for an implicit-air / out-of-grid column (matching build’s OOB “treat as full air” semantics).

No vsid bound — the reader owns OOB handling. Per-chunk bakes use a closure that resolves (x, y) to a neighbour chunk via Grid::chunk(IVec3) so the 2-voxel padding extends seamlessly across chunk boundaries.

The cache’s Self::vsid field is left at 0 for chunk- aware builds — the field is dead-code anyway, preserved only for inspection.

pub fn estnorm(&self, x: i32, y: i32, z: i32) -> [f32; 3]

Estimate the surface orientation at solid voxel (x, y, z) as the occupancy gradient of its 5×5×5 neighbourhood:

n = Σ_{solid neighbours} offset,   normal = n / |n|

(the sum runs over offset ∈ [-2, 2]³). n points toward the denser (solid) side; the lighting formulas in update_lighting are calibrated to that orientation. On a flat surface the solid half-space cancels laterally and leaves n along the inward axis. An all-solid or all-air neighbourhood gives n = 0 → (0, 0, 0), which the lighting math treats as unlit.

(x, y) must lie inside the cache’s [x0..x1) × [y0..y1) region (the padded border supplies the ±2 neighbours); z is unconstrained.