backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +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

256
d1/def/classdata__structures_1_1linked__list_1_1list.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++: data_structures::linked_list::list Class 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');
@@ -139,54 +139,54 @@ Collaboration diagram for data_structures::linked_list::list:</div>
Public Member Functions</h2></td></tr>
<tr class="memitem:a50e209b55b83622254177050945e7826" id="r_a50e209b55b83622254177050945e7826"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a50e209b55b83622254177050945e7826">list</a> ()</td></tr>
<tr class="separator:a50e209b55b83622254177050945e7826"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a454ab4918f579869dfed4bb420a3f897" id="r_a454ab4918f579869dfed4bb420a3f897"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a> ()</td></tr>
<tr class="separator:a454ab4918f579869dfed4bb420a3f897"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6e9859d1a0755fb51e41904d20c95496" id="r_a6e9859d1a0755fb51e41904d20c95496"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6e9859d1a0755fb51e41904d20c95496">push_back</a> (int new_elem)</td></tr>
<tr class="separator:a6e9859d1a0755fb51e41904d20c95496"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a332b965afd9d6bea8d3246673acd52c7" id="r_a332b965afd9d6bea8d3246673acd52c7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a332b965afd9d6bea8d3246673acd52c7">push_front</a> (int new_elem)</td></tr>
<tr class="separator:a332b965afd9d6bea8d3246673acd52c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a009b19ac8cca40f2e4daa2e5989fa4f3" id="r_a009b19ac8cca40f2e4daa2e5989fa4f3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a009b19ac8cca40f2e4daa2e5989fa4f3">erase</a> (int old_elem)</td></tr>
<tr class="separator:a009b19ac8cca40f2e4daa2e5989fa4f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1313837c0e9ec67fd9fbd17987e2d615" id="r_a1313837c0e9ec67fd9fbd17987e2d615"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1313837c0e9ec67fd9fbd17987e2d615">display</a> ()</td></tr>
<tr class="separator:a1313837c0e9ec67fd9fbd17987e2d615"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad3423f7518671351340932db3c24959a" id="r_ad3423f7518671351340932db3c24959a"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad3423f7518671351340932db3c24959a">search</a> (int find_elem)</td></tr>
<tr class="separator:ad3423f7518671351340932db3c24959a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae8424a4fce3d483f7c85d6f6a5c79a1a" id="r_ae8424a4fce3d483f7c85d6f6a5c79a1a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a> ()</td></tr>
<tr class="separator:ae8424a4fce3d483f7c85d6f6a5c79a1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad585670a392c7e842c992d088093dff5" id="r_ad585670a392c7e842c992d088093dff5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad585670a392c7e842c992d088093dff5">push_back</a> (int new_elem)</td></tr>
<tr class="separator:ad585670a392c7e842c992d088093dff5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9c73f393e984f93f33852334d1a04be0" id="r_a9c73f393e984f93f33852334d1a04be0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9c73f393e984f93f33852334d1a04be0">push_front</a> (int new_elem)</td></tr>
<tr class="separator:a9c73f393e984f93f33852334d1a04be0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1fb1792ab867dc26639eef368a56989e" id="r_a1fb1792ab867dc26639eef368a56989e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1fb1792ab867dc26639eef368a56989e">erase</a> (int old_elem)</td></tr>
<tr class="separator:a1fb1792ab867dc26639eef368a56989e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abf7c97616b873ffeebdd0eac2d19d13e" id="r_abf7c97616b873ffeebdd0eac2d19d13e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf7c97616b873ffeebdd0eac2d19d13e">display</a> ()</td></tr>
<tr class="separator:abf7c97616b873ffeebdd0eac2d19d13e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a098be172c737f236763afdb8cada4835" id="r_a098be172c737f236763afdb8cada4835"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a098be172c737f236763afdb8cada4835">search</a> (int find_elem)</td></tr>
<tr class="separator:a098be172c737f236763afdb8cada4835"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af0981944884c6dc19361ff67451261c9" id="r_af0981944884c6dc19361ff67451261c9"><td class="memItemLeft" align="right" valign="top"><a id="af0981944884c6dc19361ff67451261c9" name="af0981944884c6dc19361ff67451261c9"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>reverse</b> ()</td></tr>
<tr class="separator:af0981944884c6dc19361ff67451261c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a73c52b2243a6c9501af65756123e7149" id="r_a73c52b2243a6c9501af65756123e7149"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a73c52b2243a6c9501af65756123e7149">isEmpty</a> () const</td></tr>
<tr class="memdesc:a73c52b2243a6c9501af65756123e7149"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that checks if the list is empty. <br /></td></tr>
<tr class="separator:a73c52b2243a6c9501af65756123e7149"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa69707af46eb6d410eb3a54ee58e1ed1" id="r_aa69707af46eb6d410eb3a54ee58e1ed1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a> (int32_t new_elem)</td></tr>
<tr class="memdesc:aa69707af46eb6d410eb3a54ee58e1ed1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that adds a new element at the end of the list. <br /></td></tr>
<tr class="separator:aa69707af46eb6d410eb3a54ee58e1ed1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac466ec086c0835822467bd3d8f3ab90e" id="r_ac466ec086c0835822467bd3d8f3ab90e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac466ec086c0835822467bd3d8f3ab90e">reverseList</a> ()</td></tr>
<tr class="memdesc:ac466ec086c0835822467bd3d8f3ab90e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for reversing a list. <br /></td></tr>
<tr class="separator:ac466ec086c0835822467bd3d8f3ab90e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d50919d34481a2b96cb74627d227c0e" id="r_a6d50919d34481a2b96cb74627d227c0e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d50919d34481a2b96cb74627d227c0e">isEmpty</a> () const</td></tr>
<tr class="memdesc:a6d50919d34481a2b96cb74627d227c0e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that checks if the list is empty. <br /></td></tr>
<tr class="separator:a6d50919d34481a2b96cb74627d227c0e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4649fc2c5d09dc58608cd9299db9946f" id="r_a4649fc2c5d09dc58608cd9299db9946f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4649fc2c5d09dc58608cd9299db9946f">insert</a> (int32_t new_elem)</td></tr>
<tr class="memdesc:a4649fc2c5d09dc58608cd9299db9946f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that adds a new element at the end of the list. <br /></td></tr>
<tr class="separator:a4649fc2c5d09dc58608cd9299db9946f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8b20ca89a0346c8d4193936481528c70" id="r_a8b20ca89a0346c8d4193936481528c70"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b20ca89a0346c8d4193936481528c70">reverseList</a> ()</td></tr>
<tr class="memdesc:a8b20ca89a0346c8d4193936481528c70"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for reversing a list. <br /></td></tr>
<tr class="separator:a8b20ca89a0346c8d4193936481528c70"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a99577e8decb849ac517b7448565300dd" id="r_a99577e8decb849ac517b7448565300dd"><td class="memItemLeft" align="right" valign="top"><a id="a99577e8decb849ac517b7448565300dd" name="a99577e8decb849ac517b7448565300dd"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>display</b> () const</td></tr>
<tr class="separator:a99577e8decb849ac517b7448565300dd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9785d1478e59f5a90288b2928a7094d6" id="r_a9785d1478e59f5a90288b2928a7094d6"><td class="memItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9785d1478e59f5a90288b2928a7094d6">top</a> () const</td></tr>
<tr class="memdesc:a9785d1478e59f5a90288b2928a7094d6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to find the top element of the list. <br /></td></tr>
<tr class="separator:a9785d1478e59f5a90288b2928a7094d6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a89ad00dbd262e2527129813b53e16f81" id="r_a89ad00dbd262e2527129813b53e16f81"><td class="memItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a89ad00dbd262e2527129813b53e16f81">top</a> () const</td></tr>
<tr class="memdesc:a89ad00dbd262e2527129813b53e16f81"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to find the top element of the list. <br /></td></tr>
<tr class="separator:a89ad00dbd262e2527129813b53e16f81"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa0f19dbcc0391b1e5698b8b1c5a4ad3d" id="r_aa0f19dbcc0391b1e5698b8b1c5a4ad3d"><td class="memItemLeft" align="right" valign="top"><a id="aa0f19dbcc0391b1e5698b8b1c5a4ad3d" name="aa0f19dbcc0391b1e5698b8b1c5a4ad3d"></a>
int32_t&#160;</td><td class="memItemRight" valign="bottom"><b>last</b> () const</td></tr>
<tr class="separator:aa0f19dbcc0391b1e5698b8b1c5a4ad3d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2b951a3f1123b9b2f4891ec96aa76d69" id="r_a2b951a3f1123b9b2f4891ec96aa76d69"><td class="memItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a> (int32_t index) const</td></tr>
<tr class="memdesc:a2b951a3f1123b9b2f4891ec96aa76d69"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to find the i th element of the list. <br /></td></tr>
<tr class="separator:a2b951a3f1123b9b2f4891ec96aa76d69"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a326ac4f721f7b74d5ed4f418a67b8d38" id="r_a326ac4f721f7b74d5ed4f418a67b8d38"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a326ac4f721f7b74d5ed4f418a67b8d38">list</a> (const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;other)</td></tr>
<tr class="memdesc:a326ac4f721f7b74d5ed4f418a67b8d38"><td class="mdescLeft">&#160;</td><td class="mdescRight">copy constructor creating a deep copy of every node of the input <br /></td></tr>
<tr class="separator:a326ac4f721f7b74d5ed4f418a67b8d38"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adb04f732911fcfd30f7177b367c6af41" id="r_adb04f732911fcfd30f7177b367c6af41"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adb04f732911fcfd30f7177b367c6af41">operator=</a> (const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;other)</td></tr>
<tr class="memdesc:adb04f732911fcfd30f7177b367c6af41"><td class="mdescLeft">&#160;</td><td class="mdescRight">assignment operator creating a deep copy of every node of the input <br /></td></tr>
<tr class="separator:adb04f732911fcfd30f7177b367c6af41"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaca3be50a2a81bf3308d202a6dcee91a" id="r_aaca3be50a2a81bf3308d202a6dcee91a"><td class="memItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaca3be50a2a81bf3308d202a6dcee91a">traverse</a> (int32_t index) const</td></tr>
<tr class="memdesc:aaca3be50a2a81bf3308d202a6dcee91a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to find the i th element of the list. <br /></td></tr>
<tr class="separator:aaca3be50a2a81bf3308d202a6dcee91a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac681c278055081ac11decb6060b300de" id="r_ac681c278055081ac11decb6060b300de"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac681c278055081ac11decb6060b300de">list</a> (const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;other)</td></tr>
<tr class="memdesc:ac681c278055081ac11decb6060b300de"><td class="mdescLeft">&#160;</td><td class="mdescRight">copy constructor creating a deep copy of every node of the input <br /></td></tr>
<tr class="separator:ac681c278055081ac11decb6060b300de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab164909ee7eadc4ab186d850e716abdf" id="r_ab164909ee7eadc4ab186d850e716abdf"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab164909ee7eadc4ab186d850e716abdf">operator=</a> (const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;other)</td></tr>
<tr class="memdesc:ab164909ee7eadc4ab186d850e716abdf"><td class="mdescLeft">&#160;</td><td class="mdescRight">assignment operator creating a deep copy of every node of the input <br /></td></tr>
<tr class="separator:ab164909ee7eadc4ab186d850e716abdf"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:ac614ed8f1953f5486fab1cd6d7aa0500" id="r_ac614ed8f1953f5486fab1cd6d7aa0500"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a> ()</td></tr>
<tr class="memdesc:ac614ed8f1953f5486fab1cd6d7aa0500"><td class="mdescLeft">&#160;</td><td class="mdescRight">calls delete operator on every node in the represented list <br /></td></tr>
<tr class="separator:ac614ed8f1953f5486fab1cd6d7aa0500"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a540989875252b0d41d297d67efa032a8" id="r_a540989875252b0d41d297d67efa032a8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a540989875252b0d41d297d67efa032a8">delete_all_nodes</a> ()</td></tr>
<tr class="memdesc:a540989875252b0d41d297d67efa032a8"><td class="mdescLeft">&#160;</td><td class="mdescRight">calls delete operator on every node in the represented list <br /></td></tr>
<tr class="separator:a540989875252b0d41d297d67efa032a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af8f484c528371ae7e833910daab54572" id="r_af8f484c528371ae7e833910daab54572"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8f484c528371ae7e833910daab54572">copy_all_nodes_from_list</a> (const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;other)</td></tr>
<tr class="separator:af8f484c528371ae7e833910daab54572"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -195,16 +195,16 @@ Private Attributes</h2></td></tr>
<tr class="memitem:aa3801cea564a3b3bb7b03abfffdcf1e1" id="r_aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a></td></tr>
<tr class="memdesc:aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">link before the actual first element <br /></td></tr>
<tr class="separator:aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af39bcc08641ce0c813023f364a9a9015" id="r_af39bcc08641ce0c813023f364a9a9015"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af39bcc08641ce0c813023f364a9a9015">last</a></td></tr>
<tr class="memdesc:af39bcc08641ce0c813023f364a9a9015"><td class="mdescLeft">&#160;</td><td class="mdescRight">last link on the list <br /></td></tr>
<tr class="separator:af39bcc08641ce0c813023f364a9a9015"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab87eecc80068fc5a80e98e83536885f2" id="r_ab87eecc80068fc5a80e98e83536885f2"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab87eecc80068fc5a80e98e83536885f2">last</a></td></tr>
<tr class="memdesc:ab87eecc80068fc5a80e98e83536885f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">last link on the list <br /></td></tr>
<tr class="separator:ab87eecc80068fc5a80e98e83536885f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad7e7823ae52c4ebf3b85a1bec096be5d" id="r_ad7e7823ae52c4ebf3b85a1bec096be5d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7e7823ae52c4ebf3b85a1bec096be5d">head</a> = nullptr</td></tr>
<tr class="separator:ad7e7823ae52c4ebf3b85a1bec096be5d"><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>A list class containing a sequence of links </p>
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a50e209b55b83622254177050945e7826" name="a50e209b55b83622254177050945e7826"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a50e209b55b83622254177050945e7826">&#9670;&#160;</a></span>list() <span class="overload">[1/2]</span></h2>
@@ -224,7 +224,7 @@ Private Attributes</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -235,10 +235,10 @@ Private Attributes</h2></td></tr>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// Initialize the first link</span></div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> = std::make_shared&lt;link&gt;();</div>
<div class="line"><span class="lineno"> 92</span> <span class="comment">// Initialize the last link with the first link</span></div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa3801cea564a3b3bb7b03abfffdcf1e1"><div class="ttname"><a href="#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list::first</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; first</div><div class="ttdoc">link before the actual first element</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00083">linked_list.cpp:83</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00084">linked_list.cpp:84</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ab87eecc80068fc5a80e98e83536885f2"><div class="ttname"><a href="#ab87eecc80068fc5a80e98e83536885f2">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00084">linked_list.cpp:84</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -258,19 +258,19 @@ Private Attributes</h2></td></tr>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 196</span>{ <a class="code hl_function" href="#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>(); }</div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac614ed8f1953f5486fab1cd6d7aa0500"><div class="ttname"><a href="#ac614ed8f1953f5486fab1cd6d7aa0500">data_structures::linked_list::list::delete_all_nodes</a></div><div class="ttdeci">void delete_all_nodes()</div><div class="ttdoc">calls delete operator on every node in the represented list</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00188">reverse_a_linked_list.cpp:188</a></div></div>
<div class="fragment"><div class="line"><span class="lineno"> 196</span>{ <a class="code hl_function" href="#a540989875252b0d41d297d67efa032a8">delete_all_nodes</a>(); }</div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a540989875252b0d41d297d67efa032a8"><div class="ttname"><a href="#a540989875252b0d41d297d67efa032a8">data_structures::linked_list::list::delete_all_nodes</a></div><div class="ttdeci">void delete_all_nodes()</div><div class="ttdoc">calls delete operator on every node in the represented list</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00188">reverse_a_linked_list.cpp:188</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a326ac4f721f7b74d5ed4f418a67b8d38" name="a326ac4f721f7b74d5ed4f418a67b8d38"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a326ac4f721f7b74d5ed4f418a67b8d38">&#9670;&#160;</a></span>list() <span class="overload">[2/2]</span></h2>
<a id="ac681c278055081ac11decb6060b300de" name="ac681c278055081ac11decb6060b300de"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac681c278055081ac11decb6060b300de">&#9670;&#160;</a></span>list() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">data_structures::linked_list::list::list </td>
<td class="memname">list::list </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span></td><td>)</td>
<td></td>
@@ -304,23 +304,23 @@ Private Attributes</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00198">198</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 198</span> {</div>
<div class="line"><span class="lineno"> 199</span> assert(<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>());</div>
<div class="line"><span class="lineno"> 199</span> assert(<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>());</div>
<div class="line"><span class="lineno"> 200</span> head = <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">copy_all_nodes</a>(other.head);</div>
<div class="line"><span class="lineno"> 201</span>}</div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a454ab4918f579869dfed4bb420a3f897"><div class="ttname"><a href="#a454ab4918f579869dfed4bb420a3f897">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00111">linked_list.cpp:111</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ae8424a4fce3d483f7c85d6f6a5c79a1a"><div class="ttname"><a href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00111">linked_list.cpp:111</a></div></div>
<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00053">reverse_a_linked_list.cpp:53</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ac614ed8f1953f5486fab1cd6d7aa0500" name="ac614ed8f1953f5486fab1cd6d7aa0500"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac614ed8f1953f5486fab1cd6d7aa0500">&#9670;&#160;</a></span>delete_all_nodes()</h2>
<a id="a540989875252b0d41d297d67efa032a8" name="a540989875252b0d41d297d67efa032a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a540989875252b0d41d297d67efa032a8">&#9670;&#160;</a></span>delete_all_nodes()</h2>
<div class="memitem">
<div class="memproto">
@@ -329,7 +329,7 @@ Private Attributes</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::delete_all_nodes </td>
<td class="memname">void list::delete_all_nodes </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -337,7 +337,7 @@ Private Attributes</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -347,23 +347,22 @@ Private Attributes</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00188">188</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 188</span> {</div>
<div class="line"><span class="lineno"> 189</span> <span class="keywordflow">while</span> (head != <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 190</span> <span class="keyword">const</span> <span class="keyword">auto</span> tmp_node = head-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
<div class="line"><span class="lineno"> 190</span> <span class="keyword">const</span> <span class="keyword">auto</span> tmp_node = head-&gt;next;</div>
<div class="line"><span class="lineno"> 191</span> <span class="keyword">delete</span> head;</div>
<div class="line"><span class="lineno"> 192</span> head = tmp_node;</div>
<div class="line"><span class="lineno"> 193</span> }</div>
<div class="line"><span class="lineno"> 194</span>}</div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1_node_html_acfccd7b52c91d91300c5b317e5ec7a6e"><div class="ttname"><a href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00045">reverse_a_linked_list.cpp:45</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a1313837c0e9ec67fd9fbd17987e2d615" name="a1313837c0e9ec67fd9fbd17987e2d615"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1313837c0e9ec67fd9fbd17987e2d615">&#9670;&#160;</a></span>display()</h2>
<a id="abf7c97616b873ffeebdd0eac2d19d13e" name="abf7c97616b873ffeebdd0eac2d19d13e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abf7c97616b873ffeebdd0eac2d19d13e">&#9670;&#160;</a></span>display()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::display </td>
<td class="memname">void list::display </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -374,7 +373,7 @@ Private Attributes</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00181">181</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 181</span> {</div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 183</span> std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 185</span> }</div>
@@ -387,14 +386,14 @@ Private Attributes</h2></td></tr>
</div><!-- fragment -->
</div>
</div>
<a id="a009b19ac8cca40f2e4daa2e5989fa4f3" name="a009b19ac8cca40f2e4daa2e5989fa4f3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a009b19ac8cca40f2e4daa2e5989fa4f3">&#9670;&#160;</a></span>erase()</h2>
<a id="a1fb1792ab867dc26639eef368a56989e" name="a1fb1792ab867dc26639eef368a56989e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1fb1792ab867dc26639eef368a56989e">&#9670;&#160;</a></span>erase()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::erase </td>
<td class="memname">void list::erase </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>old_elem</em></span></td><td>)</td>
<td></td>
@@ -410,16 +409,16 @@ Private Attributes</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00152">152</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 152</span> {</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 154</span> std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
<div class="line"><span class="lineno"> 155</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 156</span> }</div>
<div class="line"><span class="lineno"> 157</span> std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
<div class="line"><span class="lineno"> 158</span> std::shared_ptr&lt;link&gt; to_be_removed = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != old_elem) {</div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != old_elem) {</div>
<div class="line"><span class="lineno"> 160</span> t = t-&gt;succ();</div>
<div class="line"><span class="lineno"> 161</span> }</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>) {</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a>) {</div>
<div class="line"><span class="lineno"> 163</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 165</span> }</div>
@@ -427,23 +426,23 @@ Private Attributes</h2></td></tr>
<div class="line"><span class="lineno"> 167</span> t-&gt;succ() = t-&gt;succ()-&gt;succ();</div>
<div class="line"><span class="lineno"> 168</span> to_be_removed.reset();</div>
<div class="line"><span class="lineno"> 169</span> <span class="keywordflow">if</span> (t-&gt;succ() == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 170</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = t;</div>
<div class="line"><span class="lineno"> 170</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = t;</div>
<div class="line"><span class="lineno"> 171</span> }</div>
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> == <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>){</div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> == <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a>){</div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 174</span> }</div>
<div class="line"><span class="lineno"> 175</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa69707af46eb6d410eb3a54ee58e1ed1" name="aa69707af46eb6d410eb3a54ee58e1ed1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa69707af46eb6d410eb3a54ee58e1ed1">&#9670;&#160;</a></span>insert()</h2>
<a id="a4649fc2c5d09dc58608cd9299db9946f" name="a4649fc2c5d09dc58608cd9299db9946f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4649fc2c5d09dc58608cd9299db9946f">&#9670;&#160;</a></span>insert()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::insert </td>
<td class="memname">void list::insert </td>
<td>(</td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
@@ -463,11 +462,11 @@ Private Attributes</h2></td></tr>
<div class="fragment"><div class="line"><span class="lineno"> 99</span> {</div>
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">try</span> {</div>
<div class="line"><span class="lineno"> 101</span> <span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-owning-memory)</span></div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* new_node = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 102</span> Node* new_node = <span class="keyword">new</span> Node();</div>
<div class="line"><span class="lineno"> 103</span> Node* temp = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 104</span> new_node-&gt;val = n;</div>
<div class="line"><span class="lineno"> 105</span> new_node-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 107</span> head = new_node;</div>
<div class="line"><span class="lineno"> 108</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 109</span> temp = head;</div>
@@ -480,18 +479,17 @@ Private Attributes</h2></td></tr>
<div class="line"><span class="lineno"> 116</span> std::cerr &lt;&lt; <span class="stringliteral">&quot;bad_alloc detected: &quot;</span> &lt;&lt; exception.what() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="line"><span class="lineno"> 118</span>}</div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a454ab4918f579869dfed4bb420a3f897" name="a454ab4918f579869dfed4bb420a3f897"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a454ab4918f579869dfed4bb420a3f897">&#9670;&#160;</a></span>isEmpty() <span class="overload">[1/2]</span></h2>
<a id="ae8424a4fce3d483f7c85d6f6a5c79a1a" name="ae8424a4fce3d483f7c85d6f6a5c79a1a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">&#9670;&#160;</a></span>isEmpty() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool data_structures::linked_list::list::isEmpty </td>
<td class="memname">bool list::isEmpty </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -504,7 +502,7 @@ false if list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 111</span> {</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 114</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -513,14 +511,14 @@ false if list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="a73c52b2243a6c9501af65756123e7149" name="a73c52b2243a6c9501af65756123e7149"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a73c52b2243a6c9501af65756123e7149">&#9670;&#160;</a></span>isEmpty() <span class="overload">[2/2]</span></h2>
<a id="a6d50919d34481a2b96cb74627d227c0e" name="a6d50919d34481a2b96cb74627d227c0e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6d50919d34481a2b96cb74627d227c0e">&#9670;&#160;</a></span>isEmpty() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool data_structures::linked_list::list::isEmpty </td>
<td class="memname">bool list::isEmpty </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
@@ -538,14 +536,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="adb04f732911fcfd30f7177b367c6af41" name="adb04f732911fcfd30f7177b367c6af41"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adb04f732911fcfd30f7177b367c6af41">&#9670;&#160;</a></span>operator=()</h2>
<a id="ab164909ee7eadc4ab186d850e716abdf" name="ab164909ee7eadc4ab186d850e716abdf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab164909ee7eadc4ab186d850e716abdf">&#9670;&#160;</a></span>operator=()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp; data_structures::linked_list::list::operator= </td>
<td class="memname"><a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp; list::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> &amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span></td><td>)</td>
<td></td>
@@ -560,7 +558,7 @@ false if the list is not empty </dd></dl>
<div class="line"><span class="lineno"> 212</span> <span class="keywordflow">if</span> (<span class="keyword">this</span> == &amp;other) {</div>
<div class="line"><span class="lineno"> 213</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><span class="lineno"> 214</span> }</div>
<div class="line"><span class="lineno"> 215</span> <a class="code hl_function" href="#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>();</div>
<div class="line"><span class="lineno"> 215</span> <a class="code hl_function" href="#a540989875252b0d41d297d67efa032a8">delete_all_nodes</a>();</div>
<div class="line"><span class="lineno"> 216</span> </div>
<div class="line"><span class="lineno"> 217</span> copy_all_nodes_from_list(other);</div>
<div class="line"><span class="lineno"> 218</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -568,14 +566,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="a6e9859d1a0755fb51e41904d20c95496" name="a6e9859d1a0755fb51e41904d20c95496"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6e9859d1a0755fb51e41904d20c95496">&#9670;&#160;</a></span>push_back()</h2>
<a id="ad585670a392c7e842c992d088093dff5" name="ad585670a392c7e842c992d088093dff5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad585670a392c7e842c992d088093dff5">&#9670;&#160;</a></span>push_back()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::push_back </td>
<td class="memname">void list::push_back </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>new_elem</em></span></td><td>)</td>
<td></td>
@@ -591,25 +589,25 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 123</span> {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 127</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 130</span> }</div>
<div class="line"><span class="lineno"> 131</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a332b965afd9d6bea8d3246673acd52c7" name="a332b965afd9d6bea8d3246673acd52c7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a332b965afd9d6bea8d3246673acd52c7">&#9670;&#160;</a></span>push_front()</h2>
<a id="a9c73f393e984f93f33852334d1a04be0" name="a9c73f393e984f93f33852334d1a04be0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9c73f393e984f93f33852334d1a04be0">&#9670;&#160;</a></span>push_front()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::push_front </td>
<td class="memname">void list::push_front </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>new_elem</em></span></td><td>)</td>
<td></td>
@@ -625,9 +623,9 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 137</span> {</div>
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
<div class="line"><span class="lineno"> 140</span> <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 140</span> <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
<div class="line"><span class="lineno"> 141</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 142</span> std::shared_ptr&lt;link&gt; t = std::make_shared&lt;link&gt;(new_elem);</div>
<div class="line"><span class="lineno"> 143</span> t-&gt;succ() = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
@@ -637,14 +635,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="ac466ec086c0835822467bd3d8f3ab90e" name="ac466ec086c0835822467bd3d8f3ab90e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac466ec086c0835822467bd3d8f3ab90e">&#9670;&#160;</a></span>reverseList()</h2>
<a id="a8b20ca89a0346c8d4193936481528c70" name="a8b20ca89a0346c8d4193936481528c70"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8b20ca89a0346c8d4193936481528c70">&#9670;&#160;</a></span>reverseList()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::linked_list::list::reverseList </td>
<td class="memname">void list::reverseList </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -657,9 +655,9 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 125</span> {</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* curr = head;</div>
<div class="line"><span class="lineno"> 127</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* prev = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* next_node = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 126</span> Node* curr = head;</div>
<div class="line"><span class="lineno"> 127</span> Node* prev = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 128</span> Node* next_node = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">while</span> (curr != <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 130</span> next_node = curr-&gt;next;</div>
<div class="line"><span class="lineno"> 131</span> curr-&gt;next = prev;</div>
@@ -671,14 +669,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="ad3423f7518671351340932db3c24959a" name="ad3423f7518671351340932db3c24959a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad3423f7518671351340932db3c24959a">&#9670;&#160;</a></span>search()</h2>
<a id="a098be172c737f236763afdb8cada4835" name="a098be172c737f236763afdb8cada4835"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a098be172c737f236763afdb8cada4835">&#9670;&#160;</a></span>search()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; data_structures::linked_list::list::search </td>
<td class="memname">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; list::search </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>find_elem</em></span></td><td>)</td>
<td></td>
@@ -695,15 +693,15 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 197</span> {</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 199</span> std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
<div class="line"><span class="lineno"> 200</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 201</span> }</div>
<div class="line"><span class="lineno"> 202</span> std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != find_elem) {</div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != find_elem) {</div>
<div class="line"><span class="lineno"> 204</span> t = t-&gt;succ();</div>
<div class="line"><span class="lineno"> 205</span> }</div>
<div class="line"><span class="lineno"> 206</span> <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>) {</div>
<div class="line"><span class="lineno"> 206</span> <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#ab87eecc80068fc5a80e98e83536885f2">last</a>) {</div>
<div class="line"><span class="lineno"> 207</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 208</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 209</span> }</div>
@@ -713,14 +711,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="a9785d1478e59f5a90288b2928a7094d6" name="a9785d1478e59f5a90288b2928a7094d6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9785d1478e59f5a90288b2928a7094d6">&#9670;&#160;</a></span>top()</h2>
<a id="a89ad00dbd262e2527129813b53e16f81" name="a89ad00dbd262e2527129813b53e16f81"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a89ad00dbd262e2527129813b53e16f81">&#9670;&#160;</a></span>top()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int32_t data_structures::linked_list::list::top </td>
<td class="memname">int32_t list::top </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
@@ -733,7 +731,7 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 142</span> {</div>
<div class="line"><span class="lineno"> 143</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 143</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> head-&gt;val;</div>
<div class="line"><span class="lineno"> 145</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
@@ -742,14 +740,14 @@ false if the list is not empty </dd></dl>
</div><!-- fragment -->
</div>
</div>
<a id="a2b951a3f1123b9b2f4891ec96aa76d69" name="a2b951a3f1123b9b2f4891ec96aa76d69"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2b951a3f1123b9b2f4891ec96aa76d69">&#9670;&#160;</a></span>traverse()</h2>
<a id="aaca3be50a2a81bf3308d202a6dcee91a" name="aaca3be50a2a81bf3308d202a6dcee91a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aaca3be50a2a81bf3308d202a6dcee91a">&#9670;&#160;</a></span>traverse()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int32_t data_structures::linked_list::list::traverse </td>
<td class="memname">int32_t list::traverse </td>
<td>(</td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
<td> const</td>
@@ -762,7 +760,7 @@ false if the list is not empty </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00168">168</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 168</span> {</div>
<div class="line"><span class="lineno"> 169</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* current = head;</div>
<div class="line"><span class="lineno"> 169</span> Node* current = head;</div>
<div class="line"><span class="lineno"> 170</span> </div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>) {</div>
@@ -796,7 +794,7 @@ false if the list is not empty </dd></dl>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -822,7 +820,7 @@ false if the list is not empty </dd></dl>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -831,8 +829,8 @@ false if the list is not empty </dd></dl>
</div>
</div>
<a id="af39bcc08641ce0c813023f364a9a9015" name="af39bcc08641ce0c813023f364a9a9015"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af39bcc08641ce0c813023f364a9a9015">&#9670;&#160;</a></span>last</h2>
<a id="ab87eecc80068fc5a80e98e83536885f2" name="ab87eecc80068fc5a80e98e83536885f2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab87eecc80068fc5a80e98e83536885f2">&#9670;&#160;</a></span>last</h2>
<div class="memitem">
<div class="memproto">
@@ -841,12 +839,12 @@ false if the list is not empty </dd></dl>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int32_t data_structures::linked_list::list::last</td>
<td class="memname">int32_t list::last</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -869,7 +867,7 @@ false if the list is not empty </dd></dl>
<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>linked_list</b></li><li class="navelem"><a class="el" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</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>

30
d1/def/classdata__structures_1_1linked__list_1_1list.js
View File

@@ -1,20 +1,20 @@
var classdata__structures_1_1linked__list_1_1list =
[
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826", null ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38", null ],
[ "delete_all_nodes", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500", null ],
[ "display", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615", null ],
[ "erase", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3", null ],
[ "insert", "d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1", null ],
[ "isEmpty", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897", null ],
[ "isEmpty", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149", null ],
[ "operator=", "d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41", null ],
[ "push_back", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496", null ],
[ "push_front", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7", null ],
[ "reverseList", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e", null ],
[ "search", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a", null ],
[ "top", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6", null ],
[ "traverse", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69", null ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ac681c278055081ac11decb6060b300de", null ],
[ "delete_all_nodes", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a540989875252b0d41d297d67efa032a8", null ],
[ "display", "d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e", null ],
[ "erase", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e", null ],
[ "insert", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f", null ],
[ "isEmpty", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a", null ],
[ "isEmpty", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a6d50919d34481a2b96cb74627d227c0e", null ],
[ "operator=", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ab164909ee7eadc4ab186d850e716abdf", null ],
[ "push_back", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5", null ],
[ "push_front", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0", null ],
[ "reverseList", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70", null ],
[ "search", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835", null ],
[ "top", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a89ad00dbd262e2527129813b53e16f81", null ],
[ "traverse", "d1/def/classdata__structures_1_1linked__list_1_1list.html#aaca3be50a2a81bf3308d202a6dcee91a", null ],
[ "first", "d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1", null ],
[ "last", "d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015", null ]
[ "last", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2", null ]
];