Class Summary |
AbstractIterator<E> |
Abstract base class for portable iterator and enumeration implementation. |
AbstractLinear<E> |
An abstract implemtation of linear data structures. |
AbstractList<E> |
An abstract structure implementing features common to all
list-like structures in this package. |
AbstractListIterator<E> |
Base class for the implementation of a list Iterator. |
AbstractMap<K,V> |
Associations establish a link between a key and a value. |
AbstractQueue<E> |
An abstract structure implementing features common to all first-in, first-out
structures in this package. |
AbstractSet<E> |
Methods common to an Implementation of a set of elements irrespective
of the underlying storage mechanism. |
AbstractStack<E> |
An abstract structure implementing features common to all
Last-In, First-Out structures in this package. |
AbstractStructure<E> |
An abstract implementation of a basic, mutable data structure. |
ArrayIterator<E> |
A conveniece class that provies a mechanism to iterate over
arrays that is analogous to the iteration techniques employed by
the structures in this package. |
Assert |
A library of assertion testing and debugging procedures. |
Association<K,V> |
A class implementing a key-value pair. |
BinarySearchTree<E extends Comparable<E>> |
A binary search tree structure. |
BinaryTree<E> |
This class implements a single node of a binary tree. |
BitSet |
Implementation of a set of numbered bits. |
ChainedHashtable<K,V> |
This class implements a hash table whose collisions are resolved
through external chaining. |
CharSet |
Implementation of a set of characters whose ASCII values are between
0 and 255, inclusive. |
CircularList<E> |
An implementation of lists using circularly linked elements,
similar to that of java.util.LinkedList . |
Clock |
A simple object for measuring time. |
ComparableAssociation<K extends Comparable<K>,V> |
A class implementing a comparable key-value pair. |
ComparableEdge<V,E extends Comparable<E>> |
A class implementing common edge type among graphs. |
DoublyLinkedList<E> |
An implementation of lists using doubly linked elements, similar to that of java.util.LinkedList . |
DoublyLinkedListIterator<E> |
An iterator for traversing the elements of a doubly linked list. |
DoublyLinkedNode<E> |
A class supporting a doubly linked list element. |
Edge<V,E> |
A class implementing common edge type among graphs. |
Entry<K,V> |
An implementation of the the java.util.Map.Entry interface, Entry
is a simple key value pair, from which both the key and the value
can be accessed. |
FileStream |
This class provides a way to connect text files to scanners,
without worrying about Exceptions. |
GraphList<V,E> |
Implementation of graph using adjacency lists. |
GraphListDirected<V,E> |
A GraphListDirected is a list-based graph representation that consists
of a collection of vertices and directed edges. |
GraphListUndirected<V,E> |
A GraphListUndirected is a list-based graph representation that consists
of a collection of vertices and undirected edges. |
GraphMatrix<V,E> |
Implementation of graph using adjacency matrices. |
GraphMatrixDirected<V,E> |
A GraphMatrixDirected is a matrix-based graph representation that
consists of a collection of vertices and directed edges. |
GraphMatrixUndirected<V,E> |
A GraphMatrixUndirected is a matrix-based graph representation that
consists of a collection of vertices and undirected edges. |
HashAssociation<K,V> |
Implements an association that can be marked "reserved". |
Hashtable<K,V> |
Implements a dictionary as a table of hashed key-value pairs. |
MapList<K,V> |
Associations establish a link between a key and a value. |
Matrix<E> |
An implementation of rectangular vectors. |
NaturalComparator<E extends Comparable<E>> |
Implementation of the Comparator interface that
provides a NaturalComparator.compare(E, E) method that compares two objects using those
objects default compareTo methods. |
Node<E> |
A class supporting a singly linked list element. |
OrderedList<E extends Comparable<E>> |
A class that implements a collection of values that are kept in order. |
OrderedVector<E extends Comparable<E>> |
Implementation of an ordered structure implemented using a vector. |
PriorityVector<E extends Comparable<E>> |
A vector-based implementation of a priority queue. |
QueueArray<E> |
An implementation of queues based on arrays. |
QueueList<E> |
An implementation of queues based on circular lists. |
QueueVector<E> |
An implementation of queues based on vectors. |
ReadStream |
A ReadStream provides reasonable access to the typewritten
data on an input stream. |
RedBlackSearchTree<E extends Comparable<E>> |
Red black trees, are binary trees that guarantee the following three properties. |
RedBlackTree<E extends Comparable<E>> |
This class implements a single node of a red-black tree. |
ReverseComparator<E extends Comparable<E>> |
Implementation of the Comparator interface that
provides a Comparator.compare(Object,Object) method that compares
two objects using those objects default compareTo methods. |
SetList<E> |
Implementation of a set of elements using a list as the underlying
storage mechanism. |
SetVector<E> |
Implementation of a set of elements using a vector as the underlying
storage mechanism. |
SinglyLinkedList<E> |
An implementation of lists using singly linked elements, similar to that of java.util.LinkedList . |
SkewHeap<E extends Comparable<E>> |
An implementation of a priority queue using skew heaps. |
SplayTree<E extends Comparable<E>> |
An implementation of binary search trees, based on a splay operation
by Tarjan et al. |
StackArray<E> |
An implementation of a stack, based on array. |
StackList<E> |
An implementation of a stack, based on lists. |
StackVector<E> |
An implementation of a stack, based on extensible arrays. |
StructCollection<E> |
This utility class converts a Structure to a Collection. |
Table<K extends Comparable<K>,V> |
An implementation of an ordered dictionary. |
Vector<E> |
An implementation of extensible arrays, similar to that of java.util.Vector . |
VectorHeap<E extends Comparable<E>> |
This class implements a priority queue based on a traditional
array-based heap. |
Version |
A utility class that can be used to determine the version of software
currently being used. |