All Classes and Interfaces

Class	Description
AdjustableBinaryHeap<T>	An implementation of an adjustable binary heap data structure.
AdjustableHeap<T>	An interface representing an adjustable binary heap data structure.
AvlTree<T>	An AVL implementation of the BinarySearchTree interface.
BinaryHeap<T>	The elements of the binary heap are ordered according to their natural ordering, or by a Comparator provided at construction time, depending on which constructor is used.
BinarySearchTree<T>	Basic binary search tree collection which permits duplicates.
GenericUkkonenSuffixTree<T>	The Generic suffix tree implementation using Ukkonen's Algorithm
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.
ImmutableStackImpl<T>	This class is the non-empty implementation.
MergeableHeap<T>	A mergeable heap data structure is a heap that allows for efficient merging of two heaps into a single heap.
OverwritingRingBuffer<T>	Represents a ring buffer that overwrites the oldest element when full.
PrefixTrie	The PrefixTrie can perform fast prefix matching.
PrefixTrieImpl	Basic implementation of a prefix 'trie'.
PrefixTrieImpl.PrefixTrieNode	Node structure for this tree implementation.
ReversePrefixTrie	This implementation uses the same insert/delete/search algorithm as the PrefixTrieImpl.
RingBuffer<T>	A ring buffer abstraction
SuffixTree<T>	Simple generic key value suffix tree contract.
SuffixTrie	An extension of the prefix trie.
UkkonenSuffixTreeInput<T>	A pair of String and T value which will be included in GenericUkkonenSuffixTree