Is there a faster TList implementation?

Question

My application makes heavy use of TList, so I was wondering if there are any alternative implementations that are faster or optimized for particular use case.

I know

Answer 1

The fastest data structure is usually not a data structure at all, but instead a mock that pulls data only as it's needed, much like Virtual Treeview does. Perhaps you can write some sort of TVirtualList that calls the appropriate functions to gather the required data when the elements are requested.