* BPlusTree - a fairly full featured IDictionary backed by a B+Tree on disk.
* BTreeDictionary - a fully in-memory IDictionary implemented by a B+Tree.
* BTreeList - an in-memory IList using a B+Tree for storage and access.
* LurchTable - Least Used Recently Concurrent Hash Table, LinkedHashMap but thread-safe.
* MergeSort - Provides a memory-efficient sort for arrays.
* OrderedEnumeration & OrderedKeyValuePairs - Ordered enum of large volumes of key-values.
* OrdinalList - A simple byte based bit-mask collection supporting set operations.
See the main project page (https://github.com/csharptest/CSharpTest.Net.Collections) for release notes.
This package has no dependencies.