📄 skewheap.html
字号:
<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%"><TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor"><TD><B>Methods inherited from class java.lang.<A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html">Object</A></B></TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD><CODE><A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#<clinit>()"><clinit></A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#clone()">clone</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#equals(java.lang.Object)">equals</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#finalize()">finalize</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#getClass()">getClass</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#hashCode()">hashCode</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#notify()">notify</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#notifyAll()">notifyAll</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#registerNatives()">registerNatives</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#wait()">wait</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#wait(long)">wait</A>, <A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/Object.html#wait(long, int)">wait</A></CODE></TD></TR></TABLE> <P><!-- ============ 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="root"><!-- --></A><H3>root</H3><PRE>protected <A HREF="../structure/BinaryTree.html">BinaryTree</A> <B>root</B></PRE><DL><DD>The root of the skew heap.</DL><HR><A NAME="count"><!-- --></A><H3>count</H3><PRE>protected int <B>count</B></PRE><DL><DD>The number of nodes within heap.</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="SkewHeap()"><!-- --></A><H3>SkewHeap</H3><PRE>public <B>SkewHeap</B>()</PRE><DL><DD>Constructs an empty priority queue.</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="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> 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="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="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="merge(structure.MergeableHeap)"><!-- --></A><H3>merge</H3><PRE>public void <B>merge</B>(<A HREF="../structure/MergeableHeap.html">MergeableHeap</A> otherHeap)</PRE><DL><DD>Merge this heap with another<DD><DL><DT><B>Specified by: </B><DD><CODE><A HREF="../structure/MergeableHeap.html#merge(structure.MergeableHeap)">merge</A></CODE> in interface <CODE><A HREF="../structure/MergeableHeap.html">MergeableHeap</A></CODE></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>otherHeap</CODE> - Heap to be merged with this heap, otherHeap is destroyed by this operation;<DT><B>Postcondition:</B><DD>the two heaps are merged and otherHeap is destroyed</DL></DD></DL><HR><A NAME="merge(structure.BinaryTree, structure.BinaryTree)"><!-- --></A><H3>merge</H3><PRE>protected static <A HREF="../structure/BinaryTree.html">BinaryTree</A> <B>merge</B>(<A HREF="../structure/BinaryTree.html">BinaryTree</A> left, <A HREF="../structure/BinaryTree.html">BinaryTree</A> right)</PRE><DL><DD><DL></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><HR><A NAME="main(java.lang.String[])"><!-- --></A><H3>main</H3><PRE>public static void <B>main</B>(<A HREF="http://java.sun.com/j2se/1.3/docs/api/java/lang/String.html">String</A>[] argv)</PRE><DL><DD><DL></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> </TD> <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></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"> <A HREF="../structure/SinglyLinkedListIterator.html"><B>PREV CLASS</B></A> <A HREF="../structure/SplayTree.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> <A HREF="SkewHeap.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD></TR><TR><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2"> SUMMARY: INNER | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD></TR></TABLE><!-- =========== END OF NAVBAR =========== --><HR></BODY></HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -