3 packages tagged with “ListPool”
ListPool and ValueListPool are optimized allocation free implementations of IList using ArrayPool. Changelog: * Improve dispose performance ListPool is the general use of the implementation, we recommend to use ListPool for most of the cases. ValueListPool is the zero heap allocations implementation, it is optimal working along stackalloc initial buffer for small lists. Note, because it is a struct it is passed by value, not by reference.
High-performance formatters for ListPool.
High-performance converters for ListPool.