mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
397 lines
52 KiB
HTML
397 lines
52 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!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.13.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: hashing/linear_probing_hash_table.cpp Source File</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<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="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</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/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.13.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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&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&dn=expat.txt MIT */
|
|
$(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp_source.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="headertitle"><div class="title">linear_probing_hash_table.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d1/dc7/linear__probing__hash__table_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="preprocessor">#include <iostream></span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d89/namespacelinear__probing.html">linear_probing</a> {</div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment">// fwd declarations</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="keyword">using </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> = <span class="keyword">struct </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>;</div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>& entry, <span class="keywordtype">int</span> key);</div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>& entry, <span class="keywordtype">int</span> key);</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(<span class="keywordtype">int</span> key);</div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="comment">// Undocumented globals</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keywordtype">int</span> notPresent;</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>std::vector<Entry> table;</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keywordtype">int</span> totalSize;</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keywordtype">int</span> tomb = -1;</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keywordtype">int</span> size;</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keywordtype">bool</span> rehashing;</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span></div>
|
|
<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html"> 35</a></span><span class="keyword">struct </span><a class="code hl_function" href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">Entry</a> {</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77"> 36</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">Entry</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> = notPresent) : <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>(<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>) {} </div>
|
|
<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a"> 37</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>; </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>};</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span></div>
|
|
<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527"> 46</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(<span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> std::hash<int> hash;</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> hash(key);</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span></div>
|
|
<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746"> 55</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(<span class="keywordtype">int</span> key, <span class="keywordtype">bool</span> searching) {</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</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 hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key));</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">int</span> index = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>((hash + i) % totalSize);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> entry = table[index];</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (searching) {</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == notPresent) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(entry, key)) {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> std::cout << <span class="stringliteral">"Found key!"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> std::cout << <span class="stringliteral">"Found tombstone or equal hash, checking next"</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> << std::endl;</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> i++;</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(entry, key)) {</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (!rehashing) {</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> std::cout << <span class="stringliteral">"Spot found!"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (!rehashing) {</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> std::cout << <span class="stringliteral">"Spot taken, looking at next"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> }</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> i++;</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (i == totalSize) {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> std::cout << <span class="stringliteral">"Linear probe failed"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> != notPresent);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">return</span> notPresent;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span></div>
|
|
<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541"> 98</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>& entry, <span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == notPresent || entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == tomb) {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span></div>
|
|
<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77"> 110</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>& entry, <span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == key) {</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span></div>
|
|
<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635"> 120</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>() {</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < totalSize; i++) {</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::cout << <span class="stringliteral">" Empty "</span>;</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> std::cout << <span class="stringliteral">" Tomb "</span>;</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> std::cout << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> std::cout << table[i].key;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> std::cout << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> }</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span></div>
|
|
<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0"> 138</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">rehash</a>() {</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Necessary so wall of add info isn't printed all at once</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> rehashing = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">int</span> oldSize = totalSize;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::vector<Entry> oldTable(table);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// Really this should use the next prime number greater than totalSize *</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// 2</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> totalSize *= 2;</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> table = std::vector<Entry>(totalSize);</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < oldSize; i++) {</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">if</span> (oldTable[i].key != -1 && oldTable[i].key != notPresent) {</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> size--; <span class="comment">// Size stays the same (add increments size)</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(oldTable[i].key);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> }</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// delete[] oldTable;</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> rehashing = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::cout << <span class="stringliteral">"Table was rehashed, new size is: "</span> << totalSize << std::endl;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span></div>
|
|
<div class="foldopen" id="foldopen00161" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1"> 161</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(<span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> table[index].key = key;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</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 id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">rehash</a>();</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span></div>
|
|
<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28"> 173</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a>(<span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">if</span> (index == notPresent) {</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::cout << <span class="stringliteral">"key not found"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> }</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> std::cout << <span class="stringliteral">"Removal Successful, leaving tomb"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> table[index].key = tomb;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> size--;</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span></div>
|
|
<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908"> 186</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">addInfo</a>(<span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::cout << <span class="stringliteral">"Initial table: "</span>;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> std::cout << <span class="stringliteral">"hash of "</span> << key << <span class="stringliteral">" is "</span> << <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) << <span class="stringliteral">" % "</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> << totalSize << <span class="stringliteral">" == "</span> << <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) % totalSize;</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(key);</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> std::cout << <span class="stringliteral">"New table: "</span>;</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span></div>
|
|
<div class="foldopen" id="foldopen00201" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0"> 201</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">removalInfo</a>(<span class="keywordtype">int</span> key) {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> std::cout << <span class="stringliteral">"Initial table: "</span>;</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> std::cout << <span class="stringliteral">"hash of "</span> << key << <span class="stringliteral">" is "</span> << <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) << <span class="stringliteral">" % "</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> << totalSize << <span class="stringliteral">" == "</span> << <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) % totalSize;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a>(key);</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> std::cout << <span class="stringliteral">"New table: "</span>;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span>} <span class="comment">// namespace linear_probing</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span><span class="keyword">using </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a>;</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span><span class="keyword">using </span>linear_probing::table;</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span><span class="keyword">using </span>linear_probing::totalSize;</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span></div>
|
|
<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 224</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">int</span> cmd = 0, hash = 0, key = 0;</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> std::cout << <span class="stringliteral">"Enter the initial size of Hash Table. = "</span>;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> std::cin >> totalSize;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> table = std::vector<Entry>(totalSize);</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">while</span> (loop) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> std::cout << <span class="stringliteral">"PLEASE CHOOSE -"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> std::cout << <span class="stringliteral">"1. Add key. (Numeric only)"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> std::cout << <span class="stringliteral">"2. Remove key."</span> << std::endl;</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> std::cout << <span class="stringliteral">"3. Find key."</span> << std::endl;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> std::cout << <span class="stringliteral">"4. Generate Hash. (Numeric only)"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> std::cout << <span class="stringliteral">"5. Display Hash table."</span> << std::endl;</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> std::cout << <span class="stringliteral">"6. Exit."</span> << std::endl;</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> std::cin >> cmd;</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordflow">switch</span> (cmd) {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> std::cout << <span class="stringliteral">"Enter key to add = "</span>;</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> std::cin >> key;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a>(key);</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keywordflow">case</span> 2:</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> std::cout << <span class="stringliteral">"Enter key to remove = "</span>;</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> std::cin >> key;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a>(key);</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">case</span> 3: {</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> std::cout << <span class="stringliteral">"Enter key to search = "</span>;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> std::cin >> key;</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a>(key, <span class="keyword">true</span>)];</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == linear_probing::notPresent) {</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> std::cout << <span class="stringliteral">"Key not present"</span>;</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> }</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> }</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">case</span> 4:</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> std::cout << <span class="stringliteral">"Enter element to generate hash = "</span>;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> std::cin >> key;</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> std::cout << <span class="stringliteral">"Hash of "</span> << key</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> << <span class="stringliteral">" is = "</span> << <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a>(key);</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="keywordflow">case</span> 5:</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a>();</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> loop = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// delete[] table;</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> }</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> }</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span>}</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="ttc" id="alinear__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00224">linear_probing_hash_table.cpp:224</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></div><div class="ttdoc">An implementation of hash table using linear probing algorithm.</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> <a href="#l00186">linear_probing_hash_table.cpp:186</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a16d34fd3511626a83ab00665d7bc34d1"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00161">linear_probing_hash_table.cpp:161</a></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> <a href="#l00046">linear_probing_hash_table.cpp:46</a></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> <a href="#l00055">linear_probing_hash_table.cpp:55</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a6a082dc1426a79f866cee6b370df37b0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> <a href="#l00138">linear_probing_hash_table.cpp:138</a></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> <a href="#l00201">linear_probing_hash_table.cpp:201</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00098">linear_probing_hash_table.cpp:98</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_a942fc8407b8001890ea26830cdcd9d77"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">linear_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00110">linear_probing_hash_table.cpp:110</a></div></div>
|
|
<div class="ttc" id="anamespacelinear__probing_html_abcf8d033f8115f39f3c93cfb6cee0b28"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">linear_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00173">linear_probing_hash_table.cpp:173</a></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> <a href="#l00120">linear_probing_hash_table.cpp:120</a></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> <a href="#l00035">linear_probing_hash_table.cpp:35</a></div></div>
|
|
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition</b> <a href="#l00036">linear_probing_hash_table.cpp:36</a></div></div>
|
|
<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> <a href="#l00037">linear_probing_hash_table.cpp:37</a></div></div>
|
|
</div><!-- fragment --></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="../../d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_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.13.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|