All Classes and Interfaces

Interfaces

Class	Description
AdjustableHeap<T>	An interface representing an adjustable binary heap data structure.
BinarySearchTree<T>	Basic binary search tree collection which permits duplicates.
Heap<T>	A heap is a data structure which satisfies the heap property.
ImmutableStack<T>	This stack is considered 'immutable' because no operations are performed in-place at any given element.
MergeableHeap<T>	A mergeable heap data structure is a heap that allows for efficient merging of two heaps into a single heap.
PrefixTrie	The PrefixTrie can perform fast prefix matching.
RingBuffer<T>	A ring buffer abstraction
SuffixTrie	An extension of the prefix trie.