A fast .NET Red-Black Tree implementing IDictionary<TKey,TValue>
The API is identical to the .NET SortedDictionary.
State: Alpha (not complete, just basic insert/remove/query operations)
Some quick performance comparisons (n = 5,000,000)
| Implementation | Insertion | Query | In-order Enumeration | Removal |
|---|---|---|---|---|
| 1. System.Collections.Generic.SortedDictionary | 1.447μs | 0.782μs | 0.098μs | 1.227μs |
| 2. Langman.DataStructures.TreeDictionary | 0.801μs (55.33%) | 0.707μs (90.44%) | 0.088μs (89.64%) | 0.855μs (69.67%) |