📄 package-summary.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Frameset//EN""http://www.w3.org/TR/REC-html40/frameset.dtd"><!--NewPage--><HTML><HEAD><!-- Generated by javadoc on Fri Aug 23 13:18:09 EDT 2002 --><TITLE>: Package structure</TITLE><LINK REL ="stylesheet" TYPE="text/css" HREF="../stylesheet.css" TITLE="Style"></HEAD><BODY BGCOLOR="white"><!-- ========== START OF NAVBAR ========== --><A NAME="navbar_top"><!-- --></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0"><TR><TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"><A NAME="navbar_top_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3"> <TR ALIGN="center" VALIGN="top"> <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Package</B></FONT> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <FONT CLASS="NavBarFont1">Class</FONT> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> </TR></TABLE></TD><TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM><a href=../copyright.html target=_top>© 1998-2002 McGraw-Hill</a></EM></TD></TR><TR><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> PREV PACKAGE NEXT PACKAGE</FONT></TD><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="../index.html" TARGET="_top"><B>FRAMES</B></A> <A HREF="package-summary.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD></TR></TABLE><!-- =========== END OF NAVBAR =========== --><HR><H2>Package structure</H2>This package is for use with <ahref="http://www.cs.williams.edu/~bailey">Duane Bailey's</a> <ahref="http://www.cs.williams.edu/~bailey/JavaStructures/index.html">JavaStructures</a> text, from <ahref="http://www.mhhe.com">McGraw-Hill</a>.<P><B>See: </B><BR> <A HREF="#package_description"><B>Description</B></A><P><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%"><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TD COLSPAN=2><FONT SIZE="+2"><B>Interface Summary</B></FONT></TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Graph.html"><I>Graph</I></A></B></TD><TD>The interface describing all Graph objects.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Linear.html"><I>Linear</I></A></B></TD><TD>An interface describing the behavior of linear data structures, structures that that have completely determined add and remove methods.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="List.html"><I>List</I></A></B></TD><TD>Interface describing lists.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Map.html"><I>Map</I></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="MergeableHeap.html"><I>MergeableHeap</I></A></B></TD><TD>Interface describing mergeable min heaps.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="OrderedMap.html"><I>OrderedMap</I></A></B></TD><TD>An interface the supports a Map whose values are kept in increasing order.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="OrderedStructure.html"><I>OrderedStructure</I></A></B></TD><TD>An interface that supports a Collection whose values are kept in increasing order.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="PriorityQueue.html"><I>PriorityQueue</I></A></B></TD><TD>Interface describing an queue of prioritized values.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Queue.html"><I>Queue</I></A></B></TD><TD>Interface describing a first-in, first-out structure.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Set.html"><I>Set</I></A></B></TD><TD>Implementation of a set of elements.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Stack.html"><I>Stack</I></A></B></TD><TD>An interface describing a Last-In, First-Out structure.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Structure.html"><I>Structure</I></A></B></TD><TD>The interface of a basic, mutable data structure.</TD></TR></TABLE> <P><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%"><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TD COLSPAN=2><FONT SIZE="+2"><B>Class Summary</B></FONT></TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractIterator.html">AbstractIterator</A></B></TD><TD>Abstract base class for portable iterator and enumeration implementation.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractLinear.html">AbstractLinear</A></B></TD><TD>An abstract implemtation of linear data structures.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractList.html">AbstractList</A></B></TD><TD>An abstract structure implementing features common to all list-like structures in this package.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractListIterator.html">AbstractListIterator</A></B></TD><TD>Base class for the implementation of a list Iterator.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractMap.html">AbstractMap</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="AbstractQueue.html">AbstractQueue</A></B></TD><TD>An abstract structure implementing features common to all first-in, first-out structures in this package.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractSet.html">AbstractSet</A></B></TD><TD>Methods common to an Implementation of a set of elements irrespective of the underlying storage mechanism.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractStack.html">AbstractStack</A></B></TD><TD>An abstract structure implementing features common to all Last-In, First-Out structures in this package.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AbstractStructure.html">AbstractStructure</A></B></TD><TD>An abstract implementation of a basic, mutable data structure.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="AppendableList.html">AppendableList</A></B></TD><TD>An extension of the circular list class that provides an operation for merging an object of this type with a CircularList in constant time.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="ArrayIterator.html">ArrayIterator</A></B></TD><TD>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.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Assert.html">Assert</A></B></TD><TD>A library of assertion testing and debugging procedures.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Association.html">Association</A></B></TD><TD>A class implementing a key-value pair.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BinarySearchTree.html">BinarySearchTree</A></B></TD><TD>A binary search tree structure.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BinaryTree.html">BinaryTree</A></B></TD><TD>This class implements a single node of a binary tree.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BitSet.html">BitSet</A></B></TD><TD>Implementation of a set of numbered bits.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BTInorderIterator.html">BTInorderIterator</A></B></TD><TD>An iterator for traversing binary trees constructed from BinaryTrees.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BTLevelorderIterator.html">BTLevelorderIterator</A></B></TD><TD>An iterator for traversing binary trees constructed from BinaryTrees.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BTPostorderIterator.html">BTPostorderIterator</A></B></TD><TD>This class implements a post-order traversal of a binary tree.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="BTPreorderIterator.html">BTPreorderIterator</A></B></TD><TD>This class implements an iterator that traverses a tree in pre-order.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="ChainedHashtable.html">ChainedHashtable</A></B></TD><TD>This class implements a hash table whose collisions are resolved through external chaining.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="ChainedHashtableIterator.html">ChainedHashtableIterator</A></B></TD><TD>A traversal of all the elements as they appear in a chained hashtable.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="CharSet.html">CharSet</A></B></TD><TD>Implementation of a set of characters whose ASCII values are between 0 and 255, inclusive.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="CircularList.html">CircularList</A></B></TD><TD>An implementation of lists using circularly linked elements, similar to that of <CODE>java.util.LinkedList</CODE>.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="CircularListIterator.html">CircularListIterator</A></B></TD><TD>An iterator for traversing the elements of a circular list.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Clock.html">Clock</A></B></TD><TD>A simple object for measuring time.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="ComparableAssociation.html">ComparableAssociation</A></B></TD><TD>A class implementing a comparable key-value pair.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="ComparableEdge.html">ComparableEdge</A></B></TD><TD>A class implementing common edge type among graphs.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="DoublyLinkedList.html">DoublyLinkedList</A></B></TD><TD>An implementation of lists using doubly linked elements, similar to that of <CODE>java.util.LinkedList</CODE>.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="DoublyLinkedListElement.html">DoublyLinkedListElement</A></B></TD><TD>A class supporting a doubly linked list element.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="DoublyLinkedListIterator.html">DoublyLinkedListIterator</A></B></TD><TD>An iterator for traversing the elements of a doubly linked list.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Edge.html">Edge</A></B></TD><TD>A class implementing common edge type among graphs.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="Entry.html">Entry</A></B></TD><TD>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.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="GraphList.html">GraphList</A></B></TD><TD>Implementation of graph using adjacency lists.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="GraphListAIterator.html">GraphListAIterator</A></B></TD><TD>An adjacent vertex iterator.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD WIDTH="15%"><B><A HREF="GraphListDirected.html">GraphListDirected</A></B></TD><TD>A GraphListDirected is a list-based graph representation that consists of a collection of vertices and directed edges.</TD></TR>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -