: Package weiss.nonstandard

Overview | Package | Class | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES

## Package weiss.nonstandard

Interface Summary
PriorityQueue | PriorityQueue interface.
PriorityQueue.Position | The Position interface represents a type that can be used for the decreaseKey operation.
Queue | Protocol for queues.
SimpleContainer |
Stack | Protocol for stacks.

Class Summary
AATree | Implements an AA-tree.
ArrayQueue | Array-based implementation of the queue.
ArrayStack | Array-based implementation of the stack.
BinaryHeap | Implements a binary heap.
BinarySearchTree | Implements an unbalanced binary search tree.
BinarySearchTreeWithRank | Implements an unbalanced binary search tree.
DisjointSets | Disjoint set class, using union by rank and path compression.
DisjointSetsFast | Disjoint set class, using union by rank and path compression.
Exiting |
LinkedList | Linked list implementation of the list using a header node.
LinkedListIterator | Linked list implementation of the list iterator using a header node.
ListQueue | List-based implementation of the queue.
ListStack | List-based implementation of the stack.
PairingHeap | Implements a pairing heap.
RedBlackTree | Implements a red-black tree.
SortedLinkedList | Linked list implementation of the list using a header node.
SplayTree | Implements a top-down splay tree.

Exception Summary
DuplicateItemException | Exception class for duplicate item errors in search tree insertions.
IllegalValueException | Exception class for illegal decrease key operations in pairing heaps.
ItemNotFoundException | Exception class for failed finds/removes in search trees, hash tables, and list and tree iterators.
UnderflowException | Exception class for access in empty containers such as stacks, queues, and priority queues.

Overview | Package | Class | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES