mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2025-01-22 09:32:06 +03:00
Code Issues Packages Projects Releases Wiki Activity

Documentation for 7aae73495f

Browse Source
This commit is contained in:
github-actions 2022-12-21 14:50:09 +00:00
parent bce0ad5b6e
commit 5bd6f6e8fb
21 changed files with 333 additions and 155 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
annotated.html
View File

@ -124,30 +124,31 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_19_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/db8/structkohonen__array__3d.html" target="_self">kohonen_array_3d</a></td><td class="desc">To store info regarding 3D arrays </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/db3/struct_l.html" target="_self">L</a></td><td class="desc"></td></tr>
<tr id="row_21_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc">Doubly linked list struct </td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d8b/structmat__3x3__.html" target="_self">mat_3x3_</a></td><td class="desc">A 3x3 Matrix type definition </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d8a/structmax__heap.html" target="_self">max_heap</a></td><td class="desc">For INT_MIN </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html" target="_self">MEMORY_INFORMATION</a></td><td class="desc">For the malloc, calloc and free functions </td></tr>
<tr id="row_25_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/dce/structmin__heap.html" target="_self">min_heap</a></td><td class="desc"></td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"><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 </td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d7d/struct_list_item.html" target="_self">ListItem</a></td><td class="desc">Definition for a binary tree node </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d8b/structmat__3x3__.html" target="_self">mat_3x3_</a></td><td class="desc">A 3x3 Matrix type definition </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d8a/structmax__heap.html" target="_self">max_heap</a></td><td class="desc">For INT_MIN </td></tr>
<tr id="row_25_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html" target="_self">MEMORY_INFORMATION</a></td><td class="desc">For the malloc, calloc and free functions </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/dce/structmin__heap.html" target="_self">min_heap</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure of the tree </td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d5e/structobservation.html" target="_self">observation</a></td><td class="desc"></td></tr>
<tr id="row_29_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d43/structpid.html" target="_self">pid</a></td><td class="desc">PID Controller </td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d58/structquaternion__.html" target="_self">quaternion_</a></td><td class="desc">Quaternion type represented using a scalar \(w\) or \(q_0\) and a 3D vector \(\left(q_1,q_2,q_3\right)\) </td></tr>
<tr id="row_31_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d36/structqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d10/struct_queue_rep.html" target="_self">QueueRep</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d06/structsegment__tree.html" target="_self">segment_tree</a></td><td class="desc">This structures holds all the data that is required by a segment tree </td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d10/struct_stack.html" target="_self">Stack</a></td><td class="desc">For printf() and scanf() </td></tr>
<tr id="row_35_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d11/structstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dac/struct_stock_spanner.html" target="_self">StockSpanner</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/de5/structsubset.html" target="_self">subset</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d18/structsudoku.html" target="_self">sudoku</a></td><td class="desc">Structure to hold the matrix and dimensions </td></tr>
<tr id="row_39_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d7e/struct_t.html" target="_self">T</a></td><td class="desc"></td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d86/structterm.html" target="_self">term</a></td><td class="desc">Identifier for single-variable polynomial coefficients as a linked list </td></tr>
<tr id="row_41_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7a/structtnode.html" target="_self">tnode</a></td><td class="desc"></td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db4/structvec__3d__.html" target="_self">vec_3d_</a></td><td class="desc">3D vector type </td></tr>
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d06/struct_vector.html" target="_self">Vector</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_45_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/ddb/structword__count__word.html" target="_self">word_count_word</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"><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 </td></tr>
<tr id="row_29_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d5e/structobservation.html" target="_self">observation</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d43/structpid.html" target="_self">pid</a></td><td class="desc">PID Controller </td></tr>
<tr id="row_31_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d58/structquaternion__.html" target="_self">quaternion_</a></td><td class="desc">Quaternion type represented using a scalar \(w\) or \(q_0\) and a 3D vector \(\left(q_1,q_2,q_3\right)\) </td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d36/structqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d10/struct_queue_rep.html" target="_self">QueueRep</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d06/structsegment__tree.html" target="_self">segment_tree</a></td><td class="desc">This structures holds all the data that is required by a segment tree </td></tr>
<tr id="row_35_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d10/struct_stack.html" target="_self">Stack</a></td><td class="desc">For printf() and scanf() </td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d11/structstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dac/struct_stock_spanner.html" target="_self">StockSpanner</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/de5/structsubset.html" target="_self">subset</a></td><td class="desc"></td></tr>
<tr id="row_39_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d18/structsudoku.html" target="_self">sudoku</a></td><td class="desc">Structure to hold the matrix and dimensions </td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d7e/struct_t.html" target="_self">T</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d86/structterm.html" target="_self">term</a></td><td class="desc">Identifier for single-variable polynomial coefficients as a linked list </td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7a/structtnode.html" target="_self">tnode</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db4/structvec__3d__.html" target="_self">vec_3d_</a></td><td class="desc">3D vector type </td></tr>
<tr id="row_45_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d06/struct_vector.html" target="_self">Vector</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/ddb/structword__count__word.html" target="_self">word_count_word</a></td><td class="desc"></td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
annotated_dup.js
View File

@ -22,12 +22,13 @@ var annotated_dup =
[ "kohonen_array_3d", "d8/db8/structkohonen__array__3d.html", "d8/db8/structkohonen__array__3d" ],
[ "L", "df/db3/struct_l.html", null ],
[ "list", "d8/d10/structlist.html", "d8/d10/structlist" ],
[ "ListItem", "d1/d7d/struct_list_item.html", null ],
[ "mat_3x3_", "d9/d8b/structmat__3x3__.html", "d9/d8b/structmat__3x3__" ],
[ "max_heap", "d0/d8a/structmax__heap.html", null ],
[ "MEMORY_INFORMATION", "d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html", "d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n" ],
[ "min_heap", "de/dce/structmin__heap.html", null ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "observation", "d1/d5e/structobservation.html", "d1/d5e/structobservation" ],
[ "pid", "d0/d43/structpid.html", null ],
[ "quaternion_", "de/d58/structquaternion__.html", "de/d58/structquaternion__" ],

4
classes.html
View File

@ -128,13 +128,13 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_L" name="letter_L">L</a></dt>
<dd><a class="el" href="df/db3/struct_l.html">L</a></dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd></dl>
<dd><a class="el" href="df/db3/struct_l.html">L</a></dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d1/d7d/struct_list_item.html">ListItem</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_M" name="letter_M">M</a></dt>
<dd><a class="el" href="d9/d8b/structmat__3x3__.html">mat_3x3_</a></dd><dd><a class="el" href="d0/d8a/structmax__heap.html">max_heap</a></dd><dd><a class="el" href="d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html">MEMORY_INFORMATION</a></dd><dd><a class="el" href="de/dce/structmin__heap.html">min_heap</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_N" name="letter_N">N</a></dt>
<dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd></dl>
<dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_O" name="letter_O">O</a></dt>
<dd><a class="el" href="d1/d5e/structobservation.html">observation</a></dd></dl>

140
d1/d7d/struct_list_item.html Normal file
View File

@ -0,0 +1,140 @@
<!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.5"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: ListItem Struct 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.5 -->
<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('d1/d7d/struct_list_item.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="#pub-attribs">Data Fields</a> </div>
<div class="headertitle"><div class="title">ListItem Struct Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Definition for a binary tree node.
<a href="../../d1/d7d/struct_list_item.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for ListItem:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0c/struct_list_item__coll__graph.svg" width="134" height="36"><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">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a58dfa7c3270b348856b6f6f8250d93e3"><td class="memItemLeft" align="right" valign="top"><a id="a58dfa7c3270b348856b6f6f8250d93e3" name="a58dfa7c3270b348856b6f6f8250d93e3"></a>
struct TreeNode *&#160;</td><td class="memItemRight" valign="bottom"><b>node</b></td></tr>
<tr class="separator:a58dfa7c3270b348856b6f6f8250d93e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3a9c06ae85f60557666cb569b36072a9"><td class="memItemLeft" align="right" valign="top"><a id="a3a9c06ae85f60557666cb569b36072a9" name="a3a9c06ae85f60557666cb569b36072a9"></a>
struct <a class="el" href="../../d1/d7d/struct_list_item.html">ListItem</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
<tr class="separator:a3a9c06ae85f60557666cb569b36072a9"><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 >Definition for a binary tree node. </p>
<p >struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; }; </p>
</div><hr/>The documentation for this struct was generated from the following file:<ul>
<li>leetcode/src/236.c</li>
</ul>
</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="../../d1/d7d/struct_list_item.html">ListItem</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.5 </li>
</ul>
</div>
</body>
</html>

100
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
View File

@ -230,104 +230,106 @@ LeetCode Algorithm</h2>
<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="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="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">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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="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">561 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/array-partition-i/" target="_blank">Array Partition I</a> </td><td class="markdownTableBodyNone"><a href="../.././src/561.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </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 Substring</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">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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<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="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">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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="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">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">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">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">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">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">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="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1704 </td><td class="markdownTableBodyNone">[Determine if String Halves Are Alike](Determine if String Halves Are Alike) </td><td class="markdownTableBodyNone"><a href="../.././src/1704.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<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="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">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">
<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">
<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>
<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="markdownTableRowEven">
<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">
<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>
</table>
</div></div><!-- contents -->

3
da/d0c/struct_list_item__coll__graph.map Normal file
View File

@ -0,0 +1,3 @@
<map id="ListItem" name="ListItem">
<area shape="rect" id="node1" title="Definition for a binary tree node." alt="" coords="5,5,75,31"/>
</map>

1
da/d0c/struct_list_item__coll__graph.md5 Normal file
View File

@ -0,0 +1 @@
264772bd526313ea5c7e099dcbb36b65

28
da/d0c/struct_list_item__coll__graph.svg Normal file
View File

@ -0,0 +1,28 @@
<?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.0.4 (20221203.1631)
-->
<!-- Title: ListItem Pages: 1 -->
<svg width="100pt" height="27pt"
viewBox="0.00 0.00 100.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>ListItem</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Definition for a binary tree node.">
<polygon fill="#999999" stroke="#666666" 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">ListItem</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="M63.49,-12.46C67.46,-11.89 70,-10.9 70,-9.5 70,-7.01 61.96,-5.83 52.2,-5.95"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="63.51,-8.95 53.71,-12.98 63.88,-15.94 63.51,-8.95"/>
<text text-anchor="middle" x="81" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00"> next</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.3 KiB

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_m.html
View File

@ -105,8 +105,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
<li>malloc_dbg()&#160;:&#160;<a class="el" href="db/d84/malloc__dbg_8c.html#a37914d05ba1fe8848aa1b48cda719422">malloc_dbg.c</a>, <a class="el" href="d2/ddd/malloc__dbg_8h.html#a37914d05ba1fe8848aa1b48cda719422">malloc_dbg.h</a></li>
<li>mat_3x3&#160;:&#160;<a class="el" href="dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7">geometry_datatypes.h</a></li>
<li>mat_mul()&#160;:&#160;<a class="el" href="d7/d50/qr__eigen__values_8c.html#a5835240036dc02ee9a13e65c559fb907">qr_eigen_values.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&#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>

8
navtreedata.js
View File

@ -136,10 +136,10 @@ var NAVTREE =
var NAVTREEINDEX =
[
"annotated.html",
"d4/d69/group__dual__quats.html",
"d8/d38/queue_8h_source.html",
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853",
"globals_func_d.html"
"d4/d68/qr__decompose_8h_source.html",
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c",
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd",
"globals_func_c.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

24
navtreeindex0.js
View File

@ -2,8 +2,8 @@ var NAVTREEINDEX0 =
{
"annotated.html":[15,0],
"classes.html":[15,1],
"d0/d10/struct_queue_rep.html":[15,0,32],
"d0/d43/structpid.html":[15,0,29],
"d0/d10/struct_queue_rep.html":[15,0,33],
"d0/d43/structpid.html":[15,0,30],
"d0/d46/kohonen__som__trace_8c.html":[16,0,12,3],
"d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,12,3,11],
"d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8":[16,0,12,3,14],
@ -34,7 +34,7 @@ var NAVTREEINDEX0 =
"d0/d8a/octal__to__hexadecimal_8c.html#a86a4edb605c2a03d9175c59de679347d":[16,0,2,8,1],
"d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,2,8,3],
"d0/d8a/octal__to__hexadecimal_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,8,0],
"d0/d8a/structmax__heap.html":[15,0,23],
"d0/d8a/structmax__heap.html":[15,0,24],
"d0/dc7/geometry__datatypes_8h.html":[14,0,4],
"d0/dcb/group__kohonen__1d.html":[14,2,3],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[14,2,3,3],
@ -89,6 +89,7 @@ var NAVTREEINDEX0 =
"d1/d6b/tcp__full__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,5,0],
"d1/d6b/tcp__full__duplex__server_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce":[16,0,1,5,1],
"d1/d6b/tcp__full__duplex__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,5,2],
"d1/d7d/struct_list_item.html":[15,0,22],
"d1/d94/odd__even__sort_8c.html":[16,0,18,8],
"d1/d94/odd__even__sort_8c.html#a17761a0788916faded6e2ca1f478ad33":[16,0,18,8,1],
"d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,8,3],
@ -102,7 +103,7 @@ var NAVTREEINDEX0 =
"d1/d99/structcluster.html#a10fa7010c12d0f03a422d68321495479":[14,2,1,1,2],
"d1/d99/structcluster.html#a13278ef636c1d9bd9ce8fad736f4c570":[14,2,1,1,1],
"d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b":[14,2,1,1,0],
"d1/dac/struct_stock_spanner.html":[15,0,36],
"d1/dac/struct_stock_spanner.html":[15,0,37],
"d1/dba/decimal__to__any__base_8c.html":[16,0,2,2],
"d1/dba/decimal__to__any__base_8c.html#a0c5ccb926a23bc0050f213ba3408e18d":[16,0,2,2,1],
"d1/dba/decimal__to__any__base_8c.html#a3e4a7cfc97a528faa4d6e5741461109c":[16,0,2,2,2],
@ -132,7 +133,7 @@ var NAVTREEINDEX0 =
"d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12":[16,0,16,14,0,0],
"d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe":[16,0,16,14,0,1],
"d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83":[16,0,16,14,0,2],
"d2/d36/structqueue.html":[15,0,31],
"d2/d36/structqueue.html":[15,0,32],
"d2/d6a/struct_graph_rep.html":[15,0,17],
"d2/d6d/bubble__sort__2_8c.html":[16,0,18,2],
"d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,18,2,0],
@ -217,10 +218,10 @@ var NAVTREEINDEX0 =
"d3/d78/words__alphabetical_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,1,3,7],
"d3/d78/words__alphabetical_8c.html#af1f9b6eb320d872ba0766dc8bd070075":[16,0,3,1,3,3],
"d4/d02/struct_b_s_t_iterator.html":[15,0,5],
"d4/d06/struct_vector.html":[15,0,44],
"d4/d06/struct_vector.html#a55870593ddea19c96770c2521b075059":[15,0,44,2],
"d4/d06/struct_vector.html#a8cb577f14bea1a6c1fbf85717b3ee4f9":[15,0,44,1],
"d4/d06/struct_vector.html#afd870750f3874ee097833fc8a1dc809e":[15,0,44,0],
"d4/d06/struct_vector.html":[15,0,45],
"d4/d06/struct_vector.html#a55870593ddea19c96770c2521b075059":[15,0,45,2],
"d4/d06/struct_vector.html#a8cb577f14bea1a6c1fbf85717b3ee4f9":[15,0,45,1],
"d4/d06/struct_vector.html#afd870750f3874ee097833fc8a1dc809e":[15,0,45,0],
"d4/d07/ode__forward__euler_8c.html":[16,0,14,3],
"d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,14,3,4],
"d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,14,3,1],
@ -228,7 +229,7 @@ var NAVTREEINDEX0 =
"d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,14,3,0],
"d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9":[16,0,14,3,2],
"d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350":[16,0,14,3,3],
"d4/d11/structstack.html":[15,0,35],
"d4/d11/structstack.html":[15,0,36],
"d4/d2d/struct_c_array.html":[15,0,7],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html":[1],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md1":[1,0],
@ -248,6 +249,5 @@ var NAVTREEINDEX0 =
"d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56":[16,0,14,6,1],
"d4/d68/qr__decompose_8h.html#a5ee39e7c8fce8a604dcf7009ce101c02":[16,0,14,6,5],
"d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a":[16,0,14,6,0],
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212":[16,0,14,6,3],
"d4/d68/qr__decompose_8h_source.html":[16,0,14,6]
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212":[16,0,14,6,3]
};

48
navtreeindex1.js
View File

@ -1,15 +1,16 @@
var NAVTREEINDEX1 =
{
"d4/d68/qr__decompose_8h_source.html":[16,0,14,6],
"d4/d69/group__dual__quats.html":[14,0,3],
"d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f":[14,0,3,1],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html":[15,0,24],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1cec46413acf776e3ee2b0b9241490c3":[15,0,24,5],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1f13725b3de5ca6ab99b238b712cb417":[15,0,24,2],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a6b0971c1415de6e0123b8d0d0a626fde":[15,0,24,6],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a731603550d2238abb179f2b572f20d99":[15,0,24,3],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a7f42967fd6562d77ac03445ea6e36a3d":[15,0,24,0],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a934ad84d159c35b24ff54f7eceb1c6be":[15,0,24,1],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#aa296b903d0e2ac54acaa7c305bae8007":[15,0,24,4],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html":[15,0,25],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1cec46413acf776e3ee2b0b9241490c3":[15,0,25,5],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1f13725b3de5ca6ab99b238b712cb417":[15,0,25,2],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a6b0971c1415de6e0123b8d0d0a626fde":[15,0,25,6],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a731603550d2238abb179f2b572f20d99":[15,0,25,3],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a7f42967fd6562d77ac03445ea6e36a3d":[15,0,25,0],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a934ad84d159c35b24ff54f7eceb1c6be":[15,0,25,1],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#aa296b903d0e2ac54acaa7c305bae8007":[15,0,25,4],
"d4/d7b/problem__6_2sol_8c.html":[16,0,16,19,0],
"d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,19,0,0],
"d4/d83/problem__401_2sol1_8c.html":[16,0,16,17,0],
@ -43,7 +44,7 @@ var NAVTREEINDEX1 =
"d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,13,13,2],
"d4/dcc/strong__number_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,13,1],
"d4/dd4/struct_graph.html":[15,0,16],
"d4/dd9/structtrie.html":[15,0,42],
"d4/dd9/structtrie.html":[15,0,43],
"d4/de3/hash__djb2_8c.html":[14,1,2],
"d4/dea/problem__14_2sol1_8c.html":[16,0,16,4,0],
"d4/dea/problem__14_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,4,0,1],
@ -76,7 +77,7 @@ var NAVTREEINDEX1 =
"d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d":[16,0,16,18,2,0],
"d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,18,2,2],
"d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,16,18,2,1],
"d5/d7e/struct_t.html":[15,0,39],
"d5/d7e/struct_t.html":[15,0,40],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[7],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[7,0],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,1],
@ -96,18 +97,18 @@ var NAVTREEINDEX1 =
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,15],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,16],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,17],
"d5/da1/structnode.html":[15,0,26],
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,26,6],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,26,3],
"d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b":[15,0,26,7],
"d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[15,0,26,8],
"d5/da1/structnode.html#a5507c3c76ddbda9c482749f3a8a8f0cc":[15,0,26,0],
"d5/da1/structnode.html#a878d22393f374f3861035e35b9edd653":[15,0,26,10],
"d5/da1/structnode.html#abbe30696293849bebed90520b8cf7ba3":[15,0,26,9],
"d5/da1/structnode.html#ac0a6453f996d4c362c015fd4348ecc6e":[15,0,26,1],
"d5/da1/structnode.html#ac0c8b57ac0a76d72588561c81481c454":[15,0,26,4],
"d5/da1/structnode.html#aece40a25d30d3e0d2135007642b64882":[15,0,26,2],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[15,0,26,5],
"d5/da1/structnode.html":[15,0,28],
"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#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#abbe30696293849bebed90520b8cf7ba3":[15,0,28,9],
"d5/da1/structnode.html#ac0a6453f996d4c362c015fd4348ecc6e":[15,0,28,1],
"d5/da1/structnode.html#ac0c8b57ac0a76d72588561c81481c454":[15,0,28,4],
"d5/da1/structnode.html#aece40a25d30d3e0d2135007642b64882":[15,0,28,2],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[15,0,28,5],
"d5/db4/struct_edge.html":[15,0,13],
"d5/db4/structvec__3d__.html":[14,0,0,0],
"d5/db4/structvec__3d__.html#a3339a40de7385fa55bee30be81c098c6":[14,0,0,0,2],
@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
"d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,16,13,0,0],
"d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,13,0,3],
"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,16,13,0,2],
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4],
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,16,13,0,1]
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4]
};

14
navtreeindex2.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX2 =
{
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,16,13,0,1],
"d8/d38/queue_8h_source.html":[16,0,3,4,1],
"d8/d71/group__k__means.html":[14,2,1],
"d8/d71/group__k__means.html#gad339c41d3ee9e6729aca9e9ab3f7d2d9":[14,2,1,3],
@ -9,7 +10,7 @@ var NAVTREEINDEX2 =
"d8/d75/fibonacci__formula_8c.html#a4d369ae048e0ccc7f515a243533cd946":[16,0,13,5,0],
"d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,13,5,2],
"d8/d75/fibonacci__formula_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,5,1],
"d8/d7a/structtnode.html":[15,0,41],
"d8/d7a/structtnode.html":[15,0,42],
"d8/d7c/dict_8h_source.html":[16,0,3,2,0],
"d8/d81/md_project_euler__r_e_a_d_m_e.html":[12],
"d8/da2/dynamic__array_8h_source.html":[16,0,3,3,0],
@ -244,10 +245,9 @@ var NAVTREEINDEX2 =
"dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1":[14,0,2,6],
"dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html":[13],
"dc/de3/hash__set_8h_source.html":[16,0,3,5,0],
"dc/de5/structsubset.html":[15,0,37],
"dd/d06/structsegment__tree.html":[15,0,33],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,33,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,33,3],
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,33,0],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,33,4]
"dc/de5/structsubset.html":[15,0,38],
"dd/d06/structsegment__tree.html":[15,0,34],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3],
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0]
};

30
navtreeindex3.js
View File

@ -1,16 +1,17 @@
var NAVTREEINDEX3 =
{
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,33,1],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4],
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,34,1],
"dd/d08/newton__raphson__root_8c.html":[16,0,14,2],
"dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,14,2,3],
"dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925":[16,0,14,2,2],
"dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337":[16,0,14,2,1],
"dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689":[16,0,14,2,0],
"dd/d10/struct_stack.html":[15,0,34],
"dd/d10/struct_stack.html#a856ca6f4a9ffde43f0cb3b43cb4d044d":[15,0,34,0],
"dd/d10/struct_stack.html#aa16cf0b36f9735ed00bde97a5013adaa":[15,0,34,1],
"dd/d10/struct_stack.html#ac2dbef151bc913684a90b06836725ef9":[15,0,34,3],
"dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a":[15,0,34,2],
"dd/d10/struct_stack.html":[15,0,35],
"dd/d10/struct_stack.html#a856ca6f4a9ffde43f0cb3b43cb4d044d":[15,0,35,0],
"dd/d10/struct_stack.html#aa16cf0b36f9735ed00bde97a5013adaa":[15,0,35,1],
"dd/d10/struct_stack.html#ac2dbef151bc913684a90b06836725ef9":[15,0,35,3],
"dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a":[15,0,35,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],
@ -89,7 +90,7 @@ var NAVTREEINDEX3 =
"de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270":[14,0,0,1],
"de/dac/sudoku__solver_8c.html":[16,0,13,14],
"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,14,1],
"de/dce/structmin__heap.html":[15,0,25],
"de/dce/structmin__heap.html":[15,0,26],
"de/dcf/rot13_8c.html":[16,0,13,11],
"de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,13,11,2],
"de/dcf/rot13_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,11,0],
@ -145,16 +146,16 @@ var NAVTREEINDEX3 =
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,18,9,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,18,9,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[16,0,18,9,1],
"df/d86/structterm.html":[15,0,40],
"df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74":[15,0,40,2],
"df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b":[15,0,40,0],
"df/d86/structterm.html#ab7ac49a58cc431c9838c855bf59a243a":[15,0,40,1],
"df/d86/structterm.html":[15,0,41],
"df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74":[15,0,41,2],
"df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b":[15,0,41,0],
"df/d86/structterm.html#ab7ac49a58cc431c9838c855bf59a243a":[15,0,41,1],
"df/d98/quaternions_8c.html":[16,0,7,1],
"df/da5/problem__9_2sol1_8c.html":[16,0,16,22,0],
"df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,22,0,0],
"df/db3/struct_l.html":[15,0,20],
"df/dc6/acronym_8h_source.html":[16,0,5,0,0],
"df/ddb/structword__count__word.html":[15,0,45],
"df/ddb/structword__count__word.html":[15,0,46],
"df/dea/structdata.html":[15,0,9],
"df/df3/union__find_8c.html":[16,0,13,15],
"df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe":[16,0,13,15,0],
@ -236,8 +237,8 @@ var NAVTREEINDEX3 =
"files.html":[16,0],
"functions.html":[15,2,0],
"functions_vars.html":[15,2,1],
"globals.html":[16,1,0],
"globals.html":[16,1,0,0],
"globals.html":[16,1,0],
"globals_a.html":[16,1,0,1],
"globals_b.html":[16,1,0,2],
"globals_c.html":[16,1,0,3],
@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
"globals_func.html":[16,1,1],
"globals_func.html":[16,1,1,0],
"globals_func_a.html":[16,1,1,1],
"globals_func_b.html":[16,1,1,2],
"globals_func_c.html":[16,1,1,3]
"globals_func_b.html":[16,1,1,2]
};

3
navtreeindex4.js
View File

@ -1,5 +1,6 @@
var NAVTREEINDEX4 =
{
"globals_func_c.html":[16,1,1,3],
"globals_func_d.html":[16,1,1,4],
"globals_func_e.html":[16,1,1,5],
"globals_func_f.html":[16,1,1,6],
@ -41,8 +42,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_md75":[0,0],
"index.html#autotoc_md76":[0,1],
"index.html#autotoc_md77":[0,2],

13
search/all_10.js
View File

@ -9,11 +9,10 @@ var searchData=
['newton_5fraphson_5froot_2ec_6',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
['next_7',['next',['../d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063',1,'node::next()'],['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#aa296b903d0e2ac54acaa7c305bae8007',1,'MEMORY_INFORMATION::next()'],['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set::next()'],['../df/d86/structterm.html#ab7ac49a58cc431c9838c855bf59a243a',1,'term::next()'],['../df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f',1,'next():&#160;vector.c']]],
['next_5fdigit_8',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
['node_9',['node',['../d5/da1/structnode.html',1,'']]],
['node_10',['Node',['../db/d8b/struct_node.html',1,'']]],
['node_11',['node',['../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324',1,'node():&#160;binary_search_tree.c'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node():&#160;threaded_binary_trees.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#af4aeda155dbe167f1c1cf38cb65bf324',1,'node():&#160;non_preemptive_priority_scheduling.c']]],
['non_5fpreemptive_5fpriority_5fscheduling_2ec_12',['non_preemptive_priority_scheduling.c',['../d2/d87/non__preemptive__priority__scheduling_8c.html',1,'']]],
['num_5fdigits_13',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_14',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_15',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
['node_9',['Node',['../db/d8b/struct_node.html',1,'']]],
['node_10',['node',['../d5/da1/structnode.html',1,'node'],['../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324',1,'node():&#160;binary_search_tree.c'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node():&#160;threaded_binary_trees.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#af4aeda155dbe167f1c1cf38cb65bf324',1,'node():&#160;non_preemptive_priority_scheduling.c']]],
['non_5fpreemptive_5fpriority_5fscheduling_2ec_11',['non_preemptive_priority_scheduling.c',['../d2/d87/non__preemptive__priority__scheduling_8c.html',1,'']]],
['num_5fdigits_12',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_13',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_14',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
];

7
search/all_e.js
View File

@ -16,7 +16,8 @@ var searchData=
['line_13',['line',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a731603550d2238abb179f2b572f20d99',1,'MEMORY_INFORMATION']]],
['list_14',['list',['../d8/d10/structlist.html',1,'']]],
['list_15',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
['llink_16',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_17',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_18',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
['listitem_16',['ListItem',['../d1/d7d/struct_list_item.html',1,'']]],
['llink_17',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_18',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_19',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
];

4
search/all_f.js
View File

@ -10,8 +10,8 @@ var searchData=
['mat_5f3x3_5f_7',['mat_3x3_',['../d9/d8b/structmat__3x3__.html',1,'']]],
['mat_5fmul_8',['mat_mul',['../d7/d50/qr__eigen__values_8c.html#a5835240036dc02ee9a13e65c559fb907',1,'qr_eigen_values.c']]],
['matrix_20operations_9',['Matrix operations',['../dd/d7a/group__matrix.html',1,'']]],
['max_10',['max',['../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_trace.c']]],
['max_11',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;server.c'],['../d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;prim.c'],['../d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;bubble_sort_2.c']]],
['max_10',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;server.c'],['../d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;prim.c'],['../d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;bubble_sort_2.c']]],
['max_11',['max',['../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_trace.c']]],
['max_5fadaline_5fiter_12',['MAX_ADALINE_ITER',['../da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f',1,'adaline_learning.c']]],
['max_5fdeno_13',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_14',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],

3
search/classes_9.js
View File

@ -1,5 +1,6 @@
var searchData=
[
['l_0',['L',['../df/db3/struct_l.html',1,'']]],
['list_1',['list',['../d8/d10/structlist.html',1,'']]]
['list_1',['list',['../d8/d10/structlist.html',1,'']]],
['listitem_2',['ListItem',['../d1/d7d/struct_list_item.html',1,'']]]
];

4
search/classes_b.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['node_0',['node',['../d5/da1/structnode.html',1,'']]],
['node_1',['Node',['../db/d8b/struct_node.html',1,'']]]
['node_0',['Node',['../db/d8b/struct_node.html',1,'']]],
['node_1',['node',['../d5/da1/structnode.html',1,'']]]
];