backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 13:53:35 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
d1/dc7/linear__probing__hash__table_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="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 File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -124,6 +124,7 @@ $(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp.html','../../
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<div class="headertitle"><div class="title">linear_probing_hash_table.cpp File Reference</div></div>
@@ -153,6 +154,11 @@ Namespaces</h2></td></tr>
<tr class="memdesc:d8/d89/namespacelinear__probing"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a617268d1e3a4993b7bc952a658904d51" id="r_a617268d1e3a4993b7bc952a658904d51"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a617268d1e3a4993b7bc952a658904d51">linear_probing::Entry</a> = struct Entry</td></tr>
<tr class="separator:a617268d1e3a4993b7bc952a658904d51"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a75d779938df7ebc68581d922b60a2541" id="r_a75d779938df7ebc68581d922b60a2541"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
@@ -193,6 +199,10 @@ Variables</h2></td></tr>
<tr class="separator:a8e81b17f2f8403c982368da3dac1ae87"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386" id="r_a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a5ff22c1a04290e24ef3ba3d6a3a06386">linear_probing::rehashing</a></td></tr>
<tr class="separator:a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8" id="r_acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb1dc3f09cf07c2633580a1c46c9f0a8">table</a></td></tr>
<tr class="separator:acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e" id="r_a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4fdb68db9f02ae4156e1845563004f8e">totalSize</a></td></tr>
<tr class="separator:a4fdb68db9f02ae4156e1845563004f8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing hash</a> keys. </p>
@@ -276,13 +286,46 @@ Variables</h2></td></tr>
<div class="line"><span class="lineno"> 277</span>}</div>
<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00186">linear_probing_hash_table.cpp:186</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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00046">linear_probing_hash_table.cpp:46</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&#39;s std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00055">linear_probing_hash_table.cpp:55</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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00201">linear_probing_hash_table.cpp:201</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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00035">linear_probing_hash_table.cpp:35</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="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00037">linear_probing_hash_table.cpp:37</a></div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Variable Documentation</h2>
<a id="acb1dc3f09cf07c2633580a1c46c9f0a8" name="acb1dc3f09cf07c2633580a1c46c9f0a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acb1dc3f09cf07c2633580a1c46c9f0a8">&#9670;&#160;</a></span>table</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::vector&lt;<a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&gt; linear_probing::table</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
</div>
</div>
<a id="a4fdb68db9f02ae4156e1845563004f8e" name="a4fdb68db9f02ae4156e1845563004f8e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4fdb68db9f02ae4156e1845563004f8e">&#9670;&#160;</a></span>totalSize</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int linear_probing::totalSize</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
</div>
</div>
</div><!-- contents -->
@@ -291,7 +334,7 @@ Variables</h2></td></tr>
<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.12.0 </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>