Package DataStructures

Interface Summary

Comparable	Protocol for Comparable objects.
Hashable	Protocol for Hashable objects.

Class Summary

AATree	Implements an AA-tree.
AvlTree	Implements an AVL tree.
BinaryHeap	Implements a binary heap.
BinarySearchTree	Implements an unbalanced binary search tree.
BinomialQueue	Implements a binomial queue.
CursorList	Linked list implementation of the list using a header node; cursor version.
CursorListItr	Linked list implementation of the list iterator using a header node; cursor version.
DisjSetsFast	Disjoint set class, using union by rank and path compression.
DSL	Implements a deterministic skip list.
LeftistHeap	Implements a leftist heap.
LinkedList	Linked list implementation of the list using a header node.
LinkedListItr	Linked list implementation of the list iterator using a header node.
MyInteger	Wrapper class for use with generic data structures.
PairHeap	Implements a pairing heap.
PairNode	Public class for use with PairHeap.
QuadraticProbingHashTable	Probing table implementation of hash tables.
QueueAr	Array-based implementation of the queue.
Random	Random number class, using a 31-bit linear congruential generator.
RedBlackTree	Implements a red-black tree.
SeparateChainingHashTable	Separate chaining table implementation of hash tables.
Sort	A class that contains several sorting routines, implemented as static methods.
SplayTree	Implements a top-down splay tree.
StackAr	Array-based implementation of the stack.
StackLi	List-based implementation of the stack.
Treap	Implements a treap.

Exception Summary

Overflow	Exception class for access in full containers such as stacks, queues, and priority queues.
Underflow	Exception class for access in empty containers such as stacks, queues, and priority queues.