mirror of
https://github.com/PaperMC/Paper.git
synced 2025-01-02 17:32:03 +01:00
badf809fef
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. |
||
|---|---|---|
| .. | ||
| advancements | ||
| commands | ||
| core | ||
| nbt | ||
| network | ||
| resources | ||
| server | ||
| stats | ||
| util | ||
| world | ||
| ChatFormatting.java.patch | ||
| CrashReport.java.patch | ||
| CrashReportCategory.java.patch | ||
| Util.java.patch | ||