backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 11:37:18 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
d3/d26/binary__search__tree_8cpp.html
View File

@@ -3,7 +3,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.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -123,30 +123,30 @@ Classes</h2></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:a1ca1e6aad9a9e45c1d21a7c8f61bccc3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a1ca1e6aad9a9e45c1d21a7c8f61bccc3">enqueue</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a1ca1e6aad9a9e45c1d21a7c8f61bccc3" id="r_a1ca1e6aad9a9e45c1d21a7c8f61bccc3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a1ca1e6aad9a9e45c1d21a7c8f61bccc3">enqueue</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:a1ca1e6aad9a9e45c1d21a7c8f61bccc3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a11b4c912d85c475c67abab608f86ecce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a11b4c912d85c475c67abab608f86ecce">dequeue</a> ()</td></tr>
<tr class="memitem:a11b4c912d85c475c67abab608f86ecce" id="r_a11b4c912d85c475c67abab608f86ecce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a11b4c912d85c475c67abab608f86ecce">dequeue</a> ()</td></tr>
<tr class="separator:a11b4c912d85c475c67abab608f86ecce"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a521ea77f195e491750e602292c6dc335"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a521ea77f195e491750e602292c6dc335">Insert</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="memitem:a521ea77f195e491750e602292c6dc335" id="r_a521ea77f195e491750e602292c6dc335"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a521ea77f195e491750e602292c6dc335">Insert</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="separator:a521ea77f195e491750e602292c6dc335"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4a1aaff44d949318d93231e1fa5c7863"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a4a1aaff44d949318d93231e1fa5c7863">findMaxInLeftST</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a4a1aaff44d949318d93231e1fa5c7863" id="r_a4a1aaff44d949318d93231e1fa5c7863"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a4a1aaff44d949318d93231e1fa5c7863">findMaxInLeftST</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:a4a1aaff44d949318d93231e1fa5c7863"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4392f2f3d0680befc1a6db07d94d6c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a4392f2f3d0680befc1a6db07d94d6c5d">Remove</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *p, <a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="memitem:a4392f2f3d0680befc1a6db07d94d6c5d" id="r_a4392f2f3d0680befc1a6db07d94d6c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a4392f2f3d0680befc1a6db07d94d6c5d">Remove</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *p, <a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="separator:a4392f2f3d0680befc1a6db07d94d6c5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa65d9b7fa9bd517ace3d819abc85c8b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6">BFT</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:aa65d9b7fa9bd517ace3d819abc85c8b6" id="r_aa65d9b7fa9bd517ace3d819abc85c8b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6">BFT</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:aa65d9b7fa9bd517ace3d819abc85c8b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9e98619e1c6cea9d6c56849a16ecc416"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416">Pre</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a9e98619e1c6cea9d6c56849a16ecc416" id="r_a9e98619e1c6cea9d6c56849a16ecc416"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416">Pre</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:a9e98619e1c6cea9d6c56849a16ecc416"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adb338121baec7856c9593d79ddeb5e18"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18">In</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:adb338121baec7856c9593d79ddeb5e18" id="r_adb338121baec7856c9593d79ddeb5e18"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18">In</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:adb338121baec7856c9593d79ddeb5e18"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a13dac1586cbb95ebfd63dc47aeeff0e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a13dac1586cbb95ebfd63dc47aeeff0e1">Post</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a13dac1586cbb95ebfd63dc47aeeff0e1" id="r_a13dac1586cbb95ebfd63dc47aeeff0e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#a13dac1586cbb95ebfd63dc47aeeff0e1">Post</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="separator:a13dac1586cbb95ebfd63dc47aeeff0e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memItemLeft" align="right" valign="top"><a id="aebb1a5194a2cd7efe7ee7fc417e78293" name="aebb1a5194a2cd7efe7ee7fc417e78293"></a>
<tr class="memitem:aebb1a5194a2cd7efe7ee7fc417e78293" id="r_aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memItemLeft" align="right" valign="top"><a id="aebb1a5194a2cd7efe7ee7fc417e78293" name="aebb1a5194a2cd7efe7ee7fc417e78293"></a>
<a class="el" href="../../dc/db5/struct_queue.html">Queue</a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue</b></td></tr>
<tr class="separator:aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -512,7 +512,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_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.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.9.7 </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.9.8 </li>
</ul>
</div>
</body>

22
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html
View File

@@ -3,7 +3,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.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::trie_using_hashmap::Trie Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -122,32 +122,32 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a092d0805a9e647c2048777dbe67b35ab"><td class="memItemLeft" align="right" valign="top"><a id="a092d0805a9e647c2048777dbe67b35ab" name="a092d0805a9e647c2048777dbe67b35ab"></a>
<tr class="memitem:a092d0805a9e647c2048777dbe67b35ab" id="r_a092d0805a9e647c2048777dbe67b35ab"><td class="memItemLeft" align="right" valign="top"><a id="a092d0805a9e647c2048777dbe67b35ab" name="a092d0805a9e647c2048777dbe67b35ab"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Trie</b> ()=default</td></tr>
<tr class="memdesc:a092d0805a9e647c2048777dbe67b35ab"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; Constructor <br /></td></tr>
<tr class="separator:a092d0805a9e647c2048777dbe67b35ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abcae0a4456e7f583ce716e3ef466dfd2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
<tr class="memitem:abcae0a4456e7f583ce716e3ef466dfd2" id="r_abcae0a4456e7f583ce716e3ef466dfd2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
<tr class="memdesc:abcae0a4456e7f583ce716e3ef466dfd2"><td class="mdescLeft">&#160;</td><td class="mdescRight">insert the string into the trie <br /></td></tr>
<tr class="separator:abcae0a4456e7f583ce716e3ef466dfd2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad71eb24207c28b546631802dba97310f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
<tr class="memitem:ad71eb24207c28b546631802dba97310f" id="r_ad71eb24207c28b546631802dba97310f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
<tr class="memdesc:ad71eb24207c28b546631802dba97310f"><td class="mdescLeft">&#160;</td><td class="mdescRight">search a word/string inside the trie <br /></td></tr>
<tr class="separator:ad71eb24207c28b546631802dba97310f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af3aee573fbabd2c1510c0f74f842dd17"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memitem:af3aee573fbabd2c1510c0f74f842dd17" id="r_af3aee573fbabd2c1510c0f74f842dd17"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memdesc:af3aee573fbabd2c1510c0f74f842dd17"><td class="mdescLeft">&#160;</td><td class="mdescRight">search a word/string that starts with a given prefix <br /></td></tr>
<tr class="separator:af3aee573fbabd2c1510c0f74f842dd17"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0bf3d6791cba144b3f539835d835e75"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">delete_word</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word)</td></tr>
<tr class="memitem:ac0bf3d6791cba144b3f539835d835e75" id="r_ac0bf3d6791cba144b3f539835d835e75"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">delete_word</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word)</td></tr>
<tr class="memdesc:ac0bf3d6791cba144b3f539835d835e75"><td class="mdescLeft">&#160;</td><td class="mdescRight">delete a word/string from a trie <br /></td></tr>
<tr class="separator:ac0bf3d6791cba144b3f539835d835e75"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; results, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;element, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> prefix)</td></tr>
<tr class="memitem:a7bbe538c8015e8ce158e7ed43f605ebd" id="r_a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; results, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;element, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> prefix)</td></tr>
<tr class="memdesc:a7bbe538c8015e8ce158e7ed43f605ebd"><td class="mdescLeft">&#160;</td><td class="mdescRight">helper function to predict/recommend words that starts with a given prefix from the end of prefix's node iterate through all the child nodes by recursively appending all the possible words below the trie <br /></td></tr>
<tr class="separator:a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae15fdc7f2b5023992d87a711d78566c4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memitem:ae15fdc7f2b5023992d87a711d78566c4" id="r_ae15fdc7f2b5023992d87a711d78566c4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memdesc:ae15fdc7f2b5023992d87a711d78566c4"><td class="mdescLeft">&#160;</td><td class="mdescRight">predict/recommend a word that starts with a given prefix <br /></td></tr>
<tr class="separator:ae15fdc7f2b5023992d87a711d78566c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a832072498abeaa52ad43c4fc99cba248"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a></td></tr>
<tr class="memitem:a832072498abeaa52ad43c4fc99cba248" id="r_a832072498abeaa52ad43c4fc99cba248"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a></td></tr>
<tr class="memdesc:a832072498abeaa52ad43c4fc99cba248"><td class="mdescLeft">&#160;</td><td class="mdescRight">declaring root node of trie <br /></td></tr>
<tr class="separator:a832072498abeaa52ad43c4fc99cba248"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -565,7 +565,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>trie_using_hashmap</b></li><li class="navelem"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</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.9.7 </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.9.8 </li>
</ul>
</div>
</body>

6
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.map
View File

@@ -1,8 +1,8 @@
<map id="data_structures::trie_using_hashmap::Trie::get_all_words" name="data_structures::trie_using_hashmap::Trie::get_all_words">
<area shape="rect" id="Node000001" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="5,29,155,85"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,29,41,19,48,10,61,5,80,3,102,5,115,13,112,17,100,11,80,8,63,10,51,15,46,21,46,29"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,29,41,19,48,10,61,5,80,3,101,5,114,12,112,17,100,10,80,8,63,10,51,15,46,21,46,29"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="208,19,352,45"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="155,45,193,40,194,45,156,50"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="155,45,193,40,193,45,156,50"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="203,68,357,94"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="156,64,188,67,188,73,155,69"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="156,64,187,67,187,73,155,69"/>
</map>

14
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::get_all_words Pages: 1 -->
<svg width="272pt" height="75pt"
@@ -33,8 +33,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.51,-66.5 76.85,-63.61 81,-59.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="84.59,-60.37 83.66,-49.82 77.81,-58.65 84.59,-60.37"/>
<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.18,-66.5 76.41,-63.76 80.67,-59.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.96,-60.85 83.26,-50.28 77.21,-58.98 83.96,-60.85"/>
</a>
</g>
</g>
@@ -51,8 +51,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.89,-35.96 131.73,-37.23 141.32,-38.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.65,-42.03 151.02,-39.83 141.55,-35.09 140.65,-42.03"/>
<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.69,-35.94 131.3,-37.17 140.7,-38.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.15,-41.84 150.52,-39.64 141.05,-34.89 140.15,-41.84"/>
</a>
</g>
</g>
@@ -69,8 +69,8 @@
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.46,-19.9 128.75,-18.89 136.93,-17.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.1,-21.28 146.6,-16.6 136.25,-14.33 137.1,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.28,-19.92 128.37,-18.94 136.38,-17.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.59,-21.46 146.1,-16.78 135.75,-14.51 136.59,-21.46"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

14
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::get_all_words Pages: 1 -->
<svg width="272pt" height="75pt"
@@ -23,8 +23,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.51,-66.5 76.85,-63.61 81,-59.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="84.59,-60.37 83.66,-49.82 77.81,-58.65 84.59,-60.37"/>
<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.18,-66.5 76.41,-63.76 80.67,-59.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.96,-60.85 83.26,-50.28 77.21,-58.98 83.96,-60.85"/>
</a>
</g>
</g>
@@ -41,8 +41,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.89,-35.96 131.73,-37.23 141.32,-38.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.65,-42.03 151.02,-39.83 141.55,-35.09 140.65,-42.03"/>
<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.69,-35.94 131.3,-37.17 140.7,-38.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.15,-41.84 150.52,-39.64 141.05,-34.89 140.15,-41.84"/>
</a>
</g>
</g>
@@ -59,8 +59,8 @@
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.46,-19.9 128.75,-18.89 136.93,-17.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.1,-21.28 146.6,-16.6 136.25,-14.33 137.1,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.28,-19.92 128.37,-18.94 136.38,-17.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.59,-21.46 146.1,-16.78 135.75,-14.51 136.59,-21.46"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

10
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map
View File

@@ -1,13 +1,13 @@
<map id="data_structures::trie_using_hashmap::Trie::delete_word" name="data_structures::trie_using_hashmap::Trie::delete_word">
<area shape="rect" id="Node000001" title="delete a word/string from a trie" alt="" coords="5,89,155,145"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/back.html#" title=" " alt="" coords="217,5,332,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,86,201,40,215,34,217,39,204,45,123,91"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,86,201,40,214,34,216,39,204,45,123,91"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/pop.html#" title=" " alt="" coords="220,55,329,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="154,95,206,82,208,87,156,100"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="154,95,205,82,207,87,156,100"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="203,104,346,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="155,114,188,114,188,120,155,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="155,114,187,114,187,120,155,120"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/push.html#" title=" " alt="" coords="217,153,332,179"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="156,133,208,147,206,152,154,138"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="156,133,207,146,205,152,154,138"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/top.html#" title=" " alt="" coords="222,203,327,228"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="123,143,204,189,217,195,215,200,201,194,121,147"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="123,143,204,189,216,194,214,199,201,194,121,147"/>
</map>

22
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::delete_word Pages: 1 -->
<svg width="264pt" height="175pt"
@@ -42,8 +42,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 151.11,-141.09 154.37,-142.49 157.68,-143.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.07,-147.34 166.66,-147.6 158.54,-140.79 156.07,-147.34"/>
<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 150.91,-141 153.96,-142.32 157.06,-143.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.65,-146.79 166.24,-147.06 158.14,-140.24 155.65,-146.79"/>
</a>
</g>
</g>
@@ -60,8 +60,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C125.03,-101.14 138.65,-104.64 151.26,-107.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.01,-111.44 160.56,-110.54 151.75,-104.66 150.01,-111.44"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C124.78,-101.07 138.11,-104.5 150.5,-107.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.54,-111.06 160.1,-110.16 151.29,-104.28 149.54,-111.06"/>
</a>
</g>
</g>
@@ -78,8 +78,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.31,-83.62 128.77,-83.62 137.07,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.86,-87.13 146.86,-83.62 136.86,-80.13 136.86,-87.13"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.13,-83.62 128.39,-83.62 136.51,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.35,-87.13 146.35,-83.63 136.35,-80.13 136.35,-87.13"/>
</a>
</g>
</g>
@@ -96,8 +96,8 @@
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C125.03,-66.11 138.65,-62.61 151.26,-59.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.75,-62.59 160.56,-56.71 150.01,-55.81 151.75,-62.59"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C124.78,-66.18 138.11,-62.75 150.5,-59.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.29,-62.97 160.1,-57.09 149.54,-56.19 151.29,-62.97"/>
</a>
</g>
</g>
@@ -114,8 +114,8 @@
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 151.11,-26.16 154.37,-24.76 157.68,-23.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.54,-26.46 166.66,-19.65 156.07,-19.91 158.54,-26.46"/>
<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 150.91,-26.25 153.96,-24.93 157.06,-23.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.14,-27.01 166.24,-20.19 155.65,-20.46 158.14,-27.01"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.2 KiB

After

Width:  |  Height:  |  Size: 6.2 KiB

22
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::delete_word Pages: 1 -->
<svg width="264pt" height="175pt"
@@ -32,8 +32,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 151.11,-141.09 154.37,-142.49 157.68,-143.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.07,-147.34 166.66,-147.6 158.54,-140.79 156.07,-147.34"/>
<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 150.91,-141 153.96,-142.32 157.06,-143.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.65,-146.79 166.24,-147.06 158.14,-140.24 155.65,-146.79"/>
</a>
</g>
</g>
@@ -50,8 +50,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C125.03,-101.14 138.65,-104.64 151.26,-107.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.01,-111.44 160.56,-110.54 151.75,-104.66 150.01,-111.44"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C124.78,-101.07 138.11,-104.5 150.5,-107.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.54,-111.06 160.1,-110.16 151.29,-104.28 149.54,-111.06"/>
</a>
</g>
</g>
@@ -68,8 +68,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.31,-83.62 128.77,-83.62 137.07,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.86,-87.13 146.86,-83.62 136.86,-80.13 136.86,-87.13"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.13,-83.62 128.39,-83.62 136.51,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.35,-87.13 146.35,-83.63 136.35,-80.13 136.35,-87.13"/>
</a>
</g>
</g>
@@ -86,8 +86,8 @@
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C125.03,-66.11 138.65,-62.61 151.26,-59.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.75,-62.59 160.56,-56.71 150.01,-55.81 151.75,-62.59"/>
<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C124.78,-66.18 138.11,-62.75 150.5,-59.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.29,-62.97 160.1,-57.09 149.54,-56.19 151.29,-62.97"/>
</a>
</g>
</g>
@@ -104,8 +104,8 @@
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 151.11,-26.16 154.37,-24.76 157.68,-23.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.54,-26.46 166.66,-19.65 156.07,-19.91 158.54,-26.46"/>
<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 150.91,-26.25 153.96,-24.93 157.06,-23.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.14,-27.01 166.24,-20.19 155.65,-20.46 158.14,-27.01"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

8
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.map
View File

@@ -1,10 +1,10 @@
<map id="data_structures::trie_using_hashmap::Trie::predict_words" name="data_structures::trie_using_hashmap::Trie::predict_words">
<area shape="rect" id="Node000001" title="predict/recommend a word that starts with a given prefix" alt="" coords="5,29,155,85"/>
<area shape="rect" id="Node000002" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="203,29,352,85"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,55,188,55,188,60,155,60"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,29,239,19,246,10,259,5,277,3,299,5,312,13,309,17,297,11,277,8,260,10,249,15,244,21,244,29"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,55,187,55,187,60,155,60"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,29,239,19,246,10,259,5,277,3,298,5,311,12,309,17,297,10,277,8,260,10,249,15,244,21,244,29"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="406,19,549,45"/>
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="352,45,391,40,391,45,353,50"/>
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="352,45,390,40,391,45,353,50"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="400,68,554,94"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="353,64,386,67,385,73,352,69"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="353,64,385,67,384,73,352,69"/>
</map>

18
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::predict_words Pages: 1 -->
<svg width="420pt" height="75pt"
@@ -44,8 +44,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.28,-27.62 128.68,-27.62 136.95,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.73,-31.13 146.73,-27.62 136.73,-24.13 136.73,-31.13"/>
<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.1,-27.62 128.3,-27.62 136.39,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-31.13 146.21,-27.63 136.21,-24.13 136.21,-31.13"/>
</a>
</g>
</g>
@@ -53,8 +53,8 @@
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.36,-66.5 224.59,-63.61 228.69,-59.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="232.28,-60.37 231.32,-49.82 225.49,-58.66 232.28,-60.37"/>
<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.03,-66.5 224.15,-63.76 228.36,-59.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.65,-60.85 230.92,-50.28 224.9,-59 231.65,-60.85"/>
</a>
</g>
</g>
@@ -71,8 +71,8 @@
<g id="edge3_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.89,-35.96 279.73,-37.23 289.32,-38.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.65,-42.03 299.02,-39.83 289.55,-35.09 288.65,-42.03"/>
<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.69,-35.94 279.3,-37.17 288.7,-38.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.15,-41.84 298.52,-39.64 289.05,-34.89 288.15,-41.84"/>
</a>
</g>
</g>
@@ -89,8 +89,8 @@
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.46,-19.9 276.75,-18.89 284.93,-17.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="285.1,-21.28 294.6,-16.6 284.25,-14.33 285.1,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.28,-19.92 276.37,-18.94 284.38,-17.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="284.59,-21.46 294.1,-16.78 283.75,-14.51 284.59,-21.46"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.3 KiB

After

Width:  |  Height:  |  Size: 5.3 KiB

18
d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::trie_using_hashmap::Trie::predict_words Pages: 1 -->
<svg width="420pt" height="75pt"
@@ -34,8 +34,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.28,-27.62 128.68,-27.62 136.95,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.73,-31.13 146.73,-27.62 136.73,-24.13 136.73,-31.13"/>
<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.1,-27.62 128.3,-27.62 136.39,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-31.13 146.21,-27.63 136.21,-24.13 136.21,-31.13"/>
</a>
</g>
</g>
@@ -43,8 +43,8 @@
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.36,-66.5 224.59,-63.61 228.69,-59.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="232.28,-60.37 231.32,-49.82 225.49,-58.66 232.28,-60.37"/>
<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.03,-66.5 224.15,-63.76 228.36,-59.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.65,-60.85 230.92,-50.28 224.9,-59 231.65,-60.85"/>
</a>
</g>
</g>
@@ -61,8 +61,8 @@
<g id="edge3_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.89,-35.96 279.73,-37.23 289.32,-38.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.65,-42.03 299.02,-39.83 289.55,-35.09 288.65,-42.03"/>
<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.69,-35.94 279.3,-37.17 288.7,-38.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.15,-41.84 298.52,-39.64 289.05,-34.89 288.15,-41.84"/>
</a>
</g>
</g>
@@ -79,8 +79,8 @@
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.46,-19.9 276.75,-18.89 284.93,-17.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="285.1,-21.28 294.6,-16.6 284.25,-14.33 285.1,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.28,-19.92 276.37,-18.94 284.38,-17.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="284.59,-21.46 294.1,-16.78 283.75,-14.51 284.59,-21.46"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.5 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB