Goletas.Collections is a comprehensive set of data structures engineered for optimal performance. Written in pure C#, all collections use generics, custom enumerators and highly optimized iterative implementations to obtain the ultimate performance levels.
Microsoft .NET Framework 2.0 is required to compile the source code.
- This is the first and only iterative implementation of AVL trees in C# available to date. Balanced binary tree nodes contain parent pointers to completely eliminate stack dependency on traversals and help more efficiently rebalance the tree.
- Implementation of a dictionary based on the SortedSet<T> algorithms.
- Stack implementation that uses singly linked list nodes.
- Queue implementation that uses singly linked list nodes.
Download Source Code
All the files supporting Goletas.Collections can be downloaded in a single zip archive file provided below.
Source Files: Goletas.Collections.zip (31 KB), last updated: November 27, 2007