📄 datastructures.binomialqueue.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--NewPage-->
<html>
<head>
<!-- Generated by javadoc on Sun Sep 27 09:53:37 EDT 1998
-->
<title>
Class DataStructures.BinomialQueue
</title>
</head>
<body>
<a name="_top_"></a>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.BinarySearchTree.html">Previous</a> <a href="DataStructures.CursorList.html">Next</a> <a href="Index.html">Index</a> </pre>
<hr>
<h1>
Class DataStructures.BinomialQueue
</h1>
<pre>
java.lang.Object
|
+----DataStructures.BinomialQueue
</pre>
<hr>
<dl>
<dt>public class <b>BinomialQueue</b>
<dt>extends Object</dl>
Implements a binomial queue.Note that all "matching" is based on the compareTo method.
<p>
<hr>
<a name="index"></a><h2>
<img src="images/constructor-index.gif" width=275 height=38 alt="Constructor Index">
</h2>
<dl>
<dt><img src="images/yellow-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#BinomialQueue()"><b>BinomialQueue</b></a>()
<dd>Construct the binomial queue.
</dl>
<h2>
<img src="images/method-index.gif" width=207 height=38 alt="Method Index">
</h2>
<dl>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#deleteMin()"><b>deleteMin</b></a>()
<dd>Remove the smallest item from the priority queue.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#findMin()"><b>findMin</b></a>()
<dd>Find the smallest item in the priority queue.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable)
<dd>Insert into the priority queue, maintaining heap order.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#isEmpty()"><b>isEmpty</b></a>()
<dd>Test if the priority queue is logically empty.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#isFull()"><b>isFull</b></a>()
<dd>Test if the priority queue is logically full.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#main(java.lang.String[])"><b>main</b></a>(String[])
<dd>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#makeEmpty()"><b>makeEmpty</b></a>()
<dd>Make the priority queue logically empty.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#merge(DataStructures.BinomialQueue)"><b>merge</b></a>(BinomialQueue)
<dd>Merge rhs into the priority queue.
</dl>
<a name="constructors"></a><h2>
<img src="images/constructors.gif" width=231 height=38 alt="Constructors">
</h2>
<a name="BinomialQueue"></a><a name="BinomialQueue"></a><a name="BinomialQueue()"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>BinomialQueue</b>
<pre>
public BinomialQueue()</pre>
<dl>
<dd>Construct the binomial queue.
<p>
</dl>
<a name="methods"></a><h2>
<img src="images/methods.gif" width=151 height=38 alt="Methods">
</h2>
<a name="merge"></a><a name="merge(DataStructures.BinomialQueue)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>merge</b>
<pre>
public void merge(<a href="#_top_">BinomialQueue</a> rhs) throws <a href="DataStructures.Overflow.html">Overflow</a></pre>
<dl>
<dd>Merge rhs into the priority queue.rhs becomes empty. rhs must be different from this.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>rhs - the other binomial queue.
<dt><b>Throws:</b>
<a href="DataStructures.Overflow.html">Overflow</a><dd>if result exceeds capacity.</dl>
</dd>
</dl>
<a name="insert"></a><a name="insert(DataStructures.Comparable)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>insert</b>
<pre>
public void insert(<a href="DataStructures.Comparable.html">Comparable</a> x) throws <a href="DataStructures.Overflow.html">Overflow</a></pre>
<dl>
<dd>Insert into the priority queue, maintaining heap order.This implementation is not optimized for O(1) performance.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to insert.
<dt><b>Throws:</b>
<a href="DataStructures.Overflow.html">Overflow</a><dd>if capacity exceeded.</dl>
</dd>
</dl>
<a name="findMin"></a><a name="findMin()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>findMin</b>
<pre>
public <a href="DataStructures.Comparable.html">Comparable</a> findMin()</pre>
<dl>
<dd>Find the smallest item in the priority queue.
<p>
<dd><dl>
<dt><b>Returns:</b>
<dd>the smallest item, or null, if empty.</dl>
</dd>
</dl>
<a name="deleteMin"></a><a name="deleteMin()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>deleteMin</b>
<pre>
public <a href="DataStructures.Comparable.html">Comparable</a> deleteMin()</pre>
<dl>
<dd>Remove the smallest item from the priority queue.
<p>
<dd><dl>
<dt><b>Returns:</b>
<dd>the smallest item, or null, if empty.</dl>
</dd>
</dl>
<a name="isEmpty"></a><a name="isEmpty()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>isEmpty</b>
<pre>
public boolean isEmpty()</pre>
<dl>
<dd>Test if the priority queue is logically empty.
<p>
<dd><dl>
<dt><b>Returns:</b>
<dd>true if empty, false otherwise.</dl>
</dd>
</dl>
<a name="isFull"></a><a name="isFull()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>isFull</b>
<pre>
public boolean isFull()</pre>
<dl>
<dd>Test if the priority queue is logically full.
<p>
<dd><dl>
<dt><b>Returns:</b>
<dd>true if full, false otherwise.</dl>
</dd>
</dl>
<a name="makeEmpty"></a><a name="makeEmpty()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>makeEmpty</b>
<pre>
public void makeEmpty()</pre>
<dl>
<dd>Make the priority queue logically empty.
<p>
</dl>
<a name="main"></a><a name="main(java.lang.String[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>main</b>
<pre>
public static void main(String[] args)</pre>
<dl>
</dl>
<hr>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.BinarySearchTree.html">Previous</a> <a href="DataStructures.CursorList.html">Next</a> <a href="Index.html">Index</a> </pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -