Use hash set since we don't need sorting

This commit is contained in:
DBotThePony 2023-08-22 17:46:07 +07:00
parent 87d35eb4af
commit 967b8c71d8
Signed by: DBot
GPG Key ID: DCC23B5715498507

View File

@ -7,6 +7,7 @@ import it.unimi.dsi.fastutil.ints.IntCollection
import it.unimi.dsi.fastutil.ints.IntIterable
import it.unimi.dsi.fastutil.ints.IntIterator
import it.unimi.dsi.fastutil.ints.IntList
import it.unimi.dsi.fastutil.ints.IntOpenHashSet
import it.unimi.dsi.fastutil.ints.IntSet
import it.unimi.dsi.fastutil.objects.Object2ObjectFunction
import it.unimi.dsi.fastutil.objects.Object2ObjectOpenCustomHashMap
@ -324,7 +325,7 @@ fun Container.sortWithIndices(sortedSlots: IntCollection) {
if (sortedSlots.isEmpty() || isEmpty)
return
val seen = IntAVLTreeSet()
val seen = IntOpenHashSet()
val valid = ArrayList<IContainerSlot>()
val iterator = sortedSlots.intIterator()