Implement numerical index tracking to optimize adding to lists

[UnderscoreTud]

Problem

When adding an element to a list, Skript scans through the entire list to find an open spot for the element. This is a pretty slow operation with a time complexity of O(n), and adds up extremely fast, to the point where adding 10k elements to a list takes around 11 seconds on my machine

Solution

Use a custom tree map implementation that tracks the list's numerical indices and their positions. The implementation adds a shortcut if the numerical indices are consecutive, so for a best case scenario (no gaps in the indices), adding to a list will have a time complexity of O(1). If gaps are present on the other hand, the list will perform a binary search to find the next open slot, giving a time complexity of O(log n) for a worst case scenario. With this implementation, adding 1 million elements to a list takes ~1.5 seconds on my machine, that's over a 70,000% improvement over the old design!

Testing Completed

IndexTrackingTreeMapTest.java

Supporting Information

---

Completes: none
Related: none
AI assistance: Junie was used to generate the majority of test cases

[Absolutionism]

Solid 💪