<divclass="ttc"id="adoubly__linked__list_8c_html_a37890fb794cb2c436ffcc643c30ec57f"><divclass="ttname"><ahref="../../dd/d29/doubly__linked__list_8c.html#a37890fb794cb2c436ffcc643c30ec57f">create</a></div><divclass="ttdeci">List * create(double value)</div><divclass="ttdoc">Create list function, a new list containing one node will be created.</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:92</div></div>
<divclass="ttc"id="asegment__tree_8c_html_a93bfab032ce9dbc0c1feaeee32a885fb"><divclass="ttname"><ahref="../../da/da0/segment__tree_8c.html#a93bfab032ce9dbc0c1feaeee32a885fb">minimum</a></div><divclass="ttdeci">void minimum(const void *a, const void *b, void *c)</div><divclass="ttdoc">Utility for test A function compare for minimum between two integers This function is used as combine...</div><divclass="ttdef"><b>Definition:</b> segment_tree.c:194</div></div>
<divclass="ttc"id="astructlist_html_a2054c799f7580787a500df82d14ace25"><divclass="ttname"><ahref="../../d8/d10/structlist.html#a2054c799f7580787a500df82d14ace25">list::prev</a></div><divclass="ttdeci">struct list * prev</div><divclass="ttdoc">directing to other nodes or NULL</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:26</div></div>
<divclass="ttc"id="astructnode_html"><divclass="ttname"><ahref="../../d5/da1/structnode.html">node</a></div><divclass="ttdoc">Node, the basic data structure in the tree.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<divclass="ttc"id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><divclass="ttname"><ahref="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><divclass="ttdeci">int data</div><divclass="ttdoc">data of the node</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
<divclass="ttc"id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><divclass="ttname"><ahref="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><divclass="ttdeci">int data</div><divclass="ttdoc">stores the number</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
<divclass="ttc"id="astruct_node_html"><divclass="ttname"><ahref="../../db/d8b/struct_node.html">Node</a></div><divclass="ttdoc">Node, the basic data structure of the tree.</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
<divclass="ttc"id="agroup__sorting_html_ga8dc3ec66cb3350313fdb34bfd1674729"><divclass="ttname"><ahref="../../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729">merge</a></div><divclass="ttdeci">void merge(int *a, int l, int r, int n)</div><divclass="ttdoc">Perform merge of segments.</div><divclass="ttdef"><b>Definition:</b> merge_sort.c:33</div></div>
<divclass="ttc"id="agroup__misc_html_ga6f8e8c9d25b5891d57e588d80d75028a"><divclass="ttname"><ahref="../../d1/ded/group__misc.html#ga6f8e8c9d25b5891d57e588d80d75028a">count</a></div><divclass="ttdeci">int count(int *arr, const int size)</div><divclass="ttdoc">Count func counts the number of prime numbers.</div><divclass="ttdef"><b>Definition:</b> prime_seive.c:42</div></div>
<divclass="ttc"id="adoubly__linked__list_8c_html_a1fadec32fc369a8dcfbcd766e166efa0"><divclass="ttname"><ahref="../../dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0">print</a></div><divclass="ttdeci">void print(List *list)</div><divclass="ttdoc">Print list function.</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:256</div></div>
<divclass="ttc"id="astructlist_html_a5363bdc0495ab9ef0ed587c99b9a2b41"><divclass="ttname"><ahref="../../d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41">list::value</a></div><divclass="ttdeci">double value</div><divclass="ttdoc">value saved on each node</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:25</div></div>
<divclass="ttc"id="adoubly__linked__list_8c_html_aedd04074dbc6af0de89051f97209311b"><divclass="ttname"><ahref="../../dd/d29/doubly__linked__list_8c.html#aedd04074dbc6af0de89051f97209311b">search</a></div><divclass="ttdeci">int search(List *list, double value)</div><divclass="ttdoc">Search value into the list function.</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:242</div></div>
<divclass="ttc"id="alu__decompose_8c_html_a0789beb8d3396582d77b7aedf5e5554a"><divclass="ttname"><ahref="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a></div><divclass="ttdeci">void display(double **A, int N)</div><divclass="ttdoc">Function to display square matrix.</div><divclass="ttdef"><b>Definition:</b> lu_decompose.c:66</div></div>
<divclass="ttc"id="abinary__search__tree_8c_html_a73152b9ccb4aa5cd4c1bacd4188bb2de"><divclass="ttname"><ahref="../../da/d02/binary__search__tree_8c.html#a73152b9ccb4aa5cd4c1bacd4188bb2de">insert</a></div><divclass="ttdeci">node * insert(node *root, int data)</div><divclass="ttdoc">Insertion procedure, which inserts the input key in a new node in the tree.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:46</div></div>
<divclass="ttc"id="adoubly__linked__list_8c_html_aa89b8bc105d9a09d4e7c06e8b34078a7"><divclass="ttname"><ahref="../../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7">List</a></div><divclass="ttdeci">struct list List</div><divclass="ttdoc">Doubly linked list struct.</div></div>
<divclass="ttc"id="adoubly__linked__list_8c_html_a04ac29c396dc8335a5827927183c9918"><divclass="ttname"><ahref="../../dd/d29/doubly__linked__list_8c.html#a04ac29c396dc8335a5827927183c9918">insert</a></div><divclass="ttdeci">List * insert(List *list, double value, int pos)</div><divclass="ttdoc">Insertion by position into the list function.</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:108</div></div>
<divclass="ttc"id="astructlist_html"><divclass="ttname"><ahref="../../d8/d10/structlist.html">list</a></div><divclass="ttdoc">Doubly linked list struct.</div><divclass="ttdef"><b>Definition:</b> doubly_linked_list.c:24</div></div>
<liclass="footer">Generated by <ahref="http://www.doxygen.org/index.html"><imgclass="footer"src="../../doxygen.svg"width="104"height="31"alt="doxygen"/></a> 1.8.20 </li>
