backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 01:02:46 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 404e2c15b3

Browse Source
This commit is contained in:
github-actions
2021-09-24 16:40:50 +00:00
parent 5a03bb2bc9
commit a157836566
105 changed files with 4775 additions and 2440 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
d1/dc7/linear__probing__hash__table_8cpp.html
View File

@@ -137,7 +137,7 @@ Functions</h2></td></tr>
<tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a> (int key)</td></tr>
<tr class="separator:a16d34fd3511626a83ab00665d7bc34d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a> (int key)</td></tr>
<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. <a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">More...</a><br /></td></tr>
<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="el" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb" title="Converts the string to bytestring and calls the main algorithm.">std::hash()</a></code> function. <a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">More...</a><br /></td></tr>
<tr class="separator:a4bde7a47f98dd1ad24c84038e2608527"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a> (int key, bool searching)</td></tr>
<tr class="separator:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -199,7 +199,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehas
</div><div class="memdoc">
<p >Main function </p><dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>
<div class="fragment"><div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> {</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="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; totalSize;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
@@ -255,6 +255,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehas
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition:</b> md5.cpp:287</div></div>
<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:186</div></div>
<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:46</div></div>
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:55</div></div>