PaperMC/paper-server
Martijn Muijsers badf809fef Optimize nearest structure border iteration
Getting the nearest generated structure contains a nested set of loops that
iterates over all chunks at a specific chessboard distance. It does this by
iterating over the entire square of chunks within that distance, and checking
if the coordinates are at exactly the right distance to be on the border.

This patch optimizes the iteration by only iterating over the border chunks.
This evaluated chunks are the same, and in the same order, as before, to
ensure that the returned found structure (which may for example be a buried
treasure that will be marked on a treasure map) is the same as in vanilla.
2023-08-21 21:05:09 +02:00
..
patches/sources Optimize nearest structure border iteration 2023-08-21 21:05:09 +02:00
src More DragonBattle API 2022-12-18 13:40:05 -08:00
.gitignore Setup Gradle project 2020-12-10 20:54:19 -08:00
build.gradle.kts Add support for Proxy Protocol 2022-04-07 16:13:39 +02:00
LGPL.txt
LICENCE.txt