package-summary.html

学习JAVA的很好的JAVA包和文档包

<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphListEIterator.html">GraphListEIterator</A></B></TD>
<TD>An iterator over all edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphListUndirected.html">GraphListUndirected</A></B></TD>
<TD>A GraphListUndirected is a list-based graph representation that consists 
 of a collection of vertices and undirected edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphListVertex.html">GraphListVertex</A></B></TD>
<TD>A private implementation of a vertex for use in graphs that
 are internally represented as a list.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphMatrix.html">GraphMatrix</A></B></TD>
<TD>Implementation of graph using adjacency matrices.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphMatrixDirected.html">GraphMatrixDirected</A></B></TD>
<TD>A GraphMatrixDirected is a matrix-based graph representation that 
 consists of a collection of vertices and directed edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphMatrixUndirected.html">GraphMatrixUndirected</A></B></TD>
<TD>A GraphMatrixUndirected is a matrix-based graph representation that 
 consists of a collection of vertices and undirected edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="GraphMatrixVertex.html">GraphMatrixVertex</A></B></TD>
<TD>A private implementation of a vertex for use in graphs that
 are internally represented as a Matrix.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Hashtable.html">Hashtable</A></B></TD>
<TD>Implements a dictionary as a table of hashed key-value pairs.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="HashtableIterator.html">HashtableIterator</A></B></TD>
<TD>A traversal of all the elements as they appear in a hashtable.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="KeyIterator.html">KeyIterator</A></B></TD>
<TD>A private master iterator for filtering the key fields from
 an Association-returning iterator.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="MapList.html">MapList</A></B></TD>
<TD>Associations establish a link between a key and a value.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Matrix.html">Matrix</A></B></TD>
<TD>An implementation of rectangular vectors.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="NaturalComparator.html">NaturalComparator</A></B></TD>
<TD>Implementation of the <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/util/Comparator.html"><CODE>Comparator</CODE></A> interface that
 provides a <A HREF="../structure/NaturalComparator.html#compare(java.lang.Object, java.lang.Object)"><CODE>NaturalComparator.compare(java.lang.Object, java.lang.Object)</CODE></A> method that compares two objects using those
 objects default compareTo methods.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="OrderedList.html">OrderedList</A></B></TD>
<TD>A class that implements a collection of values that are kept in order.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="OrderedVector.html">OrderedVector</A></B></TD>
<TD>Implementation of an ordered structure implemented using a vector.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="PriorityVector.html">PriorityVector</A></B></TD>
<TD>A vector-based implementation of a priority queue.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="QueueArray.html">QueueArray</A></B></TD>
<TD>An implementation of queues based on arrays.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="QueueList.html">QueueList</A></B></TD>
<TD>An implementation of queues based on circular lists.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="QueueVector.html">QueueVector</A></B></TD>
<TD>An implementation of queues based on vectors.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="ReadStream.html">ReadStream</A></B></TD>
<TD>A ReadStream provides reasonable access to the typewritten
 data on an input stream.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="RedBlackIterator.html">RedBlackIterator</A></B></TD>
<TD>An iterator for traversing RedBlackSearchTrees constructed from
 RedBlackTrees.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="RedBlackSearchTree.html">RedBlackSearchTree</A></B></TD>
<TD>Red black trees, are binary trees that guarantee the following three properties.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="RedBlackTree.html">RedBlackTree</A></B></TD>
<TD>This class implements a single node of a red-black tree.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="ReverseComparator.html">ReverseComparator</A></B></TD>
<TD>Implementation of the <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/util/Comparator.html"><CODE>Comparator</CODE></A> interface that
 provides a <A HREF="../structure/ReverseComparator.html#compare(java.lang.Object, java.lang.Object)"><CODE>ReverseComparator.compare(Object,Object)</CODE></A> method that compares
 two objects using those objects default compareTo methods.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SetList.html">SetList</A></B></TD>
<TD>Implementation of a set of elements using a list as the underlying
 storage mechanism.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SetVector.html">SetVector</A></B></TD>
<TD>Implementation of a set of elements using a vector as the underlying
 storage mechanism.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SinglyLinkedList.html">SinglyLinkedList</A></B></TD>
<TD>An implementation of lists using singly linked elements, similar to that of <CODE>java.util.LinkedList</CODE>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SinglyLinkedListElement.html">SinglyLinkedListElement</A></B></TD>
<TD>A class supporting a singly linked list element.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SinglyLinkedListIterator.html">SinglyLinkedListIterator</A></B></TD>
<TD>An iterator for traversing the elements of a singly linked list.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SkewHeap.html">SkewHeap</A></B></TD>
<TD>An implementation of a priority queue using skew heaps.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SplayTree.html">SplayTree</A></B></TD>
<TD>An implementation of binary search trees, based on a splay operation
 by Tarjan et al.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="SplayTreeIterator.html">SplayTreeIterator</A></B></TD>
<TD>An iterator for traversing splay trees constructed from
 BinaryTrees.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="StackArray.html">StackArray</A></B></TD>
<TD>An implementation of a stack, based on array.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="StackList.html">StackList</A></B></TD>
<TD>An implementation of a stack, based on lists.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="StackVector.html">StackVector</A></B></TD>
<TD>An implementation of a stack, based on extensible arrays.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="StructCollection.html">StructCollection</A></B></TD>
<TD>This utility class converts a Structure to a Collection.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Table.html">Table</A></B></TD>
<TD>An implementation of an ordered dictionary.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="ValueIterator.html">ValueIterator</A></B></TD>
<TD>A private master iterator for filtering the value fields from
 an Association-returning iterator.This iterator returns
 objects of the <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html"><CODE>Object</CODE></A> type, and is
 publically available throught the <A HREF="../structure/Hashtable.html#iterator()"><CODE>Hashtable.iterator()</CODE></A> 
 method.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Vector.html">Vector</A></B></TD>
<TD>An implementation of extensible arrays, similar to that of <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/util/Vector.html"><CODE>java.util.Vector</CODE></A>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="VectorHeap.html">VectorHeap</A></B></TD>
<TD>This class implements a priority queue based on a traditional
 array-based heap.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="VectorIterator.html">VectorIterator</A></B></TD>
<TD>A private class for implementing an iterator over a Vector.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Version.html">Version</A></B></TD>
<TD>A utility class that can be used to determine the version of software
 currently being used.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="Vertex.html">Vertex</A></B></TD>
<TD>A private implementation of a vertex for use in graphs.</TD>
</TR>
</TABLE>
&nbsp;

<P>

<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=2><FONT SIZE="+2">
<B>Error Summary</B></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="FailedAssertion.html">FailedAssertion</A></B></TD>
<TD>This error is thrown by the Assert class in the event of any failed
 assertion test.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="FailedInvariant.html">FailedInvariant</A></B></TD>
<TD>This error is thrown by the Assert class in the event of a failed
 invariant test.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="FailedPostcondition.html">FailedPostcondition</A></B></TD>
<TD>This error is thrown by the Assert class in the event of a failed
 postcondition.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD WIDTH="15%"><B><A HREF="FailedPrecondition.html">FailedPrecondition</A></B></TD>
<TD>This error is thrown by the Assert class in the event of a failed
 precondition.</TD>
</TR>
</TABLE>
&nbsp;

<P>
<A NAME="package_description"><!-- --></A><H2>
Package structure Description
</H2>

<P>
This package is for use with <a
href="http://www.cs.williams.edu/~bailey">Duane Bailey's</a> <a
href="http://www.cs.williams.edu/~bailey/JavaStructures/index.html">Java
Structures</a> text, from <a
href="http://www.mhhe.com">McGraw-Hill</a>.
<p>
The structures developed within this package are for non-commercial
use.  They are implementations of common and classic data structures
often studied in a data structures course.
<p>
This source, its documentation may be freely distributed according to
its <a href="copyright.html">copyright agreement</a>.
<P>
<HR>

<!-- ========== START OF NAVBAR ========== -->
<A NAME="navbar_bottom"><!-- --></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3">
  <TR ALIGN="center" VALIGN="top">
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Package</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <FONT CLASS="NavBarFont1">Class</FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>
  </TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
<a href=../copyright.html target=_top>&copy; 1998-2002 McGraw-Hill</a></EM>
</TD>
</TR>

<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
&nbsp;PREV PACKAGE&nbsp;
&nbsp;NEXT PACKAGE</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../index.html" TARGET="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="package-summary.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->

<HR>

</BODY>
</HTML>