Namespace Advanced.Algorithms.DataStructures.Foundation
Classes
ArrayList<T>
A self expanding array implementation.
Dictionary<K, V>
A dictionary implementation.
HashSet<T>
A hash table implementation.
OrderedDictionary<K, V>
A sorted Dictionary implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular Dictionary implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided).
OrderedHashSet<T>
A sorted HashSet implementation using balanced binary search tree. IEnumerable will enumerate in sorted order. This may be better than regular HashSet implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided).
Queue<T>
A queue implementation.
Stack<T>
A stack implementation.
Enums
DictionaryType
The dictionary implementation type.
HashSetType
The hash set implementation type.
QueueType
The queue implementation types.
StackType
The stack implementation types.