mirrors
/
TheAlgorithms-C
mirror of https://github.com/TheAlgorithms/C
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Documentation for f0b38a3201

This commit is contained in:
github-actions 2023-03-03 15:16:25 +00:00
parent 4f41d8e7a8
commit 08cdc60069
88 changed files with 1792 additions and 379 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
d0/d10/struct_queue_rep.html
View File

@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d0/d10/struct_queue_rep.html','../../'
<div class="dynheader">
Collaboration diagram for QueueRep:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5c/struct_queue_rep__coll__graph.svg" width="160" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5c/struct_queue_rep__coll__graph.svg" width="160" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">

2
d0/d1f/structnode__coll__graph.map
View File

@ -1,3 +1,3 @@
<map id="node" name="node">
<area shape="rect" id="node1" title="Node, the basic data structure in the tree." alt="" coords="5,51,56,77"/>
<area shape="rect" id="node1" title="Node, the basic data structure in the tree." alt="" coords="5,59,56,84"/>
</map>

2
d0/d1f/structnode__coll__graph.md5
View File

@ -1 +1 @@
20774095a65474c8514fd0a7c63db278
a681df221ef15bdb9392543a87f5faa6

27
d0/d1f/structnode__coll__graph.svg
View File

@ -4,30 +4,31 @@
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: node Pages: 1 -->
<svg width="107pt" height="96pt"
viewBox="0.00 0.00 107.00 96.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 92)">
<svg width="107pt" height="107pt"
viewBox="0.00 0.00 107.00 107.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 103)">
<title>node</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Node, the basic data structure in the tree.">
<polygon fill="#999999" stroke="#666666" points="38,-53.5 0,-53.5 0,-34.5 38,-34.5 38,-53.5"/>
<text text-anchor="middle" x="19" y="-41.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
<polygon fill="#999999" stroke="#666666" points="38,-59 0,-59 0,-40 38,-40 38,-59"/>
<text text-anchor="middle" x="19" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M49.77,-47.08C53.53,-46.53 56,-45.5 56,-44 56,-41.25 47.76,-40.1 38.42,-40.52"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.8,-43.58 39.93,-47.42 50.04,-50.57 49.8,-43.58"/>
<text text-anchor="middle" x="77.5" y="-80" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="77.5" y="-69" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="77.5" y="-58" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="77.5" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="77.5" y="-36" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="77.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M49.77,-52.58C53.53,-52.03 56,-51 56,-49.5 56,-46.75 47.76,-45.6 38.42,-46.02"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.8,-49.08 39.93,-52.92 50.04,-56.07 49.8,-49.08"/>
<text text-anchor="middle" x="77.5" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="77.5" y="-80" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="77.5" y="-69" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="77.5" y="-58" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="77.5" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="77.5" y="-36" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<text text-anchor="middle" x="77.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">prev</text>
<text text-anchor="middle" x="77.5" y="-14" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
<text text-anchor="middle" x="77.5" y="-3" font-family="Helvetica,sans-Serif" font-size="10.00">rightNode</text>
</g>

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.0 KiB

After

Width:  |  Height:  |  Size: 2.1 KiB

2
d0/dcb/poly__add_8c.html
View File

@ -474,7 +474,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 173</span> }</div>
<div class="line"><span class="lineno"> 174</span> }</div>
<div class="line"><span class="lineno"> 175</span>}</div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
</div><!-- fragment -->
</div>
</div>

2
d1/dbe/include_8h_source.html
View File

@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('d1/dbe/include_8h_source.html','../../
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">isEmpty</a>();</div>
<div class="ttc" id="ainfix__to__postfix2_8c_html_a653c98c68c558505b75b04c44b7c838e"><div class="ttname"><a href="../../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">isEmpty</a></div><div class="ttdeci">uint16_t isEmpty()</div><div class="ttdoc">Function to check whether the stack is empty or not.</div><div class="ttdef"><b>Definition:</b> infix_to_postfix2.c:61</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><div class="ttname"><a href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->

2
d2/d36/structqueue.html
View File

@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d2/d36/structqueue.html','../../'); in
<div class="dynheader">
Collaboration diagram for queue:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d75/structqueue__coll__graph.svg" width="147" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d75/structqueue__coll__graph.svg" width="147" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">

2
d2/d87/non__preemptive__priority__scheduling_8c.html
View File

@ -277,7 +277,7 @@ Functions</h2></td></tr>
<div class="ttc" id="anon__preemptive__priority__scheduling_8c_html_a40e454ce0750e794007bf41a7102b3a9"><div class="ttname"><a href="../../d2/d87/non__preemptive__priority__scheduling_8c.html#a40e454ce0750e794007bf41a7102b3a9">l_length</a></div><div class="ttdeci">int l_length(node **root)</div><div class="ttdoc">To length process queue.</div><div class="ttdef"><b>Definition:</b> non_preemptive_priority_scheduling.c:129</div></div>
<div class="ttc" id="anon__preemptive__priority__scheduling_8c_html_a5d0943b2e0e1b48b9c3a575a7f262c36"><div class="ttname"><a href="../../d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36">insert</a></div><div class="ttdeci">void insert(node **root, int id, int at, int bt, int prior)</div><div class="ttdoc">To insert a new process in the queue.</div><div class="ttdef"><b>Definition:</b> non_preemptive_priority_scheduling.c:48</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a44e51013eb31fc1f17866ca9fe8ac75b"><div class="ttname"><a href="../../d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b">node::priority</a></div><div class="ttdeci">int priority</div><div class="ttdoc">Priority of the process node.</div><div class="ttdef"><b>Definition:</b> non_preemptive_priority_scheduling.c:32</div></div>
<div class="ttc" id="astructnode_html_a5507c3c76ddbda9c482749f3a8a8f0cc"><div class="ttname"><a href="../../d5/da1/structnode.html#a5507c3c76ddbda9c482749f3a8a8f0cc">node::AT</a></div><div class="ttdeci">int AT</div><div class="ttdoc">Arrival Time of the process node.</div><div class="ttdef"><b>Definition:</b> non_preemptive_priority_scheduling.c:30</div></div>
<div class="ttc" id="astructnode_html_ac0a6453f996d4c362c015fd4348ecc6e"><div class="ttname"><a href="../../d5/da1/structnode.html#ac0a6453f996d4c362c015fd4348ecc6e">node::BT</a></div><div class="ttdeci">int BT</div><div class="ttdoc">Burst Time of the process node.</div><div class="ttdef"><b>Definition:</b> non_preemptive_priority_scheduling.c:31</div></div>

2
d2/ddd/malloc__dbg_8h.html
View File

@ -321,7 +321,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="astruct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n_html_a1cec46413acf776e3ee2b0b9241490c3"><div class="ttname"><a href="../../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1cec46413acf776e3ee2b0b9241490c3">MEMORY_INFORMATION::previous</a></div><div class="ttdeci">struct MEMORY_INFORMATION * previous</div><div class="ttdoc">Previous element in the list.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.c:28</div></div>
<div class="ttc" id="astruct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n_html_a6b0971c1415de6e0123b8d0d0a626fde"><div class="ttname"><a href="../../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a6b0971c1415de6e0123b8d0d0a626fde">MEMORY_INFORMATION::ptr</a></div><div class="ttdeci">void * ptr</div><div class="ttdoc">Pointer returned by malloc / calloc.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.c:22</div></div>
<div class="ttc" id="astruct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n_html_aa296b903d0e2ac54acaa7c305bae8007"><div class="ttname"><a href="../../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#aa296b903d0e2ac54acaa7c305bae8007">MEMORY_INFORMATION::next</a></div><div class="ttdeci">struct MEMORY_INFORMATION * next</div><div class="ttdoc">Next element in the list.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.c:27</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
</div><!-- fragment -->
</div>
</div>

2
d4/dd4/struct_graph.html
View File

@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d4/dd4/struct_graph.html','../../'); i
<div class="dynheader">
Collaboration diagram for Graph:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d6d/struct_graph__coll__graph.svg" width="220" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d6d/struct_graph__coll__graph.svg" width="220" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@ -207,6 +207,7 @@ Data Structures</h1>
</li>
<li>Linked List<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/ascending_priority_queue.c" target="_blank">Ascending Priority Queue</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/circular_doubly_linked_list.c" target="_blank">Circular Doubly Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/circular_linked_list.c" target="_blank">Circular Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/doubly_linked_list.c" target="_blank">Doubly Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/merge_linked_lists.c" target="_blank">Merge Linked Lists</a></li>

38
d5/da1/structnode.html
View File

@ -110,7 +110,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini
<div class="dynheader">
Collaboration diagram for node:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d1f/structnode__coll__graph.svg" width="143" height="128"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d1f/structnode__coll__graph.svg" width="143" height="143"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
@ -146,10 +146,16 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>color</b></td></tr>
<tr class="memitem:ab4b1f345158daee0725acecd5ba817b1"><td class="memItemLeft" align="right" valign="top"><a id="ab4b1f345158daee0725acecd5ba817b1" name="ab4b1f345158daee0725acecd5ba817b1"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>vertex</b></td></tr>
<tr class="separator:ab4b1f345158daee0725acecd5ba817b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a111a569ab2765add9b91c9f94cf9f063"><td class="memItemLeft" align="right" valign="top"><a id="a111a569ab2765add9b91c9f94cf9f063" name="a111a569ab2765add9b91c9f94cf9f063"></a>
struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
<tr class="memdesc:a111a569ab2765add9b91c9f94cf9f063"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the node <br /></td></tr>
<tr class="memitem:a111a569ab2765add9b91c9f94cf9f063"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a></td></tr>
<tr class="memdesc:a111a569ab2765add9b91c9f94cf9f063"><td class="mdescLeft">&#160;</td><td class="mdescRight">List pointers. <br /></td></tr>
<tr class="separator:a111a569ab2765add9b91c9f94cf9f063"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7ee3d227c728ce18a86e43ebc301046e"><td class="memItemLeft" align="right" valign="top"><a id="a7ee3d227c728ce18a86e43ebc301046e" name="a7ee3d227c728ce18a86e43ebc301046e"></a>
struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>prev</b></td></tr>
<tr class="separator:a7ee3d227c728ce18a86e43ebc301046e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4df5127dc26bf42ff5d965d77823efb5"><td class="memItemLeft" align="right" valign="top"><a id="a4df5127dc26bf42ff5d965d77823efb5" name="a4df5127dc26bf42ff5d965d77823efb5"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>value</b></td></tr>
<tr class="memdesc:a4df5127dc26bf42ff5d965d77823efb5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Data stored on each node. <br /></td></tr>
<tr class="separator:a4df5127dc26bf42ff5d965d77823efb5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac8973feda870a119ccdc25910254db0c"><td class="memItemLeft" align="right" valign="top"><a id="ac8973feda870a119ccdc25910254db0c" name="ac8973feda870a119ccdc25910254db0c"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>info</b></td></tr>
<tr class="separator:ac8973feda870a119ccdc25910254db0c"><td class="memSeparator" colspan="2">&#160;</td></tr>
@ -196,11 +202,32 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>TAT</b></td></tr>
<p>for assert</p>
<p>Kyler Smith, 2017 <a class="el" href="../../dd/d10/struct_stack.html" title="for printf() and scanf()">Stack</a> data structure implementation.</p>
<p>INCLUDES.</p>
<p>to verify assumptions made by the program and print a diagnostic message if this assumption is false.</p>
<p>to provide a set of integer types with universally consistent definitions that are operating system-independent for IO operations for including functions involving memory allocation such as <code>malloc</code></p>
<p>Circular Doubly linked list struct</p>
<p>Defining the structure of the node which contains 'data' (type : integer), two pointers 'next' and 'pre' (type : struct node).</p>
<p>creating a stucture with 'data'(type:int), two pointers 'next','pre' (type: struct node) .</p>
<p>for boolean data type for IO operations (<code>printf</code>) for memory allocation eg: <code>malloc</code>, <code>realloc</code>, <code>free</code>, <code>exit</code></p>
<p>Structure to represent a process </p>
</div><hr/>The documentation for this struct was generated from the following files:<ul>
</div><h2 class="groupheader">Field Documentation</h2>
<a id="a111a569ab2765add9b91c9f94cf9f063" name="a111a569ab2765add9b91c9f94cf9f063"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a111a569ab2765add9b91c9f94cf9f063">&#9670;&#160;</a></span>next</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">struct <a class="el" href="../../d5/da1/structnode.html">node</a> * node::next</td>
</tr>
</table>
</div><div class="memdoc">
<p>List pointers. </p>
<p>pointer to the node </p>
</div>
</div>
<hr/>The documentation for this struct was generated from the following files:<ul>
<li>data_structures/binary_trees/<a class="el" href="../../da/d02/binary__search__tree_8c.html">binary_search_tree.c</a></li>
<li>data_structures/binary_trees/create_node.c</li>
<li>data_structures/binary_trees/red_black_tree.c</li>
@ -210,6 +237,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>TAT</b></td></tr>
<li>data_structures/graphs/strongly_connected_components.c</li>
<li>data_structures/graphs/topological_sort.c</li>
<li>data_structures/linked_list/ascending_priority_queue.c</li>
<li>data_structures/linked_list/<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html">circular_doubly_linked_list.c</a></li>
<li>data_structures/linked_list/circular_linked_list.c</li>
<li>data_structures/linked_list/merge_linked_lists.c</li>
<li>data_structures/linked_list/queue_linked_list.c</li>

1
d5/da1/structnode.js
View File

@ -10,5 +10,6 @@ var structnode =
[ "priority", "d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b", null ],
[ "right", "d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c", null ],
[ "TAT", "d5/da1/structnode.html#abbe30696293849bebed90520b8cf7ba3", null ],
[ "value", "d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5", null ],
[ "WT", "d5/da1/structnode.html#a878d22393f374f3861035e35b9edd653", null ]
];

6
d6/d6d/struct_graph__coll__graph.map
View File

@ -1,5 +1,5 @@
<map id="Graph" name="Graph">
<area shape="rect" id="node1" title=" " alt="" coords="36,200,93,225"/>
<area shape="rect" id="node2" href="$d5/db4/struct_edge.html" title=" " alt="" coords="5,51,57,77"/>
<area shape="rect" id="node3" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="82,51,133,77"/>
<area shape="rect" id="node1" title=" " alt="" coords="36,215,93,240"/>
<area shape="rect" id="node2" href="$d5/db4/struct_edge.html" title=" " alt="" coords="5,59,57,84"/>
<area shape="rect" id="node3" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="82,59,133,84"/>
</map>

2
d6/d6d/struct_graph__coll__graph.md5
View File

@ -1 +1 @@
9fb3e54334219303c0a65c98f6749943
542302089d0b6e9b1a146e95c15a11a9

41
d6/d6d/struct_graph__coll__graph.svg
View File

@ -4,9 +4,9 @@
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: Graph Pages: 1 -->
<svg width="165pt" height="173pt"
viewBox="0.00 0.00 164.50 173.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 169)">
<svg width="165pt" height="184pt"
viewBox="0.00 0.00 164.50 184.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 180)">
<title>Graph</title>
<!-- Node1 -->
<g id="node1" class="node">
@ -21,16 +21,16 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d5/db4/struct_edge.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="39,-130.5 0,-130.5 0,-111.5 39,-111.5 39,-130.5"/>
<text text-anchor="middle" x="19.5" y="-118.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
<polygon fill="white" stroke="#bfbfbf" points="39,-136 0,-136 0,-117 39,-117 39,-136"/>
<text text-anchor="middle" x="19.5" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M17.11,-100C15.83,-82.74 15.82,-57.45 23.5,-37 25.98,-30.41 30.74,-24.17 35.11,-19.41"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="13.63,-100.3 18.09,-109.9 20.59,-99.61 13.63,-100.3"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M16.96,-105.27C15.45,-86.86 15.18,-59.25 23.5,-37 25.97,-30.4 30.73,-24.17 35.1,-19.4"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="13.47,-105.52 18,-115.1 20.43,-104.79 13.47,-105.52"/>
<text text-anchor="middle" x="37" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00"> edge</text>
<text text-anchor="middle" x="37" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">edges</text>
</g>
@ -38,29 +38,30 @@
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/da1/structnode.html" target="_top" xlink:title="Node, the basic data structure in the tree.">
<polygon fill="white" stroke="#666666" points="95.5,-130.5 57.5,-130.5 57.5,-111.5 95.5,-111.5 95.5,-130.5"/>
<text text-anchor="middle" x="76.5" y="-118.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
<polygon fill="white" stroke="#666666" points="95.5,-136 57.5,-136 57.5,-117 95.5,-117 95.5,-136"/>
<text text-anchor="middle" x="76.5" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node1 -->
<g id="edge2" class="edge">
<title>Node3&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M70.67,-100.06C63.65,-76.03 52.16,-36.7 47.07,-19.28"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="67.29,-100.97 73.46,-109.59 74.01,-99.01 67.29,-100.97"/>
<text text-anchor="middle" x="77" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00"> adjLists</text>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M71.09,-106.06C64.05,-80.77 52.05,-37.65 46.93,-19.24"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="67.64,-106.7 73.69,-115.4 74.38,-104.83 67.64,-106.7"/>
<text text-anchor="middle" x="76" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00"> adjLists</text>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node3</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M97.54,-134.58C106.19,-135.46 113.5,-130.93 113.5,-121 113.5,-107.03 99.04,-103.75 86.73,-111.18"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="98.75,-131.3 88.16,-131.32 96.46,-137.91 98.75,-131.3"/>
<text text-anchor="middle" x="135" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="135" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="135" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="135" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="135" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="135" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M96.15,-140.9C105.39,-142.55 113.5,-137.75 113.5,-126.5 113.5,-111.01 98.14,-107.75 85.6,-116.7"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="97.56,-137.7 86.99,-136.9 94.76,-144.11 97.56,-137.7"/>
<text text-anchor="middle" x="135" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="135" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="135" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="135" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="135" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="135" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<text text-anchor="middle" x="135" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">prev</text>
<text text-anchor="middle" x="135" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
<text text-anchor="middle" x="135" y="-80" font-family="Helvetica,sans-Serif" font-size="10.00">rightNode</text>
</g>

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.8 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

264
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
View File

@ -138,268 +138,270 @@ LeetCode Algorithm</h2>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">17 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/letter-combinations-of-a-phone-number" target="_blank">Letter Combinations of a Phone Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/17.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">19 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-nth-node-from-end-of-list" target="_blank">Remove Nth Node From End of List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/19.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">20 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-parentheses" target="_blank">Valid Parentheses</a> </td><td class="markdownTableBodyNone"><a href="../.././src/20.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">21 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/merge-two-sorted-lists" target="_blank">Merge Two Sorted Lists</a> </td><td class="markdownTableBodyNone"><a href="../.././src/21.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">24 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/swap-nodes-in-pairs" target="_blank">Swap Nodes in Pairs</a> </td><td class="markdownTableBodyNone"><a href="../.././src/24.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">26 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array" target="_blank">Remove Duplicates from Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/26.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">27 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-element" target="_blank">Remove Element</a> </td><td class="markdownTableBodyNone"><a href="../.././src/27.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">28 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string" target="_blank">Find the Index of the First Occurrence in a String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/28.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">29 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/divide-two-integers" target="_blank">Divide Two Integers</a> </td><td class="markdownTableBodyNone"><a href="../.././src/29.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">32 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-valid-parentheses" target="_blank">Longest Valid Parentheses</a> </td><td class="markdownTableBodyNone"><a href="../.././src/32.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">35 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/search-insert-position" target="_blank">Search Insert Position</a> </td><td class="markdownTableBodyNone"><a href="../.././src/35.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">37 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sudoku-solver" target="_blank">Sudoku Solver</a> </td><td class="markdownTableBodyNone"><a href="../.././src/37.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">38 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/count-and-say" target="_blank">Count and Say</a> </td><td class="markdownTableBodyNone"><a href="../.././src/38.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">42 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/trapping-rain-water" target="_blank">Trapping Rain Water</a> </td><td class="markdownTableBodyNone"><a href="../.././src/42.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">45 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/jump-game-ii" target="_blank">Jump Game II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/45.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">50 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/powx-n" target="_blank">Pow(x, n)</a> </td><td class="markdownTableBodyNone"><a href="../.././src/50.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">53 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-subarray" target="_blank">Maximum Subarray</a> </td><td class="markdownTableBodyNone"><a href="../.././src/53.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">62 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-paths" target="_blank">Unique Paths</a> </td><td class="markdownTableBodyNone"><a href="../.././src/62.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">63 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-paths-ii" target="_blank">Unique Paths II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/63.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">66 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/plus-one" target="_blank">Plus One</a> </td><td class="markdownTableBodyNone"><a href="../.././src/66.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">75 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sort-colors" target="_blank">Sort Colors</a> </td><td class="markdownTableBodyNone"><a href="../.././src/75.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">79 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/word-search" target="_blank">Word Search</a> </td><td class="markdownTableBodyNone"><a href="../.././src/79.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">82 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii" target="_blank">Remove Duplicates from Sorted List II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/82.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">83 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list" target="_blank">Remove Duplicates from Sorted List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/83.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">94 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-tree-inorder-traversal" target="_blank">Binary Tree Inorder Traversal</a> </td><td class="markdownTableBodyNone"><a href="../.././src/94.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">98 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/validate-binary-search-tree" target="_blank">Validate Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/98.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">101 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/symmetric-tree" target="_blank">Symmetric Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/101.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">104 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-depth-of-binary-tree" target="_blank">Maximum Depth of Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/104.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">108 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree" target="_blank">Convert Sorted Array to Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/108.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">109 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree" target="_blank">Convert Sorted List to Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/109.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">110 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/balanced-binary-tree" target="_blank">Balanced Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/110.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">112 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/path-sum" target="_blank">Path Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/112.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">118 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/pascals-triangle" target="_blank">Pascal's Triangle</a> </td><td class="markdownTableBodyNone"><a href="../.././src/118.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">119 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/pascals-triangle-ii" target="_blank">Pascal's Triangle II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/119.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">121 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock" target="_blank">Best Time to Buy and Sell Stock</a> </td><td class="markdownTableBodyNone"><a href="../.././src/121.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">124 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-tree-maximum-path-sum" target="_blank">Binary Tree Maximum Path Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/124.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">125 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-palindrome" target="_blank">Valid Palindrome</a> </td><td class="markdownTableBodyNone"><a href="../.././src/125.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">136 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/single-number" target="_blank">Single Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/136.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">141 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/linked-list-cycle" target="_blank">Linked List Cycle</a> </td><td class="markdownTableBodyNone"><a href="../.././src/141.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">142 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/linked-list-cycle-ii" target="_blank">Linked List Cycle II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/142.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">153 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array" target="_blank">Find Minimum in Rotated Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/153.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">160 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/intersection-of-two-linked-lists" target="_blank">Intersection of Two Linked Lists</a> </td><td class="markdownTableBodyNone"><a href="../.././src/160.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">169 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/majority-element" target="_blank">Majority Element</a> </td><td class="markdownTableBodyNone"><a href="../.././src/169.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">173 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-search-tree-iterator" target="_blank">Binary Search Tree Iterator</a> </td><td class="markdownTableBodyNone"><a href="../.././src/173.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">189 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/rotate-array" target="_blank">Rotate Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/189.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">190 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-bits" target="_blank">Reverse Bits</a> </td><td class="markdownTableBodyNone"><a href="../.././src/190.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">191 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-1-bits" target="_blank">Number of 1 Bits</a> </td><td class="markdownTableBodyNone"><a href="../.././src/191.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">201 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/bitwise-and-of-numbers-range" target="_blank">Bitwise AND of Numbers Range</a> </td><td class="markdownTableBodyNone"><a href="../.././src/201.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">203 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-linked-list-elements" target="_blank">Remove Linked List Elements</a> </td><td class="markdownTableBodyNone"><a href="../.././src/203.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">206 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-linked-list" target="_blank">Reverse Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/206.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">215 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/kth-largest-element-in-an-array" target="_blank">Kth Largest Element in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/215.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">217 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/contains-duplicate" target="_blank">Contains Duplicate</a> </td><td class="markdownTableBodyNone"><a href="../.././src/217.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">223 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/rectangle-area" target="_blank">Rectangle Area</a> </td><td class="markdownTableBodyNone"><a href="../.././src/223.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">226 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/invert-binary-tree" target="_blank">Invert Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/226.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">230 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/kth-smallest-element-in-a-bst" target="_blank">Kth Smallest Element in a BST</a> </td><td class="markdownTableBodyNone"><a href="../.././src/230.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">231 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/power-of-two" target="_blank">Power of Two</a> </td><td class="markdownTableBodyNone"><a href="../.././src/231.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">234 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/palindrome-linked-list" target="_blank">Palindrome Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/234.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">236 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree" target="_blank">Lowest Common Ancestor of a Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/236.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">242 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-anagram" target="_blank">Valid Anagram</a> </td><td class="markdownTableBodyNone"><a href="../.././src/242.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">268 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/missing-number" target="_blank">Missing Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/268.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">274 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/h-index" target="_blank">H-Index</a> </td><td class="markdownTableBodyNone"><a href="../.././src/274.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">278 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/first-bad-version" target="_blank">First Bad Version</a> </td><td class="markdownTableBodyNone"><a href="../.././src/278.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">283 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/move-zeroes" target="_blank">Move Zeroes</a> </td><td class="markdownTableBodyNone"><a href="../.././src/283.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">287 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-duplicate-number" target="_blank">Find the Duplicate Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/287.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">344 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-string" target="_blank">Reverse String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/344.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">367 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-perfect-square" target="_blank">Valid Perfect Square</a> </td><td class="markdownTableBodyNone"><a href="../.././src/367.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">387 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/first-unique-character-in-a-string" target="_blank">First Unique Character in a String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/387.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">389 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-difference" target="_blank">Find the Difference</a> </td><td class="markdownTableBodyNone"><a href="../.././src/389.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">404 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sum-of-left-leaves" target="_blank">Sum of Left Leaves</a> </td><td class="markdownTableBodyNone"><a href="../.././src/404.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">442 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-all-duplicates-in-an-array" target="_blank">Find All Duplicates in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/442.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">461 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/hamming-distance" target="_blank">Hamming Distance</a> </td><td class="markdownTableBodyNone"><a href="../.././src/461.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">476 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-complement" target="_blank">Number Complement</a> </td><td class="markdownTableBodyNone"><a href="../.././src/476.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">485 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/max-consecutive-ones" target="_blank">Max Consecutive Ones</a> </td><td class="markdownTableBodyNone"><a href="../.././src/485.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">509 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/fibonacci-number" target="_blank">Fibonacci Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/509.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">520 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/detect-capital" target="_blank">Detect Capital</a> </td><td class="markdownTableBodyNone"><a href="../.././src/520.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">540 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/single-element-in-a-sorted-array" target="_blank">Single Element in a Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/540.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">561 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/array-partition" target="_blank">Array Partition</a> </td><td class="markdownTableBodyNone"><a href="../.././src/561.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">567 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/permutation-in-string" target="_blank">Permutation in String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/567.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">617 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/merge-two-binary-trees" target="_blank">Merge Two Binary Trees</a> </td><td class="markdownTableBodyNone"><a href="../.././src/617.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">647 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/palindromic-substrings" target="_blank">Palindromic Substrings</a> </td><td class="markdownTableBodyNone"><a href="../.././src/647.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">669 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/trim-a-binary-search-tree" target="_blank">Trim a Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/669.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">674 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-continuous-increasing-subsequence" target="_blank">Longest Continuous Increasing Subsequence</a> </td><td class="markdownTableBodyNone"><a href="../.././src/674.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">684 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/redundant-connection" target="_blank">Redundant Connection</a> </td><td class="markdownTableBodyNone"><a href="../.././src/684.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">700 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/search-in-a-binary-search-tree" target="_blank">Search in a Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/700.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">701 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/insert-into-a-binary-search-tree" target="_blank">Insert into a Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/701.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">704 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-search" target="_blank">Binary Search</a> </td><td class="markdownTableBodyNone"><a href="../.././src/704.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">709 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/to-lower-case" target="_blank">To Lower Case</a> </td><td class="markdownTableBodyNone"><a href="../.././src/709.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">771 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/jewels-and-stones" target="_blank">Jewels and Stones</a> </td><td class="markdownTableBodyNone"><a href="../.././src/771.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">807 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/max-increase-to-keep-city-skyline" target="_blank">Max Increase to Keep City Skyline</a> </td><td class="markdownTableBodyNone"><a href="../.././src/807.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">841 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/keys-and-rooms" target="_blank">Keys and Rooms</a> </td><td class="markdownTableBodyNone"><a href="../.././src/841.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">852 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/peak-index-in-a-mountain-array" target="_blank">Peak Index in a Mountain Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/852.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">876 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/middle-of-the-linked-list" target="_blank">Middle of the Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/876.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">901 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/online-stock-span" target="_blank">Online Stock Span</a> </td><td class="markdownTableBodyNone"><a href="../.././src/901.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">905 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sort-array-by-parity" target="_blank">Sort Array By Parity</a> </td><td class="markdownTableBodyNone"><a href="../.././src/905.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">917 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-only-letters" target="_blank">Reverse Only Letters</a> </td><td class="markdownTableBodyNone"><a href="../.././src/917.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">931 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-falling-path-sum" target="_blank">Minimum Falling Path Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/931.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">938 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/range-sum-of-bst" target="_blank">Range Sum of BST</a> </td><td class="markdownTableBodyNone"><a href="../.././src/938.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">953 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/verifying-an-alien-dictionary" target="_blank">Verifying an Alien Dictionary</a> </td><td class="markdownTableBodyNone"><a href="../.././src/953.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">965 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/univalued-binary-tree" target="_blank">Univalued Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/965.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">977 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/squares-of-a-sorted-array" target="_blank">Squares of a Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/977.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">979 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/distribute-coins-in-binary-tree" target="_blank">Distribute Coins in Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/979.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">985 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sum-of-even-numbers-after-queries" target="_blank">Sum of Even Numbers After Queries</a> </td><td class="markdownTableBodyNone"><a href="../.././src/985.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">997 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-town-judge" target="_blank">Find the Town Judge</a> </td><td class="markdownTableBodyNone"><a href="../.././src/997.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1008 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal" target="_blank">Construct Binary Search Tree from Preorder Traversal</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1008.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1009 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/complement-of-base-10-integer" target="_blank">Complement of Base 10 Integer</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1009.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1019 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/next-greater-node-in-linked-list" target="_blank">Next Greater Node In Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1019.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1026 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-difference-between-node-and-ancestor" target="_blank">Maximum Difference Between Node and Ancestor</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1026.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1089 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/duplicate-zeros" target="_blank">Duplicate Zeros</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1089.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1137 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/n-th-tribonacci-number" target="_blank">N-th Tribonacci Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1137.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1147 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-chunked-palindrome-decomposition" target="_blank">Longest Chunked Palindrome Decomposition</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1147.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1184 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/distance-between-bus-stops" target="_blank">Distance Between Bus Stops</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1184.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1189 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-number-of-balloons" target="_blank">Maximum Number of Balloons</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1189.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1207 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-number-of-occurrences" target="_blank">Unique Number of Occurrences</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1207.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1283 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold" target="_blank">Find the Smallest Divisor Given a Threshold</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1283.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1524 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum" target="_blank">Number of Sub-arrays With Odd Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1524.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1653 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-deletions-to-make-string-balanced" target="_blank">Minimum Deletions to Make String Balanced</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1653.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1657 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/determine-if-two-strings-are-close" target="_blank">Determine if Two Strings Are Close</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1657.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1695 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-erasure-value" target="_blank">Maximum Erasure Value</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1695.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1704 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/determine-if-string-halves-are-alike" target="_blank">Determine if String Halves Are Alike</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1704.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1752 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/check-if-array-is-sorted-and-rotated" target="_blank">Check if Array Is Sorted and Rotated</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1752.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1769 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box" target="_blank">Minimum Number of Operations to Move All Balls to Each Box</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1769.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1833 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-ice-cream-bars" target="_blank">Maximum Ice Cream Bars</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1833.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1838 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/frequency-of-the-most-frequent-element" target="_blank">Frequency of the Most Frequent Element</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1838.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2024 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximize-the-confusion-of-an-exam" target="_blank">Maximize the Confusion of an Exam</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2024.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2095 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list" target="_blank">Delete the Middle Node of a Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2095.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2125 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-laser-beams-in-a-bank" target="_blank">Number of Laser Beams in a Bank</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2125.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2130 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list" target="_blank">Maximum Twin Sum of a Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2130.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2222 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-select-buildings" target="_blank">Number of Ways to Select Buildings</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2222.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2256 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-average-difference" target="_blank">Minimum Average Difference</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2256.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2270 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-split-array" target="_blank">Number of Ways to Split Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2270.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2279 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks" target="_blank">Maximum Bags With Full Capacity of Rocks</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2279.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2304 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid" target="_blank">Minimum Path Cost in a Grid</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2482 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column" target="_blank">Difference Between Ones and Zeros in Row and Column</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2482.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<td class="markdownTableBodyNone">2304 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid" target="_blank">Minimum Path Cost in a Grid</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2482 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column" target="_blank">Difference Between Ones and Zeros in Row and Column</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2482.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2501 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-square-streak-in-an-array" target="_blank">Longest Square Streak in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2501.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
</table>
</div></div><!-- contents -->

7
d8/d7f/circular__doubly__linked__list_8c__incl.map Normal file
View File

@ -0,0 +1,7 @@
<map id="data_structures/linked_list/circular_doubly_linked_list.c" name="data_structures/linked_list/circular_doubly_linked_list.c">
<area shape="rect" id="node1" title=" " alt="" coords="110,5,261,60"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,108,75,133"/>
<area shape="rect" id="node3" title=" " alt="" coords="99,108,178,133"/>
<area shape="rect" id="node4" title=" " alt="" coords="203,108,264,133"/>
<area shape="rect" id="node5" title=" " alt="" coords="288,108,352,133"/>
</map>

1
d8/d7f/circular__doubly__linked__list_8c__incl.md5 Normal file
View File

@ -0,0 +1 @@
97dd77c45981aca54986e5a8ead3d37e

83
d8/d7f/circular__doubly__linked__list_8c__incl.svg Normal file
View File

@ -0,0 +1,83 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: data_structures/linked_list/circular_doubly_linked_list.c Pages: 1 -->
<svg width="268pt" height="104pt"
viewBox="0.00 0.00 268.00 104.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 100)">
<title>data_structures/linked_list/circular_doubly_linked_list.c</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="191.5,-96 78.5,-96 78.5,-55 191.5,-55 191.5,-96"/>
<text text-anchor="start" x="86.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/linked</text>
<text text-anchor="start" x="86.5" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">_list/circular_doubly</text>
<text text-anchor="middle" x="135" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_linked_list.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="52,-19 0,-19 0,0 52,0 52,-19"/>
<text text-anchor="middle" x="26" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">assert.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M101.11,-54.6C84.76,-45 65.51,-33.7 50.59,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="52.74,-22.14 42.34,-20.1 49.2,-28.18 52.74,-22.14"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="129.5,-19 70.5,-19 70.5,0 129.5,0 129.5,-19"/>
<text text-anchor="middle" x="100" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">inttypes.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M124.12,-54.6C119.65,-46.43 114.5,-37.02 110.12,-29"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.33,-27.58 105.46,-20.49 107.19,-30.94 113.33,-27.58"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="194,-19 148,-19 148,0 194,0 194,-19"/>
<text text-anchor="middle" x="171" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M146.19,-54.6C150.79,-46.43 156.08,-37.02 160.6,-29"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.53,-30.91 165.39,-20.48 157.43,-27.48 163.53,-30.91"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="260,-19 212,-19 212,0 260,0 260,-19"/>
<text text-anchor="middle" x="236" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M166.4,-54.6C181.26,-45.19 198.71,-34.13 212.42,-25.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.21,-28.45 220.79,-20.14 210.47,-22.54 214.21,-28.45"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.6 KiB

4
d9/d5c/struct_queue_rep__coll__graph.map
View File

@ -1,4 +1,4 @@
<map id="QueueRep" name="QueueRep">
<area shape="rect" id="node1" title=" " alt="" coords="5,200,89,225"/>
<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="22,51,73,77"/>
<area shape="rect" id="node1" title=" " alt="" coords="5,215,89,240"/>
<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="22,59,73,84"/>
</map>

2
d9/d5c/struct_queue_rep__coll__graph.md5
View File

@ -1 +1 @@
c6a0f7a273d3b4f8c30d0d0fe7a2a1ce
6a40e22ebbc4d03f796f616087534595

31
d9/d5c/struct_queue_rep__coll__graph.svg
View File

@ -4,9 +4,9 @@
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: QueueRep Pages: 1 -->
<svg width="120pt" height="173pt"
viewBox="0.00 0.00 119.50 173.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 169)">
<svg width="120pt" height="184pt"
viewBox="0.00 0.00 119.50 184.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 180)">
<title>QueueRep</title>
<!-- Node1 -->
<g id="node1" class="node">
@ -21,30 +21,31 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d5/da1/structnode.html" target="_top" xlink:title="Node, the basic data structure in the tree.">
<polygon fill="white" stroke="#666666" points="50.5,-130.5 12.5,-130.5 12.5,-111.5 50.5,-111.5 50.5,-130.5"/>
<text text-anchor="middle" x="31.5" y="-118.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
<polygon fill="white" stroke="#666666" points="50.5,-136 12.5,-136 12.5,-117 50.5,-117 50.5,-136"/>
<text text-anchor="middle" x="31.5" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M31.5,-99.73C31.5,-75.67 31.5,-36.62 31.5,-19.28"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="28,-99.53 31.5,-109.53 35,-99.53 28,-99.53"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M31.5,-105.37C31.5,-79.99 31.5,-37.48 31.5,-19.24"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="28,-105.34 31.5,-115.34 35,-105.34 28,-105.34"/>
<text text-anchor="middle" x="44" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00"> head</text>
<text text-anchor="middle" x="44" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">tail</text>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M52.54,-134.58C61.19,-135.46 68.5,-130.93 68.5,-121 68.5,-107.03 54.04,-103.75 41.73,-111.18"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="53.75,-131.3 43.16,-131.32 51.46,-137.91 53.75,-131.3"/>
<text text-anchor="middle" x="90" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="90" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="90" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="90" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="90" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="90" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.15,-140.9C60.39,-142.55 68.5,-137.75 68.5,-126.5 68.5,-111.01 53.14,-107.75 40.6,-116.7"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="52.56,-137.7 41.99,-136.9 49.76,-144.11 52.56,-137.7"/>
<text text-anchor="middle" x="90" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="90" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="90" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="90" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="90" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="90" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<text text-anchor="middle" x="90" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">prev</text>
<text text-anchor="middle" x="90" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
<text text-anchor="middle" x="90" y="-80" font-family="Helvetica,sans-Serif" font-size="10.00">rightNode</text>
</g>

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

2
db/d84/malloc__dbg_8c.html
View File

@ -423,7 +423,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 116</span> }</div>
<div class="line"><span class="lineno"> 117</span> tmp-&gt;bytes += bytes;</div>
<div class="line"><span class="lineno"> 118</span>}</div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
</div><!-- fragment -->
</div>
</div>

2
dc/d80/cantor__set_8c.html
View File

@ -182,7 +182,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 81</span>}</div>
<div class="ttc" id="acantor__set_8c_html_a85df3c64a683100ac6246e1e034df43d"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d">free_memory</a></div><div class="ttdeci">void free_memory(CantorSet *head)</div><div class="ttdoc">Clear memory allocated by propagate function.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:72</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">

735
dd/d19/circular__doubly__linked__list_8c.html Normal file
View File

@ -0,0 +1,735 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: data_structures/linked_list/circular_doubly_linked_list.c File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dd/d19/circular__doubly__linked__list_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Data Structures</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">circular_doubly_linked_list.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include &lt;assert.h&gt;</code><br />
<code>#include &lt;inttypes.h&gt;</code><br />
<code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for circular_doubly_linked_list.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7f/circular__doubly__linked__list_8c__incl.svg" width="358" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html">node</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure in the tree. <a href="../../d5/da1/structnode.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a77bc93c58c46925ba49f51f2d1a32899"><td class="memItemLeft" align="right" valign="top">typedef struct <a class="el" href="../../d5/da1/structnode.html">node</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a></td></tr>
<tr class="memdesc:a77bc93c58c46925ba49f51f2d1a32899"><td class="mdescLeft">&#160;</td><td class="mdescRight">to verify assumptions made by the program and print a diagnostic message if this assumption is false. <br /></td></tr>
<tr class="separator:a77bc93c58c46925ba49f51f2d1a32899"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a4a89f96b090dfdb505b714195e59ca5b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a> (uint64_t <a class="el" href="../../df/dea/structdata.html">data</a>)</td></tr>
<tr class="memdesc:a4a89f96b090dfdb505b714195e59ca5b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create a list node. <br /></td></tr>
<tr class="separator:a4a89f96b090dfdb505b714195e59ca5b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a964882e633c25a29b12237e29f20fa9a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a">insert_at_head</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head, uint64_t <a class="el" href="../../df/dea/structdata.html">data</a>)</td></tr>
<tr class="memdesc:a964882e633c25a29b12237e29f20fa9a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a node at start of list. <br /></td></tr>
<tr class="separator:a964882e633c25a29b12237e29f20fa9a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aee328f691615862c4298fe730d66027b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b">insert_at_tail</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head, uint64_t <a class="el" href="../../df/dea/structdata.html">data</a>)</td></tr>
<tr class="memdesc:aee328f691615862c4298fe730d66027b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a node at end of list. <br /></td></tr>
<tr class="separator:aee328f691615862c4298fe730d66027b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1418cac5ddf9edb58fca97afce27b456"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456">delete_from_head</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head)</td></tr>
<tr class="memdesc:a1418cac5ddf9edb58fca97afce27b456"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for deletion of the first node in list. <br /></td></tr>
<tr class="separator:a1418cac5ddf9edb58fca97afce27b456"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abf4cdda9fbace9822612349d19ec2e72"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72">delete_from_tail</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head)</td></tr>
<tr class="memdesc:abf4cdda9fbace9822612349d19ec2e72"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for deletion of the last node in list. <br /></td></tr>
<tr class="separator:abf4cdda9fbace9822612349d19ec2e72"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a64eb6265e703639bbfec9c3db93e0c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head)</td></tr>
<tr class="memdesc:a6a64eb6265e703639bbfec9c3db93e0c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The function that will return current size of list. <br /></td></tr>
<tr class="separator:a6a64eb6265e703639bbfec9c3db93e0c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5411df421a94177700868b34887d5d0e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *head)</td></tr>
<tr class="memdesc:a5411df421a94177700868b34887d5d0e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Display list function. <br /></td></tr>
<tr class="separator:a5411df421a94177700868b34887d5d0e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac53a0550fa74838246bc783ddc005ec1"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">get</a> (<a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *<a class="el" href="../../d8/d10/structlist.html">list</a>, const int index)</td></tr>
<tr class="memdesc:ac53a0550fa74838246bc783ddc005ec1"><td class="mdescLeft">&#160;</td><td class="mdescRight">access the list by index <br /></td></tr>
<tr class="separator:ac53a0550fa74838246bc783ddc005ec1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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="../../dd/d19/circular__doubly__linked__list_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><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>Circular <a href="https://en.wikipedia.org/wiki/Doubly_linked_list" target="_blank">Doubly Linked List</a> combines the properties of a doubly linked list and a circular linked list in which two consecutive elements are linked or connected by the previous. Next, the pointer and the last node point to the first node via the next pointer, and the first node points to the last node via the previous pointer.</p>
<p>In this implementation, functions to insert at the head, insert at the last index, delete the first node, delete the last node, display list, and get list size functions are coded.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/SahilK-027" target="_blank">Sahil Kandhare</a> </dd></dl>
</div><h2 class="groupheader">Typedef Documentation</h2>
<a id="a77bc93c58c46925ba49f51f2d1a32899" name="a77bc93c58c46925ba49f51f2d1a32899"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a77bc93c58c46925ba49f51f2d1a32899">&#9670;&#160;</a></span>ListNode</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef struct <a class="el" href="../../d5/da1/structnode.html">node</a> <a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>to verify assumptions made by the program and print a diagnostic message if this assumption is false. </p>
<p>to provide a set of integer types with universally consistent definitions that are operating system-independent for IO operations for including functions involving memory allocation such as <code>malloc</code></p>
<p>Circular Doubly linked list struct </p>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a4a89f96b090dfdb505b714195e59ca5b" name="a4a89f96b090dfdb505b714195e59ca5b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4a89f96b090dfdb505b714195e59ca5b">&#9670;&#160;</a></span>create_node()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> * create_node </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>data</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Create a list node. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">data</td><td>the data that the node initialises with </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ListNode* pointer to the newly created list node </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 40</span>{</div>
<div class="line"><span class="lineno"> 41</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *new_list = (<a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc</a>(<span class="keyword">sizeof</span>(<a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a>));</div>
<div class="line"><span class="lineno"> 42</span> new_list-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a> = <a class="code hl_struct" href="../../df/dea/structdata.html">data</a>;</div>
<div class="line"><span class="lineno"> 43</span> new_list-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = new_list;</div>
<div class="line"><span class="lineno"> 44</span> new_list-&gt;prev = new_list;</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span> new_list;</div>
<div class="line"><span class="lineno"> 46</span>}</div>
<div class="ttc" id="amalloc__dbg_8h_html_a725f50ecaf1959d96de79b36b4788fee"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc</a></div><div class="ttdeci">#define malloc(bytes)</div><div class="ttdoc">This macro replace the standard malloc function with malloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:18</div></div>
<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a4df5127dc26bf42ff5d965d77823efb5"><div class="ttname"><a href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">node::value</a></div><div class="ttdeci">uint64_t value</div><div class="ttdoc">Data stored on each node.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:31</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a1418cac5ddf9edb58fca97afce27b456" name="a1418cac5ddf9edb58fca97afce27b456"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1418cac5ddf9edb58fca97afce27b456">&#9670;&#160;</a></span>delete_from_head()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> * delete_from_head </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function for deletion of the first node in list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ListNode* pointer to the list node after deleting first node </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 112</span>{</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (head == NULL)</div>
<div class="line"><span class="lineno"> 114</span> {</div>
<div class="line"><span class="lineno"> 115</span> printf(<span class="stringliteral">&quot;The list is empty\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="line"><span class="lineno"> 118</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp1, *temp2;</div>
<div class="line"><span class="lineno"> 119</span> temp1 = head;</div>
<div class="line"><span class="lineno"> 120</span> temp2 = temp1-&gt;prev;</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">if</span> (temp1 == temp2)</div>
<div class="line"><span class="lineno"> 122</span> {</div>
<div class="line"><span class="lineno"> 123</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(temp2);</div>
<div class="line"><span class="lineno"> 124</span> head = NULL;</div>
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 126</span> }</div>
<div class="line"><span class="lineno"> 127</span> temp2-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = temp1-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 128</span> (temp1-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>)-&gt;prev = temp2;</div>
<div class="line"><span class="lineno"> 129</span> head = temp1-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(temp1);</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 132</span>}</div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="abf4cdda9fbace9822612349d19ec2e72" name="abf4cdda9fbace9822612349d19ec2e72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abf4cdda9fbace9822612349d19ec2e72">&#9670;&#160;</a></span>delete_from_tail()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> * delete_from_tail </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function for deletion of the last node in list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ListNode* pointer to the list node after deleting first node </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 141</span>{</div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">if</span> (head == NULL)</div>
<div class="line"><span class="lineno"> 143</span> {</div>
<div class="line"><span class="lineno"> 144</span> printf(<span class="stringliteral">&quot;The list is empty\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 146</span> }</div>
<div class="line"><span class="lineno"> 147</span> </div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp1, *temp2;</div>
<div class="line"><span class="lineno"> 149</span> temp1 = head;</div>
<div class="line"><span class="lineno"> 150</span> temp2 = temp1-&gt;prev;</div>
<div class="line"><span class="lineno"> 151</span> <span class="keywordflow">if</span> (temp1 == temp2)</div>
<div class="line"><span class="lineno"> 152</span> {</div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(temp2);</div>
<div class="line"><span class="lineno"> 154</span> head = NULL;</div>
<div class="line"><span class="lineno"> 155</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 156</span> }</div>
<div class="line"><span class="lineno"> 157</span> (temp2-&gt;prev)-&gt;<a class="code hl_function" href="../../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f">next</a> = temp1;</div>
<div class="line"><span class="lineno"> 158</span> temp1-&gt;prev = temp2-&gt;prev;</div>
<div class="line"><span class="lineno"> 159</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(temp2);</div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 161</span>}</div>
<div class="ttc" id="avector_8c_html_af2f92e8cc55e764980bc0573ab5cd06f"><div class="ttname"><a href="../../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f">next</a></div><div class="ttdeci">int next(Vector *vec)</div><div class="ttdoc">This function gets the next item from the Vector each time it's called.</div><div class="ttdef"><b>Definition:</b> vector.c:102</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d19/circular__doubly__linked__list_8c_abf4cdda9fbace9822612349d19ec2e72_cgraph.svg" width="220" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a5411df421a94177700868b34887d5d0e" name="a5411df421a94177700868b34887d5d0e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5411df421a94177700868b34887d5d0e">&#9670;&#160;</a></span>display_list()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void display_list </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Display list function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 192</span>{</div>
<div class="line"><span class="lineno"> 193</span> printf(<span class="stringliteral">&quot;\nContents of your linked list: &quot;</span>);</div>
<div class="line"><span class="lineno"> 194</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp;</div>
<div class="line"><span class="lineno"> 195</span> temp = head;</div>
<div class="line"><span class="lineno"> 196</span> <span class="keywordflow">if</span> (head != NULL)</div>
<div class="line"><span class="lineno"> 197</span> {</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">while</span> (temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> != head)</div>
<div class="line"><span class="lineno"> 199</span> {</div>
<div class="line"><span class="lineno"> 200</span> printf(<span class="stringliteral">&quot;%&quot;</span> PRIu64 <span class="stringliteral">&quot; &lt;-&gt; &quot;</span>, temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a>);</div>
<div class="line"><span class="lineno"> 201</span> temp = temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 202</span> }</div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">if</span> (temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> == head)</div>
<div class="line"><span class="lineno"> 204</span> {</div>
<div class="line"><span class="lineno"> 205</span> printf(<span class="stringliteral">&quot;%&quot;</span> PRIu64, temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a>);</div>
<div class="line"><span class="lineno"> 206</span> }</div>
<div class="line"><span class="lineno"> 207</span> }</div>
<div class="line"><span class="lineno"> 208</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 209</span> {</div>
<div class="line"><span class="lineno"> 210</span> printf(<span class="stringliteral">&quot;The list is empty&quot;</span>);</div>
<div class="line"><span class="lineno"> 211</span> }</div>
<div class="line"><span class="lineno"> 212</span> printf(<span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 213</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac53a0550fa74838246bc783ddc005ec1" name="ac53a0550fa74838246bc783ddc005ec1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac53a0550fa74838246bc783ddc005ec1">&#9670;&#160;</a></span>get()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">uint64_t get </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>list</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int&#160;</td>
<td class="paramname"><em>index</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>access the list by index </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">list</td><td>pointer to the target list </td></tr>
<tr><td class="paramname">index</td><td>access location </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the value at the specified index, wrapping around if the index is larger than the size of the target list </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 224</span>{</div>
<div class="line"><span class="lineno"> 225</span> <span class="keywordflow">if</span> (<a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> == NULL || index &lt; 0)</div>
<div class="line"><span class="lineno"> 226</span> {</div>
<div class="line"><span class="lineno"> 227</span> exit(EXIT_FAILURE);</div>
<div class="line"><span class="lineno"> 228</span> }</div>
<div class="line"><span class="lineno"> 229</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp = <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>;</div>
<div class="line"><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; index; ++i)</div>
<div class="line"><span class="lineno"> 231</span> {</div>
<div class="line"><span class="lineno"> 232</span> temp = temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 233</span> }</div>
<div class="line"><span class="lineno"> 234</span> <span class="keywordflow">return</span> temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a>;</div>
<div class="line"><span class="lineno"> 235</span>}</div>
<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdoc">Doubly linked list struct.</div><div class="ttdef"><b>Definition:</b> doubly_linked_list.c:24</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a6a64eb6265e703639bbfec9c3db93e0c" name="a6a64eb6265e703639bbfec9c3db93e0c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6a64eb6265e703639bbfec9c3db93e0c">&#9670;&#160;</a></span>getsize()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int getsize </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>The function that will return current size of list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>int size of list </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 170</span>{</div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordflow">if</span> (!head)</div>
<div class="line"><span class="lineno"> 172</span> {</div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 174</span> }</div>
<div class="line"><span class="lineno"> 175</span> <span class="keywordtype">int</span> size = 1;</div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp = head-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 177</span> <span class="keywordflow">while</span> (temp != head)</div>
<div class="line"><span class="lineno"> 178</span> {</div>
<div class="line"><span class="lineno"> 179</span> temp = temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a>;</div>
<div class="line"><span class="lineno"> 180</span> size++;</div>
<div class="line"><span class="lineno"> 181</span> }</div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">return</span> size;</div>
<div class="line"><span class="lineno"> 183</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a964882e633c25a29b12237e29f20fa9a" name="a964882e633c25a29b12237e29f20fa9a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a964882e633c25a29b12237e29f20fa9a">&#9670;&#160;</a></span>insert_at_head()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> * insert_at_head </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert a node at start of list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
<tr><td class="paramname">data</td><td>the data that the node initialises with </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ListNode* pointer to the newly created list node inserted at the head </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 56</span>{</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (head == NULL)</div>
<div class="line"><span class="lineno"> 58</span> {</div>
<div class="line"><span class="lineno"> 59</span> head = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a>(<a class="code hl_struct" href="../../df/dea/structdata.html">data</a>);</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 63</span> {</div>
<div class="line"><span class="lineno"> 64</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp;</div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *new_node = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a>(<a class="code hl_struct" href="../../df/dea/structdata.html">data</a>);</div>
<div class="line"><span class="lineno"> 66</span> temp = head-&gt;prev;</div>
<div class="line"><span class="lineno"> 67</span> new_node-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = head;</div>
<div class="line"><span class="lineno"> 68</span> head-&gt;prev = new_node;</div>
<div class="line"><span class="lineno"> 69</span> new_node-&gt;prev = temp;</div>
<div class="line"><span class="lineno"> 70</span> temp-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = new_node;</div>
<div class="line"><span class="lineno"> 71</span> head = new_node;</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 73</span> }</div>
<div class="line"><span class="lineno"> 74</span>}</div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_a4a89f96b090dfdb505b714195e59ca5b"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a></div><div class="ttdeci">ListNode * create_node(uint64_t data)</div><div class="ttdoc">Create a list node.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:39</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d19/circular__doubly__linked__list_8c_a964882e633c25a29b12237e29f20fa9a_cgraph.svg" width="259" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aee328f691615862c4298fe730d66027b" name="aee328f691615862c4298fe730d66027b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aee328f691615862c4298fe730d66027b">&#9670;&#160;</a></span>insert_at_tail()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> * insert_at_tail </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">ListNode</a> *&#160;</td>
<td class="paramname"><em>head</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert a node at end of list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>start pointer of list </td></tr>
<tr><td class="paramname">data</td><td>the data that the node initialises with </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ListNode* pointer to the newly added list node that was inserted at the head of list. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 85</span>{</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">if</span> (head == NULL)</div>
<div class="line"><span class="lineno"> 87</span> {</div>
<div class="line"><span class="lineno"> 88</span> head = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a>(<a class="code hl_struct" href="../../df/dea/structdata.html">data</a>);</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 90</span> }</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 92</span> {</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *temp1, *temp2;</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *new_node = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">create_node</a>(<a class="code hl_struct" href="../../df/dea/structdata.html">data</a>);</div>
<div class="line"><span class="lineno"> 95</span> temp1 = head;</div>
<div class="line"><span class="lineno"> 96</span> temp2 = head-&gt;prev;</div>
<div class="line"><span class="lineno"> 97</span> new_node-&gt;prev = temp2;</div>
<div class="line"><span class="lineno"> 98</span> new_node-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = temp1;</div>
<div class="line"><span class="lineno"> 99</span> temp1-&gt;prev = new_node;</div>
<div class="line"><span class="lineno"> 100</span> temp2-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">next</a> = new_node;</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="line"><span class="lineno"> 103</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d19/circular__doubly__linked__list_8c_aee328f691615862c4298fe730d66027b_cgraph.svg" width="248" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 301</span>{</div>
<div class="line"><span class="lineno"> 302</span> <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 303</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 304</span>}</div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:241</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d19/circular__doubly__linked__list_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="468" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 242</span>{</div>
<div class="line"><span class="lineno"> 243</span> <a class="code hl_struct" href="../../d5/da1/structnode.html">ListNode</a> *testList = NULL;</div>
<div class="line"><span class="lineno"> 244</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> array[] = {2, 3, 4, 5, 6};</div>
<div class="line"><span class="lineno"> 245</span> </div>
<div class="line"><span class="lineno"> 246</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a>(testList) == 0);</div>
<div class="line"><span class="lineno"> 247</span> </div>
<div class="line"><span class="lineno"> 248</span> printf(<span class="stringliteral">&quot;Testing inserting elements:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 249</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 5; ++i)</div>
<div class="line"><span class="lineno"> 250</span> {</div>
<div class="line"><span class="lineno"> 251</span> <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a>(testList);</div>
<div class="line"><span class="lineno"> 252</span> testList = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a">insert_at_head</a>(testList, array[i]);</div>
<div class="line"><span class="lineno"> 253</span> assert(testList-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a> == array[i]);</div>
<div class="line"><span class="lineno"> 254</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a>(testList) == i + 1);</div>
<div class="line"><span class="lineno"> 255</span> }</div>
<div class="line"><span class="lineno"> 256</span> </div>
<div class="line"><span class="lineno"> 257</span> printf(<span class="stringliteral">&quot;\nTesting removing elements:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 258</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 4; i &gt; -1; --i)</div>
<div class="line"><span class="lineno"> 259</span> {</div>
<div class="line"><span class="lineno"> 260</span> <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a>(testList);</div>
<div class="line"><span class="lineno"> 261</span> assert(testList-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a> == array[i]);</div>
<div class="line"><span class="lineno"> 262</span> testList = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456">delete_from_head</a>(testList);</div>
<div class="line"><span class="lineno"> 263</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a>(testList) == i);</div>
<div class="line"><span class="lineno"> 264</span> }</div>
<div class="line"><span class="lineno"> 265</span> </div>
<div class="line"><span class="lineno"> 266</span> printf(<span class="stringliteral">&quot;\nTesting inserting at tail:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 267</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 5; ++i)</div>
<div class="line"><span class="lineno"> 268</span> {</div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a>(testList);</div>
<div class="line"><span class="lineno"> 270</span> testList = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b">insert_at_tail</a>(testList, array[i]);</div>
<div class="line"><span class="lineno"> 271</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">get</a>(testList, i) == array[i]);</div>
<div class="line"><span class="lineno"> 272</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a>(testList) == i + 1);</div>
<div class="line"><span class="lineno"> 273</span> }</div>
<div class="line"><span class="lineno"> 274</span> </div>
<div class="line"><span class="lineno"> 275</span> printf(<span class="stringliteral">&quot;\nTesting removing from tail:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 4; i &gt; -1; --i)</div>
<div class="line"><span class="lineno"> 277</span> {</div>
<div class="line"><span class="lineno"> 278</span> <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a>(testList);</div>
<div class="line"><span class="lineno"> 279</span> testList = <a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72">delete_from_tail</a>(testList);</div>
<div class="line"><span class="lineno"> 280</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a>(testList) == i);</div>
<div class="line"><span class="lineno"> 281</span> <span class="comment">// If list is not empty, assert that accessing the just removed element</span></div>
<div class="line"><span class="lineno"> 282</span> <span class="comment">// will wrap around to the list head</span></div>
<div class="line"><span class="lineno"> 283</span> <span class="keywordflow">if</span> (testList != NULL)</div>
<div class="line"><span class="lineno"> 284</span> {</div>
<div class="line"><span class="lineno"> 285</span> assert(<a class="code hl_function" href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">get</a>(testList, i) == testList-&gt;<a class="code hl_variable" href="../../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">value</a>);</div>
<div class="line"><span class="lineno"> 286</span> }</div>
<div class="line"><span class="lineno"> 287</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 288</span> {</div>
<div class="line"><span class="lineno"> 289</span> <span class="comment">// If the list is empty, assert that the elements were removed after</span></div>
<div class="line"><span class="lineno"> 290</span> <span class="comment">// the correct number of iterations</span></div>
<div class="line"><span class="lineno"> 291</span> assert(i == 0);</div>
<div class="line"><span class="lineno"> 292</span> }</div>
<div class="line"><span class="lineno"> 293</span> }</div>
<div class="line"><span class="lineno"> 294</span>}</div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_a1418cac5ddf9edb58fca97afce27b456"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456">delete_from_head</a></div><div class="ttdeci">ListNode * delete_from_head(ListNode *head)</div><div class="ttdoc">Function for deletion of the first node in list.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:111</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_a5411df421a94177700868b34887d5d0e"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">display_list</a></div><div class="ttdeci">void display_list(ListNode *head)</div><div class="ttdoc">Display list function.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:191</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_a6a64eb6265e703639bbfec9c3db93e0c"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">getsize</a></div><div class="ttdeci">int getsize(ListNode *head)</div><div class="ttdoc">The function that will return current size of list.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:169</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_a964882e633c25a29b12237e29f20fa9a"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a">insert_at_head</a></div><div class="ttdeci">ListNode * insert_at_head(ListNode *head, uint64_t data)</div><div class="ttdoc">Insert a node at start of list.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:55</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_abf4cdda9fbace9822612349d19ec2e72"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72">delete_from_tail</a></div><div class="ttdeci">ListNode * delete_from_tail(ListNode *head)</div><div class="ttdoc">Function for deletion of the last node in list.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:140</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_ac53a0550fa74838246bc783ddc005ec1"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">get</a></div><div class="ttdeci">uint64_t get(ListNode *list, const int index)</div><div class="ttdoc">access the list by index</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:223</div></div>
<div class="ttc" id="acircular__doubly__linked__list_8c_html_aee328f691615862c4298fe730d66027b"><div class="ttname"><a href="../../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b">insert_at_tail</a></div><div class="ttdeci">ListNode * insert_at_tail(ListNode *head, uint64_t data)</div><div class="ttdoc">Insert a node at end of list.</div><div class="ttdef"><b>Definition:</b> circular_doubly_linked_list.c:84</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d19/circular__doubly__linked__list_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="370" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../dir_261dd1200fad5b2fe1eca9af8320656e.html">linked_list</a></li><li class="navelem"><a class="el" href="../../dd/d19/circular__doubly__linked__list_8c.html">circular_doubly_linked_list.c</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.6 </li>
</ul>
</div>
</body>
</html>

15
dd/d19/circular__doubly__linked__list_8c.js Normal file
View File

@ -0,0 +1,15 @@
var circular__doubly__linked__list_8c =
[
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "ListNode", "dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899", null ],
[ "create_node", "dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b", null ],
[ "delete_from_head", "dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456", null ],
[ "delete_from_tail", "dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72", null ],
[ "display_list", "dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e", null ],
[ "get", "dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1", null ],
[ "getsize", "dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c", null ],
[ "insert_at_head", "dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a", null ],
[ "insert_at_tail", "dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b", null ],
[ "main", "dd/d19/circular__doubly__linked__list_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

4
dd/d19/circular__doubly__linked__list_8c_a964882e633c25a29b12237e29f20fa9a_cgraph.map Normal file
View File

@ -0,0 +1,4 @@
<map id="insert_at_head" name="insert_at_head">
<area shape="rect" id="node1" title="Insert a node at start of list." alt="" coords="5,5,112,31"/>
<area shape="rect" id="node2" href="$dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" title="Create a list node." alt="" coords="160,5,253,31"/>
</map>

1
dd/d19/circular__doubly__linked__list_8c_a964882e633c25a29b12237e29f20fa9a_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
4edb8a4e6028f29d0ef9e371aad8d4cf

36
dd/d19/circular__doubly__linked__list_8c_a964882e633c25a29b12237e29f20fa9a_cgraph.svg Normal file
View File

@ -0,0 +1,36 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: insert_at_head Pages: 1 -->
<svg width="194pt" height="27pt"
viewBox="0.00 0.00 194.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23)">
<title>insert_at_head</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Insert a node at start of list.">
<polygon fill="#999999" stroke="#666666" points="80,-19 0,-19 0,0 80,0 80,-19"/>
<text text-anchor="middle" x="40" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_head</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" target="_top" xlink:title="Create a list node.">
<polygon fill="white" stroke="#666666" points="186,-19 116,-19 116,0 186,0 186,-19"/>
<text text-anchor="middle" x="151" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">create_node</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M80.35,-9.5C88.14,-9.5 96.37,-9.5 104.34,-9.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="104.24,-13 114.24,-9.5 104.24,-6 104.24,-13"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.6 KiB

12
dd/d19/circular__doubly__linked__list_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@ -0,0 +1,12 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,153,49,179"/>
<area shape="rect" id="node2" href="$dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456" title="Function for deletion of the first node in list." alt="" coords="97,5,223,31"/>
<area shape="rect" id="node3" href="$dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72" title="Function for deletion of the last node in list." alt="" coords="103,55,217,80"/>
<area shape="rect" id="node5" href="$dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e" title="Display list function." alt="" coords="117,104,203,129"/>
<area shape="rect" id="node6" href="$dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1" title="access the list by index" alt="" coords="140,153,180,179"/>
<area shape="rect" id="node7" href="$dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c" title="The function that will return current size of list." alt="" coords="128,203,192,228"/>
<area shape="rect" id="node8" href="$dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a" title="Insert a node at start of list." alt="" coords="107,252,213,277"/>
<area shape="rect" id="node10" href="$dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b" title="Insert a node at end of list." alt="" coords="112,301,208,327"/>
<area shape="rect" id="node4" href="$df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" title="This function gets the next item from the Vector each time it&#39;s called." alt="" coords="294,55,341,80"/>
<area shape="rect" id="node9" href="$dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" title="Create a list node." alt="" coords="271,276,364,301"/>
</map>

1
dd/d19/circular__doubly__linked__list_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
f99109205761a9e060cfef95fa342607

162
dd/d19/circular__doubly__linked__list_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@ -0,0 +1,162 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: test Pages: 1 -->
<svg width="277pt" height="249pt"
viewBox="0.00 0.00 277.00 249.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="33,-130 0,-130 0,-111 33,-111 33,-130"/>
<text text-anchor="middle" x="16.5" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456" target="_top" xlink:title="Function for deletion of the first node in list.">
<polygon fill="white" stroke="#666666" points="163,-241 69,-241 69,-222 163,-222 163,-241"/>
<text text-anchor="middle" x="116" y="-229" font-family="Helvetica,sans-Serif" font-size="10.00">delete_from_head</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M20.45,-130.36C26.54,-149.09 42.2,-190.04 69,-213.5 69.94,-214.32 70.91,-215.1 71.92,-215.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="70.06,-218.81 80.43,-220.95 73.66,-212.81 70.06,-218.81"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72" target="_top" xlink:title="Function for deletion of the last node in list.">
<polygon fill="white" stroke="#666666" points="159,-204 73,-204 73,-185 159,-185 159,-204"/>
<text text-anchor="middle" x="116" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">delete_from_tail</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M24.44,-130.49C33.45,-142.8 50.25,-163.67 69,-176.5 70.56,-177.57 72.19,-178.58 73.86,-179.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.97,-182.51 82.48,-183.86 75.11,-176.25 71.97,-182.51"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e" target="_top" xlink:title="Display list function.">
<polygon fill="white" stroke="#666666" points="148.5,-167 83.5,-167 83.5,-148 148.5,-148 148.5,-167"/>
<text text-anchor="middle" x="116" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">display_list</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M33.17,-126.44C45.32,-131.06 62.68,-137.65 78.29,-143.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.72,-146.71 87.31,-146.99 79.2,-140.17 76.72,-146.71"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1" target="_top" xlink:title="access the list by index">
<polygon fill="white" stroke="#666666" points="131,-130 101,-130 101,-111 131,-111 131,-130"/>
<text text-anchor="middle" x="116" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="#63b8ff" d="M33.17,-120.5C48.3,-120.5 71.48,-120.5 89.32,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.13,-124 99.13,-120.5 89.13,-117 89.13,-124"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c" target="_top" xlink:title="The function that will return current size of list.">
<polygon fill="white" stroke="#666666" points="140,-93 92,-93 92,-74 140,-74 140,-93"/>
<text text-anchor="middle" x="116" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">getsize</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="#63b8ff" d="M33.17,-114.56C46.15,-109.63 65.06,-102.45 81.43,-96.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="82.21,-99.69 90.32,-92.87 79.73,-93.14 82.21,-99.69"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a" target="_top" xlink:title="Insert a node at start of list.">
<polygon fill="white" stroke="#666666" points="156,-56 76,-56 76,-37 156,-37 156,-56"/>
<text text-anchor="middle" x="116" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_head</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="#63b8ff" d="M24.52,-110.75C33.61,-98.73 50.49,-78.3 69,-65.5 71.08,-64.06 73.28,-62.71 75.56,-61.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.04,-64.6 84.44,-57.03 73.93,-58.33 77.04,-64.6"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b" target="_top" xlink:title="Insert a node at end of list.">
<polygon fill="white" stroke="#666666" points="152,-19 80,-19 80,0 152,0 152,-19"/>
<text text-anchor="middle" x="116" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_tail</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node1&#45;&gt;Node10</title>
<path fill="none" stroke="#63b8ff" d="M20.62,-110.5C26.89,-91.92 42.72,-51.83 69,-28.5 70.42,-27.24 71.94,-26.05 73.52,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="74.97,-28.15 81.86,-20.1 71.45,-22.1 74.97,-28.15"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" target="_top" xlink:title="This function gets the next item from the Vector each time it&#39;s called.">
<polygon fill="white" stroke="#666666" points="251.5,-204 216.5,-204 216.5,-185 251.5,-185 251.5,-204"/>
<text text-anchor="middle" x="234" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M159.21,-194.5C174.44,-194.5 191.24,-194.5 204.96,-194.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="204.6,-198 214.6,-194.5 204.6,-191 204.6,-198"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" target="_top" xlink:title="Create a list node.">
<polygon fill="white" stroke="#666666" points="269,-38 199,-38 199,-19 269,-19 269,-38"/>
<text text-anchor="middle" x="234" y="-26" font-family="Helvetica,sans-Serif" font-size="10.00">create_node</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="#63b8ff" d="M156.27,-40.41C166.3,-38.85 177.17,-37.16 187.48,-35.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.97,-39.03 197.32,-34.04 186.9,-32.11 187.97,-39.03"/>
</g>
<!-- Node10&#45;&gt;Node9 -->
<g id="edge10" class="edge">
<title>Node10&#45;&gt;Node9</title>
<path fill="none" stroke="#63b8ff" d="M152.43,-15.3C163.43,-17.1 175.7,-19.12 187.29,-21.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="186.65,-24.45 197.09,-22.62 187.78,-17.55 186.65,-24.45"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.0 KiB

4
dd/d19/circular__doubly__linked__list_8c_abf4cdda9fbace9822612349d19ec2e72_cgraph.map Normal file
View File

@ -0,0 +1,4 @@
<map id="delete_from_tail" name="delete_from_tail">
<area shape="rect" id="node1" title="Function for deletion of the last node in list." alt="" coords="5,5,120,31"/>
<area shape="rect" id="node2" href="$df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" title="This function gets the next item from the Vector each time it&#39;s called." alt="" coords="168,5,215,31"/>
</map>

1
dd/d19/circular__doubly__linked__list_8c_abf4cdda9fbace9822612349d19ec2e72_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
5ac123540760418957099ee4ac1a302e

36
dd/d19/circular__doubly__linked__list_8c_abf4cdda9fbace9822612349d19ec2e72_cgraph.svg Normal file
View File

@ -0,0 +1,36 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: delete_from_tail Pages: 1 -->
<svg width="165pt" height="27pt"
viewBox="0.00 0.00 165.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23)">
<title>delete_from_tail</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function for deletion of the last node in list.">
<polygon fill="#999999" stroke="#666666" points="86,-19 0,-19 0,0 86,0 86,-19"/>
<text text-anchor="middle" x="43" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">delete_from_tail</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" target="_top" xlink:title="This function gets the next item from the Vector each time it&#39;s called.">
<polygon fill="white" stroke="#666666" points="157,-19 122,-19 122,0 157,0 157,-19"/>
<text text-anchor="middle" x="139.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M86.27,-9.5C94.43,-9.5 102.79,-9.5 110.36,-9.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.31,-13 120.31,-9.5 110.31,-6 110.31,-13"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.6 KiB

13
dd/d19/circular__doubly__linked__list_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@ -0,0 +1,13 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,153,56,179"/>
<area shape="rect" id="node2" href="$dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,153,148,179"/>
<area shape="rect" id="node3" href="$dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456" title="Function for deletion of the first node in list." alt="" coords="196,5,321,31"/>
<area shape="rect" id="node4" href="$dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72" title="Function for deletion of the last node in list." alt="" coords="201,55,316,80"/>
<area shape="rect" id="node6" href="$dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e" title="Display list function." alt="" coords="215,104,302,129"/>
<area shape="rect" id="node7" href="$dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1" title="access the list by index" alt="" coords="239,153,279,179"/>
<area shape="rect" id="node8" href="$dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c" title="The function that will return current size of list." alt="" coords="227,203,291,228"/>
<area shape="rect" id="node9" href="$dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a" title="Insert a node at start of list." alt="" coords="205,252,312,277"/>
<area shape="rect" id="node11" href="$dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b" title="Insert a node at end of list." alt="" coords="211,301,307,327"/>
<area shape="rect" id="node5" href="$df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" title="This function gets the next item from the Vector each time it&#39;s called." alt="" coords="393,55,439,80"/>
<area shape="rect" id="node10" href="$dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" title="Create a list node." alt="" coords="369,276,463,301"/>
</map>

1
dd/d19/circular__doubly__linked__list_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
b5a6ce5f5a303d5caf937d1882c63ae7

177
dd/d19/circular__doubly__linked__list_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@ -0,0 +1,177 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: main Pages: 1 -->
<svg width="351pt" height="249pt"
viewBox="0.00 0.00 351.00 249.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="38,-130 0,-130 0,-111 38,-111 38,-130"/>
<text text-anchor="middle" x="19" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="107,-130 74,-130 74,-111 107,-111 107,-130"/>
<text text-anchor="middle" x="90.5" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M38.26,-120.5C45.72,-120.5 54.5,-120.5 62.66,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.44,-124 72.44,-120.5 62.44,-117 62.44,-124"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456" target="_top" xlink:title="Function for deletion of the first node in list.">
<polygon fill="white" stroke="#666666" points="237,-241 143,-241 143,-222 237,-222 237,-241"/>
<text text-anchor="middle" x="190" y="-229" font-family="Helvetica,sans-Serif" font-size="10.00">delete_from_head</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M94.45,-130.36C100.54,-149.09 116.2,-190.04 143,-213.5 143.94,-214.32 144.91,-215.1 145.92,-215.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.06,-218.81 154.43,-220.95 147.66,-212.81 144.06,-218.81"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72" target="_top" xlink:title="Function for deletion of the last node in list.">
<polygon fill="white" stroke="#666666" points="233,-204 147,-204 147,-185 233,-185 233,-204"/>
<text text-anchor="middle" x="190" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">delete_from_tail</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M98.44,-130.49C107.45,-142.8 124.25,-163.67 143,-176.5 144.56,-177.57 146.19,-178.58 147.86,-179.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.97,-182.51 156.48,-183.86 149.11,-176.25 145.97,-182.51"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e" target="_top" xlink:title="Display list function.">
<polygon fill="white" stroke="#666666" points="222.5,-167 157.5,-167 157.5,-148 222.5,-148 222.5,-167"/>
<text text-anchor="middle" x="190" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">display_list</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="#63b8ff" d="M107.17,-126.44C119.32,-131.06 136.68,-137.65 152.29,-143.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.72,-146.71 161.31,-146.99 153.2,-140.17 150.72,-146.71"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1" target="_top" xlink:title="access the list by index">
<polygon fill="white" stroke="#666666" points="205,-130 175,-130 175,-111 205,-111 205,-130"/>
<text text-anchor="middle" x="190" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node2&#45;&gt;Node7</title>
<path fill="none" stroke="#63b8ff" d="M107.17,-120.5C122.3,-120.5 145.48,-120.5 163.32,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.13,-124 173.13,-120.5 163.13,-117 163.13,-124"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c" target="_top" xlink:title="The function that will return current size of list.">
<polygon fill="white" stroke="#666666" points="214,-93 166,-93 166,-74 214,-74 214,-93"/>
<text text-anchor="middle" x="190" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">getsize</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node8</title>
<path fill="none" stroke="#63b8ff" d="M107.17,-114.56C120.15,-109.63 139.06,-102.45 155.43,-96.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.21,-99.69 164.32,-92.87 153.73,-93.14 156.21,-99.69"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a" target="_top" xlink:title="Insert a node at start of list.">
<polygon fill="white" stroke="#666666" points="230,-56 150,-56 150,-37 230,-37 230,-56"/>
<text text-anchor="middle" x="190" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_head</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node2&#45;&gt;Node9</title>
<path fill="none" stroke="#63b8ff" d="M98.52,-110.75C107.61,-98.73 124.49,-78.3 143,-65.5 145.08,-64.06 147.28,-62.71 149.56,-61.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.04,-64.6 158.44,-57.03 147.93,-58.33 151.04,-64.6"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b" target="_top" xlink:title="Insert a node at end of list.">
<polygon fill="white" stroke="#666666" points="226,-19 154,-19 154,0 226,0 226,-19"/>
<text text-anchor="middle" x="190" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_tail</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge10" class="edge">
<title>Node2&#45;&gt;Node11</title>
<path fill="none" stroke="#63b8ff" d="M94.62,-110.5C100.89,-91.92 116.72,-51.83 143,-28.5 144.42,-27.24 145.94,-26.05 147.52,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.97,-28.15 155.86,-20.1 145.45,-22.1 148.97,-28.15"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f" target="_top" xlink:title="This function gets the next item from the Vector each time it&#39;s called.">
<polygon fill="white" stroke="#666666" points="325.5,-204 290.5,-204 290.5,-185 325.5,-185 325.5,-204"/>
<text text-anchor="middle" x="308" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M233.21,-194.5C248.44,-194.5 265.24,-194.5 278.96,-194.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="278.6,-198 288.6,-194.5 278.6,-191 278.6,-198"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" target="_top" xlink:title="Create a list node.">
<polygon fill="white" stroke="#666666" points="343,-38 273,-38 273,-19 343,-19 343,-38"/>
<text text-anchor="middle" x="308" y="-26" font-family="Helvetica,sans-Serif" font-size="10.00">create_node</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="#63b8ff" d="M230.27,-40.41C240.3,-38.85 251.17,-37.16 261.48,-35.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="261.97,-39.03 271.32,-34.04 260.9,-32.11 261.97,-39.03"/>
</g>
<!-- Node11&#45;&gt;Node10 -->
<g id="edge11" class="edge">
<title>Node11&#45;&gt;Node10</title>
<path fill="none" stroke="#63b8ff" d="M226.43,-15.3C237.43,-17.1 249.7,-19.12 261.29,-21.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="260.65,-24.45 271.09,-22.62 261.78,-17.55 260.65,-24.45"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.8 KiB

4
dd/d19/circular__doubly__linked__list_8c_aee328f691615862c4298fe730d66027b_cgraph.map Normal file
View File

@ -0,0 +1,4 @@
<map id="insert_at_tail" name="insert_at_tail">
<area shape="rect" id="node1" title="Insert a node at end of list." alt="" coords="5,5,101,31"/>
<area shape="rect" id="node2" href="$dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" title="Create a list node." alt="" coords="149,5,243,31"/>
</map>

1
dd/d19/circular__doubly__linked__list_8c_aee328f691615862c4298fe730d66027b_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
13d8348ac8ca227eb80c51d606493f00

36
dd/d19/circular__doubly__linked__list_8c_aee328f691615862c4298fe730d66027b_cgraph.svg Normal file
View File

@ -0,0 +1,36 @@
<?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 7.1.0 (20230121.1956)
-->
<!-- Title: insert_at_tail Pages: 1 -->
<svg width="186pt" height="27pt"
viewBox="0.00 0.00 186.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23)">
<title>insert_at_tail</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Insert a node at end of list.">
<polygon fill="#999999" stroke="#666666" points="72,-19 0,-19 0,0 72,0 72,-19"/>
<text text-anchor="middle" x="36" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">insert_at_tail</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b" target="_top" xlink:title="Create a list node.">
<polygon fill="white" stroke="#666666" points="178,-19 108,-19 108,0 178,0 178,-19"/>
<text text-anchor="middle" x="143" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">create_node</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M72.26,-9.5C80.03,-9.5 88.37,-9.5 96.49,-9.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.21,-13 106.21,-9.5 96.21,-6 96.21,-13"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.5 KiB

2
dd/d29/doubly__linked__list_8c.html
View File

@ -286,7 +286,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 231</span> <span class="keywordflow">return</span> <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>;</div>
<div class="line"><span class="lineno"> 232</span> }</div>
<div class="line"><span class="lineno"> 233</span>}</div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">pointer to the node</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
<div class="ttc" id="astructnode_html_a111a569ab2765add9b91c9f94cf9f063"><div class="ttname"><a href="../../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063">node::next</a></div><div class="ttdeci">struct node * next</div><div class="ttdoc">List pointers.</div><div class="ttdef"><b>Definition:</b> bfs.c:24</div></div>
</div><!-- fragment -->
</div>
</div>

4
dd/d75/structqueue__coll__graph.map
View File

@ -1,4 +1,4 @@
<map id="queue" name="queue">
<area shape="rect" id="node1" title=" " alt="" coords="5,200,63,225"/>
<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="9,51,59,77"/>
<area shape="rect" id="node1" title=" " alt="" coords="5,215,63,240"/>
<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="9,59,59,84"/>
</map>

2
dd/d75/structqueue__coll__graph.md5
View File

@ -1 +1 @@
6bf0f1a3818b7c4fc1ac36cec804d053
bb2e86347259e0f0a8fe9585a5288d19

31
dd/d75/structqueue__coll__graph.svg
View File

@ -4,9 +4,9 @@
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: queue Pages: 1 -->
<svg width="110pt" height="173pt"
viewBox="0.00 0.00 109.50 173.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 169)">
<svg width="110pt" height="184pt"
viewBox="0.00 0.00 109.50 184.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 180)">
<title>queue</title>
<!-- Node1 -->
<g id="node1" class="node">
@ -21,30 +21,31 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d5/da1/structnode.html" target="_top" xlink:title="Node, the basic data structure in the tree.">
<polygon fill="white" stroke="#666666" points="40.5,-130.5 2.5,-130.5 2.5,-111.5 40.5,-111.5 40.5,-130.5"/>
<text text-anchor="middle" x="21.5" y="-118.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
<polygon fill="white" stroke="#666666" points="40.5,-136 2.5,-136 2.5,-117 40.5,-117 40.5,-136"/>
<text text-anchor="middle" x="21.5" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M21.5,-99.73C21.5,-75.67 21.5,-36.62 21.5,-19.28"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="18,-99.53 21.5,-109.53 25,-99.53 18,-99.53"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M21.5,-105.37C21.5,-79.99 21.5,-37.48 21.5,-19.24"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="18,-105.34 21.5,-115.34 25,-105.34 18,-105.34"/>
<text text-anchor="middle" x="33" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00"> front</text>
<text text-anchor="middle" x="33" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">rear</text>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M42.54,-134.58C51.19,-135.46 58.5,-130.93 58.5,-121 58.5,-107.03 44.04,-103.75 31.73,-111.18"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="43.75,-131.3 33.16,-131.32 41.46,-137.91 43.75,-131.3"/>
<text text-anchor="middle" x="80" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="80" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="80" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="80" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="80" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="80" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M41.15,-140.9C50.39,-142.55 58.5,-137.75 58.5,-126.5 58.5,-111.01 43.14,-107.75 30.6,-116.7"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="42.56,-137.7 31.99,-136.9 39.76,-144.11 42.56,-137.7"/>
<text text-anchor="middle" x="80" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="80" y="-157" font-family="Helvetica,sans-Serif" font-size="10.00">leftNode</text>
<text text-anchor="middle" x="80" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">link</text>
<text text-anchor="middle" x="80" y="-135" font-family="Helvetica,sans-Serif" font-size="10.00">next</text>
<text text-anchor="middle" x="80" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">par</text>
<text text-anchor="middle" x="80" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">pre</text>
<text text-anchor="middle" x="80" y="-102" font-family="Helvetica,sans-Serif" font-size="10.00">prev</text>
<text text-anchor="middle" x="80" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
<text text-anchor="middle" x="80" y="-80" font-family="Helvetica,sans-Serif" font-size="10.00">rightNode</text>
</g>

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

2
dir_261dd1200fad5b2fe1eca9af8320656e.html
View File

@ -109,6 +109,8 @@ Directory dependency graph for linked_list:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d19/circular__doubly__linked__list_8c.html">circular_doubly_linked_list.c</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d29/doubly__linked__list_8c.html">doubly_linked_list.c</a></td></tr>
<tr class="memdesc:dd/d29/doubly__linked__list_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Doubly_linked_list" target="_blank">Doubly linked list</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_261dd1200fad5b2fe1eca9af8320656e.js
View File

@ -1,4 +1,5 @@
var dir_261dd1200fad5b2fe1eca9af8320656e =
[
[ "circular_doubly_linked_list.c", "dd/d19/circular__doubly__linked__list_8c.html", "dd/d19/circular__doubly__linked__list_8c" ],
[ "doubly_linked_list.c", "dd/d29/doubly__linked__list_8c.html", "dd/d29/doubly__linked__list_8c" ]
];

3
files.html
View File

@ -144,7 +144,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_3_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_5_" class="arrow" onclick="toggleFolder('3_5_')">&#9658;</span><span id="img_3_5_" class="iconfclosed" onclick="toggleFolder('3_5_')">&#160;</span><a class="el" href="dir_955029374964e51cf770754b424e7d39.html" target="_self">hash_set</a></td><td class="desc"></td></tr>
<tr id="row_3_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="dc/de3/hash__set_8h_source.html"><span class="icondoc"></span></a><b>hash_set.h</b></td><td class="desc"></td></tr>
<tr id="row_3_6_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_6_" class="arrow" onclick="toggleFolder('3_6_')">&#9658;</span><span id="img_3_6_" class="iconfclosed" onclick="toggleFolder('3_6_')">&#160;</span><a class="el" href="dir_261dd1200fad5b2fe1eca9af8320656e.html" target="_self">linked_list</a></td><td class="desc"></td></tr>
<tr id="row_3_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d29/doubly__linked__list_8c.html" target="_self">doubly_linked_list.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Doubly_linked_list" target="_blank">Doubly linked list</a> </td></tr>
<tr id="row_3_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d19/circular__doubly__linked__list_8c.html" target="_self">circular_doubly_linked_list.c</a></td><td class="desc"></td></tr>
<tr id="row_3_6_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d29/doubly__linked__list_8c.html" target="_self">doubly_linked_list.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Doubly_linked_list" target="_blank">Doubly linked list</a> </td></tr>
<tr id="row_3_7_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_7_" class="arrow" onclick="toggleFolder('3_7_')">&#9658;</span><span id="img_3_7_" class="iconfclosed" onclick="toggleFolder('3_7_')">&#160;</span><a class="el" href="dir_b6018f60d424a2ef7e4c942ac681e38b.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_3_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="da/d23/list_8h_source.html"><span class="icondoc"></span></a><b>list.h</b></td><td class="desc"></td></tr>
<tr id="row_3_8_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_8_" class="arrow" onclick="toggleFolder('3_8_')">&#9658;</span><span id="img_3_8_" class="iconfclosed" onclick="toggleFolder('3_8_')">&#160;</span><a class="el" href="dir_fb09f588f9daea69f78b63a0310e98cc.html" target="_self">queue</a></td><td class="desc"></td></tr>

2
functions.html
View File

@ -224,7 +224,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
<h3><a id="index_v" name="index_v"></a>- v -</h3><ul>
<li>value&#160;:&#160;<a class="el" href="dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int</a>, <a class="el" href="d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41">list</a></li>
<li>value&#160;:&#160;<a class="el" href="dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int</a>, <a class="el" href="d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41">list</a>, <a class="el" href="d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">node</a></li>
</ul>

2
functions_vars.html
View File

@ -224,7 +224,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_v" name="index_v"></a>- v -</h3><ul>
<li>value&#160;:&#160;<a class="el" href="dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int</a>, <a class="el" href="d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41">list</a></li>
<li>value&#160;:&#160;<a class="el" href="dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008">_big_int</a>, <a class="el" href="d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41">list</a>, <a class="el" href="d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5">node</a></li>
</ul>

2
globals_c.html
View File

@ -128,7 +128,7 @@ $(document).ready(function(){initNavTree('globals_c.html',''); initResizable();
<li>crc32()&#160;:&#160;<a class="el" href="d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567">hash_crc32.c</a></li>
<li>create()&#160;:&#160;<a class="el" href="dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f">doubly_linked_list.c</a></li>
<li>create_matrix()&#160;:&#160;<a class="el" href="d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">qr_eigen_values.c</a></li>
<li>create_node()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d">threaded_binary_trees.c</a></li>
<li>create_node()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d">threaded_binary_trees.c</a>, <a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">circular_doubly_linked_list.c</a></li>
<li>create_polynomial()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d">poly_add.c</a></li>
</ul>
</div><!-- contents -->

3
globals_d.html
View File

@ -107,8 +107,11 @@ $(document).ready(function(){initNavTree('globals_d.html',''); initResizable();
<li>delete()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a6983e8a91a3d25d7d000807f18ba2748">binary_search_tree.c</a>, <a class="el" href="dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446">doubly_linked_list.c</a>, <a class="el" href="df/dfa/vector_8c.html#a2191fb0b42377eb385e1daf04bdfb939">vector.c</a></li>
<li>delete_adaline()&#160;:&#160;<a class="el" href="da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665">adaline_learning.c</a></li>
<li>delete_bt()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317">threaded_binary_trees.c</a></li>
<li>delete_from_head()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456">circular_doubly_linked_list.c</a></li>
<li>delete_from_tail()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72">circular_doubly_linked_list.c</a></li>
<li>delete_number()&#160;:&#160;<a class="el" href="d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae">factorial_large_number.c</a></li>
<li>display()&#160;:&#160;<a class="el" href="dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">lu_decompose.c</a>, <a class="el" href="d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">bubble_sort.c</a></li>
<li>display_list()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">circular_doubly_linked_list.c</a></li>
<li>display_polynomial()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d">poly_add.c</a></li>
<li>divisors&#160;:&#160;<a class="el" href="d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6">sol2.c</a></li>
<li>djb2()&#160;:&#160;<a class="el" href="d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b">hash_djb2.c</a></li>

2
globals_defs.html
View File

@ -144,8 +144,8 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
<li>malloc&#160;:&#160;<a class="el" href="d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc_dbg.h</a></li>
<li>max&#160;:&#160;<a class="el" href="d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>, <a class="el" href="d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a></li>
<li>MAX&#160;:&#160;<a class="el" href="dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">client.c</a>, <a class="el" href="d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326">server.c</a>, <a class="el" href="d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326">prim.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326">bubble_sort_2.c</a></li>
<li>max&#160;:&#160;<a class="el" href="d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>, <a class="el" href="d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a></li>
<li>MAX_ADALINE_ITER&#160;:&#160;<a class="el" href="da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f">adaline_learning.c</a></li>
<li>MAX_DENO&#160;:&#160;<a class="el" href="d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">sol1.c</a></li>
<li>MAX_DIGITS&#160;:&#160;<a class="el" href="d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">sol1.c</a></li>

2
globals_func_c.html
View File

@ -125,7 +125,7 @@ $(document).ready(function(){initNavTree('globals_func_c.html',''); initResizabl
<li>crc32()&#160;:&#160;<a class="el" href="d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567">hash_crc32.c</a></li>
<li>create()&#160;:&#160;<a class="el" href="dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f">doubly_linked_list.c</a></li>
<li>create_matrix()&#160;:&#160;<a class="el" href="d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0">qr_eigen_values.c</a></li>
<li>create_node()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d">threaded_binary_trees.c</a></li>
<li>create_node()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d">threaded_binary_trees.c</a>, <a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b">circular_doubly_linked_list.c</a></li>
<li>create_polynomial()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d">poly_add.c</a></li>
</ul>
</div><!-- contents -->

3
globals_func_d.html
View File

@ -107,8 +107,11 @@ $(document).ready(function(){initNavTree('globals_func_d.html',''); initResizabl
<li>delete()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a6983e8a91a3d25d7d000807f18ba2748">binary_search_tree.c</a>, <a class="el" href="dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446">doubly_linked_list.c</a>, <a class="el" href="df/dfa/vector_8c.html#a2191fb0b42377eb385e1daf04bdfb939">vector.c</a></li>
<li>delete_adaline()&#160;:&#160;<a class="el" href="da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665">adaline_learning.c</a></li>
<li>delete_bt()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317">threaded_binary_trees.c</a></li>
<li>delete_from_head()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456">circular_doubly_linked_list.c</a></li>
<li>delete_from_tail()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72">circular_doubly_linked_list.c</a></li>
<li>delete_number()&#160;:&#160;<a class="el" href="d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae">factorial_large_number.c</a></li>
<li>display()&#160;:&#160;<a class="el" href="dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">lu_decompose.c</a>, <a class="el" href="d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">bubble_sort.c</a></li>
<li>display_list()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e">circular_doubly_linked_list.c</a></li>
<li>display_polynomial()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d">poly_add.c</a></li>
<li>djb2()&#160;:&#160;<a class="el" href="d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b">hash_djb2.c</a></li>
<li>dot_prod()&#160;:&#160;<a class="el" href="de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84">vectors_3d.c</a></li>

3
globals_func_g.html
View File

@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('globals_func_g.html',''); initResizabl
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
<li>gcd()&#160;:&#160;<a class="el" href="d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">sol3.c</a></li>
<li>get()&#160;:&#160;<a class="el" href="df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250">vector.c</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">circular_doubly_linked_list.c</a>, <a class="el" href="df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250">vector.c</a></li>
<li>get_angle()&#160;:&#160;<a class="el" href="de/d7b/group__vec__3d.html#ga55be1d766c8a824b35d97e79744834d8">vectors_3d.c</a></li>
<li>get_ch()&#160;:&#160;<a class="el" href="d9/deb/min__printf_8h.html#a409d428c337bf5476567a228274f49f1">min_printf.h</a></li>
<li>get_clock_diff()&#160;:&#160;<a class="el" href="d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908">kohonen_som_trace.c</a></li>
@ -122,6 +122,7 @@ $(document).ready(function(){initNavTree('globals_func_g.html',''); initResizabl
<li>getMax()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#ad50f3debc5323bb7b71933effb64f30f">binary_search_tree.c</a></li>
<li>getPointerToWord()&#160;:&#160;<a class="el" href="d3/d78/words__alphabetical_8c.html#a9e3cab68cf6557024f0073f674a307a1">words_alphabetical.c</a></li>
<li>getPrecedence()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787">infix_to_postfix.c</a>, <a class="el" href="dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65">shunting_yard.c</a></li>
<li>getsize()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">circular_doubly_linked_list.c</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

2
globals_func_i.html
View File

@ -105,6 +105,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>inOrder()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc">binary_search_tree.c</a></li>
<li>inorder_display()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7">threaded_binary_trees.c</a></li>
<li>insert()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a031cc98830742bca57c0da81a0fb779f">binary_search_tree.c</a>, <a class="el" href="dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918">doubly_linked_list.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36">non_preemptive_priority_scheduling.c</a></li>
<li>insert_at_head()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a">circular_doubly_linked_list.c</a></li>
<li>insert_at_tail()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b">circular_doubly_linked_list.c</a></li>
<li>insert_bt()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb">threaded_binary_trees.c</a></li>
<li>insertionSort()&#160;:&#160;<a class="el" href="db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb">insertion_sort.c</a></li>
<li>int_to_string()&#160;:&#160;<a class="el" href="dd/d53/int__to__string_8c.html#aeb4be1a1db1c5fea06e9d8b87e6c3973">int_to_string.c</a></li>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

3
globals_g.html
View File

@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('globals_g.html',''); initResizable();
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
<li>gcd()&#160;:&#160;<a class="el" href="d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">sol3.c</a></li>
<li>get()&#160;:&#160;<a class="el" href="df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250">vector.c</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1">circular_doubly_linked_list.c</a>, <a class="el" href="df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250">vector.c</a></li>
<li>get_angle()&#160;:&#160;<a class="el" href="de/d7b/group__vec__3d.html#ga55be1d766c8a824b35d97e79744834d8">vectors_3d.c</a></li>
<li>get_ch()&#160;:&#160;<a class="el" href="d9/deb/min__printf_8h.html#a409d428c337bf5476567a228274f49f1">min_printf.h</a></li>
<li>get_clock_diff()&#160;:&#160;<a class="el" href="d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908">kohonen_som_trace.c</a></li>
@ -122,6 +122,7 @@ $(document).ready(function(){initNavTree('globals_g.html',''); initResizable();
<li>getMax()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#ad50f3debc5323bb7b71933effb64f30f">binary_search_tree.c</a></li>
<li>getPointerToWord()&#160;:&#160;<a class="el" href="d3/d78/words__alphabetical_8c.html#a9e3cab68cf6557024f0073f674a307a1">words_alphabetical.c</a></li>
<li>getPrecedence()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787">infix_to_postfix.c</a>, <a class="el" href="dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65">shunting_yard.c</a></li>
<li>getsize()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c">circular_doubly_linked_list.c</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

2
globals_i.html
View File

@ -105,6 +105,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>inOrder()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc">binary_search_tree.c</a></li>
<li>inorder_display()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7">threaded_binary_trees.c</a></li>
<li>insert()&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#a031cc98830742bca57c0da81a0fb779f">binary_search_tree.c</a>, <a class="el" href="dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918">doubly_linked_list.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36">non_preemptive_priority_scheduling.c</a></li>
<li>insert_at_head()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a">circular_doubly_linked_list.c</a></li>
<li>insert_at_tail()&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b">circular_doubly_linked_list.c</a></li>
<li>insert_bt()&#160;:&#160;<a class="el" href="df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb">threaded_binary_trees.c</a></li>
<li>insertionSort()&#160;:&#160;<a class="el" href="db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb">insertion_sort.c</a></li>
<li>INT_MAX_LENGTH&#160;:&#160;<a class="el" href="d9/deb/min__printf_8h.html#ab47a4bec9213d96e1dba5171e5db0e25">min_printf.h</a></li>

1
globals_l.html
View File

@ -110,6 +110,7 @@ $(document).ready(function(){initNavTree('globals_l.html',''); initResizable();
<li>len()&#160;:&#160;<a class="el" href="df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93">vector.c</a></li>
<li>LIMS&#160;:&#160;<a class="el" href="d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">qr_eigen_values.c</a></li>
<li>List&#160;:&#160;<a class="el" href="dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7">doubly_linked_list.c</a></li>
<li>ListNode&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">circular_doubly_linked_list.c</a></li>
<li>lu_decomposition()&#160;:&#160;<a class="el" href="dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4">lu_decompose.c</a></li>
</ul>
</div><!-- contents -->

4
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_t.html
View File

File diff suppressed because one or more lines are too long

1
globals_type.html
View File

@ -106,6 +106,7 @@ $(document).ready(function(){initNavTree('globals_type.html',''); initResizable(
<li>euler&#160;:&#160;<a class="el" href="dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd">geometry_datatypes.h</a></li>
<li>large_num&#160;:&#160;<a class="el" href="d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d">factorial_large_number.c</a></li>
<li>List&#160;:&#160;<a class="el" href="dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7">doubly_linked_list.c</a></li>
<li>ListNode&#160;:&#160;<a class="el" href="dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899">circular_doubly_linked_list.c</a></li>
<li>mat_3x3&#160;:&#160;<a class="el" href="dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7">geometry_datatypes.h</a></li>
<li>mem_info&#160;:&#160;<a class="el" href="db/d84/malloc__dbg_8c.html#ab6619fb17769f2e4e2e36c9ef2dda3c6">malloc_dbg.c</a></li>
<li>node&#160;:&#160;<a class="el" href="da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">binary_search_tree.c</a>, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">threaded_binary_trees.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">non_preemptive_priority_scheduling.c</a></li>

6
navtreedata.js
View File

@ -134,9 +134,9 @@ var NAVTREEINDEX =
[
"annotated.html",
"d4/d68/qr__decompose_8h.html",
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d",
"dc/d73/shunting__yard_8c.html#aa8dca7b867074164d5f45b0f3851269d",
"dir_bd4a7dd282074645ef41b1ea31ac813a.html"
"d7/dfd/structdual__quat__.html",
"dc/d73/shunting__yard_8c.html#a4ea3d659fb78b0de0fcc88188815d013",
"dir_8c6743d405e8ed13cc39f42e382307fd.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

6
navtreeindex1.js
View File

@ -110,9 +110,10 @@ var NAVTREEINDEX1 =
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3],
"d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b":[15,0,28,7],
"d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5":[15,0,28,10],
"d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[15,0,28,8],
"d5/da1/structnode.html#a5507c3c76ddbda9c482749f3a8a8f0cc":[15,0,28,0],
"d5/da1/structnode.html#a878d22393f374f3861035e35b9edd653":[15,0,28,10],
"d5/da1/structnode.html#a878d22393f374f3861035e35b9edd653":[15,0,28,11],
"d5/da1/structnode.html#abbe30696293849bebed90520b8cf7ba3":[15,0,28,9],
"d5/da1/structnode.html#ac0a6453f996d4c362c015fd4348ecc6e":[15,0,28,1],
"d5/da1/structnode.html#ac0c8b57ac0a76d72588561c81481c454":[15,0,28,4],
@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
"d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,12,0,4],
"d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[16,0,18,12,0,2],
"d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,18,12,0,0],
"d7/de0/stack_8h_source.html":[16,0,3,9,1],
"d7/dfd/structdual__quat__.html":[14,0,3,0]
"d7/de0/stack_8h_source.html":[16,0,3,9,1]
};

4
navtreeindex2.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX2 =
{
"d7/dfd/structdual__quat__.html":[14,0,3,0],
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d":[14,0,3,0,0],
"d7/dfd/structdual__quat__.html#ad663036ace6a586f90a2f89386f7731a":[14,0,3,0,1],
"d8/d10/structlist.html":[15,0,21],
@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
"dc/d64/md__coding_guidelines.html#autotoc_md14":[2,0],
"dc/d64/md__coding_guidelines.html#autotoc_md16":[2,1],
"dc/d73/shunting__yard_8c.html":[16,0,15,5],
"dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65":[16,0,15,5,1],
"dc/d73/shunting__yard_8c.html#a4ea3d659fb78b0de0fcc88188815d013":[16,0,15,5,0]
"dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65":[16,0,15,5,1]
};

46
navtreeindex3.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX3 =
{
"dc/d73/shunting__yard_8c.html#a4ea3d659fb78b0de0fcc88188815d013":[16,0,15,5,0],
"dc/d73/shunting__yard_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,15,5,4],
"dc/d73/shunting__yard_8c.html#aab4ea5886f3335a6c26621ccce6bce8f":[16,0,15,5,3],
"dc/d73/shunting__yard_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,5,2],
@ -42,15 +43,27 @@ var NAVTREEINDEX3 =
"dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a":[15,0,36,2],
"dd/d11/test__malloc__dbg_8c.html":[16,0,4,3],
"dd/d11/test__malloc__dbg_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,4,3,0],
"dd/d29/doubly__linked__list_8c.html":[16,0,3,6,0],
"dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918":[16,0,3,6,0,5],
"dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0":[16,0,3,6,0,7],
"dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f":[16,0,3,6,0,2],
"dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446":[16,0,3,6,0,3],
"dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7":[16,0,3,6,0,1],
"dd/d29/doubly__linked__list_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,6,0,6],
"dd/d29/doubly__linked__list_8c.html#aedd04074dbc6af0de89051f97209311b":[16,0,3,6,0,8],
"dd/d29/doubly__linked__list_8c.html#afa2b50f4716fc3b42221a72e676e1422":[16,0,3,6,0,4],
"dd/d19/circular__doubly__linked__list_8c.html":[16,0,3,6,0],
"dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456":[16,0,3,6,0,3],
"dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b":[16,0,3,6,0,2],
"dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e":[16,0,3,6,0,5],
"dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c":[16,0,3,6,0,7],
"dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899":[16,0,3,6,0,1],
"dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a":[16,0,3,6,0,8],
"dd/d19/circular__doubly__linked__list_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,3,6,0,11],
"dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72":[16,0,3,6,0,4],
"dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1":[16,0,3,6,0,6],
"dd/d19/circular__doubly__linked__list_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,6,0,10],
"dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b":[16,0,3,6,0,9],
"dd/d29/doubly__linked__list_8c.html":[16,0,3,6,1],
"dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918":[16,0,3,6,1,5],
"dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0":[16,0,3,6,1,7],
"dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f":[16,0,3,6,1,2],
"dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446":[16,0,3,6,1,3],
"dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7":[16,0,3,6,1,1],
"dd/d29/doubly__linked__list_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,6,1,6],
"dd/d29/doubly__linked__list_8c.html#aedd04074dbc6af0de89051f97209311b":[16,0,3,6,1,8],
"dd/d29/doubly__linked__list_8c.html#afa2b50f4716fc3b42221a72e676e1422":[16,0,3,6,1,4],
"dd/d53/int__to__string_8c.html":[16,0,2,7],
"dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,2,7,2],
"dd/d53/int__to__string_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,7,1],
@ -236,18 +249,5 @@ var NAVTREEINDEX3 =
"dir_7445e5a68245b48f3c03982b6d501815.html":[16,0,3,2],
"dir_76784a7b04633629b9ecb5543b9ad889.html":[16,0,6,2],
"dir_81f43aa0067826ea5befe80cd7aefcc5.html":[16,0,6,3],
"dir_8a20dd5bfd5341a725342bf72b6b686f.html":[16,0,5],
"dir_8c6743d405e8ed13cc39f42e382307fd.html":[16,0,18,0],
"dir_955029374964e51cf770754b424e7d39.html":[16,0,3,5],
"dir_9babc524d57e25f3d9f4179cabc3599e.html":[16,0,2],
"dir_9c6faab82c22511b50177aa2e38e2780.html":[16,0,16],
"dir_a4300992e825aa9b9238bf43160a241e.html":[16,0,10],
"dir_a52f4d3d586a58b02f3a4ddf0a992157.html":[16,0,15],
"dir_a5f32cf82ad289a7dac212f63f40f55b.html":[16,0,0],
"dir_aba97bf327db94061e830e9bc18e925d.html":[16,0,18,4],
"dir_abf1a26ece768c4076e73592705ae077.html":[16,0,4],
"dir_b2dbfa46230fd9f775c32c1836ed3764.html":[16,0,18,15],
"dir_b3d331eabd4234f247030c297aaf021c.html":[16,0,18],
"dir_b6018f60d424a2ef7e4c942ac681e38b.html":[16,0,3,7],
"dir_bb1b521853a9c46347182a9d10420771.html":[16,0,20]
"dir_8a20dd5bfd5341a725342bf72b6b686f.html":[16,0,5]
};

17
navtreeindex4.js
View File

@ -1,5 +1,18 @@
var NAVTREEINDEX4 =
{
"dir_8c6743d405e8ed13cc39f42e382307fd.html":[16,0,18,0],
"dir_955029374964e51cf770754b424e7d39.html":[16,0,3,5],
"dir_9babc524d57e25f3d9f4179cabc3599e.html":[16,0,2],
"dir_9c6faab82c22511b50177aa2e38e2780.html":[16,0,16],
"dir_a4300992e825aa9b9238bf43160a241e.html":[16,0,10],
"dir_a52f4d3d586a58b02f3a4ddf0a992157.html":[16,0,15],
"dir_a5f32cf82ad289a7dac212f63f40f55b.html":[16,0,0],
"dir_aba97bf327db94061e830e9bc18e925d.html":[16,0,18,4],
"dir_abf1a26ece768c4076e73592705ae077.html":[16,0,4],
"dir_b2dbfa46230fd9f775c32c1836ed3764.html":[16,0,18,15],
"dir_b3d331eabd4234f247030c297aaf021c.html":[16,0,18],
"dir_b6018f60d424a2ef7e4c942ac681e38b.html":[16,0,3,7],
"dir_bb1b521853a9c46347182a9d10420771.html":[16,0,20],
"dir_bd4a7dd282074645ef41b1ea31ac813a.html":[16,0,3,3],
"dir_c7ef0fcb2f2095a74f0a3a1634dfc798.html":[16,0,3,0],
"dir_d20ad0b8de644c123692ba5582cc7a7b.html":[16,0,1],
@ -18,8 +31,8 @@ var NAVTREEINDEX4 =
"files.html":[16,0],
"functions.html":[15,2,0],
"functions_vars.html":[15,2,1],
"globals.html":[16,1,0,0],
"globals.html":[16,1,0],
"globals.html":[16,1,0,0],
"globals_a.html":[16,1,0,1],
"globals_b.html":[16,1,0,2],
"globals_c.html":[16,1,0,3],
@ -73,8 +86,8 @@ var NAVTREEINDEX4 =
"globals_vars.html":[16,1,2],
"globals_w.html":[16,1,0,23],
"globals_x.html":[16,1,0,24],
"index.html":[0],
"index.html":[],
"index.html":[0],
"index.html#autotoc_md77":[0,0],
"index.html#autotoc_md78":[0,1],
"index.html#autotoc_md79":[0,2],

2
search/all_16.js
View File

File diff suppressed because one or more lines are too long

2
search/all_18.js
View File

@ -2,7 +2,7 @@ var searchData=
[
['validateposition_0',['validatePosition',['../db/de2/naval__battle_8c.html#a4a5686c91f144d07eff1c6576303962d',1,'naval_battle.c']]],
['validentrylinecolumn_1',['validEntryLineColumn',['../db/de2/naval__battle_8c.html#a7c5042bd35c4186b06ae28f06635b40e',1,'naval_battle.c']]],
['value_2',['value',['../d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41',1,'list::value()'],['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int::value()']]],
['value_2',['value',['../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5',1,'node::value()'],['../d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41',1,'list::value()'],['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int::value()']]],
['vec_5f3d_3',['vec_3d',['../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270',1,'geometry_datatypes.h']]],
['vec_5f3d_5f_4',['vec_3d_',['../d5/db4/structvec__3d__.html',1,'']]],
['vector_5',['Vector',['../d4/d06/struct_vector.html',1,'']]],

55
search/all_5.js
View File

@ -19,31 +19,32 @@ var searchData=
['celsius_5fto_5ffahrenheit_2ec_16',['celsius_to_fahrenheit.c',['../d0/d51/celsius__to__fahrenheit_8c.html',1,'']]],
['check_5fnumber_17',['check_number',['../dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3',1,'check_number(unsigned long long n):&#160;sol1.c'],['../d5/d3d/problem__5_2sol2_8c.html#aa7cfa5a28d00d93ec48fab9c3fd5812f',1,'check_number(unsigned long long n):&#160;sol2.c']]],
['check_5ftermination_18',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
['clear_19',['clear',['../df/dfa/vector_8c.html#ab9dfc1249180f1e924b7333a4e5d133a',1,'vector.c']]],
['client_2ec_20',['client.c',['../dd/d93/client_8c.html',1,'']]],
['closefile_21',['closeFile',['../d3/d78/words__alphabetical_8c.html#af1f9b6eb320d872ba0766dc8bd070075',1,'words_alphabetical.c']]],
['cluster_22',['cluster',['../d1/d99/structcluster.html',1,'']]],
['code_20style_20convention_23',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
['coef_24',['coef',['../df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b',1,'term']]],
['collatz_25',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['collatz_2ec_26',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]],
['combine_27',['combine',['../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df',1,'segment_tree']]],
['combine_5ffunction_28',['combine_function',['../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8',1,'segment_tree.c']]],
['compare_29',['compare',['../d2/d87/non__preemptive__priority__scheduling_8c.html#a01b8ee561d8532a44d665c2c854e0d09',1,'compare(node *a, node *b):&#160;non_preemptive_priority_scheduling.c'],['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'compare(const void *a, const void *b):&#160;sol1.c']]],
['complex_5fstr_30',['complex_str',['../da/d38/durand__kerner__roots_8c.html#a46197e91f478e99a2229562aaaac311e',1,'durand_kerner_roots.c']]],
['contents_31',['contents',['../d4/d06/struct_vector.html#afd870750f3874ee097833fc8a1dc809e',1,'Vector']]],
['contribution_20guidelines_32',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
['contributor_20covenant_20code_20of_20conduct_33',['Contributor Covenant Code of Conduct',['../d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html',1,'']]],
['convert_34',['convert',['../db/d0c/infix__to__postfix_8c.html#a92af69ffc1e1f965ebce6a44672e96b1',1,'convert(char infix[], char postfix[]):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#ae363a3863a8bfbf40e7a95c2b9dbe71b',1,'convert(char inf[]):&#160;infix_to_postfix2.c'],['../d0/df3/6_8c.html#afdf3bfe2dc8aadac13c7e6d051d3bd5d',1,'convert(char *in, uint16_t numRows):&#160;6.c']]],
['converted_5flen_35',['converted_len',['../d1/dba/decimal__to__any__base_8c.html#a899b3a7e0f1fac5a465eac0d4b10d711',1,'decimal_to_any_base.c']]],
['convertion_36',['convertion',['../d1/dba/decimal__to__any__base_8c.html#a0c5ccb926a23bc0050f213ba3408e18d',1,'decimal_to_any_base.c']]],
['count_37',['count',['../d1/ded/group__misc.html#ga6f8e8c9d25b5891d57e588d80d75028a',1,'count():&#160;prime_sieve.c'],['../d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b',1,'cluster::count()']]],
['count_5fdivisors_38',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['crc32_39',['crc32',['../d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567',1,'hash_crc32.c']]],
['create_40',['create',['../dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f',1,'doubly_linked_list.c']]],
['create_5fmatrix_41',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_42',['create_node',['../df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d',1,'threaded_binary_trees.c']]],
['create_5fpolynomial_43',['create_polynomial',['../d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d',1,'poly_add.c']]],
['ct_44',['CT',['../d5/da1/structnode.html#aece40a25d30d3e0d2135007642b64882',1,'node']]],
['current_45',['current',['../d4/d06/struct_vector.html#a8cb577f14bea1a6c1fbf85717b3ee4f9',1,'Vector']]]
['circular_5fdoubly_5flinked_5flist_2ec_19',['circular_doubly_linked_list.c',['../dd/d19/circular__doubly__linked__list_8c.html',1,'']]],
['clear_20',['clear',['../df/dfa/vector_8c.html#ab9dfc1249180f1e924b7333a4e5d133a',1,'vector.c']]],
['client_2ec_21',['client.c',['../dd/d93/client_8c.html',1,'']]],
['closefile_22',['closeFile',['../d3/d78/words__alphabetical_8c.html#af1f9b6eb320d872ba0766dc8bd070075',1,'words_alphabetical.c']]],
['cluster_23',['cluster',['../d1/d99/structcluster.html',1,'']]],
['code_20style_20convention_24',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
['coef_25',['coef',['../df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b',1,'term']]],
['collatz_26',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['collatz_2ec_27',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]],
['combine_28',['combine',['../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df',1,'segment_tree']]],
['combine_5ffunction_29',['combine_function',['../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8',1,'segment_tree.c']]],
['compare_30',['compare',['../d2/d87/non__preemptive__priority__scheduling_8c.html#a01b8ee561d8532a44d665c2c854e0d09',1,'compare(node *a, node *b):&#160;non_preemptive_priority_scheduling.c'],['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'compare(const void *a, const void *b):&#160;sol1.c']]],
['complex_5fstr_31',['complex_str',['../da/d38/durand__kerner__roots_8c.html#a46197e91f478e99a2229562aaaac311e',1,'durand_kerner_roots.c']]],
['contents_32',['contents',['../d4/d06/struct_vector.html#afd870750f3874ee097833fc8a1dc809e',1,'Vector']]],
['contribution_20guidelines_33',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
['contributor_20covenant_20code_20of_20conduct_34',['Contributor Covenant Code of Conduct',['../d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html',1,'']]],
['convert_35',['convert',['../db/d0c/infix__to__postfix_8c.html#a92af69ffc1e1f965ebce6a44672e96b1',1,'convert(char infix[], char postfix[]):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#ae363a3863a8bfbf40e7a95c2b9dbe71b',1,'convert(char inf[]):&#160;infix_to_postfix2.c'],['../d0/df3/6_8c.html#afdf3bfe2dc8aadac13c7e6d051d3bd5d',1,'convert(char *in, uint16_t numRows):&#160;6.c']]],
['converted_5flen_36',['converted_len',['../d1/dba/decimal__to__any__base_8c.html#a899b3a7e0f1fac5a465eac0d4b10d711',1,'decimal_to_any_base.c']]],
['convertion_37',['convertion',['../d1/dba/decimal__to__any__base_8c.html#a0c5ccb926a23bc0050f213ba3408e18d',1,'decimal_to_any_base.c']]],
['count_38',['count',['../d1/ded/group__misc.html#ga6f8e8c9d25b5891d57e588d80d75028a',1,'count():&#160;prime_sieve.c'],['../d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b',1,'cluster::count()']]],
['count_5fdivisors_39',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['crc32_40',['crc32',['../d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567',1,'hash_crc32.c']]],
['create_41',['create',['../dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f',1,'doubly_linked_list.c']]],
['create_5fmatrix_42',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_43',['create_node',['../df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d',1,'create_node(int data):&#160;threaded_binary_trees.c'],['../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b',1,'create_node(uint64_t data):&#160;circular_doubly_linked_list.c']]],
['create_5fpolynomial_44',['create_polynomial',['../d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d',1,'poly_add.c']]],
['ct_45',['CT',['../d5/da1/structnode.html#aece40a25d30d3e0d2135007642b64882',1,'node']]],
['current_46',['current',['../d4/d06/struct_vector.html#a8cb577f14bea1a6c1fbf85717b3ee4f9',1,'Vector']]]
];

41
search/all_6.js
View File

@ -10,23 +10,26 @@ var searchData=
['delete_7',['delete',['../da/d02/binary__search__tree_8c.html#a6983e8a91a3d25d7d000807f18ba2748',1,'delete(node *root, int data):&#160;binary_search_tree.c'],['../dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446',1,'delete(List *list, int pos):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#a2191fb0b42377eb385e1daf04bdfb939',1,'delete(Vector *vec):&#160;vector.c']]],
['delete_5fadaline_8',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_9',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_10',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_11',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dictionary_12',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]],
['digits_13',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_14',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_15',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_16',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]],
['display_17',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c'],['../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bubble_sort.c']]],
['display_5fpolynomial_18',['display_polynomial',['../d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d',1,'poly_add.c']]],
['divisors_19',['divisors',['../d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6',1,'sol2.c']]],
['djb2_20',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_21',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['doubly_5flinked_5flist_2ec_22',['doubly_linked_list.c',['../dd/d29/doubly__linked__list_8c.html',1,'']]],
['dual_23',['dual',['../de/d58/structquaternion__.html#a596abbab688731119c1f23b26a7ac17a',1,'quaternion_::dual()'],['../d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d',1,'dual_quat_::dual()']]],
['dual_5fquat_24',['dual_quat',['../d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f',1,'geometry_datatypes.h']]],
['dual_5fquat_5f_25',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['duplicatenumber_26',['duplicateNumber',['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d',1,'floyd_cycle_detection_algorithm.c']]],
['durand_5fkerner_5froots_2ec_27',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_28',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
['delete_5ffrom_5fhead_10',['delete_from_head',['../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456',1,'circular_doubly_linked_list.c']]],
['delete_5ffrom_5ftail_11',['delete_from_tail',['../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72',1,'circular_doubly_linked_list.c']]],
['delete_5fnumber_12',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_13',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dictionary_14',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]],
['digits_15',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_16',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_17',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_18',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]],
['display_19',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c'],['../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bubble_sort.c']]],
['display_5flist_20',['display_list',['../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e',1,'circular_doubly_linked_list.c']]],
['display_5fpolynomial_21',['display_polynomial',['../d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d',1,'poly_add.c']]],
['divisors_22',['divisors',['../d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6',1,'sol2.c']]],
['djb2_23',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_24',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['doubly_5flinked_5flist_2ec_25',['doubly_linked_list.c',['../dd/d29/doubly__linked__list_8c.html',1,'']]],
['dual_26',['dual',['../de/d58/structquaternion__.html#a596abbab688731119c1f23b26a7ac17a',1,'quaternion_::dual()'],['../d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d',1,'dual_quat_::dual()']]],
['dual_5fquat_27',['dual_quat',['../d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f',1,'geometry_datatypes.h']]],
['dual_5fquat_5f_28',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['duplicatenumber_29',['duplicateNumber',['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d',1,'floyd_cycle_detection_algorithm.c']]],
['durand_5fkerner_5froots_2ec_30',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_31',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
];

11
search/all_9.js
View File

@ -2,7 +2,7 @@ var searchData=
[
['gcd_0',['gcd',['../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol3.c']]],
['geometry_5fdatatypes_2eh_1',['geometry_datatypes.h',['../d0/dc7/geometry__datatypes_8h.html',1,'']]],
['get_2',['get',['../df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250',1,'vector.c']]],
['get_2',['get',['../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1',1,'get(ListNode *list, const int index):&#160;circular_doubly_linked_list.c'],['../df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250',1,'get(Vector *vec, int index):&#160;vector.c']]],
['get_5fangle_3',['get_angle',['../de/d7b/group__vec__3d.html#ga55be1d766c8a824b35d97e79744834d8',1,'vectors_3d.c']]],
['get_5fch_4',['get_ch',['../d9/deb/min__printf_8h.html#a409d428c337bf5476567a228274f49f1',1,'min_printf.h']]],
['get_5fclock_5fdiff_5',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.c']]],
@ -23,8 +23,9 @@ var searchData=
['getmax_20',['getMax',['../da/d02/binary__search__tree_8c.html#ad50f3debc5323bb7b71933effb64f30f',1,'binary_search_tree.c']]],
['getpointertoword_21',['getPointerToWord',['../d3/d78/words__alphabetical_8c.html#a9e3cab68cf6557024f0073f674a307a1',1,'words_alphabetical.c']]],
['getprecedence_22',['getPrecedence',['../dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65',1,'getPrecedence(char operator):&#160;shunting_yard.c'],['../db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787',1,'getPrecedence(char op1, char op2):&#160;infix_to_postfix.c']]],
['graph_23',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_24',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]],
['group_25',['group',['../d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab',1,'observation']]],
['guidelines_20for_20reviewers_20and_20maintainers_26',['Guidelines for reviewers and maintainers',['../dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html',1,'']]]
['getsize_23',['getsize',['../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c',1,'circular_doubly_linked_list.c']]],
['graph_24',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_25',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]],
['group_26',['group',['../d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab',1,'observation']]],
['guidelines_20for_20reviewers_20and_20maintainers_27',['Guidelines for reviewers and maintainers',['../dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html',1,'']]]
];

44
search/all_b.js
View File

@ -9,25 +9,27 @@ var searchData=
['inorder_6',['inOrder',['../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc',1,'binary_search_tree.c']]],
['inorder_5fdisplay_7',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_8',['insert',['../da/d02/binary__search__tree_8c.html#a031cc98830742bca57c0da81a0fb779f',1,'insert(node *root, int data):&#160;binary_search_tree.c'],['../dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918',1,'insert(List *list, double value, int pos):&#160;doubly_linked_list.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36',1,'insert(node **root, int id, int at, int bt, int prior):&#160;non_preemptive_priority_scheduling.c']]],
['insert_5fbt_9',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertion_5fsort_2ec_10',['insertion_sort.c',['../db/ddf/insertion__sort_8c.html',1,'']]],
['insertion_5fsort_5frecursive_2ec_11',['insertion_sort_recursive.c',['../de/d0c/insertion__sort__recursive_8c.html',1,'']]],
['insertionsort_12',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fmax_5flength_13',['INT_MAX_LENGTH',['../d9/deb/min__printf_8h.html#ab47a4bec9213d96e1dba5171e5db0e25',1,'min_printf.h']]],
['int_5fto_5fstring_14',['int_to_string',['../dd/d53/int__to__string_8c.html#aeb4be1a1db1c5fea06e9d8b87e6c3973',1,'int_to_string.c']]],
['int_5fto_5fstring_2ec_15',['int_to_string.c',['../dd/d53/int__to__string_8c.html',1,'']]],
['is_5fabundant_16',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_17',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_18',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fnumber_19',['is_number',['../d9/deb/min__printf_8h.html#ad4908ab912d8dc481225e33ca3285c21',1,'min_printf.h']]],
['is_5fpalindromic_20',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_21',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_22',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isbad_5falphabet_23',['isbad_alphabet',['../d1/dba/decimal__to__any__base_8c.html#ae071f62d704823751bf9a085bf0a1bd7',1,'decimal_to_any_base.c']]],
['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
['insert_5fat_5fhead_9',['insert_at_head',['../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a',1,'circular_doubly_linked_list.c']]],
['insert_5fat_5ftail_10',['insert_at_tail',['../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b',1,'circular_doubly_linked_list.c']]],
['insert_5fbt_11',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertion_5fsort_2ec_12',['insertion_sort.c',['../db/ddf/insertion__sort_8c.html',1,'']]],
['insertion_5fsort_5frecursive_2ec_13',['insertion_sort_recursive.c',['../de/d0c/insertion__sort__recursive_8c.html',1,'']]],
['insertionsort_14',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fmax_5flength_15',['INT_MAX_LENGTH',['../d9/deb/min__printf_8h.html#ab47a4bec9213d96e1dba5171e5db0e25',1,'min_printf.h']]],
['int_5fto_5fstring_16',['int_to_string',['../dd/d53/int__to__string_8c.html#aeb4be1a1db1c5fea06e9d8b87e6c3973',1,'int_to_string.c']]],
['int_5fto_5fstring_2ec_17',['int_to_string.c',['../dd/d53/int__to__string_8c.html',1,'']]],
['is_5fabundant_18',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_19',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_20',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fnumber_21',['is_number',['../d9/deb/min__printf_8h.html#ad4908ab912d8dc481225e33ca3285c21',1,'min_printf.h']]],
['is_5fpalindromic_22',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_23',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_24',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isbad_5falphabet_25',['isbad_alphabet',['../d1/dba/decimal__to__any__base_8c.html#ae071f62d704823751bf9a085bf0a1bd7',1,'decimal_to_any_base.c']]],
['isempty_26',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_27',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_28',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_29',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_30',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_31',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

7
search/all_e.js
View File

@ -20,7 +20,8 @@ var searchData=
['list_17',['list',['../d8/d10/structlist.html',1,'']]],
['list_18',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
['listitem_19',['ListItem',['../d1/d7d/struct_list_item.html',1,'']]],
['llink_20',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_21',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_22',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
['listnode_20',['ListNode',['../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899',1,'circular_doubly_linked_list.c']]],
['llink_21',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_22',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_23',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
];

6
search/all_f.js
View File

File diff suppressed because one or more lines are too long

5
search/files_3.js
View File

@ -4,6 +4,7 @@ var searchData=
['cantor_5fset_2ec_1',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['cartesian_5fto_5fpolar_2ec_2',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]],
['celsius_5fto_5ffahrenheit_2ec_3',['celsius_to_fahrenheit.c',['../d0/d51/celsius__to__fahrenheit_8c.html',1,'']]],
['client_2ec_4',['client.c',['../dd/d93/client_8c.html',1,'']]],
['collatz_2ec_5',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
['circular_5fdoubly_5flinked_5flist_2ec_4',['circular_doubly_linked_list.c',['../dd/d19/circular__doubly__linked__list_8c.html',1,'']]],
['client_2ec_5',['client.c',['../dd/d93/client_8c.html',1,'']]],
['collatz_2ec_6',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
];

2
search/functions_14.js
View File

File diff suppressed because one or more lines are too long

2
search/functions_3.js
View File

@ -25,6 +25,6 @@ var searchData=
['crc32_22',['crc32',['../d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567',1,'hash_crc32.c']]],
['create_23',['create',['../dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f',1,'doubly_linked_list.c']]],
['create_5fmatrix_24',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_25',['create_node',['../df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d',1,'threaded_binary_trees.c']]],
['create_5fnode_25',['create_node',['../df/d3c/threaded__binary__trees_8c.html#a4802bca3f38251543b4aba6765e0390d',1,'create_node(int data):&#160;threaded_binary_trees.c'],['../dd/d19/circular__doubly__linked__list_8c.html#a4a89f96b090dfdb505b714195e59ca5b',1,'create_node(uint64_t data):&#160;circular_doubly_linked_list.c']]],
['create_5fpolynomial_26',['create_polynomial',['../d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d',1,'poly_add.c']]]
];

15
search/functions_4.js
View File

@ -7,10 +7,13 @@ var searchData=
['delete_4',['delete',['../da/d02/binary__search__tree_8c.html#a6983e8a91a3d25d7d000807f18ba2748',1,'delete(node *root, int data):&#160;binary_search_tree.c'],['../dd/d29/doubly__linked__list_8c.html#aa49167a68597f162e699b846fac0d446',1,'delete(List *list, int pos):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#a2191fb0b42377eb385e1daf04bdfb939',1,'delete(Vector *vec):&#160;vector.c']]],
['delete_5fadaline_5',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_6',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_7',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['display_8',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c'],['../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bubble_sort.c']]],
['display_5fpolynomial_9',['display_polynomial',['../d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d',1,'poly_add.c']]],
['djb2_10',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_11',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['duplicatenumber_12',['duplicateNumber',['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d',1,'floyd_cycle_detection_algorithm.c']]]
['delete_5ffrom_5fhead_7',['delete_from_head',['../dd/d19/circular__doubly__linked__list_8c.html#a1418cac5ddf9edb58fca97afce27b456',1,'circular_doubly_linked_list.c']]],
['delete_5ffrom_5ftail_8',['delete_from_tail',['../dd/d19/circular__doubly__linked__list_8c.html#abf4cdda9fbace9822612349d19ec2e72',1,'circular_doubly_linked_list.c']]],
['delete_5fnumber_9',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['display_10',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c'],['../dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bubble_sort.c']]],
['display_5flist_11',['display_list',['../dd/d19/circular__doubly__linked__list_8c.html#a5411df421a94177700868b34887d5d0e',1,'circular_doubly_linked_list.c']]],
['display_5fpolynomial_12',['display_polynomial',['../d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d',1,'poly_add.c']]],
['djb2_13',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_14',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['duplicatenumber_15',['duplicateNumber',['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d',1,'floyd_cycle_detection_algorithm.c']]]
];

5
search/functions_7.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['gcd_0',['gcd',['../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol3.c']]],
['get_1',['get',['../df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250',1,'vector.c']]],
['get_1',['get',['../dd/d19/circular__doubly__linked__list_8c.html#ac53a0550fa74838246bc783ddc005ec1',1,'get(ListNode *list, const int index):&#160;circular_doubly_linked_list.c'],['../df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250',1,'get(Vector *vec, int index):&#160;vector.c']]],
['get_5fangle_2',['get_angle',['../de/d7b/group__vec__3d.html#ga55be1d766c8a824b35d97e79744834d8',1,'vectors_3d.c']]],
['get_5fch_3',['get_ch',['../d9/deb/min__printf_8h.html#a409d428c337bf5476567a228274f49f1',1,'min_printf.h']]],
['get_5fclock_5fdiff_4',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.c']]],
@ -21,5 +21,6 @@ var searchData=
['getassociativity_18',['getAssociativity',['../dc/d73/shunting__yard_8c.html#a4ea3d659fb78b0de0fcc88188815d013',1,'shunting_yard.c']]],
['getmax_19',['getMax',['../da/d02/binary__search__tree_8c.html#ad50f3debc5323bb7b71933effb64f30f',1,'binary_search_tree.c']]],
['getpointertoword_20',['getPointerToWord',['../d3/d78/words__alphabetical_8c.html#a9e3cab68cf6557024f0073f674a307a1',1,'words_alphabetical.c']]],
['getprecedence_21',['getPrecedence',['../db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787',1,'getPrecedence(char op1, char op2):&#160;infix_to_postfix.c'],['../dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65',1,'getPrecedence(char operator):&#160;shunting_yard.c']]]
['getprecedence_21',['getPrecedence',['../db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787',1,'getPrecedence(char op1, char op2):&#160;infix_to_postfix.c'],['../dc/d73/shunting__yard_8c.html#a4438f2369c8f681d8d0dff2eb86d0e65',1,'getPrecedence(char operator):&#160;shunting_yard.c']]],
['getsize_22',['getsize',['../dd/d19/circular__doubly__linked__list_8c.html#a6a64eb6265e703639bbfec9c3db93e0c',1,'circular_doubly_linked_list.c']]]
];

36
search/functions_9.js
View File

@ -5,21 +5,23 @@ var searchData=
['inorder_2',['inOrder',['../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc',1,'binary_search_tree.c']]],
['inorder_5fdisplay_3',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_4',['insert',['../da/d02/binary__search__tree_8c.html#a031cc98830742bca57c0da81a0fb779f',1,'insert(node *root, int data):&#160;binary_search_tree.c'],['../dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918',1,'insert(List *list, double value, int pos):&#160;doubly_linked_list.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36',1,'insert(node **root, int id, int at, int bt, int prior):&#160;non_preemptive_priority_scheduling.c']]],
['insert_5fbt_5',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertionsort_6',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fto_5fstring_7',['int_to_string',['../dd/d53/int__to__string_8c.html#aeb4be1a1db1c5fea06e9d8b87e6c3973',1,'int_to_string.c']]],
['is_5fabundant_8',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_9',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_10',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fnumber_11',['is_number',['../d9/deb/min__printf_8h.html#ad4908ab912d8dc481225e33ca3285c21',1,'min_printf.h']]],
['is_5fpalindromic_12',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_13',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_14',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isbad_5falphabet_15',['isbad_alphabet',['../d1/dba/decimal__to__any__base_8c.html#ae071f62d704823751bf9a085bf0a1bd7',1,'decimal_to_any_base.c']]],
['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
['insert_5fat_5fhead_5',['insert_at_head',['../dd/d19/circular__doubly__linked__list_8c.html#a964882e633c25a29b12237e29f20fa9a',1,'circular_doubly_linked_list.c']]],
['insert_5fat_5ftail_6',['insert_at_tail',['../dd/d19/circular__doubly__linked__list_8c.html#aee328f691615862c4298fe730d66027b',1,'circular_doubly_linked_list.c']]],
['insert_5fbt_7',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertionsort_8',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fto_5fstring_9',['int_to_string',['../dd/d53/int__to__string_8c.html#aeb4be1a1db1c5fea06e9d8b87e6c3973',1,'int_to_string.c']]],
['is_5fabundant_10',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_11',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_12',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fnumber_13',['is_number',['../d9/deb/min__printf_8h.html#ad4908ab912d8dc481225e33ca3285c21',1,'min_printf.h']]],
['is_5fpalindromic_14',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_15',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_16',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isbad_5falphabet_17',['isbad_alphabet',['../d1/dba/decimal__to__any__base_8c.html#ae071f62d704823751bf9a085bf0a1bd7',1,'decimal_to_any_base.c']]],
['isempty_18',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_19',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_20',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_21',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_22',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_23',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

2
search/functions_d.js
View File

File diff suppressed because one or more lines are too long

3
search/typedefs_4.js
View File

@ -1,5 +1,6 @@
var searchData=
[
['large_5fnum_0',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['list_1',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]]
['list_1',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
['listnode_2',['ListNode',['../dd/d19/circular__doubly__linked__list_8c.html#a77bc93c58c46925ba49f51f2d1a32899',1,'circular_doubly_linked_list.c']]]
];

2
search/variables_11.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['value_0',['value',['../d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41',1,'list::value()'],['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int::value()']]]
['value_0',['value',['../d5/da1/structnode.html#a4df5127dc26bf42ff5d965d77823efb5',1,'node::value()'],['../d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41',1,'list::value()'],['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int::value()']]]
];