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

Documentation for e75d0e75d7

Browse Source
This commit is contained in:
github-actions 2020-09-09 16:54:50 +00:00
parent 71ab5784b3
commit 5c05070be1
184 changed files with 2356 additions and 840 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
annotated.html
View File

@ -119,21 +119,22 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<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="d9/d8b/structmat__3x3__.html" target="_self">mat_3x3_</a></td><td class="desc">A 3x3 Matrix type definition </td></tr>
<tr id="row_21_"><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"></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="de/dce/structmin__heap.html" target="_self">min_heap</a></td><td class="desc"></td></tr>
<tr id="row_23_"><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_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="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_23_"><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_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="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_25_"><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_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="d0/d43/structpid.html" target="_self">pid</a></td><td class="desc">PID Controller </td></tr>
<tr id="row_27_"><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_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="d2/d36/structqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_29_"><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_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="dd/d10/struct_stack.html" target="_self">Stack</a></td><td class="desc"></td></tr>
<tr id="row_31_"><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_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="dc/d18/structsudoku.html" target="_self">sudoku</a></td><td class="desc">Structure to hold the matrix and dimensions </td></tr>
<tr id="row_33_"><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_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="d8/d7a/structtnode.html" target="_self">tnode</a></td><td class="desc"></td></tr>
<tr id="row_35_"><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="da/d9b/struct_trie_node.html" target="_self">TrieNode</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="d5/db4/structvec__3d__.html" target="_self">vec_3d_</a></td><td class="desc">3D vector type </td></tr>
<tr id="row_37_"><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_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="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_31_"><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"></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="dc/de5/structsubset.html" target="_self">subset</a></td><td class="desc"></td></tr>
<tr id="row_33_"><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_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="d5/d7e/struct_t.html" target="_self">T</a></td><td class="desc"></td></tr>
<tr id="row_35_"><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_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="da/d9b/struct_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_37_"><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_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="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

@ -23,13 +23,14 @@ var annotated_dup =
[ "mat_3x3_", "d9/d8b/structmat__3x3__.html", "d9/d8b/structmat__3x3__" ],
[ "max_heap", "d0/d8a/structmax__heap.html", "d0/d8a/structmax__heap" ],
[ "min_heap", "de/dce/structmin__heap.html", "de/dce/structmin__heap" ],
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "observation", "d1/d5e/structobservation.html", "d1/d5e/structobservation" ],
[ "pid", "d0/d43/structpid.html", "d0/d43/structpid" ],
[ "quaternion_", "de/d58/structquaternion__.html", "de/d58/structquaternion__" ],
[ "queue", "d2/d36/structqueue.html", "d2/d36/structqueue" ],
[ "QueueRep", "d0/d10/struct_queue_rep.html", "d0/d10/struct_queue_rep" ],
[ "segment_tree", "dd/d06/structsegment__tree.html", "dd/d06/structsegment__tree" ],
[ "Stack", "dd/d10/struct_stack.html", "dd/d10/struct_stack" ],
[ "subset", "dc/de5/structsubset.html", "dc/de5/structsubset" ],
[ "sudoku", "dc/d18/structsudoku.html", "dc/d18/structsudoku" ],

19
classes.html
View File

@ -157,36 +157,37 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<td></td></tr>
<tr><td valign="top"><a class="el" href="d2/de8/structeuler__.html">euler_</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="de/dce/structmin__heap.html">min_heap</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d10/struct_stack.html">Stack</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d06/structsegment__tree.html">segment_tree</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td valign="top"><a class="el" href="d4/d02/struct_b_s_t_iterator.html">BSTIterator</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
</td>
<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="dc/de5/structsubset.html">subset</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d10/struct_stack.html">Stack</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;c&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="dc/d18/structsudoku.html">sudoku</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dc/de5/structsubset.html">subset</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td valign="top"><a class="el" href="d4/dd4/struct_graph.html">Graph</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;t&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dc/d18/structsudoku.html">sudoku</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td valign="top"><a class="el" href="d4/d2d/struct_c_array.html">CArray</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/d6a/struct_graph_rep.html">GraphRep</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;t&#160;&#160;</div></td></tr></table>
</td>
<td></td></tr>
<tr><td valign="top"><a class="el" href="d1/d99/structcluster.html">cluster</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;h&#160;&#160;</div></td></tr></table>
</td>
<td rowspan="2" valign="bottom"><a name="letter_o"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;o&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="d5/d7e/struct_t.html">T</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td></td><td></td><td></td></tr>
<tr><td></td><td valign="top"><a class="el" href="d5/d7e/struct_t.html">T</a>&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td></td><td valign="top"><a class="el" href="d0/df1/structhash__set__t.html">hash_set_t</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/d5e/structobservation.html">observation</a>&#160;&#160;&#160;</td>
<td></td><td></td></tr>

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@ -134,6 +134,7 @@ Data Structures</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/create_node.c">Create Node</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/recursive_traversals.c">Recursive Traversals</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/redblacktree.c">Redblacktree</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/segment_tree.c">Segment Tree</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/threaded_binary_trees.c">Threaded Binary Trees</a></li>
</ul>
</li>

8
d6/ddc/segment__tree_8c__incl.map Normal file
View File

@ -0,0 +1,8 @@
<map id="data_structures/binary_trees/segment_tree.c" name="data_structures/binary_trees/segment_tree.c">
<area shape="rect" id="node1" title="segment trees with only point updates" alt="" coords="157,5,309,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,75,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="99,95,178,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="203,95,264,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="288,95,352,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="377,95,442,121"/>
</map>

1
d6/ddc/segment__tree_8c__incl.md5 Normal file
View File

@ -0,0 +1 @@
b0d5125b255ee902472ff06b20347408

98
d6/ddc/segment__tree_8c__incl.svg Normal file
View File

@ -0,0 +1,98 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures/binary_trees/segment_tree.c Pages: 1 -->
<svg width="336pt" height="95pt"
viewBox="0.00 0.00 335.50 95.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 91)">
<title>data_structures/binary_trees/segment_tree.c</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 331.5,-91 331.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="segment trees with only point updates">
<polygon fill="#bfbfbf" stroke="black" points="114,-56.5 114,-86.5 228,-86.5 228,-56.5 114,-56.5"/>
<text text-anchor="start" x="122" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/binary</text>
<text text-anchor="middle" x="171" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_trees/segment_tree.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 52,-19.5 52,-0.5 0,-0.5"/>
<text text-anchor="middle" x="26" y="-7.5" 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="midnightblue" d="M136.64,-56.4C112.31,-46.42 79.97,-33.15 56.54,-23.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="57.68,-20.22 47.1,-19.66 55.02,-26.69 57.68,-20.22"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="70.5,-0.5 70.5,-19.5 129.5,-19.5 129.5,-0.5 70.5,-0.5"/>
<text text-anchor="middle" x="100" y="-7.5" 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="midnightblue" d="M154.17,-56.4C143.33,-47.31 129.22,-35.49 118.13,-26.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="120.24,-23.4 110.33,-19.66 115.75,-28.76 120.24,-23.4"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="148,-0.5 148,-19.5 194,-19.5 194,-0.5 148,-0.5"/>
<text text-anchor="middle" x="171" y="-7.5" 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="midnightblue" d="M171,-56.4C171,-48.47 171,-38.46 171,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="174.5,-29.66 171,-19.66 167.5,-29.66 174.5,-29.66"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="212,-0.5 212,-19.5 260,-19.5 260,-0.5 212,-0.5"/>
<text text-anchor="middle" x="236" y="-7.5" 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="midnightblue" d="M186.4,-56.4C196.24,-47.4 208.99,-35.72 219.11,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="221.53,-28.99 226.54,-19.66 216.8,-23.83 221.53,-28.99"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="278.5,-0.5 278.5,-19.5 327.5,-19.5 327.5,-0.5 278.5,-0.5"/>
<text text-anchor="middle" x="303" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">string.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M202.28,-56.4C224.23,-46.51 253.34,-33.38 274.62,-23.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="276.11,-26.96 283.79,-19.66 273.24,-20.58 276.11,-26.96"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.3 KiB

18
d8/d7c/dict_8h_source.html
View File

@ -163,35 +163,53 @@ $(document).ready(function(){initNavTree('d8/d7c/dict_8h_source.html','../../');
</div><!-- doc-content -->
<div class="ttc" id="athreaded__binary__trees_8c_html_a284d683f74b6c884e79ba00d3d1c3317"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317">delete_bt</a></div><div class="ttdeci">void delete_bt(node **root, int ele)</div><div class="ttdoc">deletion of a node from the tree if the node isn't present in the tree, it takes no action.</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:173</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main funcion.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:249</div></div>
<div class="ttc" id="asegment__tree_8c_html_a93bfab032ce9dbc0c1feaeee32a885fb"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a></div><div class="ttdeci">void minimum(const void *a, const void *b, void *c)</div><div class="ttdoc">Utility for test A function compare for minimum between two integers This function is used as combine...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:194</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="abinary__search__tree_8c_html_a0f18adaaca5ecc410cfa16dd2a3684dc"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc">inOrder</a></div><div class="ttdeci">void inOrder(node *root)</div><div class="ttdoc">Traversal procedure to list the current keys in the tree in order of value (from the left to the righ...</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:238</div></div>
<div class="ttc" id="astruct_a_v_lnode_html"><div class="ttname"><a href="../../d2/d71/struct_a_v_lnode.html">AVLnode</a></div><div class="ttdef"><b>Definition:</b> avl.c:5</div></div>
<div class="ttc" id="asegment__tree_8c_html_a1e81a9bbf01716f1b4fb27ef36a9098c"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree_update</a></div><div class="ttdeci">void segment_tree_update(segment_tree *tree, size_t index, void *val)</div><div class="ttdoc">For point updates This function updates the element at given index and also updates segment tree acco...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:79</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 class="ttc" id="abinary__search__tree_8c_html_ac73c73be92dbbeeaad942c0103b9540d"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d">newNode</a></div><div class="ttdeci">node * newNode(int data)</div><div class="ttdoc">The node constructor, which receives the key value input and returns a node pointer.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:28</div></div>
<div class="ttc" id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><div class="ttname"><a href="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">stores the number</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
<div class="ttc" id="astruct_node_html_a0ed3c7305b43527f0f237bbfd438b8f7"><div class="ttname"><a href="../../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7">Node::rlink</a></div><div class="ttdeci">struct Node * rlink</div><div class="ttdoc">link to right child</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:30</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdoc">Node, the basic data structure of the tree.</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
<div class="ttc" id="astruct_dict_html"><div class="ttname"><a href="../../d4/dfe/struct_dict.html">Dict</a></div><div class="ttdef"><b>Definition:</b> dict.h:18</div></div>
<div class="ttc" id="asegment__tree_8c_html_aca549b5311d32ab1a703b4a4605821d8"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">combine_function</a></div><div class="ttdeci">void(* combine_function)(const void *a, const void *b, void *result)</div><div class="ttdoc">Function that combines two data to generate a new one The name of function might be misleading actual...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:33</div></div>
<div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
<div class="ttc" id="astructsegment__tree_html_aa18d7cb422873a807707b26448dce7cd"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">segment_tree::root</a></div><div class="ttdeci">void * root</div><div class="ttdoc">the root of formed segment tree</div><div class="ttdef"><b>Definition:</b> segment_tree.c:40</div></div>
<div class="ttc" id="asegment__tree_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:231</div></div>
<div class="ttc" id="astructsegment__tree_html_a5373ee53a5ac1cd7a9dcb89a4c23a04a"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">segment_tree::identity</a></div><div class="ttdeci">void * identity</div><div class="ttdoc">identity element for combine function</div><div class="ttdef"><b>Definition:</b> segment_tree.c:41</div></div>
<div class="ttc" id="astructsegment__tree_html_a973ab017a97678fdc6774543585897df"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">segment_tree::combine</a></div><div class="ttdeci">combine_function combine</div><div class="ttdoc">the function to be used to combine two node's data to form parent's data</div><div class="ttdef"><b>Definition:</b> segment_tree.c:47</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_a5a82ae0ee13788be51ca4ba6cddb0719"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719">postorder_display</a></div><div class="ttdeci">void postorder_display(node *curr)</div><div class="ttdoc">performs postorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:143</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><div class="ttdeci">void search(node *root, int ele)</div><div class="ttdoc">searches for the element</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_adff4c6248834a9944a1fb03a20230c9c"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#adff4c6248834a9944a1fb03a20230c9c">find</a></div><div class="ttdeci">int find(node *root, int data)</div><div class="ttdoc">Search procedure, which looks for the input key in the tree and returns 1 if it's present or 0 if it'...</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:152</div></div>
<div class="ttc" id="asegment__tree_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test RMQ Testing Segment tree using Range Minimum Queries.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:205</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_ad297e528a7bb8604ca93af149d609150"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ad297e528a7bb8604ca93af149d609150">getMax</a></div><div class="ttdeci">node * getMax(node *root)</div><div class="ttdoc">Utilitary procedure to find the greatest key in the left subtree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:72</div></div>
<div class="ttc" id="astruct_node_html_a60b73f452505cef98795d2c8de3e72ef"><div class="ttname"><a href="../../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef">Node::llink</a></div><div class="ttdeci">struct Node * llink</div><div class="ttdoc">link to left child</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:29</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_a8169ba0dfd5b8183672e444d1434bf9c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c">preorder_display</a></div><div class="ttdeci">void preorder_display(node *curr)</div><div class="ttdoc">performs preorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:157</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="asegment__tree_8c_html_acecc34fd89923ab41dcee3a779622816"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree_init</a></div><div class="ttdeci">segment_tree * segment_tree_init(void *arr, size_t elem_size, size_t len, void *identity, combine_function func)</div><div class="ttdoc">Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:140</div></div>
<div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div>
<div class="ttc" id="astructnode_html_af7109e6ffd82cbbb705e486fd0ce92f0"><div class="ttname"><a href="../../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">node::left</a></div><div class="ttdeci">struct node * left</div><div class="ttdoc">left child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:16</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_a4c1e06b5f0876ec9c1bd6817f3b7eda7"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7">inorder_display</a></div><div class="ttdeci">void inorder_display(node *curr)</div><div class="ttdoc">performs inorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:129</div></div>
<div class="ttc" id="asegment__tree_8c_html_af20a9f373083d3f701e1cd92560cef01"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree_dispose</a></div><div class="ttdeci">void segment_tree_dispose(segment_tree *tree)</div><div class="ttdoc">Dispose Segment Tree Frees all heap memory accquired by segment tree.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:162</div></div>
<div class="ttc" id="aclient_8c_html_ac17020a38607ab29ce18939d5194a32a"><div class="ttname"><a href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">func</a></div><div class="ttdeci">void func(int sockfd)</div><div class="ttdoc">Continuous loop to send and receive over the socket.</div><div class="ttdef"><b>Definition:</b> client.c:37</div></div>
<div class="ttc" id="asegment__tree_8c_html_aae59daf9a0dc33f8cbc7a525a616ee75"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree_build</a></div><div class="ttdeci">void segment_tree_build(segment_tree *tree)</div><div class="ttdoc">Builds a Segment tree It is assumed that leaves of tree already contains data.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:55</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><div class="ttdeci">struct node node</div><div class="ttdoc">Node, the basic data structure in the tree.</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_a73152b9ccb4aa5cd4c1bacd4188bb2de"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a73152b9ccb4aa5cd4c1bacd4188bb2de">insert</a></div><div class="ttdeci">node * insert(node *root, int data)</div><div class="ttdoc">Insertion procedure, which inserts the input key in a new node in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:46</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_ab21d1d36d95001defbca2f6abd4d410c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c">create_node</a></div><div class="ttdeci">node * create_node(int data)</div><div class="ttdoc">creates a new node param[in] data value to be inserted</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:38</div></div>
<div class="ttc" id="asegment__tree_8c_html_af61bd96660cb53f49f28d60a5f1d0c91"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a></div><div class="ttdeci">void segment_tree_query(segment_tree *tree, long long l, long long r, void *res)</div><div class="ttdoc">Query the segment tree This function helps in range query of segment tree This function assumes that ...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:105</div></div>
<div class="ttc" id="asegment__tree_8c_html_a776abfa81cde9016a2885dca7cfc05ab"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab">segment_tree_print_int</a></div><div class="ttdeci">void segment_tree_print_int(segment_tree *tree)</div><div class="ttdoc">Prints the data in segment tree The data should be of int type A utility to print segment tree with d...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:175</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_a823432888332fc9f0aa6072cff28c3bb"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb">insert_bt</a></div><div class="ttdeci">void insert_bt(node **root, int data)</div><div class="ttdoc">inserts a node into the tree param[in,out] root pointer to node pointer to the topmost node of the tr...</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:51</div></div>
<div class="ttc" id="astructsegment__tree_html_aa9dc376b5b219c4cec6546483527b853"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">segment_tree::elem_size</a></div><div class="ttdeci">size_t elem_size</div><div class="ttdoc">size in bytes of each data element</div><div class="ttdef"><b>Definition:</b> segment_tree.c:42</div></div>
<div class="ttc" id="astructsegment__tree_html_a5ad61abcbd2c25a4a71416281dba8f1e"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">segment_tree::length</a></div><div class="ttdeci">size_t length</div><div class="ttdoc">total size of array which segment tree represents</div><div class="ttdef"><b>Definition:</b> segment_tree.c:43</div></div>
<div class="ttc" id="astructsegment__tree_html"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html">segment_tree</a></div><div class="ttdoc">This structures holds all the data that is required by a segment tree.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:39</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdoc">Utilitary procedure to measure the height of the binary tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:187</div></div>
<div class="ttc" id="astructnode_html_a51e160f22dc6064bac4a4f9f1d931c2c"><div class="ttname"><a href="../../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c">node::right</a></div><div class="ttdeci">struct node * right</div><div class="ttdoc">right child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:17</div></div>
<div class="ttc" id="abinary__search__tree_8c_html_a01151353aa2d9688934ed39208133241"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241">purge</a></div><div class="ttdeci">void purge(node *root)</div><div class="ttdoc">Utilitary procedure to free all nodes in a tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:217</div></div>
<div class="ttc" id="asegment__tree_8c_html_ac206721972f739510cb11f7c0a6a8f63"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63">segment_tree</a></div><div class="ttdeci">struct segment_tree segment_tree</div><div class="ttdoc">This structures holds all the data that is required by a segment tree.</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:255</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

1
da/d23/list_8h_source.html
View File

@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('da/d23/list_8h_source.html','../../');
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="astruct_l_html"><div class="ttname"><a href="../../df/db3/struct_l.html">L</a></div><div class="ttdef"><b>Definition:</b> list.h:8</div></div>
<div class="ttc" id="asegment__tree_8c_html_a93bfab032ce9dbc0c1feaeee32a885fb"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a></div><div class="ttdeci">void minimum(const void *a, const void *b, void *c)</div><div class="ttdoc">Utility for test A function compare for minimum between two integers This function is used as combine...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:194</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_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>

662
da/da0/segment__tree_8c.html Normal file
View File

@ -0,0 +1,662 @@
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: data_structures/binary_trees/segment_tree.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C
&#160;<span id="projectnumber">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.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('da/da0/segment__tree_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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</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">segment_tree.c File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>segment trees with only point updates
<a href="#details">More...</a></p>
<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 />
<code>#include &lt;string.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for segment_tree.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/ddc/segment__tree_8c__incl.svg" width="448" height="127"><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 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="../../dd/d06/structsegment__tree.html">segment_tree</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">This structures holds all the data that is required by a segment tree. <a href="../../dd/d06/structsegment__tree.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 name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:aca549b5311d32ab1a703b4a4605821d8"><td class="memItemLeft" align="right" valign="top">typedef void(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">combine_function</a>) (const void *a, const void *b, void *result)</td></tr>
<tr class="memdesc:aca549b5311d32ab1a703b4a4605821d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that combines two data to generate a new one The name of function might be misleading actually combine here signifies the fact that in segment trees we take partial result from two ranges and using partial results we derive the result for joint range of those two ranges For Example: array(1,2,3,4,5,6) sum of range [0,2] = 6 and sum of range [3,5] = 15 the combined sum of two range is 6+15=21. <a href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">More...</a><br /></td></tr>
<tr class="separator:aca549b5311d32ab1a703b4a4605821d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac206721972f739510cb11f7c0a6a8f63"><td class="memItemLeft" align="right" valign="top"><a id="ac206721972f739510cb11f7c0a6a8f63"></a>
typedef struct <a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63">segment_tree</a></td></tr>
<tr class="memdesc:ac206721972f739510cb11f7c0a6a8f63"><td class="mdescLeft">&#160;</td><td class="mdescRight">This structures holds all the data that is required by a segment tree. <br /></td></tr>
<tr class="separator:ac206721972f739510cb11f7c0a6a8f63"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aae59daf9a0dc33f8cbc7a525a616ee75"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree_build</a> (<a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree)</td></tr>
<tr class="memdesc:aae59daf9a0dc33f8cbc7a525a616ee75"><td class="mdescLeft">&#160;</td><td class="mdescRight">Builds a Segment tree It is assumed that leaves of tree already contains data. <a href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">More...</a><br /></td></tr>
<tr class="separator:aae59daf9a0dc33f8cbc7a525a616ee75"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e81a9bbf01716f1b4fb27ef36a9098c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree_update</a> (<a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree, size_t index, void *val)</td></tr>
<tr class="memdesc:a1e81a9bbf01716f1b4fb27ef36a9098c"><td class="mdescLeft">&#160;</td><td class="mdescRight">For point updates This function updates the element at given index and also updates segment tree accordingly. <a href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">More...</a><br /></td></tr>
<tr class="separator:a1e81a9bbf01716f1b4fb27ef36a9098c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af61bd96660cb53f49f28d60a5f1d0c91"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a> (<a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree, long long l, long long r, void *res)</td></tr>
<tr class="memdesc:af61bd96660cb53f49f28d60a5f1d0c91"><td class="mdescLeft">&#160;</td><td class="mdescRight">Query the segment tree This function helps in range query of segment tree This function assumes that the given range is valid Performs the query in range [l,r]. <a href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">More...</a><br /></td></tr>
<tr class="separator:af61bd96660cb53f49f28d60a5f1d0c91"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acecc34fd89923ab41dcee3a779622816"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree_init</a> (void *arr, size_t elem_size, size_t len, void *identity, <a class="el" href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">combine_function</a> <a class="el" href="../../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925">func</a>)</td></tr>
<tr class="memdesc:acecc34fd89923ab41dcee3a779622816"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with data from array. <a href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">More...</a><br /></td></tr>
<tr class="separator:acecc34fd89923ab41dcee3a779622816"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af20a9f373083d3f701e1cd92560cef01"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree_dispose</a> (<a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree)</td></tr>
<tr class="memdesc:af20a9f373083d3f701e1cd92560cef01"><td class="mdescLeft">&#160;</td><td class="mdescRight">Dispose Segment Tree Frees all heap memory accquired by segment tree. <a href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">More...</a><br /></td></tr>
<tr class="separator:af20a9f373083d3f701e1cd92560cef01"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a776abfa81cde9016a2885dca7cfc05ab"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab">segment_tree_print_int</a> (<a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree)</td></tr>
<tr class="memdesc:a776abfa81cde9016a2885dca7cfc05ab"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the data in segment tree The data should be of int type A utility to print segment tree with data type of int. <a href="../../da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab">More...</a><br /></td></tr>
<tr class="separator:a776abfa81cde9016a2885dca7cfc05ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a93bfab032ce9dbc0c1feaeee32a885fb"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a> (const void *a, const void *b, void *c)</td></tr>
<tr class="memdesc:a93bfab032ce9dbc0c1feaeee32a885fb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility for test A function compare for minimum between two integers This function is used as combine_function for RMQ. <a href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">More...</a><br /></td></tr>
<tr class="separator:a93bfab032ce9dbc0c1feaeee32a885fb"><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="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test RMQ Testing Segment tree using Range Minimum Queries. <a href="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><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="../../da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main Function. <a href="../../da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><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>segment trees with only point updates </p>
<p>This code implements segment trees. Segment trees are general structures which allow range based queries in a given array in logN time. Segment tree with point updates allow update of single element in the array in logN time. <a href="https://codeforces.com/blog/entry/18051">Learn more about segment trees here</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Lakhan-Nad">Lakhan Nad</a> </dd></dl>
</div><h2 class="groupheader">Typedef Documentation</h2>
<a id="aca549b5311d32ab1a703b4a4605821d8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aca549b5311d32ab1a703b4a4605821d8">&#9670;&nbsp;</a></span>combine_function</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef void(* combine_function) (const void *a, const void *b, void *result)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Function that combines two data to generate a new one The name of function might be misleading actually combine here signifies the fact that in segment trees we take partial result from two ranges and using partial results we derive the result for joint range of those two ranges For Example: array(1,2,3,4,5,6) sum of range [0,2] = 6 and sum of range [3,5] = 15 the combined sum of two range is 6+15=21. </p>
<dl class="section note"><dt>Note</dt><dd>The function is same to binary function in Discrete Mathematics </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>pointer to first data </td></tr>
<tr><td class="paramname">b</td><td>pointer to second data </td></tr>
<tr><td class="paramname">result</td><td>pointer to memory location where result of combining a and b is to be stored </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</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"><a name="l00232"></a><span class="lineno"> 232</span>&#160;{</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160;}</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="../../da/da0/segment__tree_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="450" height="291"><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="a93bfab032ce9dbc0c1feaeee32a885fb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a93bfab032ce9dbc0c1feaeee32a885fb">&#9670;&nbsp;</a></span>minimum()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void minimum </td>
<td>(</td>
<td class="paramtype">const void *&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const void *&#160;</td>
<td class="paramname"><em>b</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>c</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Utility for test A function compare for minimum between two integers This function is used as combine_function for RMQ. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>pointer to integer a </td></tr>
<tr><td class="paramname">b</td><td>pointer to integer b </td></tr>
<tr><td class="paramname">c</td><td>pointer where minimum of a and b is tored as result </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160;{</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; *(<span class="keywordtype">int</span> *)c = *(<span class="keywordtype">int</span> *)a &lt; *(<span class="keywordtype">int</span> *)b ? *(<span class="keywordtype">int</span> *)a : *(<span class="keywordtype">int</span> *)b;</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aae59daf9a0dc33f8cbc7a525a616ee75"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aae59daf9a0dc33f8cbc7a525a616ee75">&#9670;&nbsp;</a></span>segment_tree_build()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void segment_tree_build </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Builds a Segment tree It is assumed that leaves of tree already contains data. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>pointer to segment tree to be build </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160;{</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordtype">size_t</span> elem_size = tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a>;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordtype">int</span> index = (tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> - 2);</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordtype">size_t</span> b, l, r;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordtype">char</span> *ptr = (<span class="keywordtype">char</span> *)tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; for (; index &gt;= 0; index--)</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; b = index * elem_size;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; l = (2 * index + 1) * elem_size;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; r = (2 * index + 2) * elem_size;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a>(ptr + l, ptr + r, ptr + b);</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; }</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="af20a9f373083d3f701e1cd92560cef01"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af20a9f373083d3f701e1cd92560cef01">&#9670;&nbsp;</a></span>segment_tree_dispose()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void segment_tree_dispose </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Dispose Segment Tree Frees all heap memory accquired by segment tree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>pointer to segment tree </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160;{</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; free(tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>);</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; free(tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">identity</a>);</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="acecc34fd89923ab41dcee3a779622816"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acecc34fd89923ab41dcee3a779622816">&#9670;&nbsp;</a></span>segment_tree_init()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a>* segment_tree_init </td>
<td>(</td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>elem_size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>len</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>identity</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">combine_function</a>&#160;</td>
<td class="paramname"><em>func</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with data from array. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>the array data upon which segment tree is build </td></tr>
<tr><td class="paramname">elem_size</td><td>size of each element in segment tree </td></tr>
<tr><td class="paramname">len</td><td>total no of elements in array </td></tr>
<tr><td class="paramname">identity</td><td>the identity element for combine_function </td></tr>
<tr><td class="paramname">func</td><td>the combine_function used to build segment tree</td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>pointer to sgement tree build </dd></dl>
<div class="fragment"><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160;{</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <a class="code" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree = malloc(<span class="keyword">sizeof</span>(<a class="code" href="../../dd/d06/structsegment__tree.html">segment_tree</a>));</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a> = elem_size;</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> = len;</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a> = <a class="code" href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">func</a>;</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a> = malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">char</span>) * elem_size * (2 * len - 1));</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">identity</a> = malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">char</span>) * elem_size);</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="keywordtype">char</span> *ptr = (<span class="keywordtype">char</span> *)tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>;</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; memset(ptr, 0, (len - 1) * elem_size); <span class="comment">// Initializing memory</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; ptr = ptr + (len - 1) * elem_size;</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; memcpy(ptr, arr, elem_size * len); <span class="comment">// copy the leaf nodes i.e. array data</span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; memcpy(tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">identity</a>, identity, elem_size); <span class="comment">// copy identity element</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="keywordflow">return</span> tree;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160;}</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="../../da/da0/segment__tree_8c_acecc34fd89923ab41dcee3a779622816_cgraph.svg" width="231" height="38"><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="a776abfa81cde9016a2885dca7cfc05ab"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a776abfa81cde9016a2885dca7cfc05ab">&#9670;&nbsp;</a></span>segment_tree_print_int()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void segment_tree_print_int </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td>
<td class="paramname"><em>tree</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Prints the data in segment tree The data should be of int type A utility to print segment tree with data type of int. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>pointer to segment tree </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160;{</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="keywordtype">char</span> *base = (<span class="keywordtype">char</span> *)tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>;</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordtype">size_t</span> i = 0;</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; for (; i &lt; 2 * tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> - 1; i++)</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; {</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; printf(<span class="stringliteral">&quot;%d &quot;</span>, *(<span class="keywordtype">int</span> *)(base + i * tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a>));</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; }</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; printf(<span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="af61bd96660cb53f49f28d60a5f1d0c91"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af61bd96660cb53f49f28d60a5f1d0c91">&#9670;&nbsp;</a></span>segment_tree_query()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void segment_tree_query </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">long long&#160;</td>
<td class="paramname"><em>l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">long long&#160;</td>
<td class="paramname"><em>r</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>res</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Query the segment tree This function helps in range query of segment tree This function assumes that the given range is valid Performs the query in range [l,r]. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>pointer to segment tree </td></tr>
<tr><td class="paramname">l</td><td>the start of range </td></tr>
<tr><td class="paramname">r</td><td>the end of range </td></tr>
<tr><td class="paramname">res</td><td>the pointer to memory where result of query is stored </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;{</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordtype">size_t</span> elem_size = tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; memcpy(res, tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">identity</a>, elem_size);</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; elem_size = tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a>;</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordtype">char</span> *root = (<span class="keywordtype">char</span> *)tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; l += tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> - 1;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; r += tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> - 1;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; while (l &lt;= r)</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; {</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">if</span> (!(l &amp; 1))</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; {</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a>(res, root + l * elem_size, res);</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">if</span> (r &amp; 1)</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a>(res, root + r * elem_size, res);</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; r = (r &gt;&gt; 1) - 1;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; l = (l &gt;&gt; 1);</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a1e81a9bbf01716f1b4fb27ef36a9098c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1e81a9bbf01716f1b4fb27ef36a9098c">&#9670;&nbsp;</a></span>segment_tree_update()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void segment_tree_update </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *&#160;</td>
<td class="paramname"><em>tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>index</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>val</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>For point updates This function updates the element at given index and also updates segment tree accordingly. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree</td><td>pointer to segment tree </td></tr>
<tr><td class="paramname">index</td><td>the index whose element is to be updated (0 based indexing used) </td></tr>
<tr><td class="paramname">val</td><td>pointer to value that is to be replaced at given index </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;{</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordtype">size_t</span> elem_size = tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a>;</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; index = index + tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a> - 1;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordtype">char</span> *base = (<span class="keywordtype">char</span> *)tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a>;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordtype">char</span> *t = base + index * elem_size;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; memcpy(t, val, elem_size);</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="keywordflow">while</span> (index &gt; 0)</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; index = ((index - 1) &gt;&gt; 1);</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; tree-&gt;<a class="code" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a>(base + (2 * index + 1) * elem_size,</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; base + (2 * index + 2) * elem_size,</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; base + index * elem_size);</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; }</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&nbsp;</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>Test RMQ Testing Segment tree using Range Minimum Queries. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160;{</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; int32_t arr[10] = {1, 0, 3, 5, 7, 2, 11, 6, -2, 8};</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; int32_t identity = __INT32_MAX__;</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; <a class="code" href="../../dd/d06/structsegment__tree.html">segment_tree</a> *tree =</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree_init</a>(arr, <span class="keyword">sizeof</span>(*arr), 10, &amp;identity, <a class="code" href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a>);</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree_build</a>(tree);</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; int32_t result;</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a>(tree, 3, 6, &amp;result);</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; assert(result == 2);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a>(tree, 8, 9, &amp;result);</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; assert(result == -2);</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; result = 12;</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree_update</a>(tree, 5, &amp;result);</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree_update</a>(tree, 8, &amp;result);</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a>(tree, 0, 3, &amp;result);</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; assert(result == 0);</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a>(tree, 8, 9, &amp;result);</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; assert(result == 8);</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <a class="code" href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree_dispose</a>(tree);</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160;}</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="../../da/da0/segment__tree_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="351" height="291"><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 -->
<div class="ttc" id="asegment__tree_8c_html_a93bfab032ce9dbc0c1feaeee32a885fb"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a></div><div class="ttdeci">void minimum(const void *a, const void *b, void *c)</div><div class="ttdoc">Utility for test A function compare for minimum between two integers This function is used as combine...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:194</div></div>
<div class="ttc" id="asegment__tree_8c_html_a1e81a9bbf01716f1b4fb27ef36a9098c"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree_update</a></div><div class="ttdeci">void segment_tree_update(segment_tree *tree, size_t index, void *val)</div><div class="ttdoc">For point updates This function updates the element at given index and also updates segment tree acco...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:79</div></div>
<div class="ttc" id="astructsegment__tree_html_aa18d7cb422873a807707b26448dce7cd"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">segment_tree::root</a></div><div class="ttdeci">void * root</div><div class="ttdoc">the root of formed segment tree</div><div class="ttdef"><b>Definition:</b> segment_tree.c:40</div></div>
<div class="ttc" id="astructsegment__tree_html_a5373ee53a5ac1cd7a9dcb89a4c23a04a"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">segment_tree::identity</a></div><div class="ttdeci">void * identity</div><div class="ttdoc">identity element for combine function</div><div class="ttdef"><b>Definition:</b> segment_tree.c:41</div></div>
<div class="ttc" id="astructsegment__tree_html_a973ab017a97678fdc6774543585897df"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">segment_tree::combine</a></div><div class="ttdeci">combine_function combine</div><div class="ttdoc">the function to be used to combine two node's data to form parent's data</div><div class="ttdef"><b>Definition:</b> segment_tree.c:47</div></div>
<div class="ttc" id="asegment__tree_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test RMQ Testing Segment tree using Range Minimum Queries.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:205</div></div>
<div class="ttc" id="asegment__tree_8c_html_acecc34fd89923ab41dcee3a779622816"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree_init</a></div><div class="ttdeci">segment_tree * segment_tree_init(void *arr, size_t elem_size, size_t len, void *identity, combine_function func)</div><div class="ttdoc">Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:140</div></div>
<div class="ttc" id="asegment__tree_8c_html_af20a9f373083d3f701e1cd92560cef01"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree_dispose</a></div><div class="ttdeci">void segment_tree_dispose(segment_tree *tree)</div><div class="ttdoc">Dispose Segment Tree Frees all heap memory accquired by segment tree.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:162</div></div>
<div class="ttc" id="aclient_8c_html_ac17020a38607ab29ce18939d5194a32a"><div class="ttname"><a href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a">func</a></div><div class="ttdeci">void func(int sockfd)</div><div class="ttdoc">Continuous loop to send and receive over the socket.</div><div class="ttdef"><b>Definition:</b> client.c:37</div></div>
<div class="ttc" id="asegment__tree_8c_html_aae59daf9a0dc33f8cbc7a525a616ee75"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree_build</a></div><div class="ttdeci">void segment_tree_build(segment_tree *tree)</div><div class="ttdoc">Builds a Segment tree It is assumed that leaves of tree already contains data.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:55</div></div>
<div class="ttc" id="asegment__tree_8c_html_af61bd96660cb53f49f28d60a5f1d0c91"><div class="ttname"><a href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree_query</a></div><div class="ttdeci">void segment_tree_query(segment_tree *tree, long long l, long long r, void *res)</div><div class="ttdoc">Query the segment tree This function helps in range query of segment tree This function assumes that ...</div><div class="ttdef"><b>Definition:</b> segment_tree.c:105</div></div>
<div class="ttc" id="astructsegment__tree_html_aa9dc376b5b219c4cec6546483527b853"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">segment_tree::elem_size</a></div><div class="ttdeci">size_t elem_size</div><div class="ttdoc">size in bytes of each data element</div><div class="ttdef"><b>Definition:</b> segment_tree.c:42</div></div>
<div class="ttc" id="astructsegment__tree_html_a5ad61abcbd2c25a4a71416281dba8f1e"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">segment_tree::length</a></div><div class="ttdeci">size_t length</div><div class="ttdoc">total size of array which segment tree represents</div><div class="ttdef"><b>Definition:</b> segment_tree.c:43</div></div>
<div class="ttc" id="astructsegment__tree_html"><div class="ttname"><a href="../../dd/d06/structsegment__tree.html">segment_tree</a></div><div class="ttdoc">This structures holds all the data that is required by a segment tree.</div><div class="ttdef"><b>Definition:</b> segment_tree.c:39</div></div>
<!-- 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_e39df94f82619fa5256f1786519937be.html">binary_trees</a></li><li class="navelem"><a class="el" href="../../da/da0/segment__tree_8c.html">segment_tree.c</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

15
da/da0/segment__tree_8c.js Normal file
View File

@ -0,0 +1,15 @@
var segment__tree_8c =
[
[ "segment_tree", "dd/d06/structsegment__tree.html", "dd/d06/structsegment__tree" ],
[ "combine_function", "da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8", null ],
[ "segment_tree", "da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63", null ],
[ "main", "da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "minimum", "da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb", null ],
[ "segment_tree_build", "da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75", null ],
[ "segment_tree_dispose", "da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01", null ],
[ "segment_tree_init", "da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816", null ],
[ "segment_tree_print_int", "da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab", null ],
[ "segment_tree_query", "da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91", null ],
[ "segment_tree_update", "da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c", null ],
[ "test", "da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

10
da/da0/segment__tree_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@ -0,0 +1,10 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Test RMQ Testing Segment tree using Range Minimum Queries." alt="" coords="5,132,49,159"/>
<area shape="rect" id="node2" href="$da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb" title="Utility for test A function compare for minimum between two integers This function is used as combine..." alt="" coords="137,5,211,32"/>
<area shape="rect" id="node3" href="$da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75" title="Builds a Segment tree It is assumed that leaves of tree already contains data." alt="" coords="107,56,241,83"/>
<area shape="rect" id="node4" href="$da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01" title="Dispose Segment Tree Frees all heap memory accquired by segment tree." alt="" coords="97,107,251,133"/>
<area shape="rect" id="node5" href="$da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816" title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d..." alt="" coords="111,157,237,184"/>
<area shape="rect" id="node7" href="$da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91" title="Query the segment tree This function helps in range query of segment tree This function assumes that ..." alt="" coords="104,208,244,235"/>
<area shape="rect" id="node8" href="$da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c" title="For point updates This function updates the element at given index and also updates segment tree acco..." alt="" coords="101,259,247,285"/>
<area shape="rect" id="node6" href="$dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" title="Continuous loop to send and receive over the socket." alt="" coords="299,157,345,184"/>
</map>

1
da/da0/segment__tree_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
1c86120d378018b751c34c9d4c753d45

127
da/da0/segment__tree_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@ -0,0 +1,127 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: test Pages: 1 -->
<svg width="263pt" height="218pt"
viewBox="0.00 0.00 263.00 218.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 214)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-214 259,-214 259,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test RMQ Testing Segment tree using Range Minimum Queries.">
<polygon fill="#bfbfbf" stroke="black" points="0,-95.5 0,-114.5 33,-114.5 33,-95.5 0,-95.5"/>
<text text-anchor="middle" x="16.5" y="-102.5" 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="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb" target="_top" xlink:title="Utility for test A function compare for minimum between two integers This function is used as combine...">
<polygon fill="white" stroke="black" points="98.5,-190.5 98.5,-209.5 154.5,-209.5 154.5,-190.5 98.5,-190.5"/>
<text text-anchor="middle" x="126.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M21.54,-114.66C28.73,-130.73 45.27,-162.97 69,-181 74.89,-185.48 81.9,-188.94 88.94,-191.59"/>
<polygon fill="midnightblue" stroke="midnightblue" points="87.87,-194.93 98.46,-194.75 90.07,-188.28 87.87,-194.93"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75" target="_top" xlink:title="Builds a Segment tree It is assumed that leaves of tree already contains data.">
<polygon fill="white" stroke="black" points="76,-152.5 76,-171.5 177,-171.5 177,-152.5 76,-152.5"/>
<text text-anchor="middle" x="126.5" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_build</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M28.28,-114.53C38.27,-122.95 53.82,-135.1 69,-143 73.03,-145.1 77.35,-147.04 81.72,-148.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="80.74,-152.18 91.33,-152.42 83.2,-145.62 80.74,-152.18"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01" target="_top" xlink:title="Dispose Segment Tree Frees all heap memory accquired by segment tree.">
<polygon fill="white" stroke="black" points="69,-114.5 69,-133.5 184,-133.5 184,-114.5 69,-114.5"/>
<text text-anchor="middle" x="126.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_dispose</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M33.44,-107.8C41.17,-109.16 51.03,-110.9 61.4,-112.72"/>
<polygon fill="midnightblue" stroke="midnightblue" points="61,-116.21 71.46,-114.49 62.21,-109.31 61,-116.21"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816" target="_top" xlink:title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...">
<polygon fill="white" stroke="black" points="79.5,-76.5 79.5,-95.5 173.5,-95.5 173.5,-76.5 79.5,-76.5"/>
<text text-anchor="middle" x="126.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_init</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M33.44,-102.2C43.07,-100.5 55.99,-98.23 69.1,-95.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="69.86,-99.34 79.11,-94.16 68.65,-92.45 69.86,-99.34"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91" target="_top" xlink:title="Query the segment tree This function helps in range query of segment tree This function assumes that ...">
<polygon fill="white" stroke="black" points="74,-38.5 74,-57.5 179,-57.5 179,-38.5 74,-38.5"/>
<text text-anchor="middle" x="126.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_query</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M28.28,-95.47C38.27,-87.05 53.82,-74.9 69,-67 73.03,-64.9 77.35,-62.96 81.72,-61.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="83.2,-64.38 91.33,-57.58 80.74,-57.82 83.2,-64.38"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c" target="_top" xlink:title="For point updates This function updates the element at given index and also updates segment tree acco...">
<polygon fill="white" stroke="black" points="71.5,-0.5 71.5,-19.5 181.5,-19.5 181.5,-0.5 71.5,-0.5"/>
<text text-anchor="middle" x="126.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_update</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M21.54,-95.34C28.73,-79.27 45.27,-47.03 69,-29 71.47,-27.12 74.15,-25.42 76.93,-23.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="78.61,-26.96 86.14,-19.51 75.6,-20.64 78.61,-26.96"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" target="_top" xlink:title="Continuous loop to send and receive over the socket.">
<polygon fill="white" stroke="black" points="220,-76.5 220,-95.5 255,-95.5 255,-76.5 220,-76.5"/>
<text text-anchor="middle" x="237.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">func</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M173.73,-86C186,-86 198.84,-86 209.69,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="209.78,-89.5 219.78,-86 209.78,-82.5 209.78,-89.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.8 KiB

4
da/da0/segment__tree_8c_acecc34fd89923ab41dcee3a779622816_cgraph.map Normal file
View File

@ -0,0 +1,4 @@
<map id="segment_tree_init" name="segment_tree_init">
<area shape="rect" id="node1" title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d..." alt="" coords="5,5,131,32"/>
<area shape="rect" id="node2" href="$dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" title="Continuous loop to send and receive over the socket." alt="" coords="179,5,225,32"/>
</map>

1
da/da0/segment__tree_8c_acecc34fd89923ab41dcee3a779622816_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
4c5476714a2080707d1de76df951ed57

37
da/da0/segment__tree_8c_acecc34fd89923ab41dcee3a779622816_cgraph.svg Normal file
View File

@ -0,0 +1,37 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: segment_tree_init Pages: 1 -->
<svg width="173pt" height="28pt"
viewBox="0.00 0.00 173.00 28.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 24)">
<title>segment_tree_init</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 169,-24 169,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 94,-19.5 94,-0.5 0,-0.5"/>
<text text-anchor="middle" x="47" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_init</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" target="_top" xlink:title="Continuous loop to send and receive over the socket.">
<polygon fill="white" stroke="black" points="130,-0.5 130,-19.5 165,-19.5 165,-0.5 130,-0.5"/>
<text text-anchor="middle" x="147.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">func</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M94.08,-10C102.89,-10 111.84,-10 119.79,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="119.9,-13.5 129.9,-10 119.9,-6.5 119.9,-13.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

11
da/da0/segment__tree_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@ -0,0 +1,11 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main Function." alt="" coords="5,132,56,159"/>
<area shape="rect" id="node2" href="$da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d" title="Test RMQ Testing Segment tree using Range Minimum Queries." alt="" coords="104,132,148,159"/>
<area shape="rect" id="node3" href="$da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb" title="Utility for test A function compare for minimum between two integers This function is used as combine..." alt="" coords="235,5,310,32"/>
<area shape="rect" id="node4" href="$da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75" title="Builds a Segment tree It is assumed that leaves of tree already contains data." alt="" coords="205,56,340,83"/>
<area shape="rect" id="node5" href="$da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01" title="Dispose Segment Tree Frees all heap memory accquired by segment tree." alt="" coords="196,107,349,133"/>
<area shape="rect" id="node6" href="$da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816" title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d..." alt="" coords="210,157,335,184"/>
<area shape="rect" id="node8" href="$da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91" title="Query the segment tree This function helps in range query of segment tree This function assumes that ..." alt="" coords="203,208,343,235"/>
<area shape="rect" id="node9" href="$da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c" title="For point updates This function updates the element at given index and also updates segment tree acco..." alt="" coords="199,259,346,285"/>
<area shape="rect" id="node7" href="$dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" title="Continuous loop to send and receive over the socket." alt="" coords="397,157,444,184"/>
</map>

1
da/da0/segment__tree_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
70269bbf38df81cb7cc61e734ac5d492

142
da/da0/segment__tree_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@ -0,0 +1,142 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: main Pages: 1 -->
<svg width="337pt" height="218pt"
viewBox="0.00 0.00 337.00 218.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 214)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-214 333,-214 333,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main Function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-95.5 0,-114.5 38,-114.5 38,-95.5 0,-95.5"/>
<text text-anchor="middle" x="19" y="-102.5" 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="../../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test RMQ Testing Segment tree using Range Minimum Queries.">
<polygon fill="white" stroke="black" points="74,-95.5 74,-114.5 107,-114.5 107,-95.5 74,-95.5"/>
<text text-anchor="middle" x="90.5" y="-102.5" 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="midnightblue" d="M38.26,-105C46.07,-105 55.31,-105 63.79,-105"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-108.5 73.95,-105 63.95,-101.5 63.95,-108.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb" target="_top" xlink:title="Utility for test A function compare for minimum between two integers This function is used as combine...">
<polygon fill="white" stroke="black" points="172.5,-190.5 172.5,-209.5 228.5,-209.5 228.5,-190.5 172.5,-190.5"/>
<text text-anchor="middle" x="200.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">minimum</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M95.54,-114.66C102.73,-130.73 119.27,-162.97 143,-181 148.89,-185.48 155.9,-188.94 162.94,-191.59"/>
<polygon fill="midnightblue" stroke="midnightblue" points="161.87,-194.93 172.46,-194.75 164.07,-188.28 161.87,-194.93"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75" target="_top" xlink:title="Builds a Segment tree It is assumed that leaves of tree already contains data.">
<polygon fill="white" stroke="black" points="150,-152.5 150,-171.5 251,-171.5 251,-152.5 150,-152.5"/>
<text text-anchor="middle" x="200.5" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_build</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M102.28,-114.53C112.27,-122.95 127.82,-135.1 143,-143 147.03,-145.1 151.35,-147.04 155.72,-148.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="154.74,-152.18 165.33,-152.42 157.2,-145.62 154.74,-152.18"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01" target="_top" xlink:title="Dispose Segment Tree Frees all heap memory accquired by segment tree.">
<polygon fill="white" stroke="black" points="143,-114.5 143,-133.5 258,-133.5 258,-114.5 143,-114.5"/>
<text text-anchor="middle" x="200.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_dispose</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M107.44,-107.8C115.17,-109.16 125.03,-110.9 135.4,-112.72"/>
<polygon fill="midnightblue" stroke="midnightblue" points="135,-116.21 145.46,-114.49 136.21,-109.31 135,-116.21"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816" target="_top" xlink:title="Initializes Segment Tree Accquires memory for segment tree and fill the leaves of segment tree with d...">
<polygon fill="white" stroke="black" points="153.5,-76.5 153.5,-95.5 247.5,-95.5 247.5,-76.5 153.5,-76.5"/>
<text text-anchor="middle" x="200.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_init</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M107.44,-102.2C117.07,-100.5 129.99,-98.23 143.1,-95.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="143.86,-99.34 153.11,-94.16 142.65,-92.45 143.86,-99.34"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91" target="_top" xlink:title="Query the segment tree This function helps in range query of segment tree This function assumes that ...">
<polygon fill="white" stroke="black" points="148,-38.5 148,-57.5 253,-57.5 253,-38.5 148,-38.5"/>
<text text-anchor="middle" x="200.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_query</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M102.28,-95.47C112.27,-87.05 127.82,-74.9 143,-67 147.03,-64.9 151.35,-62.96 155.72,-61.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="157.2,-64.38 165.33,-57.58 154.74,-57.82 157.2,-64.38"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c" target="_top" xlink:title="For point updates This function updates the element at given index and also updates segment tree acco...">
<polygon fill="white" stroke="black" points="145.5,-0.5 145.5,-19.5 255.5,-19.5 255.5,-0.5 145.5,-0.5"/>
<text text-anchor="middle" x="200.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">segment_tree_update</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node2&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M95.54,-95.34C102.73,-79.27 119.27,-47.03 143,-29 145.47,-27.12 148.15,-25.42 150.93,-23.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="152.61,-26.96 160.14,-19.51 149.6,-20.64 152.61,-26.96"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a" target="_top" xlink:title="Continuous loop to send and receive over the socket.">
<polygon fill="white" stroke="black" points="294,-76.5 294,-95.5 329,-95.5 329,-76.5 294,-76.5"/>
<text text-anchor="middle" x="311.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">func</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M247.73,-86C260,-86 272.84,-86 283.69,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="283.78,-89.5 293.78,-86 283.78,-82.5 283.78,-89.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 7.5 KiB

141
dd/d06/structsegment__tree.html Normal file
View File

@ -0,0 +1,141 @@
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: segment_tree 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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C
&#160;<span id="projectnumber">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.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('dd/d06/structsegment__tree.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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-attribs">Data Fields</a> </div>
<div class="headertitle">
<div class="title">segment_tree Struct Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>This structures holds all the data that is required by a segment tree.
<a href="../../dd/d06/structsegment__tree.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:aa18d7cb422873a807707b26448dce7cd"><td class="memItemLeft" align="right" valign="top"><a id="aa18d7cb422873a807707b26448dce7cd"></a>
void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">root</a></td></tr>
<tr class="memdesc:aa18d7cb422873a807707b26448dce7cd"><td class="mdescLeft">&#160;</td><td class="mdescRight">the root of formed segment tree <br /></td></tr>
<tr class="separator:aa18d7cb422873a807707b26448dce7cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5373ee53a5ac1cd7a9dcb89a4c23a04a"><td class="memItemLeft" align="right" valign="top"><a id="a5373ee53a5ac1cd7a9dcb89a4c23a04a"></a>
void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">identity</a></td></tr>
<tr class="memdesc:a5373ee53a5ac1cd7a9dcb89a4c23a04a"><td class="mdescLeft">&#160;</td><td class="mdescRight">identity element for combine function <br /></td></tr>
<tr class="separator:a5373ee53a5ac1cd7a9dcb89a4c23a04a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa9dc376b5b219c4cec6546483527b853"><td class="memItemLeft" align="right" valign="top"><a id="aa9dc376b5b219c4cec6546483527b853"></a>
size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">elem_size</a></td></tr>
<tr class="memdesc:aa9dc376b5b219c4cec6546483527b853"><td class="mdescLeft">&#160;</td><td class="mdescRight">size in bytes of each data element <br /></td></tr>
<tr class="separator:aa9dc376b5b219c4cec6546483527b853"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5ad61abcbd2c25a4a71416281dba8f1e"><td class="memItemLeft" align="right" valign="top"><a id="a5ad61abcbd2c25a4a71416281dba8f1e"></a>
size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">length</a></td></tr>
<tr class="memdesc:a5ad61abcbd2c25a4a71416281dba8f1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">total size of array which segment tree represents <br /></td></tr>
<tr class="separator:a5ad61abcbd2c25a4a71416281dba8f1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a973ab017a97678fdc6774543585897df"><td class="memItemLeft" align="right" valign="top"><a id="a973ab017a97678fdc6774543585897df"></a>
<a class="el" href="../../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">combine_function</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">combine</a></td></tr>
<tr class="memdesc:a973ab017a97678fdc6774543585897df"><td class="mdescLeft">&#160;</td><td class="mdescRight">the function to be used to combine two node's data to form parent's data <br /></td></tr>
<tr class="separator:a973ab017a97678fdc6774543585897df"><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>This structures holds all the data that is required by a segment tree. </p>
</div><hr/>The documentation for this struct was generated from the following file:<ul>
<li>data_structures/binary_trees/<a class="el" href="../../da/da0/segment__tree_8c.html">segment_tree.c</a></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="../../dd/d06/structsegment__tree.html">segment_tree</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

8
dd/d06/structsegment__tree.js Normal file
View File

@ -0,0 +1,8 @@
var structsegment__tree =
[
[ "combine", "dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df", null ],
[ "elem_size", "dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853", null ],
[ "identity", "dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a", null ],
[ "length", "dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e", null ],
[ "root", "dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd", null ]
];

3
dir_e39df94f82619fa5256f1786519937be.html
View File

@ -100,6 +100,9 @@ Files</h2></td></tr>
<tr class="memitem:da/d02/binary__search__tree_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d02/binary__search__tree_8c.html">binary_search_tree.c</a></td></tr>
<tr class="memdesc:da/d02/binary__search__tree_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">A basic unbalanced binary search tree implementation in C. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:da/da0/segment__tree_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/da0/segment__tree_8c.html">segment_tree.c</a></td></tr>
<tr class="memdesc:da/da0/segment__tree_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">segment trees with only point updates <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:df/d3c/threaded__binary__trees_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d3c/threaded__binary__trees_8c.html">threaded_binary_trees.c</a></td></tr>
<tr class="memdesc:df/d3c/threaded__binary__trees_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">This file is a simple implementation of a Threaded Binary Tree. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_e39df94f82619fa5256f1786519937be.js
View File

@ -1,5 +1,6 @@
var dir_e39df94f82619fa5256f1786519937be =
[
[ "binary_search_tree.c", "da/d02/binary__search__tree_8c.html", "da/d02/binary__search__tree_8c" ],
[ "segment_tree.c", "da/da0/segment__tree_8c.html", "da/da0/segment__tree_8c" ],
[ "threaded_binary_trees.c", "df/d3c/threaded__binary__trees_8c.html", "df/d3c/threaded__binary__trees_8c" ]
];

3
files.html
View File

@ -110,7 +110,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_2_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d2/dc3/carray_8h_source.html"><span class="icondoc"></span></a><b>carray.h</b></td><td class="desc"></td></tr>
<tr id="row_2_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_2_1_" class="arrow" onclick="toggleFolder('2_1_')">&#9658;</span><span id="img_2_1_" class="iconfclosed" onclick="toggleFolder('2_1_')">&#160;</span><a class="el" href="dir_e39df94f82619fa5256f1786519937be.html" target="_self">binary_trees</a></td><td class="desc"></td></tr>
<tr id="row_2_1_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="da/d02/binary__search__tree_8c.html" target="_self">binary_search_tree.c</a></td><td class="desc">A basic unbalanced binary search tree implementation in C </td></tr>
<tr id="row_2_1_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="df/d3c/threaded__binary__trees_8c.html" target="_self">threaded_binary_trees.c</a></td><td class="desc">This file is a simple implementation of a Threaded Binary Tree </td></tr>
<tr id="row_2_1_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="da/da0/segment__tree_8c.html" target="_self">segment_tree.c</a></td><td class="desc">Segment trees with only point updates </td></tr>
<tr id="row_2_1_2_" 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="df/d3c/threaded__binary__trees_8c.html" target="_self">threaded_binary_trees.c</a></td><td class="desc">This file is a simple implementation of a Threaded Binary Tree </td></tr>
<tr id="row_2_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_2_2_" class="arrow" onclick="toggleFolder('2_2_')">&#9658;</span><span id="img_2_2_" class="iconfclosed" onclick="toggleFolder('2_2_')">&#160;</span><a class="el" href="dir_7445e5a68245b48f3c03982b6d501815.html" target="_self">dictionary</a></td><td class="desc"></td></tr>
<tr id="row_2_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d8/d7c/dict_8h_source.html"><span class="icondoc"></span></a><b>dict.h</b></td><td class="desc"></td></tr>
<tr id="row_2_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_2_3_" class="arrow" onclick="toggleFolder('2_3_')">&#9658;</span><span id="img_2_3_" class="iconfclosed" onclick="toggleFolder('2_3_')">&#160;</span><a class="el" href="dir_bd4a7dd282074645ef41b1ea31ac813a.html" target="_self">dynamic_array</a></td><td class="desc"></td></tr>

19
functions.html
View File

@ -107,6 +107,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
<h3><a id="index_c"></a>- c -</h3><ul>
<li>combine
: <a class="el" href="dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">segment_tree</a>
</li>
<li>count
: <a class="el" href="d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b">cluster</a>
</li>
@ -139,6 +142,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
<h3><a id="index_e"></a>- e -</h3><ul>
<li>elem_size
: <a class="el" href="dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">segment_tree</a>
</li>
<li>elevation
: <a class="el" href="d2/de8/structeuler__.html#abbbf12f0a960faf783d219f9012cdce6">euler_</a>
</li>
@ -165,10 +171,20 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
</ul>
<h3><a id="index_i"></a>- i -</h3><ul>
<li>identity
: <a class="el" href="dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">segment_tree</a>
</li>
</ul>
<h3><a id="index_l"></a>- l -</h3><ul>
<li>left
: <a class="el" href="d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">node</a>
</li>
<li>length
: <a class="el" href="dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">segment_tree</a>
</li>
<li>llink
: <a class="el" href="db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef">Node</a>
</li>
@ -227,6 +243,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
<li>roll
: <a class="el" href="d2/de8/structeuler__.html#a3f1b77e489be443a8d84a84082b8092e">euler_</a>
</li>
<li>root
: <a class="el" href="dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">segment_tree</a>
</li>
<li>row1
: <a class="el" href="d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e">mat_3x3_</a>
</li>

19
functions_vars.html
View File

@ -107,6 +107,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_c"></a>- c -</h3><ul>
<li>combine
: <a class="el" href="dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df">segment_tree</a>
</li>
<li>count
: <a class="el" href="d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b">cluster</a>
</li>
@ -139,6 +142,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_e"></a>- e -</h3><ul>
<li>elem_size
: <a class="el" href="dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853">segment_tree</a>
</li>
<li>elevation
: <a class="el" href="d2/de8/structeuler__.html#abbbf12f0a960faf783d219f9012cdce6">euler_</a>
</li>
@ -165,10 +171,20 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
</ul>
<h3><a id="index_i"></a>- i -</h3><ul>
<li>identity
: <a class="el" href="dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a">segment_tree</a>
</li>
</ul>
<h3><a id="index_l"></a>- l -</h3><ul>
<li>left
: <a class="el" href="d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">node</a>
</li>
<li>length
: <a class="el" href="dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e">segment_tree</a>
</li>
<li>llink
: <a class="el" href="db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef">Node</a>
</li>
@ -227,6 +243,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<li>roll
: <a class="el" href="d2/de8/structeuler__.html#a3f1b77e489be443a8d84a84082b8092e">euler_</a>
</li>
<li>root
: <a class="el" href="dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd">segment_tree</a>
</li>
<li>row1
: <a class="el" href="d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e">mat_3x3_</a>
</li>

3
globals_c.html
View File

@ -115,6 +115,9 @@ $(document).ready(function(){initNavTree('globals_c.html',''); initResizable();
<li>collatz()
: <a class="el" href="d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80">sol1.c</a>
</li>
<li>combine_function
: <a class="el" href="da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">segment_tree.c</a>
</li>
<li>compare()
: <a class="el" href="d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">sol1.c</a>
</li>

28
globals_func_m.html
View File

@ -98,10 +98,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d1/d20/server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">server.c</a>
, <a class="el" href="d8/dca/udp__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">udp_server.c</a>
, <a class="el" href="da/d02/binary__search__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_search_tree.c</a>
, <a class="el" href="d0/d57/hash__xor8_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_xor8.c</a>
, <a class="el" href="d7/d0c/hash__sdbm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_sdbm.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.c</a>
, <a class="el" href="dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d5/d3d/problem__5_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">shell_sort2.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">selection_sort.c</a>
, <a class="el" href="d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe">merge_sort.c</a>
@ -117,12 +117,11 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d6/d64/problem__7_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d5/d3d/problem__5_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol3.c</a>
, <a class="el" href="d0/d57/hash__xor8_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_xor8.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol2.c</a>
@ -140,10 +139,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
, <a class="el" href="d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.c</a>
, <a class="el" href="da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">segment_tree.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.c</a>
, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">threaded_binary_trees.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">k_means_clustering.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">union_find.c</a>
, <a class="el" href="de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solver.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">strong_number.c</a>
@ -155,16 +154,16 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cartesian_to_polar.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.c</a>
, <a class="el" href="d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">c_atoi_str_to_integer.c</a>
, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">threaded_binary_trees.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.c</a>
, <a class="el" href="d5/db8/vectors__3d_8c.html#a840291bc02cba5474a4cb46a9b9566fe">vectors_3d.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.c</a>
, <a class="el" href="d7/d0c/hash__sdbm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_sdbm.c</a>
, <a class="el" href="da/de6/udp__client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">udp_client.c</a>
, <a class="el" href="d4/de3/hash__djb2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_djb2.c</a>
, <a class="el" href="d9/dc9/hash__crc32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_crc32.c</a>
, <a class="el" href="d3/d39/hash__adler32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_adler32.c</a>
, <a class="el" href="da/de6/udp__client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">udp_client.c</a>
, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_binary_recursion.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.c</a>
, <a class="el" href="dd/d53/int__to__string_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">int_to_string.c</a>
</li>
<li>mat_mul()
@ -182,6 +181,9 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
<li>midpoint_euler_step()
: <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51">ode_midpoint_euler.c</a>
</li>
<li>minimum()
: <a class="el" href="da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">segment_tree.c</a>
</li>
<li>modifiedBinarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modified_binary_search.c</a>
</li>

24
globals_func_s.html
View File

@ -108,6 +108,24 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
<li>search()
: <a class="el" href="df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">threaded_binary_trees.c</a>
</li>
<li>segment_tree_build()
: <a class="el" href="da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree.c</a>
</li>
<li>segment_tree_dispose()
: <a class="el" href="da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree.c</a>
</li>
<li>segment_tree_init()
: <a class="el" href="da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree.c</a>
</li>
<li>segment_tree_print_int()
: <a class="el" href="da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab">segment_tree.c</a>
</li>
<li>segment_tree_query()
: <a class="el" href="da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree.c</a>
</li>
<li>segment_tree_update()
: <a class="el" href="da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree.c</a>
</li>
<li>selectionSort()
: <a class="el" href="df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617">selection_sort.c</a>
</li>
@ -118,8 +136,8 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
: <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb">ode_semi_implicit_euler.c</a>
</li>
<li>shell_sort()
: <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">sol1.c</a>
, <a class="el" href="d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
, <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">sol1.c</a>
</li>
<li>show_data()
: <a class="el" href="d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">shell_sort2.c</a>
@ -150,9 +168,9 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
</li>
<li>swap()
: <a class="el" href="d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">merge_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort_recursion.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">selection_sort.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort_recursion.c</a>
</li>
</ul>
</div><!-- contents -->

31
globals_func_t.html
View File

@ -96,36 +96,37 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
<li>test()
: <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">decimal_to_binary_recursion.c</a>
, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>
, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>
, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>
, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>
, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>
, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>
</li>
<li>test1()
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>
: <a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>
</li>
<li>test2()
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a>
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">adaline_learning.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0">k_means_clustering.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a>
</li>
<li>test3()
: <a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>
</li>
<li>test_2d_classes()
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">kohonen_som_topology.c</a>

64
globals_m.html
View File

@ -98,49 +98,48 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d1/d20/server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">server.c</a>
, <a class="el" href="d8/dca/udp__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">udp_server.c</a>
, <a class="el" href="da/d02/binary__search__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_search_tree.c</a>
, <a class="el" href="d0/d57/hash__xor8_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_xor8.c</a>
, <a class="el" href="d7/d0c/hash__sdbm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_sdbm.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.c</a>
, <a class="el" href="dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d5/d3d/problem__5_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol3.c</a>
, <a class="el" href="d0/d57/hash__xor8_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_xor8.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.c</a>
, <a class="el" href="d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d6/d64/problem__7_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.c</a>
, <a class="el" href="dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">segment_tree.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.c</a>
, <a class="el" href="d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">threaded_binary_trees.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">k_means_clustering.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
, <a class="el" href="df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
, <a class="el" href="d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">binary_search.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jump_search.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">k_means_clustering.c</a>
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
, <a class="el" href="d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">shell_sort2.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">selection_sort.c</a>
, <a class="el" href="d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe">merge_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bubble_sort_recursion.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jump_search.c</a>
, <a class="el" href="d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modified_binary_search.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.c</a>
, <a class="el" href="d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">bead_sort.c</a>
, <a class="el" href="dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">bubble_sort.c</a>
, <a class="el" href="d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">c_atoi_str_to_integer.c</a>
, <a class="el" href="d5/db8/vectors__3d_8c.html#a840291bc02cba5474a4cb46a9b9566fe">vectors_3d.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">threaded_binary_trees.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.c</a>
, <a class="el" href="dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.c</a>
, <a class="el" href="da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="da/d56/problem__1_2sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol3.c</a>
, <a class="el" href="d5/db8/vectors__3d_8c.html#a840291bc02cba5474a4cb46a9b9566fe">vectors_3d.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol4.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cartesian_to_polar.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol1.c</a>
@ -148,23 +147,23 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">so1.c</a>
, <a class="el" href="dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cartesian_to_polar.c</a>
, <a class="el" href="d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">collatz.c</a>
, <a class="el" href="d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="da/de6/udp__client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">udp_client.c</a>
, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_binary_recursion.c</a>
, <a class="el" href="d3/d39/hash__adler32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_adler32.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.c</a>
, <a class="el" href="dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">collatz.c</a>
, <a class="el" href="d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97">factorial_large_number.c</a>
, <a class="el" href="d3/d39/hash__adler32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_adler32.c</a>
, <a class="el" href="d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">fibonacci_fast.c</a>
, <a class="el" href="d9/dc9/hash__crc32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_crc32.c</a>
, <a class="el" href="df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">palindrome.c</a>
, <a class="el" href="da/d93/prime_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">prime.c</a>
, <a class="el" href="dd/d53/int__to__string_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">int_to_string.c</a>
, <a class="el" href="d4/de3/hash__djb2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_djb2.c</a>
, <a class="el" href="d9/dc9/hash__crc32_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_crc32.c</a>
, <a class="el" href="da/d93/prime_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">prime.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">strong_number.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="d4/de3/hash__djb2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_djb2.c</a>
, <a class="el" href="de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solver.c</a>
, <a class="el" href="d7/d0c/hash__sdbm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_sdbm.c</a>
, <a class="el" href="df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">union_find.c</a>
</li>
<li>mat_3x3
@ -174,12 +173,12 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">qr_eigen_values.c</a>
</li>
<li>max
: <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>
: <a class="el" href="d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a>
, <a class="el" href="d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>
</li>
<li>MAX
: <a class="el" href="d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326">server.c</a>
, <a class="el" href="dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">client.c</a>
: <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>
</li>
<li>MAX_ADALINE_ITER
: <a class="el" href="da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f">adaline_learning.c</a>
@ -226,6 +225,9 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d">kohonen_som_topology.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e">jump_search.c</a>
</li>
<li>minimum()
: <a class="el" href="da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">segment_tree.c</a>
</li>
<li>MOD_LIMIT
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3">sol1.c</a>
</li>

27
globals_s.html
View File

@ -112,6 +112,27 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
<li>search()
: <a class="el" href="df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">threaded_binary_trees.c</a>
</li>
<li>segment_tree
: <a class="el" href="da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63">segment_tree.c</a>
</li>
<li>segment_tree_build()
: <a class="el" href="da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75">segment_tree.c</a>
</li>
<li>segment_tree_dispose()
: <a class="el" href="da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01">segment_tree.c</a>
</li>
<li>segment_tree_init()
: <a class="el" href="da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816">segment_tree.c</a>
</li>
<li>segment_tree_print_int()
: <a class="el" href="da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab">segment_tree.c</a>
</li>
<li>segment_tree_query()
: <a class="el" href="da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91">segment_tree.c</a>
</li>
<li>segment_tree_update()
: <a class="el" href="da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c">segment_tree.c</a>
</li>
<li>selectionSort()
: <a class="el" href="df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617">selection_sort.c</a>
</li>
@ -153,10 +174,10 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
: <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sol1.c</a>
</li>
<li>swap()
: <a class="el" href="dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">selection_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort_recursion.c</a>
: <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort_recursion.c</a>
, <a class="el" href="d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">merge_sort.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">selection_sort.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">bubble_sort.c</a>
</li>
</ul>
</div><!-- contents -->

31
globals_t.html
View File

@ -96,36 +96,37 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
<li>test()
: <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">decimal_to_binary_recursion.c</a>
, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>
, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>
, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>
, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>
, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>
, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>
, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>
, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>
, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>
, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>
, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>
, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>
, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>
</li>
<li>test1()
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>
: <a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>
</li>
<li>test2()
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a>
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">adaline_learning.c</a>
, <a class="el" href="d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0">k_means_clustering.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a>
</li>
<li>test3()
: <a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>
</li>
<li>test_2d_classes()
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">kohonen_som_topology.c</a>

6
globals_type.html
View File

@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('globals_type.html',''); initResizable(
<li>CantorSet
: <a class="el" href="dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94">cantor_set.c</a>
</li>
<li>combine_function
: <a class="el" href="da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8">segment_tree.c</a>
</li>
<li>dual_quat
: <a class="el" href="d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f">geometry_datatypes.h</a>
</li>
@ -116,6 +119,9 @@ $(document).ready(function(){initNavTree('globals_type.html',''); initResizable(
<li>quaternion
: <a class="el" href="dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b">geometry_datatypes.h</a>
</li>
<li>segment_tree
: <a class="el" href="da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63">segment_tree.c</a>
</li>
<li>vec_3d
: <a class="el" href="de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270">geometry_datatypes.h</a>
</li>

2
menudata.js
View File

@ -38,6 +38,7 @@ var menudata={children:[
{text:"e",url:"functions.html#index_e"},
{text:"g",url:"functions.html#index_g"},
{text:"h",url:"functions.html#index_h"},
{text:"i",url:"functions.html#index_i"},
{text:"l",url:"functions.html#index_l"},
{text:"n",url:"functions.html#index_n"},
{text:"p",url:"functions.html#index_p"},
@ -57,6 +58,7 @@ var menudata={children:[
{text:"e",url:"functions_vars.html#index_e"},
{text:"g",url:"functions_vars.html#index_g"},
{text:"h",url:"functions_vars.html#index_h"},
{text:"i",url:"functions_vars.html#index_i"},
{text:"l",url:"functions_vars.html#index_l"},
{text:"n",url:"functions_vars.html#index_n"},
{text:"p",url:"functions_vars.html#index_p"},

2
navtreedata.js
View File

@ -90,7 +90,7 @@ var NAVTREEINDEX =
"annotated.html",
"d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002",
"d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def",
"df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86"
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617"
];
var SYNCONMSG = 'click to disable panel synchronisation';

12
navtreeindex0.js
View File

@ -43,20 +43,20 @@ var NAVTREEINDEX0 =
"d0/dc7/geometry__datatypes_8h.html":[12,0,4,0],
"d0/dc7/geometry__datatypes_8h_source.html":[12,0,4,0],
"d0/dcb/group__kohonen__1d.html":[10,2,3],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[10,2,3,3],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[12,0,7,3,5],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[10,2,3,3],
"d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a":[10,2,3,6],
"d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a":[12,0,7,3,9],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[10,2,3,1],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[12,0,7,3,2],
"d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f":[10,2,3,5],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[10,2,3,1],
"d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f":[12,0,7,3,7],
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[10,2,3,4],
"d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f":[10,2,3,5],
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[12,0,7,3,6],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[10,2,3,2],
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[10,2,3,4],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[12,0,7,3,3],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[10,2,3,0],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[10,2,3,2],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[12,0,7,3,1],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[10,2,3,0],
"d0/df1/structhash__set__t.html":[11,0,17],
"d0/df1/structhash__set__t.html#a1b52c6b78642e398f574c2ec9ed22e8a":[11,0,17,1],
"d0/df1/structhash__set__t.html#a5fd11ba3c74b2cc7fd161696fb951b82":[11,0,17,2],

54
navtreeindex1.js
View File

@ -28,9 +28,9 @@ var NAVTREEINDEX1 =
"d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d":[12,0,10,18,2,0],
"d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,10,18,2,2],
"d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[12,0,10,18,2,1],
"d5/d7e/struct_t.html":[11,0,33],
"d5/d7e/struct_t.html#a2023d2bb6a6cdf472b567b3ec5cf35d4":[11,0,33,0],
"d5/d7e/struct_t.html#a5a06d4022d41bad87137ba3430abce8b":[11,0,33,1],
"d5/d7e/struct_t.html":[11,0,34],
"d5/d7e/struct_t.html#a2023d2bb6a6cdf472b567b3ec5cf35d4":[11,0,34,0],
"d5/d7e/struct_t.html#a5a06d4022d41bad87137ba3430abce8b":[11,0,34,1],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[5],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md14":[5,0],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md15":[5,1],
@ -48,21 +48,21 @@ var NAVTREEINDEX1 =
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27":[5,13],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md28":[5,14],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md29":[5,15],
"d5/da1/structnode.html":[11,0,24],
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,24,7],
"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,24,6],
"d5/da1/structnode.html#a2783f1aec750191646305988f7e28756":[11,0,24,5],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[11,0,24,1],
"d5/da1/structnode.html#a310a09cb5a882788781a5287096ad425":[11,0,24,0],
"d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[11,0,24,10],
"d5/da1/structnode.html#a6f9100a3fe81d82776ce47ecdba94691":[11,0,24,2],
"d5/da1/structnode.html#a707bf3f1eeeaf8974e7e8e90f7bfd6a1":[11,0,24,12],
"d5/da1/structnode.html#a7f5750a90eac14a9a21d5b976cd8b8a7":[11,0,24,9],
"d5/da1/structnode.html#a8139af7faac30d394e198365a999b54d":[11,0,24,8],
"d5/da1/structnode.html#aaf2ec5ed1bb563465cbe2e9d16d74d1e":[11,0,24,11],
"d5/da1/structnode.html#ab4b1f345158daee0725acecd5ba817b1":[11,0,24,13],
"d5/da1/structnode.html#ac8973feda870a119ccdc25910254db0c":[11,0,24,3],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[11,0,24,4],
"d5/da1/structnode.html":[11,0,23],
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,23,7],
"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,23,6],
"d5/da1/structnode.html#a2783f1aec750191646305988f7e28756":[11,0,23,5],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[11,0,23,1],
"d5/da1/structnode.html#a310a09cb5a882788781a5287096ad425":[11,0,23,0],
"d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[11,0,23,10],
"d5/da1/structnode.html#a6f9100a3fe81d82776ce47ecdba94691":[11,0,23,2],
"d5/da1/structnode.html#a707bf3f1eeeaf8974e7e8e90f7bfd6a1":[11,0,23,12],
"d5/da1/structnode.html#a7f5750a90eac14a9a21d5b976cd8b8a7":[11,0,23,9],
"d5/da1/structnode.html#a8139af7faac30d394e198365a999b54d":[11,0,23,8],
"d5/da1/structnode.html#aaf2ec5ed1bb563465cbe2e9d16d74d1e":[11,0,23,11],
"d5/da1/structnode.html#ab4b1f345158daee0725acecd5ba817b1":[11,0,23,13],
"d5/da1/structnode.html#ac8973feda870a119ccdc25910254db0c":[11,0,23,3],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[11,0,23,4],
"d5/db4/struct_edge.html":[11,0,12],
"d5/db4/struct_edge.html#a0c7bb90b11b1b795c665786317ca744d":[11,0,12,4],
"d5/db4/struct_edge.html#a2449478938136b5ab7ef0e7d92e6990b":[11,0,12,1],
@ -138,20 +138,20 @@ var NAVTREEINDEX1 =
"d7/d3b/group__hash.html":[10,1],
"d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b":[10,1,7],
"d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b":[12,0,6,2,0],
"d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0":[10,1,13],
"d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0":[12,0,6,4,1],
"d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0":[10,1,13],
"d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567":[10,1,6],
"d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567":[12,0,6,1,0],
"d7/d3b/group__hash.html#ga506f0227a3b5f9434a503e09a3cb672b":[10,1,5],
"d7/d3b/group__hash.html#ga506f0227a3b5f9434a503e09a3cb672b":[12,0,6,0,0],
"d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605":[12,0,6,3,1],
"d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605":[10,1,8],
"d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd":[10,1,9],
"d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605":[12,0,6,3,1],
"d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd":[12,0,6,0,2],
"d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd":[10,1,9],
"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[10,1,11],
"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[12,0,6,2,2],
"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[10,1,12],
"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[12,0,6,3,2],
"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[10,1,12],
"d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2":[12,0,6,1,2],
"d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2":[10,1,10],
"d7/d3b/group__hash.html#gae4836b42b998b336298f3b19dcc9cdeb":[10,1,14],
@ -213,11 +213,11 @@ var NAVTREEINDEX1 =
"d8/d71/group__k__means.html#gad339c41d3ee9e6729aca9e9ab3f7d2d9":[12,0,7,1,4],
"d8/d71/group__k__means.html#gadee39a3f17bf5144df5592e48dbfc9f7":[10,2,1,2],
"d8/d71/group__k__means.html#gadee39a3f17bf5144df5592e48dbfc9f7":[12,0,7,1,3],
"d8/d7a/structtnode.html":[11,0,34],
"d8/d7a/structtnode.html#a44127c1d017332403d91a96a1633a76a":[11,0,34,3],
"d8/d7a/structtnode.html#ad302cb43ee1cab8a29581e8aaf76bbd4":[11,0,34,0],
"d8/d7a/structtnode.html#ae1f202bf98d22f8316eeb71b68a59951":[11,0,34,1],
"d8/d7a/structtnode.html#af7ce6341b8536c58a5a9ebdb4862a32a":[11,0,34,2],
"d8/d7a/structtnode.html":[11,0,35],
"d8/d7a/structtnode.html#a44127c1d017332403d91a96a1633a76a":[11,0,35,3],
"d8/d7a/structtnode.html#ad302cb43ee1cab8a29581e8aaf76bbd4":[11,0,35,0],
"d8/d7a/structtnode.html#ae1f202bf98d22f8316eeb71b68a59951":[11,0,35,1],
"d8/d7a/structtnode.html#af7ce6341b8536c58a5a9ebdb4862a32a":[11,0,35,2],
"d8/d7c/dict_8h_source.html":[12,0,2,2,0],
"d8/d81/md_project_euler__r_e_a_d_m_e.html":[9],
"d8/da2/dynamic__array_8h_source.html":[12,0,2,3,0],

112
navtreeindex2.js
View File

@ -16,22 +16,22 @@ var NAVTREEINDEX2 =
"da/d2a/group__adaline.html":[10,2,0],
"da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166":[10,2,0,5],
"da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166":[12,0,7,0,4],
"da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120":[12,0,7,0,5],
"da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120":[10,2,0,6],
"da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa":[12,0,7,0,2],
"da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120":[12,0,7,0,5],
"da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa":[10,2,0,3],
"da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa":[12,0,7,0,2],
"da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f":[10,2,0,2],
"da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f":[12,0,7,0,1],
"da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[12,0,7,0,7],
"da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[10,2,0,8],
"da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[12,0,7,0,7],
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[10,2,0,4],
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[12,0,7,0,3],
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[10,2,0,1],
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[12,0,7,0,0],
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[10,2,0,7],
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[12,0,7,0,6],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[12,0,7,0,9],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[10,2,0,9],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[12,0,7,0,9],
"da/d35/problem__1_2sol1_8c.html":[12,0,10,0,0],
"da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,10,0,0,0],
"da/d38/durand__kerner__roots_8c.html":[12,0,9,0],
@ -47,10 +47,22 @@ var NAVTREEINDEX2 =
"da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f":[12,0,8,6,0],
"da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,8,6,2],
"da/d93/prime_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,8,6,1],
"da/d9b/struct_trie_node.html":[11,0,35],
"da/d9b/struct_trie_node.html#a8e9e3ac8a47ed2f730476945933722c1":[11,0,35,0],
"da/d9b/struct_trie_node.html#a9dc2a9bc247486fac3e4b350c73a3060":[11,0,35,1],
"da/d9b/struct_trie_node.html#ab2732ce1e141346865d997859836d663":[11,0,35,2],
"da/d9b/struct_trie_node.html":[11,0,36],
"da/d9b/struct_trie_node.html#a8e9e3ac8a47ed2f730476945933722c1":[11,0,36,0],
"da/d9b/struct_trie_node.html#a9dc2a9bc247486fac3e4b350c73a3060":[11,0,36,1],
"da/d9b/struct_trie_node.html#ab2732ce1e141346865d997859836d663":[11,0,36,2],
"da/da0/segment__tree_8c.html":[12,0,2,1,1],
"da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c":[12,0,2,1,1,10],
"da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab":[12,0,2,1,1,8],
"da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb":[12,0,2,1,1,4],
"da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d":[12,0,2,1,1,11],
"da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75":[12,0,2,1,1,5],
"da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63":[12,0,2,1,1,2],
"da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8":[12,0,2,1,1,1],
"da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816":[12,0,2,1,1,7],
"da/da0/segment__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,2,1,1,3],
"da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01":[12,0,2,1,1,6],
"da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91":[12,0,2,1,1,9],
"da/de6/udp__client_8c.html":[12,0,0,2],
"da/de6/udp__client_8c.html#a3e937c42922f7601edb17b747602c471":[12,0,0,2,0],
"da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[12,0,0,2,1],
@ -65,11 +77,11 @@ var NAVTREEINDEX2 =
"db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[12,0,10,9,0,4],
"db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32":[12,0,10,9,0,1],
"db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86":[12,0,10,9,0,2],
"db/d8b/struct_node.html":[11,0,23],
"db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7":[11,0,23,3],
"db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef":[11,0,23,1],
"db/d8b/struct_node.html#a772e2a82248c0d0dfc5cdf19d5b45df9":[11,0,23,2],
"db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605":[11,0,23,0],
"db/d8b/struct_node.html":[11,0,24],
"db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7":[11,0,24,3],
"db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef":[11,0,24,1],
"db/d8b/struct_node.html#a772e2a82248c0d0dfc5cdf19d5b45df9":[11,0,24,2],
"db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605":[11,0,24,0],
"db/ddb/hello__world_8h_source.html":[12,0,3,1,0],
"db/ddf/insertion__sort_8c.html":[12,0,12,3],
"db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb":[12,0,12,3,0],
@ -114,31 +126,37 @@ var NAVTREEINDEX2 =
"dc/d9a/group__quats.html#ga1afd165100e9b02b86e3bd11b50f3b06":[12,0,4,1,0],
"dc/d9a/group__quats.html#ga4779f448daaf806ce5e750c13b3e0965":[10,0,7,5],
"dc/d9a/group__quats.html#ga4779f448daaf806ce5e750c13b3e0965":[12,0,4,1,2],
"dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd":[10,0,7,2],
"dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd":[12,0,4,0,2],
"dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd":[10,0,7,2],
"dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b":[10,0,7,3],
"dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b":[12,0,4,0,4],
"dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1":[10,0,7,6],
"dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1":[12,0,4,1,3],
"dc/de3/hash__set_8h_source.html":[12,0,2,5,0],
"dc/de5/structsubset.html":[11,0,31],
"dc/de5/structsubset.html#a2cc3bbda6f758afb7bf8067eb8f07a10":[11,0,31,1],
"dc/de5/structsubset.html#ad8f7d99dc56f8ce3f0c3aaf4a633373a":[11,0,31,0],
"dc/de5/structsubset.html":[11,0,32],
"dc/de5/structsubset.html#a2cc3bbda6f758afb7bf8067eb8f07a10":[11,0,32,1],
"dc/de5/structsubset.html#ad8f7d99dc56f8ce3f0c3aaf4a633373a":[11,0,32,0],
"dd/d06/structsegment__tree.html":[11,0,30],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[11,0,30,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[11,0,30,3],
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[11,0,30,0],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[11,0,30,4],
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[11,0,30,1],
"dd/d08/newton__raphson__root_8c.html":[12,0,9,2],
"dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,9,2,3],
"dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925":[12,0,9,2,2],
"dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337":[12,0,9,2,1],
"dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689":[12,0,9,2,0],
"dd/d10/struct_stack.html":[11,0,30],
"dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a":[11,0,30,1],
"dd/d10/struct_stack.html#ad9b9f0f414ea2dc2437fd42b6cc4321b":[11,0,30,0],
"dd/d10/struct_stack.html":[11,0,31],
"dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a":[11,0,31,1],
"dd/d10/struct_stack.html#ad9b9f0f414ea2dc2437fd42b6cc4321b":[11,0,31,0],
"dd/d53/int__to__string_8c.html":[12,0,1,2],
"dd/d53/int__to__string_8c.html#a969911f32f1c435bb2bf166574ef9ae5":[12,0,1,2,0],
"dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d":[12,0,1,2,2],
"dd/d53/int__to__string_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,1,2,1],
"dd/d7a/group__matrix.html":[10,0,6],
"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[12,0,4,0,3],
"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[10,0,6,1],
"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[12,0,4,0,3],
"dd/d8b/problem__22_2sol1_8c.html":[12,0,10,11,0],
"dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,10,11,0,3],
"dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63":[12,0,10,11,0,4],
@ -177,25 +195,25 @@ var NAVTREEINDEX2 =
"de/d58/structquaternion__.html#a627574208aad1215fde8fcf9cb3f36e4":[10,0,7,0,3],
"de/d58/structquaternion__.html#a835e2ba72517fbb29d0d4e3cb4c2914f":[10,0,7,0,5],
"de/d5a/group__quaternions.html":[10,0],
"de/d5a/group__quaternions.html#ga002b2f4894492820fe708b1b7e7c5e70":[12,0,4,0,0],
"de/d5a/group__quaternions.html#ga002b2f4894492820fe708b1b7e7c5e70":[10,0,10],
"de/d5a/group__quaternions.html#ga002b2f4894492820fe708b1b7e7c5e70":[12,0,4,0,0],
"de/d7b/group__vec__3d.html":[10,0,5],
"de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84":[10,0,5,2],
"de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84":[12,0,4,2,0],
"de/d7b/group__vec__3d.html#ga3cdfd8378a0b115563ea6c561bb46b7e":[12,0,4,2,5],
"de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84":[10,0,5,2],
"de/d7b/group__vec__3d.html#ga3cdfd8378a0b115563ea6c561bb46b7e":[10,0,5,5],
"de/d7b/group__vec__3d.html#ga4fd194972bea4884e0b33cf4a166d14e":[12,0,4,2,3],
"de/d7b/group__vec__3d.html#ga3cdfd8378a0b115563ea6c561bb46b7e":[12,0,4,2,5],
"de/d7b/group__vec__3d.html#ga4fd194972bea4884e0b33cf4a166d14e":[10,0,5,4],
"de/d7b/group__vec__3d.html#ga4fd194972bea4884e0b33cf4a166d14e":[12,0,4,2,3],
"de/d7b/group__vec__3d.html#ga5082b0720c2cc51ae84bf19bd76dc849":[10,0,5,3],
"de/d7b/group__vec__3d.html#ga5082b0720c2cc51ae84bf19bd76dc849":[12,0,4,2,1],
"de/d7b/group__vec__3d.html#ga94805165d037d111d7d7c0df99e3a5de":[12,0,4,2,7],
"de/d7b/group__vec__3d.html#ga94805165d037d111d7d7c0df99e3a5de":[10,0,5,7],
"de/d7b/group__vec__3d.html#ga97da356cb7d5da73a0ac9bad09a435cc":[10,0,5,9],
"de/d7b/group__vec__3d.html#ga97da356cb7d5da73a0ac9bad09a435cc":[12,0,4,2,9],
"de/d7b/group__vec__3d.html#ga97da356cb7d5da73a0ac9bad09a435cc":[10,0,5,9],
"de/d7b/group__vec__3d.html#gaa6b5ac18429ffb0131dc8593d31c25a4":[12,0,4,2,6],
"de/d7b/group__vec__3d.html#gaa6b5ac18429ffb0131dc8593d31c25a4":[10,0,5,6],
"de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5":[10,0,5,8],
"de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5":[12,0,4,2,8],
"de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5":[10,0,5,8],
"de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270":[10,0,5,1],
"de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270":[12,0,4,0,5],
"de/dac/sudoku__solver_8c.html":[12,0,8,8],
@ -216,38 +234,20 @@ var NAVTREEINDEX2 =
"df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,11,0,2],
"df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032":[12,0,11,0,1],
"df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,11,0,3],
"df/d3c/threaded__binary__trees_8c.html":[12,0,2,1,1],
"df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317":[12,0,2,1,1,3],
"df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c":[12,0,2,1,1,9],
"df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7":[12,0,2,1,1,4],
"df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719":[12,0,2,1,1,7],
"df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c":[12,0,2,1,1,8],
"df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb":[12,0,2,1,1,5],
"df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c":[12,0,2,1,1,2],
"df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6":[12,0,2,1,1,1],
"df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,2,1,1,6],
"df/d3c/threaded__binary__trees_8c.html":[12,0,2,1,2],
"df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317":[12,0,2,1,2,3],
"df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c":[12,0,2,1,2,9],
"df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7":[12,0,2,1,2,4],
"df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719":[12,0,2,1,2,7],
"df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c":[12,0,2,1,2,8],
"df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb":[12,0,2,1,2,5],
"df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c":[12,0,2,1,2,2],
"df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6":[12,0,2,1,2,1],
"df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,2,1,2,6],
"df/d58/md_leetcode__r_e_a_d_m_e.html":[8],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md33":[4],
"df/d83/selection__sort_8c.html":[12,0,12,5],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[12,0,12,5,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[12,0,12,5,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[12,0,12,5,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[12,0,12,5,1],
"df/d98/quaternions_8c.html":[12,0,4,1],
"df/d98/quaternions_8c.html#aa8dca7b867074164d5f45b0f3851269d":[12,0,4,1,4],
"df/d98/quaternions_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,4,1,1],
"df/da5/problem__9_2sol1_8c.html":[12,0,10,22,0],
"df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,10,22,0,0],
"df/db3/struct_l.html":[11,0,19],
"df/db3/struct_l.html#a4d585643a6364fbf79f54de5fa49d17f":[11,0,19,1],
"df/db3/struct_l.html#adbf91f5f6cc3047e13bb3dbbfb277be0":[11,0,19,0],
"df/dc6/acronym_8h_source.html":[12,0,3,0,0],
"df/ddb/structword__count__word.html":[11,0,37],
"df/ddb/structword__count__word.html#a44e237e11196ffa56574b90ea807e8fc":[11,0,37,0],
"df/ddb/structword__count__word.html#a9c018b5f83b2aeeefac5cc09e5f41efd":[11,0,37,1],
"df/dea/structdata.html":[11,0,8],
"df/dea/structdata.html#a7a7e33023945ddb393dc306c489c4049":[11,0,8,1],
"df/dea/structdata.html#ab1464d70ed28af0a16cdd2ebaa64027c":[11,0,8,0],
"df/df3/union__find_8c.html":[12,0,8,9],
"df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe":[12,0,8,9,0]
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[12,0,12,5,2]
};

22
navtreeindex3.js
View File

@ -1,5 +1,23 @@
var NAVTREEINDEX3 =
{
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[12,0,12,5,1],
"df/d98/quaternions_8c.html":[12,0,4,1],
"df/d98/quaternions_8c.html#aa8dca7b867074164d5f45b0f3851269d":[12,0,4,1,4],
"df/d98/quaternions_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,4,1,1],
"df/da5/problem__9_2sol1_8c.html":[12,0,10,22,0],
"df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,10,22,0,0],
"df/db3/struct_l.html":[11,0,19],
"df/db3/struct_l.html#a4d585643a6364fbf79f54de5fa49d17f":[11,0,19,1],
"df/db3/struct_l.html#adbf91f5f6cc3047e13bb3dbbfb277be0":[11,0,19,0],
"df/dc6/acronym_8h_source.html":[12,0,3,0,0],
"df/ddb/structword__count__word.html":[11,0,38],
"df/ddb/structword__count__word.html#a44e237e11196ffa56574b90ea807e8fc":[11,0,38,0],
"df/ddb/structword__count__word.html#a9c018b5f83b2aeeefac5cc09e5f41efd":[11,0,38,1],
"df/dea/structdata.html":[11,0,8],
"df/dea/structdata.html#a7a7e33023945ddb393dc306c489c4049":[11,0,8,1],
"df/dea/structdata.html#ab1464d70ed28af0a16cdd2ebaa64027c":[11,0,8,0],
"df/df3/union__find_8c.html":[12,0,8,9],
"df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe":[12,0,8,9,0],
"df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86":[12,0,8,9,1],
"df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,8,9,3],
"df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a":[12,0,8,9,2],
@ -56,8 +74,8 @@ var NAVTREEINDEX3 =
"files.html":[12,0],
"functions.html":[11,2,0],
"functions_vars.html":[11,2,1],
"globals.html":[12,1,0],
"globals.html":[12,1,0,0],
"globals.html":[12,1,0],
"globals_a.html":[12,1,0,1],
"globals_b.html":[12,1,0,2],
"globals_c.html":[12,1,0,3],
@ -65,8 +83,8 @@ var NAVTREEINDEX3 =
"globals_defs.html":[12,1,4],
"globals_e.html":[12,1,0,5],
"globals_f.html":[12,1,0,6],
"globals_func.html":[12,1,1],
"globals_func.html":[12,1,1,0],
"globals_func.html":[12,1,1],
"globals_func_a.html":[12,1,1,1],
"globals_func_b.html":[12,1,1,2],
"globals_func_c.html":[12,1,1,3],

18
search/all_10.js
View File

@ -1,12 +1,12 @@
var searchData=
[
['observation_215',['observation',['../d1/d5e/structobservation.html',1,'']]],
['ode_5fforward_5feuler_2ec_216',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_217',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_218',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
['ok_219',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]],
['okbox_220',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]],
['okcol_221',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]],
['okrow_222',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]],
['order_223',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_semi_implicit_euler.c']]]
['observation_221',['observation',['../d1/d5e/structobservation.html',1,'']]],
['ode_5fforward_5feuler_2ec_222',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_223',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_224',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
['ok_225',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]],
['okbox_226',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]],
['okcol_227',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]],
['okrow_228',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]],
['order_229',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_semi_implicit_euler.c']]]
];

36
search/all_11.js
View File

@ -1,21 +1,21 @@
var searchData=
[
['projecteuler_224',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['palindrome_2ec_225',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
['pid_226',['pid',['../d0/d43/structpid.html',1,'']]],
['pitch_227',['pitch',['../d2/de8/structeuler__.html#aa71f9aa6dfa32d8014b2d54ab8410e0b',1,'euler_']]],
['poly_5ffunction_228',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['port_229',['PORT',['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c']]],
['postorder_5fdisplay_230',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['preorder_5fdisplay_231',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_5fdigit_232',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['prime_2ec_233',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['print_234',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fmatrix_235',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_236',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N):&#160;sol1.c']]],
['print_5fvector_237',['print_vector',['../de/d7b/group__vec__3d.html#ga4fd194972bea4884e0b33cf4a166d14e',1,'vectors_3d.c']]],
['printeps_238',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['problem_239',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_semi_implicit_euler.c']]],
['propagate_240',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['purge_241',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]]
['projecteuler_230',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['palindrome_2ec_231',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
['pid_232',['pid',['../d0/d43/structpid.html',1,'']]],
['pitch_233',['pitch',['../d2/de8/structeuler__.html#aa71f9aa6dfa32d8014b2d54ab8410e0b',1,'euler_']]],
['poly_5ffunction_234',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['port_235',['PORT',['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c']]],
['postorder_5fdisplay_236',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['preorder_5fdisplay_237',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_5fdigit_238',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['prime_2ec_239',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['print_240',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fmatrix_241',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_242',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N):&#160;sol1.c']]],
['print_5fvector_243',['print_vector',['../de/d7b/group__vec__3d.html#ga4fd194972bea4884e0b33cf4a166d14e',1,'vectors_3d.c']]],
['printeps_244',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['problem_245',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_semi_implicit_euler.c']]],
['propagate_246',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['purge_247',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]]
];

24
search/all_12.js
View File

@ -1,15 +1,15 @@
var searchData=
[
['q0_242',['q0',['../de/d58/structquaternion__.html#a37819eb7d76c65c37a9c2a63f01f65b2',1,'quaternion_']]],
['qr_5fdecompose_243',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
['qr_5fdecompose_2eh_244',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_245',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_246',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
['quat_5ffrom_5feuler_247',['quat_from_euler',['../dc/d9a/group__quats.html#ga4779f448daaf806ce5e750c13b3e0965',1,'quaternions.c']]],
['quaternion_248',['quaternion',['../dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b',1,'geometry_datatypes.h']]],
['quaternion_5f_249',['quaternion_',['../de/d58/structquaternion__.html',1,'']]],
['quaternion_5fmultiply_250',['quaternion_multiply',['../dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1',1,'quaternions.c']]],
['quaternions_2ec_251',['quaternions.c',['../df/d98/quaternions_8c.html',1,'']]],
['queue_252',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_253',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
['q0_248',['q0',['../de/d58/structquaternion__.html#a37819eb7d76c65c37a9c2a63f01f65b2',1,'quaternion_']]],
['qr_5fdecompose_249',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
['qr_5fdecompose_2eh_250',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_251',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_252',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
['quat_5ffrom_5feuler_253',['quat_from_euler',['../dc/d9a/group__quats.html#ga4779f448daaf806ce5e750c13b3e0965',1,'quaternions.c']]],
['quaternion_254',['quaternion',['../dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b',1,'geometry_datatypes.h']]],
['quaternion_5f_255',['quaternion_',['../de/d58/structquaternion__.html',1,'']]],
['quaternion_5fmultiply_256',['quaternion_multiply',['../dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1',1,'quaternions.c']]],
['quaternions_2ec_257',['quaternions.c',['../df/d98/quaternions_8c.html',1,'']]],
['queue_258',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_259',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
];

19
search/all_13.js
View File

@ -1,12 +1,13 @@
var searchData=
[
['real_254',['real',['../d7/dfd/structdual__quat__.html#ad663036ace6a586f90a2f89386f7731a',1,'dual_quat_']]],
['realtime_5fstats_2ec_255',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
['remove_5fdigits_256',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
['right_257',['right',['../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c',1,'node']]],
['rlink_258',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]],
['roll_259',['roll',['../d2/de8/structeuler__.html#a3f1b77e489be443a8d84a84082b8092e',1,'euler_']]],
['row1_260',['row1',['../d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e',1,'mat_3x3_']]],
['row2_261',['row2',['../d9/d8b/structmat__3x3__.html#a8d7ae8fbcc408e3c30e9d64bbd28feaf',1,'mat_3x3_']]],
['row3_262',['row3',['../d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563',1,'mat_3x3_']]]
['real_260',['real',['../d7/dfd/structdual__quat__.html#ad663036ace6a586f90a2f89386f7731a',1,'dual_quat_']]],
['realtime_5fstats_2ec_261',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
['remove_5fdigits_262',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
['right_263',['right',['../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c',1,'node']]],
['rlink_264',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]],
['roll_265',['roll',['../d2/de8/structeuler__.html#a3f1b77e489be443a8d84a84082b8092e',1,'euler_']]],
['root_266',['root',['../dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd',1,'segment_tree']]],
['row1_267',['row1',['../d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e',1,'mat_3x3_']]],
['row2_268',['row2',['../d9/d8b/structmat__3x3__.html#a8d7ae8fbcc408e3c30e9d64bbd28feaf',1,'mat_3x3_']]],
['row3_269',['row3',['../d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563',1,'mat_3x3_']]]
];

86
search/all_14.js
View File

@ -1,42 +1,50 @@
var searchData=
[
['simple_20generic_20stack_263',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_264',['Sample solutions for &lt;a href=&quot;http://exercism.io/&quot;&gt;exercism.io&lt;/a&gt;',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]],
['sa_265',['SA',['../dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;client.c'],['../d1/d20/server_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;server.c']]],
['save_5f2d_5fdata_266',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_267',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_268',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
['sdbm_269',['sdbm',['../d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605',1,'hash_sdbm.c']]],
['search_270',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['selection_5fsort_2ec_271',['selection_sort.c',['../df/d83/selection__sort_8c.html',1,'']]],
['selectionsort_272',['selectionSort',['../df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617',1,'selection_sort.c']]],
['semi_5fimplicit_5feuler_273',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_274',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['server_2ec_275',['server.c',['../d1/d20/server_8c.html',1,'']]],
['shell_5fsort_276',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['shell_5fsort2_2ec_277',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['show_5fdata_278',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_279',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_280',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['so1_2ec_281',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_282',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_283',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d32/problem__5_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_284',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d5/d3d/problem__5_2sol2_8c.html',1,'(Global Namespace)'],['../d6/d64/problem__7_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_285',['sol3.c',['../da/d56/problem__1_2sol3_8c.html',1,'(Global Namespace)'],['../d5/d7c/problem__5_2sol3_8c.html',1,'(Global Namespace)']]],
['sol4_2ec_286',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['solve_287',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
['sorting_20algorithms_288',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]],
['spirograph_289',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
['spirograph_2ec_290',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
['stack_291',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_292',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_293',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_294',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['strong_5fnumber_2ec_295',['strong_number.c',['../d4/dcc/strong__number_8c.html',1,'']]],
['subset_296',['subset',['../dc/de5/structsubset.html',1,'']]],
['sudoku_297',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]],
['sudoku_5fsolver_2ec_298',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]],
['sum_5fof_5fdivisors_299',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_300',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_301',['swap',['../dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;bubble_sort.c'],['../d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;bubble_sort_recursion.c'],['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'swap(int *a, int *b):&#160;merge_sort.c'],['../df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;selection_sort.c']]]
['simple_20generic_20stack_270',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_271',['Sample solutions for &lt;a href=&quot;http://exercism.io/&quot;&gt;exercism.io&lt;/a&gt;',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]],
['sa_272',['SA',['../dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;client.c'],['../d1/d20/server_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;server.c']]],
['save_5f2d_5fdata_273',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_274',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_275',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
['sdbm_276',['sdbm',['../d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605',1,'hash_sdbm.c']]],
['search_277',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['segment_5ftree_278',['segment_tree',['../dd/d06/structsegment__tree.html',1,'segment_tree'],['../da/da0/segment__tree_8c.html#ac206721972f739510cb11f7c0a6a8f63',1,'segment_tree():&#160;segment_tree.c']]],
['segment_5ftree_2ec_279',['segment_tree.c',['../da/da0/segment__tree_8c.html',1,'']]],
['segment_5ftree_5fbuild_280',['segment_tree_build',['../da/da0/segment__tree_8c.html#aae59daf9a0dc33f8cbc7a525a616ee75',1,'segment_tree.c']]],
['segment_5ftree_5fdispose_281',['segment_tree_dispose',['../da/da0/segment__tree_8c.html#af20a9f373083d3f701e1cd92560cef01',1,'segment_tree.c']]],
['segment_5ftree_5finit_282',['segment_tree_init',['../da/da0/segment__tree_8c.html#acecc34fd89923ab41dcee3a779622816',1,'segment_tree.c']]],
['segment_5ftree_5fprint_5fint_283',['segment_tree_print_int',['../da/da0/segment__tree_8c.html#a776abfa81cde9016a2885dca7cfc05ab',1,'segment_tree.c']]],
['segment_5ftree_5fquery_284',['segment_tree_query',['../da/da0/segment__tree_8c.html#af61bd96660cb53f49f28d60a5f1d0c91',1,'segment_tree.c']]],
['segment_5ftree_5fupdate_285',['segment_tree_update',['../da/da0/segment__tree_8c.html#a1e81a9bbf01716f1b4fb27ef36a9098c',1,'segment_tree.c']]],
['selection_5fsort_2ec_286',['selection_sort.c',['../df/d83/selection__sort_8c.html',1,'']]],
['selectionsort_287',['selectionSort',['../df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617',1,'selection_sort.c']]],
['semi_5fimplicit_5feuler_288',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_289',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['server_2ec_290',['server.c',['../d1/d20/server_8c.html',1,'']]],
['shell_5fsort_291',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['shell_5fsort2_2ec_292',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['show_5fdata_293',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_294',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_295',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['so1_2ec_296',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_297',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_298',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d32/problem__5_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_299',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d5/d3d/problem__5_2sol2_8c.html',1,'(Global Namespace)'],['../d6/d64/problem__7_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_300',['sol3.c',['../da/d56/problem__1_2sol3_8c.html',1,'(Global Namespace)'],['../d5/d7c/problem__5_2sol3_8c.html',1,'(Global Namespace)']]],
['sol4_2ec_301',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['solve_302',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]],
['sorting_20algorithms_303',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]],
['spirograph_304',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]],
['spirograph_2ec_305',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
['stack_306',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_307',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_308',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_309',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['strong_5fnumber_2ec_310',['strong_number.c',['../d4/dcc/strong__number_8c.html',1,'']]],
['subset_311',['subset',['../dc/de5/structsubset.html',1,'']]],
['sudoku_312',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]],
['sudoku_5fsolver_2ec_313',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]],
['sum_5fof_5fdivisors_314',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_315',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_316',['swap',['../dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;bubble_sort.c'],['../d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;bubble_sort_recursion.c'],['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'swap(int *a, int *b):&#160;merge_sort.c'],['../df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3',1,'swap(int *first, int *second):&#160;selection_sort.c']]]
];

46
search/all_15.js
View File

@ -1,26 +1,26 @@
var searchData=
[
['the_20algorithms_20_2d_20c_302',['The Algorithms - C',['../index.html',1,'']]],
['t_303',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_304',['test',['../d8/d30/decimal__to__binary__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;decimal_to_binary_recursion.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c']]],
['test1_305',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_306',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.c'],['../d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;k_means_clustering.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_307',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.c']]],
['test_5f2d_5fclasses_308',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_309',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_310',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_311',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fadler32_312',['test_adler32',['../d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd',1,'hash_adler32.c']]],
['test_5fc_5fatoi_313',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_314',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5fcrc32_315',['test_crc32',['../d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2',1,'hash_crc32.c']]],
['test_5fdjb2_316',['test_djb2',['../d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5',1,'hash_djb2.c']]],
['test_5ffunction_317',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_318',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['test_5fsdbm_319',['test_sdbm',['../d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453',1,'hash_sdbm.c']]],
['test_5fxor8_320',['test_xor8',['../d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0',1,'hash_xor8.c']]],
['threaded_5fbinary_5ftrees_2ec_321',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_322',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['to_5fpolar_323',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
['trienode_324',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['the_20algorithms_20_2d_20c_317',['The Algorithms - C',['../index.html',1,'']]],
['t_318',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_319',['test',['../d8/d30/decimal__to__binary__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;decimal_to_binary_recursion.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c']]],
['test1_320',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_321',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.c'],['../d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;k_means_clustering.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_322',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.c']]],
['test_5f2d_5fclasses_323',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_324',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_325',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_326',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fadler32_327',['test_adler32',['../d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd',1,'hash_adler32.c']]],
['test_5fc_5fatoi_328',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_329',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5fcrc32_330',['test_crc32',['../d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2',1,'hash_crc32.c']]],
['test_5fdjb2_331',['test_djb2',['../d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5',1,'hash_djb2.c']]],
['test_5ffunction_332',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_333',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['test_5fsdbm_334',['test_sdbm',['../d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453',1,'hash_sdbm.c']]],
['test_5fxor8_335',['test_xor8',['../d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0',1,'hash_xor8.c']]],
['threaded_5fbinary_5ftrees_2ec_336',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_337',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['to_5fpolar_338',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
['trienode_339',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

8
search/all_16.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['udp_5fclient_2ec_325',['udp_client.c',['../da/de6/udp__client_8c.html',1,'']]],
['udp_5fserver_2ec_326',['udp_server.c',['../d8/dca/udp__server_8c.html',1,'']]],
['union_5ffind_2ec_327',['union_find.c',['../df/df3/union__find_8c.html',1,'']]],
['unit_5fvec_328',['unit_vec',['../de/d7b/group__vec__3d.html#ga3cdfd8378a0b115563ea6c561bb46b7e',1,'vectors_3d.c']]]
['udp_5fclient_2ec_340',['udp_client.c',['../da/de6/udp__client_8c.html',1,'']]],
['udp_5fserver_2ec_341',['udp_server.c',['../d8/dca/udp__server_8c.html',1,'']]],
['union_5ffind_2ec_342',['union_find.c',['../df/df3/union__find_8c.html',1,'']]],
['unit_5fvec_343',['unit_vec',['../de/d7b/group__vec__3d.html#ga3cdfd8378a0b115563ea6c561bb46b7e',1,'vectors_3d.c']]]
];

22
search/all_17.js
View File

@ -1,14 +1,14 @@
var searchData=
[
['value_329',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vec_5f3d_330',['vec_3d',['../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270',1,'geometry_datatypes.h']]],
['vec_5f3d_5f_331',['vec_3d_',['../d5/db4/structvec__3d__.html',1,'']]],
['vector_5fadd_332',['vector_add',['../de/d7b/group__vec__3d.html#gaa6b5ac18429ffb0131dc8593d31c25a4',1,'vectors_3d.c']]],
['vector_5fdot_333',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_334',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fnorm_335',['vector_norm',['../de/d7b/group__vec__3d.html#ga94805165d037d111d7d7c0df99e3a5de',1,'vectors_3d.c']]],
['vector_5fprod_336',['vector_prod',['../de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5',1,'vectors_3d.c']]],
['vector_5fproj_337',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_338',['vector_sub',['../de/d7b/group__vec__3d.html#ga97da356cb7d5da73a0ac9bad09a435cc',1,'vector_sub(const vec_3d *a, const vec_3d *b):&#160;vectors_3d.c'],['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'vector_sub(double *a, double *b, double *out, int L):&#160;qr_decompose.h']]],
['vectors_5f3d_2ec_339',['vectors_3d.c',['../d5/db8/vectors__3d_8c.html',1,'']]]
['value_344',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vec_5f3d_345',['vec_3d',['../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270',1,'geometry_datatypes.h']]],
['vec_5f3d_5f_346',['vec_3d_',['../d5/db4/structvec__3d__.html',1,'']]],
['vector_5fadd_347',['vector_add',['../de/d7b/group__vec__3d.html#gaa6b5ac18429ffb0131dc8593d31c25a4',1,'vectors_3d.c']]],
['vector_5fdot_348',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_349',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fnorm_350',['vector_norm',['../de/d7b/group__vec__3d.html#ga94805165d037d111d7d7c0df99e3a5de',1,'vectors_3d.c']]],
['vector_5fprod_351',['vector_prod',['../de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5',1,'vectors_3d.c']]],
['vector_5fproj_352',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_353',['vector_sub',['../de/d7b/group__vec__3d.html#ga97da356cb7d5da73a0ac9bad09a435cc',1,'vector_sub(const vec_3d *a, const vec_3d *b):&#160;vectors_3d.c'],['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'vector_sub(double *a, double *b, double *out, int L):&#160;qr_decompose.h']]],
['vectors_5f3d_2ec_354',['vectors_3d.c',['../d5/db8/vectors__3d_8c.html',1,'']]]
];

6
search/all_18.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['w_340',['w',['../de/d58/structquaternion__.html#a835e2ba72517fbb29d0d4e3cb4c2914f',1,'quaternion_']]],
['weights_341',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_342',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
['w_355',['w',['../de/d58/structquaternion__.html#a835e2ba72517fbb29d0d4e3cb4c2914f',1,'quaternion_']]],
['weights_356',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_357',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
];

4
search/all_19.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['x_343',['x',['../d5/db4/structvec__3d__.html#a53462a5a195c9e16fb584f73fd66c3d0',1,'vec_3d_::x()'],['../d1/d5e/structobservation.html#a04f3dcfd59dd91353395e35c9831fade',1,'observation::x()'],['../d1/d99/structcluster.html#a13278ef636c1d9bd9ce8fad736f4c570',1,'cluster::x()']]],
['xor8_344',['xor8',['../d7/d3b/group__hash.html#gae4836b42b998b336298f3b19dcc9cdeb',1,'hash_xor8.c']]]
['x_358',['x',['../d5/db4/structvec__3d__.html#a53462a5a195c9e16fb584f73fd66c3d0',1,'vec_3d_::x()'],['../d1/d5e/structobservation.html#a04f3dcfd59dd91353395e35c9831fade',1,'observation::x()'],['../d1/d99/structcluster.html#a13278ef636c1d9bd9ce8fad736f4c570',1,'cluster::x()']]],
['xor8_359',['xor8',['../d7/d3b/group__hash.html#gae4836b42b998b336298f3b19dcc9cdeb',1,'hash_xor8.c']]]
];

4
search/all_1a.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['y_345',['y',['../d5/db4/structvec__3d__.html#a76098d39a382838df3b4b48c3443413b',1,'vec_3d_::y()'],['../d1/d5e/structobservation.html#ab6be1fa7024b2d5f3a30d6c6b70efdd7',1,'observation::y()'],['../d1/d99/structcluster.html#a10fa7010c12d0f03a422d68321495479',1,'cluster::y()']]],
['yaw_346',['yaw',['../d2/de8/structeuler__.html#aad52507cc423ec49847471f6f15dd9d7',1,'euler_']]]
['y_360',['y',['../d5/db4/structvec__3d__.html#a76098d39a382838df3b4b48c3443413b',1,'vec_3d_::y()'],['../d1/d5e/structobservation.html#ab6be1fa7024b2d5f3a30d6c6b70efdd7',1,'observation::y()'],['../d1/d99/structcluster.html#a10fa7010c12d0f03a422d68321495479',1,'cluster::y()']]],
['yaw_361',['yaw',['../d2/de8/structeuler__.html#aad52507cc423ec49847471f6f15dd9d7',1,'euler_']]]
];

2
search/all_1b.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['z_347',['z',['../d5/db4/structvec__3d__.html#a3339a40de7385fa55bee30be81c098c6',1,'vec_3d_']]]
['z_362',['z',['../d5/db4/structvec__3d__.html#a3339a40de7385fa55bee30be81c098c6',1,'vec_3d_']]]
];

18
search/all_4.js
View File

@ -14,12 +14,14 @@ var searchData=
['cluster_49',['cluster',['../d1/d99/structcluster.html',1,'']]],
['collatz_50',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['collatz_2ec_51',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]],
['compare_52',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_53',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_54',['count',['../d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b',1,'cluster']]],
['count_5fdivisors_55',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['crc32_56',['crc32',['../d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567',1,'hash_crc32.c']]],
['create_5fmatrix_57',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_58',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]],
['code_20style_20convention_59',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
['combine_52',['combine',['../dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df',1,'segment_tree']]],
['combine_5ffunction_53',['combine_function',['../da/da0/segment__tree_8c.html#aca549b5311d32ab1a703b4a4605821d8',1,'segment_tree.c']]],
['compare_54',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_55',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_56',['count',['../d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b',1,'cluster']]],
['count_5fdivisors_57',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['crc32_58',['crc32',['../d7/d3b/group__hash.html#ga483e7ee6db1dc09a0f3e683e028ec567',1,'hash_crc32.c']]],
['create_5fmatrix_59',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_60',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]],
['code_20style_20convention_61',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
];

46
search/all_5.js
View File

@ -1,26 +1,26 @@
var searchData=
[
['d_5ffunc_60',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['data_61',['data',['../df/dea/structdata.html',1,'data'],['../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2',1,'node::data()'],['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]],
['decimal_5fto_5fbinary_62',['decimal_to_binary',['../d8/d30/decimal__to__binary__recursion_8c.html#acbbe6358ec95b3201865a72b2ac522c8',1,'decimal_to_binary_recursion.c']]],
['decimal_5fto_5fbinary_5frecursion_2ec_63',['decimal_to_binary_recursion.c',['../d8/d30/decimal__to__binary__recursion_8c.html',1,'']]],
['delete_64',['delete',['../da/d02/binary__search__tree_8c.html#a748f3966920e2fd197906be1e151b127',1,'binary_search_tree.c']]],
['delete_5fadaline_65',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_66',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_67',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_68',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['digits_69',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_70',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_71',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_72',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]],
['display_73',['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']]],
['divisors_74',['divisors',['../d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6',1,'sol2.c']]],
['djb2_75',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_76',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['dual_77',['dual',['../de/d58/structquaternion__.html#a596abbab688731119c1f23b26a7ac17a',1,'quaternion_::dual()'],['../d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d',1,'dual_quat_::dual()']]],
['dual_5fquat_78',['dual_quat',['../d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f',1,'geometry_datatypes.h']]],
['dual_5fquat_5f_79',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['durand_5fkerner_5froots_2ec_80',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_81',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]],
['dictionary_82',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
['d_5ffunc_62',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['data_63',['data',['../df/dea/structdata.html',1,'data'],['../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2',1,'node::data()'],['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]],
['decimal_5fto_5fbinary_64',['decimal_to_binary',['../d8/d30/decimal__to__binary__recursion_8c.html#acbbe6358ec95b3201865a72b2ac522c8',1,'decimal_to_binary_recursion.c']]],
['decimal_5fto_5fbinary_5frecursion_2ec_65',['decimal_to_binary_recursion.c',['../d8/d30/decimal__to__binary__recursion_8c.html',1,'']]],
['delete_66',['delete',['../da/d02/binary__search__tree_8c.html#a748f3966920e2fd197906be1e151b127',1,'binary_search_tree.c']]],
['delete_5fadaline_67',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_68',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_69',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_70',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['digits_71',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_72',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_73',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_74',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]],
['display_75',['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']]],
['divisors_76',['divisors',['../d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6',1,'sol2.c']]],
['djb2_77',['djb2',['../d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b',1,'hash_djb2.c']]],
['dot_5fprod_78',['dot_prod',['../de/d7b/group__vec__3d.html#ga243e74d542d0d4d14fa3ae0bc2170d84',1,'vectors_3d.c']]],
['dual_79',['dual',['../de/d58/structquaternion__.html#a596abbab688731119c1f23b26a7ac17a',1,'quaternion_::dual()'],['../d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d',1,'dual_quat_::dual()']]],
['dual_5fquat_80',['dual_quat',['../d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f',1,'geometry_datatypes.h']]],
['dual_5fquat_5f_81',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['durand_5fkerner_5froots_2ec_82',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_83',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]],
['dictionary_84',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
];

23
search/all_6.js
View File

@ -1,14 +1,15 @@
var searchData=
[
['edge_83',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['eigen_5fvalues_84',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['elem_85',['elem',['../d0/d6b/structelem.html',1,'']]],
['elevation_86',['elevation',['../d2/de8/structeuler__.html#abbbf12f0a960faf783d219f9012cdce6',1,'euler_']]],
['end_87',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]],
['epsilon_88',['EPSILON',['../de/d5a/group__quaternions.html#ga002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON():&#160;geometry_datatypes.h'],['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON():&#160;qr_eigen_values.c']]],
['eta_89',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]],
['euler_90',['euler',['../dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd',1,'geometry_datatypes.h']]],
['euler_5f_91',['euler_',['../d2/de8/structeuler__.html',1,'']]],
['euler_5ffrom_5fquat_92',['euler_from_quat',['../dc/d9a/group__quats.html#ga1afd165100e9b02b86e3bd11b50f3b06',1,'quaternions.c']]],
['exact_5fsolution_93',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_semi_implicit_euler.c']]]
['edge_85',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['eigen_5fvalues_86',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['elem_87',['elem',['../d0/d6b/structelem.html',1,'']]],
['elem_5fsize_88',['elem_size',['../dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853',1,'segment_tree']]],
['elevation_89',['elevation',['../d2/de8/structeuler__.html#abbbf12f0a960faf783d219f9012cdce6',1,'euler_']]],
['end_90',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]],
['epsilon_91',['EPSILON',['../de/d5a/group__quaternions.html#ga002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON():&#160;geometry_datatypes.h'],['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON():&#160;qr_eigen_values.c']]],
['eta_92',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]],
['euler_93',['euler',['../dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd',1,'geometry_datatypes.h']]],
['euler_5f_94',['euler_',['../d2/de8/structeuler__.html',1,'']]],
['euler_5ffrom_5fquat_95',['euler_from_quat',['../dc/d9a/group__quats.html#ga1afd165100e9b02b86e3bd11b50f3b06',1,'quaternions.c']]],
['exact_5fsolution_96',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_semi_implicit_euler.c']]]
];

16
search/all_7.js
View File

@ -1,11 +1,11 @@
var searchData=
[
['factorial_5flarge_5fnumber_2ec_94',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fib_95',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['fibonacci_5ffast_2ec_96',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]],
['find_97',['find',['../da/d02/binary__search__tree_8c.html#adff4c6248834a9944a1fb03a20230c9c',1,'find(node *root, int data):&#160;binary_search_tree.c'],['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'find(int *p, int x):&#160;union_find.c']]],
['forward_5feuler_98',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_99',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_100',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_101',['func',['../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a',1,'func(int sockfd):&#160;client.c'],['../d1/d20/server_8c.html#ac17020a38607ab29ce18939d5194a32a',1,'func(int sockfd):&#160;server.c'],['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'func(double complex x):&#160;newton_raphson_root.c']]]
['factorial_5flarge_5fnumber_2ec_97',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fib_98',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['fibonacci_5ffast_2ec_99',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]],
['find_100',['find',['../da/d02/binary__search__tree_8c.html#adff4c6248834a9944a1fb03a20230c9c',1,'find(node *root, int data):&#160;binary_search_tree.c'],['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'find(int *p, int x):&#160;union_find.c']]],
['forward_5feuler_101',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_102',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_103',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_104',['func',['../dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a',1,'func(int sockfd):&#160;client.c'],['../d1/d20/server_8c.html#ac17020a38607ab29ce18939d5194a32a',1,'func(int sockfd):&#160;server.c'],['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'func(double complex x):&#160;newton_raphson_root.c']]]
];

36
search/all_8.js
View File

@ -1,21 +1,21 @@
var searchData=
[
['gcd_102',['gcd',['../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol3.c']]],
['geometry_5fdatatypes_2eh_103',['geometry_datatypes.h',['../d0/dc7/geometry__datatypes_8h.html',1,'']]],
['get_5fclock_5fdiff_104',['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']]],
['get_5fcross_5fmatrix_105',['get_cross_matrix',['../de/d7b/group__vec__3d.html#ga5082b0720c2cc51ae84bf19bd76dc849',1,'vectors_3d.c']]],
['get_5fdigits_106',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_107',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f2d_108',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_109',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_110',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol2.c']]],
['get_5fnext_5funknown_111',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]],
['get_5fnumber_112',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_113',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol2.c']]],
['get_5fproduct_114',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
['get_5frand_115',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]],
['getmax_116',['getMax',['../da/d02/binary__search__tree_8c.html#ad297e528a7bb8604ca93af149d609150',1,'binary_search_tree.c']]],
['graph_117',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_118',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]],
['group_119',['group',['../d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab',1,'observation']]]
['gcd_105',['gcd',['../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol3.c']]],
['geometry_5fdatatypes_2eh_106',['geometry_datatypes.h',['../d0/dc7/geometry__datatypes_8h.html',1,'']]],
['get_5fclock_5fdiff_107',['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']]],
['get_5fcross_5fmatrix_108',['get_cross_matrix',['../de/d7b/group__vec__3d.html#ga5082b0720c2cc51ae84bf19bd76dc849',1,'vectors_3d.c']]],
['get_5fdigits_109',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_110',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f2d_111',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_112',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_113',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol2.c']]],
['get_5fnext_5funknown_114',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]],
['get_5fnumber_115',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_116',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol2.c']]],
['get_5fproduct_117',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
['get_5frand_118',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]],
['getmax_119',['getMax',['../da/d02/binary__search__tree_8c.html#ad297e528a7bb8604ca93af149d609150',1,'binary_search_tree.c']]],
['graph_120',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_121',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]],
['group_122',['group',['../d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab',1,'observation']]]
];

20
search/all_9.js
View File

@ -1,13 +1,13 @@
var searchData=
[
['hash_20algorithms_120',['Hash algorithms',['../d7/d3b/group__hash.html',1,'']]],
['hash_5fadler32_2ec_121',['hash_adler32.c',['../d3/d39/hash__adler32_8c.html',1,'']]],
['hash_5fcrc32_2ec_122',['hash_crc32.c',['../d9/dc9/hash__crc32_8c.html',1,'']]],
['hash_5fdjb2_2ec_123',['hash_djb2.c',['../d4/de3/hash__djb2_8c.html',1,'']]],
['hash_5fsdbm_2ec_124',['hash_sdbm.c',['../d7/d0c/hash__sdbm_8c.html',1,'']]],
['hash_5fset_5ft_125',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]],
['hash_5fxor8_2ec_126',['hash_xor8.c',['../d0/d57/hash__xor8_8c.html',1,'']]],
['heading_127',['heading',['../d2/de8/structeuler__.html#a899572e1b6a43387128de3a402a0a5f8',1,'euler_']]],
['height_128',['height',['../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'binary_search_tree.c']]],
['hash_20algorithms_129',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
['hash_20algorithms_123',['Hash algorithms',['../d7/d3b/group__hash.html',1,'']]],
['hash_5fadler32_2ec_124',['hash_adler32.c',['../d3/d39/hash__adler32_8c.html',1,'']]],
['hash_5fcrc32_2ec_125',['hash_crc32.c',['../d9/dc9/hash__crc32_8c.html',1,'']]],
['hash_5fdjb2_2ec_126',['hash_djb2.c',['../d4/de3/hash__djb2_8c.html',1,'']]],
['hash_5fsdbm_2ec_127',['hash_sdbm.c',['../d7/d0c/hash__sdbm_8c.html',1,'']]],
['hash_5fset_5ft_128',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]],
['hash_5fxor8_2ec_129',['hash_xor8.c',['../d0/d57/hash__xor8_8c.html',1,'']]],
['heading_130',['heading',['../d2/de8/structeuler__.html#a899572e1b6a43387128de3a402a0a5f8',1,'euler_']]],
['height_131',['height',['../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'binary_search_tree.c']]],
['hash_20algorithms_132',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
];

35
search/all_a.js
View File

@ -1,20 +1,21 @@
var searchData=
[
['inorder_130',['inOrder',['../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc',1,'binary_search_tree.c']]],
['inorder_5fdisplay_131',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_132',['insert',['../da/d02/binary__search__tree_8c.html#a73152b9ccb4aa5cd4c1bacd4188bb2de',1,'binary_search_tree.c']]],
['insert_5fbt_133',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertion_5fsort_2ec_134',['insertion_sort.c',['../db/ddf/insertion__sort_8c.html',1,'']]],
['insertionsort_135',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fto_5fstring_136',['int_to_string',['../dd/d53/int__to__string_8c.html#a969911f32f1c435bb2bf166574ef9ae5',1,'int_to_string.c']]],
['int_5fto_5fstring_2ec_137',['int_to_string.c',['../dd/d53/int__to__string_8c.html',1,'']]],
['is_5fabundant_138',['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_139',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_140',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_141',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_142',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_143',['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']]],
['ispalindrome_144',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_145',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'isPrime(int x):&#160;prime.c'],['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'isprime(int no):&#160;sol1.c']]],
['isstrong_146',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
['identity_133',['identity',['../dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a',1,'segment_tree']]],
['inorder_134',['inOrder',['../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc',1,'binary_search_tree.c']]],
['inorder_5fdisplay_135',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_136',['insert',['../da/d02/binary__search__tree_8c.html#a73152b9ccb4aa5cd4c1bacd4188bb2de',1,'binary_search_tree.c']]],
['insert_5fbt_137',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['insertion_5fsort_2ec_138',['insertion_sort.c',['../db/ddf/insertion__sort_8c.html',1,'']]],
['insertionsort_139',['insertionSort',['../db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb',1,'insertion_sort.c']]],
['int_5fto_5fstring_140',['int_to_string',['../dd/d53/int__to__string_8c.html#a969911f32f1c435bb2bf166574ef9ae5',1,'int_to_string.c']]],
['int_5fto_5fstring_2ec_141',['int_to_string.c',['../dd/d53/int__to__string_8c.html',1,'']]],
['is_5fabundant_142',['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_143',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_144',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_145',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_146',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_147',['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']]],
['ispalindrome_148',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_149',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'isPrime(int x):&#160;prime.c'],['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'isprime(int no):&#160;sol1.c']]],
['isstrong_150',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

6
search/all_b.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['join_147',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]],
['jump_5fsearch_148',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]],
['jump_5fsearch_2ec_149',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]]
['join_151',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]],
['jump_5fsearch_152',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]],
['jump_5fsearch_2ec_153',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]]
];

26
search/all_c.js
View File

@ -1,16 +1,16 @@
var searchData=
[
['k_2dmeans_20clustering_20algorithm_150',['K-Means Clustering Algorithm',['../d8/d71/group__k__means.html',1,'']]],
['k_5fmeans_5fclustering_2ec_151',['k_means_clustering.c',['../d6/d76/k__means__clustering_8c.html',1,'']]],
['kmeans_152',['kMeans',['../d8/d71/group__k__means.html#gad229b1dc406cb5ea510f26a373ed8bfd',1,'k_means_clustering.c']]],
['kohonen_20som_20trace_2fchain_20algorithm_153',['Kohonen SOM trace/chain algorithm',['../d0/dcb/group__kohonen__1d.html',1,'']]],
['kohonen_20som_20topology_20algorithm_154',['Kohonen SOM topology algorithm',['../d1/d6b/group__kohonen__2d.html',1,'']]],
['kohonen_5farray_5f3d_155',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]],
['kohonen_5fdata_5f3d_156',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]],
['kohonen_5fget_5fmin_5f1d_157',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]],
['kohonen_5fsom_158',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftopology_2ec_159',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_160',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]],
['kohonen_5fsom_5ftracer_161',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]],
['kohonen_5fupdate_5fweights_162',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_trace.c']]]
['k_2dmeans_20clustering_20algorithm_154',['K-Means Clustering Algorithm',['../d8/d71/group__k__means.html',1,'']]],
['k_5fmeans_5fclustering_2ec_155',['k_means_clustering.c',['../d6/d76/k__means__clustering_8c.html',1,'']]],
['kmeans_156',['kMeans',['../d8/d71/group__k__means.html#gad229b1dc406cb5ea510f26a373ed8bfd',1,'k_means_clustering.c']]],
['kohonen_20som_20trace_2fchain_20algorithm_157',['Kohonen SOM trace/chain algorithm',['../d0/dcb/group__kohonen__1d.html',1,'']]],
['kohonen_20som_20topology_20algorithm_158',['Kohonen SOM topology algorithm',['../d1/d6b/group__kohonen__2d.html',1,'']]],
['kohonen_5farray_5f3d_159',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]],
['kohonen_5fdata_5f3d_160',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]],
['kohonen_5fget_5fmin_5f1d_161',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]],
['kohonen_5fsom_162',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftopology_2ec_163',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_164',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]],
['kohonen_5fsom_5ftracer_165',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]],
['kohonen_5fupdate_5fweights_166',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_trace.c']]]
];

25
search/all_d.js
View File

@ -1,15 +1,16 @@
var searchData=
[
['l_163',['L',['../df/db3/struct_l.html',1,'']]],
['large_5fnum_164',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['lazy_5fsort_165',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_166',['lcm',['../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol3.c']]],
['left_167',['left',['../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0',1,'node']]],
['lims_168',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['llink_169',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_170',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_171',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]],
['list_20of_20all_20files_172',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_173',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]],
['library_20for_203d_20vectors_20_26_20quaternions_174',['Library for 3D Vectors &amp; Quaternions',['../de/d5a/group__quaternions.html',1,'']]]
['l_167',['L',['../df/db3/struct_l.html',1,'']]],
['large_5fnum_168',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['lazy_5fsort_169',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_170',['lcm',['../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol3.c']]],
['left_171',['left',['../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0',1,'node']]],
['length_172',['length',['../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e',1,'segment_tree']]],
['lims_173',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['llink_174',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_175',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_176',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]],
['list_20of_20all_20files_177',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_178',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]],
['library_20for_203d_20vectors_20_26_20quaternions_179',['Library for 3D Vectors &amp; Quaternions',['../de/d5a/group__quaternions.html',1,'']]]
];

57
search/all_e.js
View File

File diff suppressed because one or more lines are too long

24
search/all_f.js
View File

@ -1,15 +1,15 @@
var searchData=
[
['n_203',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]],
['n2_204',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]],
['new_5fadaline_205',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_206',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['newnode_207',['newNode',['../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d',1,'binary_search_tree.c']]],
['newton_5fraphson_5froot_2ec_208',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
['next_209',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
['next_5fdigit_210',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
['node_211',['Node',['../db/d8b/struct_node.html',1,'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']]],
['num_5fdigits_212',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_213',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_214',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
['n_209',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]],
['n2_210',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]],
['new_5fadaline_211',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_212',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['newnode_213',['newNode',['../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d',1,'binary_search_tree.c']]],
['newton_5fraphson_5froot_2ec_214',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
['next_215',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
['next_5fdigit_216',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
['node_217',['node',['../d5/da1/structnode.html',1,'node'],['../db/d8b/struct_node.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']]],
['num_5fdigits_218',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_219',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_220',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
];

6
search/classes_0.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['_5fbig_5fint_348',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_349',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_350',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
['_5fbig_5fint_363',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_364',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_365',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
];

4
search/classes_1.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['adaline_351',['adaline',['../d2/daa/structadaline.html',1,'']]],
['avlnode_352',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
['adaline_366',['adaline',['../d2/daa/structadaline.html',1,'']]],
['avlnode_367',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
];

6
search/classes_10.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['t_380',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_381',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_382',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['t_396',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_397',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_398',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

2
search/classes_11.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['vec_5f3d_5f_383',['vec_3d_',['../d5/db4/structvec__3d__.html',1,'']]]
['vec_5f3d_5f_399',['vec_3d_',['../d5/db4/structvec__3d__.html',1,'']]]
];

2
search/classes_12.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['word_5fcount_5fword_384',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
['word_5fcount_5fword_400',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
];

2
search/classes_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['bstiterator_353',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
['bstiterator_368',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
];

4
search/classes_3.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['carray_354',['CArray',['../d4/d2d/struct_c_array.html',1,'']]],
['cluster_355',['cluster',['../d1/d99/structcluster.html',1,'']]]
['carray_369',['CArray',['../d4/d2d/struct_c_array.html',1,'']]],
['cluster_370',['cluster',['../d1/d99/structcluster.html',1,'']]]
];

8
search/classes_4.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['data_356',['data',['../df/dea/structdata.html',1,'']]],
['dict_357',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dual_5fquat_5f_358',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['dynamic_5farray_359',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
['data_371',['data',['../df/dea/structdata.html',1,'']]],
['dict_372',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dual_5fquat_5f_373',['dual_quat_',['../d7/dfd/structdual__quat__.html',1,'']]],
['dynamic_5farray_374',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
];

6
search/classes_5.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['edge_360',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_361',['elem',['../d0/d6b/structelem.html',1,'']]],
['euler_5f_362',['euler_',['../d2/de8/structeuler__.html',1,'']]]
['edge_375',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_376',['elem',['../d0/d6b/structelem.html',1,'']]],
['euler_5f_377',['euler_',['../d2/de8/structeuler__.html',1,'']]]
];

4
search/classes_6.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['graph_363',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_364',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
['graph_378',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_379',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
];

2
search/classes_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['hash_5fset_5ft_365',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
['hash_5fset_5ft_380',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
];

2
search/classes_8.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['kohonen_5farray_5f3d_366',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
['kohonen_5farray_5f3d_381',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
];

2
search/classes_9.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['l_367',['L',['../df/db3/struct_l.html',1,'']]]
['l_382',['L',['../df/db3/struct_l.html',1,'']]]
];

6
search/classes_a.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['mat_5f3x3_5f_368',['mat_3x3_',['../d9/d8b/structmat__3x3__.html',1,'']]],
['max_5fheap_369',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_370',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
['mat_5f3x3_5f_383',['mat_3x3_',['../d9/d8b/structmat__3x3__.html',1,'']]],
['max_5fheap_384',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_385',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
];

2
search/classes_b.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['node_371',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]]
['node_386',['node',['../d5/da1/structnode.html',1,'node'],['../db/d8b/struct_node.html',1,'Node']]]
];

2
search/classes_c.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['observation_372',['observation',['../d1/d5e/structobservation.html',1,'']]]
['observation_387',['observation',['../d1/d5e/structobservation.html',1,'']]]
];

2
search/classes_d.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['pid_373',['pid',['../d0/d43/structpid.html',1,'']]]
['pid_388',['pid',['../d0/d43/structpid.html',1,'']]]
];

6
search/classes_e.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['quaternion_5f_374',['quaternion_',['../de/d58/structquaternion__.html',1,'']]],
['queue_375',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_376',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
['quaternion_5f_389',['quaternion_',['../de/d58/structquaternion__.html',1,'']]],
['queue_390',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_391',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
];

7
search/classes_f.js
View File

@ -1,6 +1,7 @@
var searchData=
[
['stack_377',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_378',['subset',['../dc/de5/structsubset.html',1,'']]],
['sudoku_379',['sudoku',['../dc/d18/structsudoku.html',1,'']]]
['segment_5ftree_392',['segment_tree',['../dd/d06/structsegment__tree.html',1,'']]],
['stack_393',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_394',['subset',['../dc/de5/structsubset.html',1,'']]],
['sudoku_395',['sudoku',['../dc/d18/structsudoku.html',1,'']]]
];

2
search/defines_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['_5fuse_5fmath_5fdefines_656',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;cartesian_to_polar.c']]]
['_5fuse_5fmath_5fdefines_687',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;cartesian_to_polar.c']]]
];

2
search/defines_1.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['accuracy_657',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;newton_raphson_root.c']]]
['accuracy_688',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;newton_raphson_root.c']]]
];

2
search/defines_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['epsilon_658',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
['epsilon_689',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
];

2
search/defines_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['lims_659',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
['lims_690',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
];

22
search/defines_4.js
View File

@ -1,14 +1,14 @@
var searchData=
[
['max_660',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;server.c']]],
['max_5fdeno_661',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_662',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5flen_663',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5flength_664',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]],
['max_5fname_5flen_665',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_666',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['max_5fsize_667',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
['maxline_668',['MAXLINE',['../da/de6/udp__client_8c.html#a3e937c42922f7601edb17b747602c471',1,'MAXLINE():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a3e937c42922f7601edb17b747602c471',1,'MAXLINE():&#160;udp_server.c']]],
['min_669',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]],
['mod_5flimit_670',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]]
['max_691',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;server.c']]],
['max_5fdeno_692',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_693',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5flen_694',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5flength_695',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]],
['max_5fname_5flen_696',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_697',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['max_5fsize_698',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]],
['maxline_699',['MAXLINE',['../da/de6/udp__client_8c.html#a3e937c42922f7601edb17b747602c471',1,'MAXLINE():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a3e937c42922f7601edb17b747602c471',1,'MAXLINE():&#160;udp_server.c']]],
['min_700',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]],
['mod_5flimit_701',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]]
];

2
search/defines_5.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['order_671',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_semi_implicit_euler.c']]]
['order_702',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_semi_implicit_euler.c']]]
];

2
search/defines_6.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['port_672',['PORT',['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c']]]
['port_703',['PORT',['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c'],['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c']]]
];

2
search/defines_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['sa_673',['SA',['../dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;client.c'],['../d1/d20/server_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;server.c']]]
['sa_704',['SA',['../dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;client.c'],['../d1/d20/server_8c.html#a1e43924adac4ae865aa0acf79710261c',1,'SA():&#160;server.c']]]
];

2
search/files_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['adaline_5flearning_2ec_385',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
['adaline_5flearning_2ec_401',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
];

10
search/files_1.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['bead_5fsort_2ec_386',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['binary_5fsearch_2ec_387',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]],
['binary_5fsearch_5ftree_2ec_388',['binary_search_tree.c',['../da/d02/binary__search__tree_8c.html',1,'']]],
['bubble_5fsort_2ec_389',['bubble_sort.c',['../dd/de4/bubble__sort_8c.html',1,'']]],
['bubble_5fsort_5frecursion_2ec_390',['bubble_sort_recursion.c',['../d5/d38/bubble__sort__recursion_8c.html',1,'']]]
['bead_5fsort_2ec_402',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['binary_5fsearch_2ec_403',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]],
['binary_5fsearch_5ftree_2ec_404',['binary_search_tree.c',['../da/d02/binary__search__tree_8c.html',1,'']]],
['bubble_5fsort_2ec_405',['bubble_sort.c',['../dd/de4/bubble__sort_8c.html',1,'']]],
['bubble_5fsort_5frecursion_2ec_406',['bubble_sort_recursion.c',['../d5/d38/bubble__sort__recursion_8c.html',1,'']]]
];

2
search/files_10.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['realtime_5fstats_2ec_425',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
['realtime_5fstats_2ec_441',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
];

25
search/files_11.js
View File

@ -1,15 +1,16 @@
var searchData=
[
['selection_5fsort_2ec_426',['selection_sort.c',['../df/d83/selection__sort_8c.html',1,'']]],
['server_2ec_427',['server.c',['../d1/d20/server_8c.html',1,'']]],
['shell_5fsort2_2ec_428',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_429',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_430',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_431',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d32/problem__5_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_432',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d5/d3d/problem__5_2sol2_8c.html',1,'(Global Namespace)'],['../d6/d64/problem__7_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_433',['sol3.c',['../da/d56/problem__1_2sol3_8c.html',1,'(Global Namespace)'],['../d5/d7c/problem__5_2sol3_8c.html',1,'(Global Namespace)']]],
['sol4_2ec_434',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['spirograph_2ec_435',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
['strong_5fnumber_2ec_436',['strong_number.c',['../d4/dcc/strong__number_8c.html',1,'']]],
['sudoku_5fsolver_2ec_437',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]]
['segment_5ftree_2ec_442',['segment_tree.c',['../da/da0/segment__tree_8c.html',1,'']]],
['selection_5fsort_2ec_443',['selection_sort.c',['../df/d83/selection__sort_8c.html',1,'']]],
['server_2ec_444',['server.c',['../d1/d20/server_8c.html',1,'']]],
['shell_5fsort2_2ec_445',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_446',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_447',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_448',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d32/problem__5_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_449',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d5/d3d/problem__5_2sol2_8c.html',1,'(Global Namespace)'],['../d6/d64/problem__7_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_450',['sol3.c',['../da/d56/problem__1_2sol3_8c.html',1,'(Global Namespace)'],['../d5/d7c/problem__5_2sol3_8c.html',1,'(Global Namespace)']]],
['sol4_2ec_451',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['spirograph_2ec_452',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]],
['strong_5fnumber_2ec_453',['strong_number.c',['../d4/dcc/strong__number_8c.html',1,'']]],
['sudoku_5fsolver_2ec_454',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]]
];

2
search/files_12.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['threaded_5fbinary_5ftrees_2ec_438',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
['threaded_5fbinary_5ftrees_2ec_455',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
];

6
search/files_13.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['udp_5fclient_2ec_439',['udp_client.c',['../da/de6/udp__client_8c.html',1,'']]],
['udp_5fserver_2ec_440',['udp_server.c',['../d8/dca/udp__server_8c.html',1,'']]],
['union_5ffind_2ec_441',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
['udp_5fclient_2ec_456',['udp_client.c',['../da/de6/udp__client_8c.html',1,'']]],
['udp_5fserver_2ec_457',['udp_server.c',['../d8/dca/udp__server_8c.html',1,'']]],
['union_5ffind_2ec_458',['union_find.c',['../df/df3/union__find_8c.html',1,'']]]
];

2
search/files_14.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['vectors_5f3d_2ec_442',['vectors_3d.c',['../d5/db8/vectors__3d_8c.html',1,'']]]
['vectors_5f3d_2ec_459',['vectors_3d.c',['../d5/db8/vectors__3d_8c.html',1,'']]]
];

10
search/files_2.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['c_5fatoi_5fstr_5fto_5finteger_2ec_391',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_392',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['cartesian_5fto_5fpolar_2ec_393',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]],
['client_2ec_394',['client.c',['../dd/d93/client_8c.html',1,'']]],
['collatz_2ec_395',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
['c_5fatoi_5fstr_5fto_5finteger_2ec_407',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_408',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['cartesian_5fto_5fpolar_2ec_409',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]],
['client_2ec_410',['client.c',['../dd/d93/client_8c.html',1,'']]],
['collatz_2ec_411',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
];

Some files were not shown because too many files have changed in this diff Show More