vectorheap.html

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

<!-- ============ FIELD DETAIL =========== -->

<A NAME="field_detail"><!-- --></A>
<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Field Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="data"><!-- --></A><H3>
data</H3>
<PRE>
protected <A HREF="../structure/Vector.html">Vector</A> <B>data</B></PRE>
<DL>
<DD>The data, kept in heap order.</DL>

<!-- ========= CONSTRUCTOR DETAIL ======== -->

<A NAME="constructor_detail"><!-- --></A>
<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Constructor Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="VectorHeap()"><!-- --></A><H3>
VectorHeap</H3>
<PRE>
public <B>VectorHeap</B>()</PRE>
<DL>
<DD>Construct a new priority queue</DL>
<HR>

<A NAME="VectorHeap(structure.Vector)"><!-- --></A><H3>
VectorHeap</H3>
<PRE>
public <B>VectorHeap</B>(<A HREF="../structure/Vector.html">Vector</A>&nbsp;v)</PRE>
<DL>
<DD>Construct a new priority queue from an unordered vector</DL>

<!-- ============ METHOD DETAIL ========== -->

<A NAME="method_detail"><!-- --></A>
<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Method Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="parent(int)"><!-- --></A><H3>
parent</H3>
<PRE>
protected static int <B>parent</B>(int&nbsp;i)</PRE>
<DL>
<DD>Returns parent index<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - a node index<DT><B>Precondition:</B><DD>0 <= i < size<DT><B>Postcondition:</B><DD>returns parent of node at location i<DT><B>Returns:</B><DD>parent of node at i</DL>
</DD>
</DL>
<HR>

<A NAME="left(int)"><!-- --></A><H3>
left</H3>
<PRE>
protected static int <B>left</B>(int&nbsp;i)</PRE>
<DL>
<DD>Returns left child index.<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - a node index<DT><B>Precondition:</B><DD>0 <= i < size<DT><B>Postcondition:</B><DD>returns index of left child of node at location i<DT><B>Returns:</B><DD>left child of node at i</DL>
</DD>
</DL>
<HR>

<A NAME="right(int)"><!-- --></A><H3>
right</H3>
<PRE>
protected static int <B>right</B>(int&nbsp;i)</PRE>
<DL>
<DD>Returns right child index.<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - a node index<DT><B>Precondition:</B><DD>0 <= i < size<DT><B>Postcondition:</B><DD>returns index of right child of node at location i<DT><B>Returns:</B><DD>right child of node at i</DL>
</DD>
</DL>
<HR>

<A NAME="getFirst()"><!-- --></A><H3>
getFirst</H3>
<PRE>
public <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Comparable.html">Comparable</A> <B>getFirst</B>()</PRE>
<DL>
<DD>Fetch lowest valued (highest priority) item from queue.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#getFirst()">getFirst</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Precondition:</B><DD>!isEmpty()<DT><B>Postcondition:</B><DD>returns the minimum value in priority queue<DT><B>Returns:</B><DD>The smallest value from queue.</DL>
</DD>
</DL>
<HR>

<A NAME="remove()"><!-- --></A><H3>
remove</H3>
<PRE>
public <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Comparable.html">Comparable</A> <B>remove</B>()</PRE>
<DL>
<DD>Returns the minimum value from the queue.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#remove()">remove</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Precondition:</B><DD>!isEmpty()<DT><B>Postcondition:</B><DD>returns and removes minimum value from queue<DT><B>Returns:</B><DD>The minimum value in the queue.</DL>
</DD>
</DL>
<HR>

<A NAME="add(java.lang.Comparable)"><!-- --></A><H3>
add</H3>
<PRE>
public void <B>add</B>(<A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Comparable.html">Comparable</A>&nbsp;value)</PRE>
<DL>
<DD>Add a value to the priority queue.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#add(java.lang.Comparable)">add</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>value</CODE> - The value to be added.<DT><B>Precondition:</B><DD>value is non-null comparable<DT><B>Postcondition:</B><DD>value is added to priority queue</DL>
</DD>
</DL>
<HR>

<A NAME="isEmpty()"><!-- --></A><H3>
isEmpty</H3>
<PRE>
public boolean <B>isEmpty</B>()</PRE>
<DL>
<DD>Determine if the queue is empty.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#isEmpty()">isEmpty</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Postcondition:</B><DD>returns true iff no elements are in queue<DT><B>Returns:</B><DD>True if the queue is empty.</DL>
</DD>
</DL>
<HR>

<A NAME="percolateUp(int)"><!-- --></A><H3>
percolateUp</H3>
<PRE>
protected void <B>percolateUp</B>(int&nbsp;leaf)</PRE>
<DL>
<DD>Moves node upward to appropriate position within heap.<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>leaf</CODE> - Index of the node in the heap.<DT><B>Precondition:</B><DD>0 <= leaf < size<DT><B>Postcondition:</B><DD>moves node at index leaf up to appropriate position</DL>
</DD>
</DL>
<HR>

<A NAME="pushDownRoot(int)"><!-- --></A><H3>
pushDownRoot</H3>
<PRE>
protected void <B>pushDownRoot</B>(int&nbsp;root)</PRE>
<DL>
<DD>Moves node downward, into appropriate position within subheap.<DD><DL>
</DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>root</CODE> - Index of the root of the subheap.<DT><B>Precondition:</B><DD>0 <= root < size<DT><B>Postcondition:</B><DD>moves node at index root down 
   to appropriate position in subtree</DL>
</DD>
</DL>
<HR>

<A NAME="size()"><!-- --></A><H3>
size</H3>
<PRE>
public int <B>size</B>()</PRE>
<DL>
<DD>Determine the size of the queue.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#size()">size</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Postcondition:</B><DD>returns number of elements within queue<DT><B>Returns:</B><DD>The number of elements within the queue.</DL>
</DD>
</DL>
<HR>

<A NAME="clear()"><!-- --></A><H3>
clear</H3>
<PRE>
public void <B>clear</B>()</PRE>
<DL>
<DD>Remove all the elements from the queue.<DD><DL>
<DT><B>Specified by: </B><DD><CODE><A HREF="../structure/PriorityQueue.html#clear()">clear</A></CODE> in interface <CODE><A HREF="../structure/PriorityQueue.html">PriorityQueue</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Postcondition:</B><DD>removes all elements from queue</DL>
</DD>
</DL>
<HR>

<A NAME="toString()"><!-- --></A><H3>
toString</H3>
<PRE>
public <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/String.html">String</A> <B>toString</B>()</PRE>
<DL>
<DD>Construct a string representation of the heap.<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#toString()">toString</A></CODE> in class <CODE><A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html">Object</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Postcondition:</B><DD>returns string representation of heap<DT><B>Returns:</B><DD>The string representing the heap.</DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<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="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></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;<A HREF="../structure/Vector.html"><B>PREV CLASS</B></A>&nbsp;
&nbsp;<A HREF="../structure/VectorIterator.html"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../index.html" TARGET="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="VectorHeap.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
  SUMMARY: &nbsp;INNER&nbsp;|&nbsp;<A HREF="#field_summary">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: &nbsp;<A HREF="#field_detail">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->

<HR>

</BODY>
</HTML>