Improve scrolling performance

[John-Paul-R]

Compare performance of list generation methods:

• one where each list element is regenerated each time it is needed
• or, two, where each list element is cached but hidden when node needed

My prediction: the former uses less memory, but will run slower. Perhaps give user option to toggle between these?

---

For list scrolling, prioritize loading new elements over removing old ones. Debounce the remove operation until scrolling is completed.

---

Experiment with determining which list elements need to be displayed based on absolute scroll position instead of last_contentful_container_index.

---

Experiment with preloading the next few item batches when scroll is idle. Although I theorize this will have limited benefit, as most scroll issues only arise when scrolling very rabidly for an extended period of time.