⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 datastructures.quadraticprobinghashtable.html

📁 Data StructuresAnd Algorithm Analysis In Java Source Code
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--NewPage-->
<html>
<head>
<!-- Generated by javadoc on Sun Sep 27 09:53:40 EDT 1998
-->
<title>
Class DataStructures.QuadraticProbingHashTable
</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.PairNode.html">Previous</a>  <a href="DataStructures.QueueAr.html">Next</a>  <a href="Index.html">Index</a>  </pre>
<hr>
<h1>
Class DataStructures.QuadraticProbingHashTable
</h1>
<pre>
java.lang.Object
    |
    +----DataStructures.QuadraticProbingHashTable
</pre>
<hr>
<dl>
<dt>public class <b>QuadraticProbingHashTable</b>
<dt>extends Object</dl>
Probing table implementation of hash tables.Note that all "matching" is based on the equals 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="#QuadraticProbingHashTable()"><b>QuadraticProbingHashTable</b></a>()
<dd>Construct the hash table.
<dt><img src="images/yellow-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#QuadraticProbingHashTable(int)"><b>QuadraticProbingHashTable</b></a>(int)
<dd>Construct the hash table.
</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="#find(DataStructures.Hashable)"><b>find</b></a>(Hashable)
<dd>Find an item in the hash table.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#hash(java.lang.String, int)"><b>hash</b></a>(String, int)
<dd>A hash routine for String objects.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#insert(DataStructures.Hashable)"><b>insert</b></a>(Hashable)
<dd>Insert into the hash table.
<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 hash table logically empty.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#remove(DataStructures.Hashable)"><b>remove</b></a>(Hashable)
<dd>Remove from the hash table.
</dl>
<a name="constructors"></a><h2>
<img src="images/constructors.gif" width=231 height=38 alt="Constructors">
</h2>
<a name="QuadraticProbingHashTable"></a><a name="QuadraticProbingHashTable"></a><a name="QuadraticProbingHashTable()"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>QuadraticProbingHashTable</b>
<pre>
public QuadraticProbingHashTable()</pre>
<dl>
<dd>Construct the hash table.
<p>
</dl>
<a name="QuadraticProbingHashTable"></a><a name="QuadraticProbingHashTable(int)"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>QuadraticProbingHashTable</b>
<pre>
public QuadraticProbingHashTable(int size)</pre>
<dl>
<dd>Construct the hash table.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>size - the approximate initial size.
</dl>
</dd>
</dl>
<a name="methods"></a><h2>
<img src="images/methods.gif" width=151 height=38 alt="Methods">
</h2>
<a name="insert"></a><a name="insert(DataStructures.Hashable)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>insert</b>
<pre>
public void insert(<a href="DataStructures.Hashable.html">Hashable</a> x)</pre>
<dl>
<dd>Insert into the hash table. If the item isalready present, do nothing.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to insert.
</dl>
</dd>
</dl>
<a name="remove"></a><a name="remove(DataStructures.Hashable)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>remove</b>
<pre>
public void remove(<a href="DataStructures.Hashable.html">Hashable</a> x)</pre>
<dl>
<dd>Remove from the hash table.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to remove.
</dl>
</dd>
</dl>
<a name="find"></a><a name="find(DataStructures.Hashable)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>find</b>
<pre>
public <a href="DataStructures.Hashable.html">Hashable</a> find(<a href="DataStructures.Hashable.html">Hashable</a> x)</pre>
<dl>
<dd>Find an item in the hash table.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to search for.
<dt><b>Returns:</b>
<dd>the matching item.</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 hash table logically empty.
<p>
</dl>
<a name="hash"></a><a name="hash(java.lang.String, int)"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>hash</b>
<pre>
public static int hash(String key,                       int tableSize)</pre>
<dl>
<dd>A hash routine for String objects.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>key - the String to hash.
<dd>tableSize - the size of the hash table.
<dt><b>Returns:</b>
<dd>the hash value.</dl>
</dd>
</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.PairNode.html">Previous</a>  <a href="DataStructures.QueueAr.html">Next</a>  <a href="Index.html">Index</a>  </pre>
</body>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -