On the rows along a box's bottom, top and sides every cell is outer, so in a
section no block reaches out of, the rest of the row up to the chunk's edge
is passed in one step instead of cell by cell. The candidate budget still
ends the scan where it did.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
BlockCollisions keeps a block on the cells around the box (Cursor3D types 1
and 2) only if it has a large collision shape or is a moving piston. Most
sections hold neither in their palette, so the scan now asks the provider
once per section and passes those cells without reading them: a mob's box
reads about a fifth of the cells it did. Same hits, same order.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Block collision scans (vanilla's BlockCollisions) are most of every mob's
move, and moves were the largest share of the world tick with 600 mobs.
Per cell and per hit, the scan did work vanilla's JIT makes cheap:
- the cursor divided its index by the box width and height for every cell;
it now counts x, then y, then z, as Cursor3D does (same cells, same order,
same budget);
- the unit cube test cloned the shared unit cube to compare identities
(`VoxelShape::is_block` compares with it in place), and built a
normalised box to test it against the entity box (`intersects_corners`);
- every non-empty block looked its state up in the contextual rule map
(scaffolding, liquids, powder snow); a flag in the scan table now says
which states have one;
- a moved shape decomposed its occupancy into boxes again; the moved
shape's boxes are its own boxes moved, the same values.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>