title: Is there a faster TList implementation?
body: <p>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.</p>
  
  <p>I know of <a href="http://cc.codegear.com/Item/25537" rel="noreferrer" title="RtlVCLOptimize.pas 2.77">RtlVCLOptimize.pas 2.77</a>, which has optimized implementations of several TList methods.</p>
  
  <p>But I'd like to know if there is anything else out there. I also don't require it to be a TList descendant, I just need the TList functionality regardless of how it's implemented.</p>
  
  <p>It's entirely possible, given the rather basic functionality TList provides, that there is not much room for improvement, but would still like to verify that, hence this question.</p>
  
  <p>edit: In my particular use case no lists are sorted. There are lots of lists, with various number of elements in. I did replace TList with my own class in order to log number of Add/Remove calls and count of elements. It reports (toatal for all lists):</p>
  
  <pre><code>ListAdd = 15766012; ListRemove = 10630000; ListCount = 5136012
  </code></pre>
  
  <p>I could also find out what the highest number of elements in a single list is.</p>
  
  <p>I have no particular issue, I just wonder if there is a way to make it faster all around as with these numbers even small improvement would add up.</p>