Package <Unnamed>

Interface Summary

Iterator<K,D>	An iterator allows to iterate over all entries of a Map.
Listiterator<K,D>	An Listiterator allows all operations of an Iterator, and additionally has operations to insert and delete entries at the current position.
Map<K,D>	A Map is a data structure to store data under key values, or just keys.

Class Summary

Array<D>	An array is more convenient class of the built-in arrays.
AVLtree<K extends Comparable<K>,D>	An AVL-tree is an always balanced tree.
Dictionary<K,D>	A dictionary provides some default implementations of methods that are required for the Map-interface.
Hashtable<K,D>	A hashtable implementation of the Map-interface.
List<K,D>	A List is a Map implemented as double-linked list.
OArray<D extends Comparable<D>>	An (O)rdered array is like an array but there additional methods to sort an array (OArray.quicksort() and OArray.heapsort()).
OPair<A extends Comparable<A>,B extends Comparable<B>>	An ordered pair is a pair which is ordered lexicographically.
Pair<A,B>	A pair consists of two values of type A and B.
Queue<D>	A list-based implementation of a queue, i.e.
Searchtree<K extends Comparable<K>,D>	A Searchtree is a Map-implementation as (not necessarily balanced) binary tree.
Set<K>	A set is like a Map without data, i.e.
SimpleIterator<K>	A SimpleIterator only iterates over the keys, but hides the data associated to the keys.
Skiplist<K extends Comparable<K>,D>	This class implements the Map-interface as skiplists.
Splaytree<K extends Comparable<K>,D>	An implementation of a Splaytree.
Stack<D>	A list-based implementation of a stack (LIFO-buffer) with only constant time operations.
Treap<K extends Comparable<K>,D>	A treap is like a search-tree where the nodes are annotated with weights/priorities.