backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-22 04:42:10 +08:00
Code Issues Projects Releases Wiki Activity
Files
a4e0db52731eb0cc7275eb7d16defefcaa6f804e
C-Plus-Plus/d6/d80/double__hash__hash__table_8cpp.html
github-actions 27c0a2f2f9 Documentation for 8a368240e2
2024-08-30 17:22:07 +00:00

303 lines
33 KiB
HTML
Raw Blame History

<!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" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: hashing/double_hash_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>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d6/d80/double__hash__hash__table_8cpp.html','../../'); initResizable(true); });
/* @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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<div class="headertitle"><div class="title">double_hash_hash_table.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a>.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;memory&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for double_hash_hash_table.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dda/double__hash__hash__table_8cpp__incl.svg" width="255" height="126"><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 id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></td></tr>
<tr class="memdesc:d0/d65/namespacedouble__hashing"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top"><a id="a92054ec26cd6907c163fb00a596bebdd" name="a92054ec26cd6907c163fb00a596bebdd"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::Entry</b> = struct Entry</td></tr>
<tr class="separator:a92054ec26cd6907c163fb00a596bebdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac2adfce49ac57f6dbd1778d2c1ce0d2b" id="r_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a29f543e2626bad58907661e1e45028a6" id="r_a29f543e2626bad58907661e1e45028a6"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:a29f543e2626bad58907661e1e45028a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a79a9c914a6c68275b3640303d7faad8a" id="r_a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a> (int key)</td></tr>
<tr class="separator:a79a9c914a6c68275b3640303d7faad8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0d90726ed1de7b3d2ae261baed048003" id="r_a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a> (int key)</td></tr>
<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</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. <br /></td></tr>
<tr class="separator:a0d90726ed1de7b3d2ae261baed048003"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a33968a1178289ab61445dd4000df7082" id="r_a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a> (int key)</td></tr>
<tr class="memdesc:a33968a1178289ab61445dd4000df7082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Used for second hash function. <br /></td></tr>
<tr class="separator:a33968a1178289ab61445dd4000df7082"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8f8ff4fb018e1bb32d67d8a1885d3200" id="r_a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a> (int key, bool searching)</td></tr>
<tr class="memdesc:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs double hashing to resolve collisions. <br /></td></tr>
<tr class="separator:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e901418c759627557eff359b8db38cd" id="r_a1e901418c759627557eff359b8db38cd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a> ()</td></tr>
<tr class="separator:a1e901418c759627557eff359b8db38cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4981819aae8bc7e7beeaef02615e30d" id="r_af4981819aae8bc7e7beeaef02615e30d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a> ()</td></tr>
<tr class="separator:af4981819aae8bc7e7beeaef02615e30d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a28083ecac6eb94b643281875c8665931" id="r_a28083ecac6eb94b643281875c8665931"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a> (int key)</td></tr>
<tr class="separator:a28083ecac6eb94b643281875c8665931"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9c652b2e467e5d250dfe3bed83b12560" id="r_a9c652b2e467e5d250dfe3bed83b12560"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a> (int key)</td></tr>
<tr class="separator:a9c652b2e467e5d250dfe3bed83b12560"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d06e4598569526294f10104875f6824" id="r_a5d06e4598569526294f10104875f6824"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a> (int key)</td></tr>
<tr class="separator:a5d06e4598569526294f10104875f6824"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a77d33a0c49294b9ec22ad86eeff79585" id="r_a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top"><a id="a77d33a0c49294b9ec22ad86eeff79585" name="a77d33a0c49294b9ec22ad86eeff79585"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::notPresent</b></td></tr>
<tr class="separator:a77d33a0c49294b9ec22ad86eeff79585"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26" id="r_a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top"><a id="a0e2ff0f9cfc7b54e60a6561f792d8b26" name="a0e2ff0f9cfc7b54e60a6561f792d8b26"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::table</b></td></tr>
<tr class="separator:a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a60a52265027518b25655d730f960013a" id="r_a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top"><a id="a60a52265027518b25655d730f960013a" name="a60a52265027518b25655d730f960013a"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::totalSize</b></td></tr>
<tr class="separator:a60a52265027518b25655d730f960013a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1" id="r_a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top"><a id="a4e9a7219d34e781e4e73d74a968b26c1" name="a4e9a7219d34e781e4e73d74a968b26c1"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::tomb</b> = -1</td></tr>
<tr class="separator:a4e9a7219d34e781e4e73d74a968b26c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5f5323b52037218cf5ae888778b7f980" id="r_a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top"><a id="a5f5323b52037218cf5ae888778b7f980" name="a5f5323b52037218cf5ae888778b7f980"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::size</b></td></tr>
<tr class="separator:a5f5323b52037218cf5ae888778b7f980"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f" id="r_ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top"><a id="ae5d042a7f6038a2ec9e5718d0c7fb31f" name="ae5d042a7f6038a2ec9e5718d0c7fb31f"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::rehashing</b></td></tr>
<tr class="separator:ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memSeparator" colspan="2">&#160;</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/Double_hashing" target="_blank">double-hashed keys</a>. </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/achance6" target="_blank">achance6</a> </dd>
<dd>
<a href="https://github.com/kvedala" target="_blank">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" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</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"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main program </p><dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 250</span> {</div>
<div class="line"><span class="lineno"> 251</span> <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
<div class="line"><span class="lineno"> 252</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
<div class="line"><span class="lineno"> 253</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; totalSize;</div>
<div class="line"><span class="lineno"> 254</span> table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
<div class="line"><span class="lineno"> 255</span> <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 256</span> <span class="keywordflow">while</span> (loop) {</div>
<div class="line"><span class="lineno"> 257</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 258</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 259</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 261</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 262</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 264</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; cmd;</div>
<div class="line"><span class="lineno"> 266</span> <span class="keywordflow">switch</span> (cmd) {</div>
<div class="line"><span class="lineno"> 267</span> <span class="keywordflow">case</span> 1:</div>
<div class="line"><span class="lineno"> 268</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a>(key);</div>
<div class="line"><span class="lineno"> 271</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 272</span> <span class="keywordflow">case</span> 2:</div>
<div class="line"><span class="lineno"> 273</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
<div class="line"><span class="lineno"> 274</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
<div class="line"><span class="lineno"> 275</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a>(key);</div>
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 277</span> <span class="keywordflow">case</span> 3: {</div>
<div class="line"><span class="lineno"> 278</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
<div class="line"><span class="lineno"> 279</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
<div class="line"><span class="lineno"> 280</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a>(key, <span class="keyword">true</span>)];</div>
<div class="line"><span class="lineno"> 281</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == double_hashing::notPresent) {</div>
<div class="line"><span class="lineno"> 282</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
<div class="line"><span class="lineno"> 283</span> }</div>
<div class="line"><span class="lineno"> 284</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 285</span> }</div>
<div class="line"><span class="lineno"> 286</span> <span class="keywordflow">case</span> 4:</div>
<div class="line"><span class="lineno"> 287</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
<div class="line"><span class="lineno"> 288</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
<div class="line"><span class="lineno"> 289</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
<div class="line"><span class="lineno"> 290</span> &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a>(key);</div>
<div class="line"><span class="lineno"> 291</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 292</span> <span class="keywordflow">case</span> 5:</div>
<div class="line"><span class="lineno"> 293</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a>();</div>
<div class="line"><span class="lineno"> 294</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 295</span> <span class="keywordflow">default</span>:</div>
<div class="line"><span class="lineno"> 296</span> loop = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 297</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 298</span> <span class="comment">// delete[] table;</span></div>
<div class="line"><span class="lineno"> 299</span> }</div>
<div class="line"><span class="lineno"> 300</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 301</span> }</div>
<div class="line"><span class="lineno"> 302</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 303</span>}</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>
<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="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:287</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::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> double_hash_hash_table.cpp:47</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:143</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:227</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:71</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a9c652b2e467e5d250dfe3bed83b12560"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:212</div></div>
<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:36</div></div>
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:38</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>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- 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="../../d6/d80/double__hash__hash__table_8cpp.html">double_hash_hash_table.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink