mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 21:01:50 +08:00
676 lines
57 KiB
HTML
676 lines
57 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.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: double_hashing Namespace 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.20 -->
|
|
<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('d0/d65/namespacedouble__hashing.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="#typedef-members">Typedefs</a> |
|
|
<a href="#func-members">Functions</a> |
|
|
<a href="#var-members">Variables</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">double_hashing Namespace Reference<div class="ingroups"><a class="el" href="../../d4/d39/group__open__addressing.html">Open Addressing</a></div></div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing">double hashing</a> algorithm.
|
|
<a href="../../d0/d65/namespacedouble__hashing.html#details">More...</a></p>
|
|
<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="../../d9/dde/structdouble__hashing_1_1_entry.html">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="typedef-members"></a>
|
|
Typedefs</h2></td></tr>
|
|
<tr class="memitem:a4b68c58d0e039662991f8e220129efd9"><td class="memItemLeft" align="right" valign="top"><a id="a4b68c58d0e039662991f8e220129efd9"></a>
|
|
using </td><td class="memItemRight" valign="bottom"><b>Entry</b> = struct <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a></td></tr>
|
|
<tr class="separator:a4b68c58d0e039662991f8e220129efd9"><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:ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &entry, int key)</td></tr>
|
|
<tr class="separator:ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a29f543e2626bad58907661e1e45028a6"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &entry, int key)</td></tr>
|
|
<tr class="separator:a29f543e2626bad58907661e1e45028a6"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a> (int key)</td></tr>
|
|
<tr class="separator:a79a9c914a6c68275b3640303d7faad8a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a> (int key)</td></tr>
|
|
<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><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="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">More...</a><br /></td></tr>
|
|
<tr class="separator:a0d90726ed1de7b3d2ae261baed048003"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a> (int key)</td></tr>
|
|
<tr class="memdesc:a33968a1178289ab61445dd4000df7082"><td class="mdescLeft"> </td><td class="mdescRight">Used for second hash function. <a href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">More...</a><br /></td></tr>
|
|
<tr class="separator:a33968a1178289ab61445dd4000df7082"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a> (int key, bool searching)</td></tr>
|
|
<tr class="memdesc:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="mdescLeft"> </td><td class="mdescRight">Performs double hashing to resolve collisions. <a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">More...</a><br /></td></tr>
|
|
<tr class="separator:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a1e901418c759627557eff359b8db38cd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a> ()</td></tr>
|
|
<tr class="separator:a1e901418c759627557eff359b8db38cd"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af4981819aae8bc7e7beeaef02615e30d"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a> ()</td></tr>
|
|
<tr class="separator:af4981819aae8bc7e7beeaef02615e30d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a28083ecac6eb94b643281875c8665931"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a> (int key)</td></tr>
|
|
<tr class="separator:a28083ecac6eb94b643281875c8665931"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9c652b2e467e5d250dfe3bed83b12560"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">addInfo</a> (int key)</td></tr>
|
|
<tr class="separator:a9c652b2e467e5d250dfe3bed83b12560"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5d06e4598569526294f10104875f6824"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">removalInfo</a> (int key)</td></tr>
|
|
<tr class="separator:a5d06e4598569526294f10104875f6824"><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:a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top"><a id="a77d33a0c49294b9ec22ad86eeff79585"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>notPresent</b></td></tr>
|
|
<tr class="separator:a77d33a0c49294b9ec22ad86eeff79585"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top"><a id="a0e2ff0f9cfc7b54e60a6561f792d8b26"></a>
|
|
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> > </td><td class="memItemRight" valign="bottom"><b>table</b></td></tr>
|
|
<tr class="separator:a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top"><a id="a60a52265027518b25655d730f960013a"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>totalSize</b></td></tr>
|
|
<tr class="separator:a60a52265027518b25655d730f960013a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top"><a id="a4e9a7219d34e781e4e73d74a968b26c1"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>tomb</b> = -1</td></tr>
|
|
<tr class="separator:a4e9a7219d34e781e4e73d74a968b26c1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top"><a id="a5f5323b52037218cf5ae888778b7f980"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
|
|
<tr class="separator:a5f5323b52037218cf5ae888778b7f980"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top"><a id="ae5d042a7f6038a2ec9e5718d0c7fb31f"></a>
|
|
bool </td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></tr>
|
|
<tr class="separator:ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing">double hashing</a> algorithm. </p>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="a79a9c914a6c68275b3640303d7faad8a"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a79a9c914a6c68275b3640303d7faad8a">◆ </a></span>add()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::add </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Checks for load factor here </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to add to the table </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<div class="fragment"><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// auto* entry = new Entry();</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// entry->key = key;</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">int</span> index = <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  table[index].key = key;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(totalSize) >= 0.5) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a>();</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg" width="640" height="256"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a9c652b2e467e5d250dfe3bed83b12560"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a9c652b2e467e5d250dfe3bed83b12560">◆ </a></span>addInfo()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::addInfo </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Information about the adding process </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to add to table </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<div class="fragment"><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initial table: "</span>;</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</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="l00216"></a><span class="lineno"> 216</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 << <span class="stringliteral">" is "</span> << <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) << <span class="stringliteral">" % "</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  << totalSize << <span class="stringliteral">" == "</span> << <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</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="l00219"></a><span class="lineno"> 219</span>  <a class="code" href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a>(key);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"New table: "</span>;</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> }</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="../../d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg" width="100%" height="518"><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>
|
|
<a id="a1e901418c759627557eff359b8db38cd"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a1e901418c759627557eff359b8db38cd">◆ </a></span>display()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::display </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Displays the table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  {</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < totalSize; i++) {</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">" Empty "</span>;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">" Tomb "</span>;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << table[i].key;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</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="l00156"></a><span class="lineno"> 156</span> }</div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg" width="292" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a8f8ff4fb018e1bb32d67d8a1885d3200"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8f8ff4fb018e1bb32d67d8a1885d3200">◆ </a></span>doubleHash()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int double_hashing::doubleHash </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">bool </td>
|
|
<td class="paramname"><em>searching</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Performs double hashing to resolve collisions. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to apply double-hash on </td></tr>
|
|
<tr><td class="paramname">searching</td><td><code>true</code> to check for conflicts </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>Index of key when found </dd>
|
|
<dd>
|
|
new hash if no conflicts present </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">int</span> hash = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(<a class="code" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key));</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry;</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">int</span> index =</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(hash + (i * <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) % totalSize;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  entry = table[index];</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">if</span> (searching) {</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (entry.<a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a>(entry, key)) {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Found 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="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Found tombstone or equal hash, checking next"</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</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="l00089"></a><span class="lineno"> 89</span>  i++;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (!rehashing) {</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Spot found!"</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="l00094"></a><span class="lineno"> 94</span>  }</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (!rehashing) {</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Spot taken, looking at next (next index:"</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  << <span class="stringliteral">" "</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  << <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(hash + (i * <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) %</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  totalSize</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  << <span class="stringliteral">")"</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="l00103"></a><span class="lineno"> 103</span>  }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  i++;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (i == totalSize * 100) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"DoubleHash probe failed"</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="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  } <span class="keywordflow">while</span> (entry.<a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> != notPresent);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg" width="451" height="256"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a0d90726ed1de7b3d2ae261baed048003"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0d90726ed1de7b3d2ae261baed048003">◆ </a></span>hashFxn()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t double_hashing::hashFxn </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>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. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>value to hash </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash<int></a> hash;</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> hash(key);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a33968a1178289ab61445dd4000df7082"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a33968a1178289ab61445dd4000df7082">◆ </a></span>otherHashFxn()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">size_t double_hashing::otherHashFxn </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Used for second hash function. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to hash </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash<int></a> hash;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">return</span> 1 + (7 - (hash(key) % 7));</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac2adfce49ac57f6dbd1778d2c1ce0d2b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">◆ </a></span>putProber()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool double_hashing::putProber </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> & </td>
|
|
<td class="paramname"><em>entry</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Finds empty spot in a vector </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">entry</td><td>vector to search in </td></tr>
|
|
<tr><td class="paramname">key</td><td>key to search for </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if key is not present or is a <code>toumb</code> </dd>
|
|
<dd>
|
|
<code>false</code> is already occupied </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (entry.<a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent || entry.<a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == tomb) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="af4981819aae8bc7e7beeaef02615e30d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af4981819aae8bc7e7beeaef02615e30d">◆ </a></span>rehash()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::rehash </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Rehashes the table into a bigger table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// Necessary so wall of add info isn't printed all at once</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  rehashing = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">int</span> oldSize = totalSize;</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Entry></a> oldTable(table);</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Really this should use the next prime number greater than totalSize * 2</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  table = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Entry></a>(totalSize * 2);</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  totalSize *= 2;</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < oldSize; i++) {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (oldTable[i].key != -1 && oldTable[i].key != notPresent) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  size--; <span class="comment">// Size stays the same (add increments size)</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a>(oldTable[i].key);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// delete[] oldTable;</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// oldTable.reset();</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  rehashing = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Table was rehashed, new size is: "</span> << totalSize << <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="l00180"></a><span class="lineno"> 180</span> }</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="../../d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg" width="100%" height="492"><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>
|
|
<a id="a5d06e4598569526294f10104875f6824"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a5d06e4598569526294f10104875f6824">◆ </a></span>removalInfo()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::removalInfo </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Information about removal process </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to remove from table </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<div class="fragment"><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initial table: "</span>;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</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="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> << <span class="stringliteral">"hash of "</span> << key << <span class="stringliteral">" is "</span> << <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) << <span class="stringliteral">" % "</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  << totalSize << <span class="stringliteral">" == "</span> << <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</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> << <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="code" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(key);</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">"New table: "</span>;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</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="../../d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg" width="100%" height="499"><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>
|
|
<a id="a28083ecac6eb94b643281875c8665931"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a28083ecac6eb94b643281875c8665931">◆ </a></span>remove()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void double_hashing::remove </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Removes key. Leaves tombstone upon removal. </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">key</td><td>key value to remove </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<div class="fragment"><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> index = <a class="code" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (index == notPresent) {</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</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 found"</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="l00203"></a><span class="lineno"> 203</span>  }</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  table[index].key = tomb;</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Removal successful, leaving tombstone"</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="l00206"></a><span class="lineno"> 206</span>  size--;</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> }</div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg" width="662" height="256"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a29f543e2626bad58907661e1e45028a6"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a29f543e2626bad58907661e1e45028a6">◆ </a></span>searchingProber()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool double_hashing::searchingProber </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> & </td>
|
|
<td class="paramname"><em>entry</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>key</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Looks for a matching key </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">entry</td><td>vector to search in </td></tr>
|
|
<tr><td class="paramname">key</td><td>key value to search </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
|
|
<dd>
|
|
<code>false</code> if not found </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (entry.<a class="code" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == key) {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<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="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:58</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="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:120</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="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_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:161</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_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:199</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="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</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="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:24</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="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</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="../../d0/d65/namespacedouble__hashing.html">double_hashing</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.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|