Upstream/Minestom
1
0
Fork 0
mirror of https://github.com/Minestom/Minestom.git synced 2024-11-08 03:40:27 +01:00
Code Issues Projects Releases Wiki Activity

Stricter resize rule

Browse Source
This commit is contained in:
themode 2022-02-25 22:58:55 +01:00
parent 8839503767
commit 487fbcb5b9
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/main/java/net/minestom/server/instance/palette/AdaptivePalette.java
View File

@ -126,11 +126,12 @@ final class AdaptivePalette implements Palette {
// Find all entries and compress the palette // Find all entries and compress the palette
IntSet entries = new IntOpenHashSet(flexiblePalette.paletteToValueList.size()); IntSet entries = new IntOpenHashSet(flexiblePalette.paletteToValueList.size());
flexiblePalette.getAll((x, y, z, value) -> entries.add(value)); flexiblePalette.getAll((x, y, z, value) -> entries.add(value));
final int currentBitsPerEntry = flexiblePalette.bitsPerEntry();
final int bitsPerEntry;
if (entries.size() == 1) { if (entries.size() == 1) {
return new FilledPalette(dimension, entries.iterator().nextInt()); return new FilledPalette(dimension, entries.iterator().nextInt());
} else if (flexiblePalette.bitsPerEntry() > defaultBitsPerEntry) { } else if (currentBitsPerEntry > defaultBitsPerEntry &&
final int bitsPerEntry = MathUtils.bitsToRepresent(entries.size() - 1); (bitsPerEntry = MathUtils.bitsToRepresent(entries.size() - 1)) < currentBitsPerEntry) {
assert bitsPerEntry < flexiblePalette.bitsPerEntry();
flexiblePalette.resize(bitsPerEntry); flexiblePalette.resize(bitsPerEntry);
return flexiblePalette; return flexiblePalette;
} }