The FastList is very similar to the standard generic List of .NET because both are working in a similar way. Both of them are using growing arrays for storing data. The advantage of the FastList over the .NET-List are:
  • Clearing the list: The FastList is approx. 10 times faster
  • Removing elements from the beginning: The FastList is approx. 10 times faster
  • Enumerating the list: The FastList is approx. 3 times faster

The FastList is faster at clearing, because it doesn't really clears the list and doesn't free any memory. It resets the element counter only to zero. When you add new elements they will overwrite the old unused elements. Removing single elements from the list is working in a similar way. No memory is freed in this case.

Last edited Dec 8, 2010 at 8:53 AM by Glatzemann, version 1

Comments

No comments yet.