mirror of
https://github.com/PaperMC/Paper.git
synced 2025-05-19 05:30:23 -07:00
Make advancement ordering predictable (#12292)
This commit is contained in:
parent
f49d18df89
commit
894631f0d0
@ -67,3 +67,12 @@
|
|||||||
}
|
}
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
@@ -247,7 +_,7 @@
|
||||||
|
public void flushDirty(ServerPlayer serverPlayer) {
|
||||||
|
if (this.isFirstPacket || !this.rootsToUpdate.isEmpty() || !this.progressChanged.isEmpty()) {
|
||||||
|
Map<ResourceLocation, AdvancementProgress> map = new HashMap<>();
|
||||||
|
- Set<AdvancementHolder> set = new HashSet<>();
|
||||||
|
+ Set<AdvancementHolder> set = new java.util.TreeSet<>(java.util.Comparator.comparing(adv -> adv.id().toString())); // Paper - Changed from HashSet to TreeSet ordered alphabetically.
|
||||||
|
Set<ResourceLocation> set1 = new HashSet<>();
|
||||||
|
|
||||||
|
for (AdvancementNode advancementNode : this.rootsToUpdate) {
|
||||||
|
Loading…
x
Reference in New Issue
Block a user