mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
281 lines
31 KiB
HTML
281 lines
31 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.19"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: hashing/linear_probing_hash_table.cpp File Reference</title>
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Algorithms_in_C++
|
|
 <span id="projectnumber">1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.19 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp.html','../../'); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#nested-classes">Classes</a> |
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#typedef-members">Typedefs</a> |
|
|
<a href="#func-members">Functions</a> |
|
|
<a href="#var-members">Variables</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">linear_probing_hash_table.cpp File Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing hash</a> keys.
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <iostream></code><br />
|
|
<code>#include <vector></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for linear_probing_hash_table.cpp:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dad/linear__probing__hash__table_8cpp__incl.svg" width="167" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
</div><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:d8/d89/namespacelinear__probing"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></td></tr>
|
|
<tr class="memdesc:d8/d89/namespacelinear__probing"><td class="mdescLeft"> </td><td class="mdescRight">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> algorithm. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="typedef-members"></a>
|
|
Typedefs</h2></td></tr>
|
|
<tr class="memitem:a2de838f453df67b72411eefb7faf833c"><td class="memItemLeft" align="right" valign="top"><a id="a2de838f453df67b72411eefb7faf833c"></a>
|
|
using </td><td class="memItemRight" valign="bottom"><b>linear_probing::Entry</b> = struct <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a></td></tr>
|
|
<tr class="separator:a2de838f453df67b72411eefb7faf833c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a75d779938df7ebc68581d922b60a2541"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &entry, int key)</td></tr>
|
|
<tr class="separator:a75d779938df7ebc68581d922b60a2541"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a942fc8407b8001890ea26830cdcd9d77"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">linear_probing::searchingProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &entry, int key)</td></tr>
|
|
<tr class="separator:a942fc8407b8001890ea26830cdcd9d77"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a> (int key)</td></tr>
|
|
<tr class="separator:a16d34fd3511626a83ab00665d7bc34d1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a> (int key)</td></tr>
|
|
<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft"> </td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. <a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">More...</a><br /></td></tr>
|
|
<tr class="separator:a4bde7a47f98dd1ad24c84038e2608527"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a> (int key, bool searching)</td></tr>
|
|
<tr class="separator:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad87b71d810901fab69c4ad9d4d0fa635"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a> ()</td></tr>
|
|
<tr class="separator:ad87b71d810901fab69c4ad9d4d0fa635"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6a082dc1426a79f866cee6b370df37b0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a> ()</td></tr>
|
|
<tr class="separator:a6a082dc1426a79f866cee6b370df37b0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abcf8d033f8115f39f3c93cfb6cee0b28"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">linear_probing::remove</a> (int key)</td></tr>
|
|
<tr class="separator:abcf8d033f8115f39f3c93cfb6cee0b28"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a16680b8a37d442c2f208faa286e33908"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a> (int key)</td></tr>
|
|
<tr class="separator:a16680b8a37d442c2f208faa286e33908"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a75854f5aa216e61219154c62167ce8f0"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a> (int key)</td></tr>
|
|
<tr class="separator:a75854f5aa216e61219154c62167ce8f0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
|
|
Variables</h2></td></tr>
|
|
<tr class="memitem:addfce7597f6a42f796fa597ae40eecc9"><td class="memItemLeft" align="right" valign="top"><a id="addfce7597f6a42f796fa597ae40eecc9"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>linear_probing::notPresent</b></td></tr>
|
|
<tr class="separator:addfce7597f6a42f796fa597ae40eecc9"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top"><a id="acb1dc3f09cf07c2633580a1c46c9f0a8"></a>
|
|
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> > </td><td class="memItemRight" valign="bottom"><b>linear_probing::table</b></td></tr>
|
|
<tr class="separator:acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top"><a id="a4fdb68db9f02ae4156e1845563004f8e"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>linear_probing::totalSize</b></td></tr>
|
|
<tr class="separator:a4fdb68db9f02ae4156e1845563004f8e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a62fbd519adacd4e05706f34a7e551288"><td class="memItemLeft" align="right" valign="top"><a id="a62fbd519adacd4e05706f34a7e551288"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>linear_probing::tomb</b> = -1</td></tr>
|
|
<tr class="separator:a62fbd519adacd4e05706f34a7e551288"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8e81b17f2f8403c982368da3dac1ae87"><td class="memItemLeft" align="right" valign="top"><a id="a8e81b17f2f8403c982368da3dac1ae87"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>linear_probing::size</b></td></tr>
|
|
<tr class="separator:a8e81b17f2f8403c982368da3dac1ae87"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top"><a id="a5ff22c1a04290e24ef3ba3d6a3a06386"></a>
|
|
bool </td><td class="memItemRight" valign="bottom"><b>linear_probing::rehashing</b></td></tr>
|
|
<tr class="separator:a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing hash</a> keys. </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/achance6">achance6</a> </dd>
|
|
<dd>
|
|
<a href="https://github.com/kvedala">Krishna Vedala</a> </dd></dl>
|
|
<dl class="section note"><dt>Note</dt><dd>The implementation can be optimized by using OOP style. </dd></dl>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int main </td>
|
|
<td>(</td>
|
|
<td class="paramtype">void </td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Main function </p><dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordtype">int</span> cmd = 0, hash = 0, key = 0;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the initial size of Hash Table. = "</span>;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> totalSize;</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  table = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Entry></a>(totalSize);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">while</span> (loop) {</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"PLEASE CHOOSE -"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1. Add key. (Numeric only)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2. Remove key."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3. Find key."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"4. Generate Hash. (Numeric only)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"5. Display Hash table."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"6. Exit."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> cmd;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">switch</span> (cmd) {</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter key to add = "</span>;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a>(key);</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">case</span> 2:</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter key to remove = "</span>;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a>(key);</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">case</span> 3: {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter key to search = "</span>;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <a class="code" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry = table[<a class="code" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a>(key, <span class="keyword">true</span>)];</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (entry.<a class="code" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == linear_probing::notPresent) {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Key not present"</span>;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">case</span> 4:</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter element to generate hash = "</span>;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Hash of "</span> << key</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  << <span class="stringliteral">" is = "</span> << <a class="code" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a>(key);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">case</span> 5:</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a>();</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  loop = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// delete[] table;</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:37</div></div>
|
|
<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:35</div></div>
|
|
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:46</div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:186</div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:55</div></div>
|
|
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
|
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:201</div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_ad87b71d810901fab69c4ad9d4d0fa635"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:120</div></div>
|
|
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></li>
|
|
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.19 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|