Package structure

Interface Summary
Graph The interface describing all Graph objects.
Linear Linear classes are contains that have completely determined add and remove methods.
List Interface describing lists.
Map  
OrderedMap  
OrderedStructure An interface the supports a Collection whose values are kept in increasing order.
PriorityQueue Interface describing an queue of prioritized values.
Queue A first-in, first-out structure.
Set Implementation of a set of elements.
Stack An interface describing a Last-In, First-Out structure.
Structure The interface of a basic, mutable data structure.
 

Class Summary
AbstractIterator Abstract base class for portable iterator and enumeration implementation.
AbstractLinear  
AbstractList  
AbstractListIterator  
AbstractMap  
AbstractQueue An abstract structure describing a First-In, First-Out structure.
AbstractSet Implementation of a set of elements.
AbstractStack An abstract structure describing a Last-In, First-Out structure.
AbstractStructure An abstract implementation of a basic, mutable data structure.
ArrayIterator  
Assert A library of assertion testing and debugging procedures.
Association A class implementing a key-value pair.
BinarySearchTree A binary search tree structure.
BinaryTree This class implements a single node of a binary tree.
BitSet A simple class implementing a set of numbered bits.
ChainedHashtable 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 A class implementing a singly linked circular list.
Clock A simple object for measuring time.
ComparableAssociation An association that can be compared.
ComparableEdge A class implementing common edge type among graphs.
DoublyLinkedList An implementation of lists that makes use of doubly linked elements.
DoublyLinkedListElement A private class implementing the element of a doubly linked list.
DoublyLinkedListIterator A private iterator for traversing a doubly linked list.
Edge A class implementing common edge type among graphs.
Entry  
FileStream This class provides a way to connect text files to scanners, without worrying about Exceptions.
GraphList Implementation of graph using adjacency lists.
GraphListDirected A class implementing a directed, adjacency-list based graph.
GraphListUndirected A class implementing an undirected, adjacency-list based graph.
GraphMatrix Implementation of graph using adjacency matrices.
GraphMatrixDirected A class implementing a directed, adjacency-matrix based graph.
GraphMatrixUndirected A class implementing an undirected, adjacency-matrix based graph.
Hashtable Implements a dictionary as a table of hashed key-value pairs.
MapBST  
MapList  
Matrix An implementation of rectangular vectors.
NaturalComparator  
OrderedList A class that implements a collection of values that are kept in order.
OrderedVector Implementation of an ordered structure implemented using a vector
PriorityVector A vector-based implementation of a priority queue.
QueueArray An implementation of a queue based on arrays.
QueueList An implementation of queues based on lists.
QueueVector An implementation of queues written using vectors.
ReadStream A ReadStream provides reasonable access to the typewritten data on an input stream.
RedBlackTree  
ReverseComparator  
SetList An implementation of a set using lists.
SetVector An implementation of a set using vectors
SinglyLinkedList Singly linked lists have elements connected by a single reference.
SinglyLinkedListElement A class supporting a singly linked list element.
SkewHeap An implementation of a priority queue using skew heaps.
SplayTree An implementation of binary search trees, based on a splay operation by Tarjan et al.
StackArray An implementation of a stack using an array.
StackList An implementation of a stack, based on lists.
StackVector An implementation of stacks using Vectors.
StructCollection This utility class converts a Structure to a Collection.
Table An implementation of an ordered dictionary.
Vector An implemention of extensible arrays, similar to that of java.util.Vector.
VectorHeap 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.