mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 22:02:20 +08:00
822 lines
190 KiB
HTML
822 lines
190 KiB
HTML
<!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.18"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>Algorithms_in_C++: math/large_number.h Source File</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++
|
||
 <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.18 -->
|
||
<script type="text/javascript">
|
||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&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&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&dn=gpl-2.0.txt GPL-v2 */
|
||
$(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.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="headertitle">
|
||
<div class="title">large_number.h</div> </div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<a href="../../d4/d86/large__number_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * @file</span></div>
|
||
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * @brief Library to perform arithmatic operations on arbitrarily large</span></div>
|
||
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * numbers.</span></div>
|
||
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * \author [Krishna Vedala](https://github.com/kvedala)</span></div>
|
||
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>  </div>
|
||
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#ifndef MATH_LARGE_NUMBER_H_</span></div>
|
||
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#define MATH_LARGE_NUMBER_H_</span></div>
|
||
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <algorithm></span></div>
|
||
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <cassert></span></div>
|
||
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <cinttypes></span></div>
|
||
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <cstring></span></div>
|
||
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <iostream></span></div>
|
||
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <type_traits></span></div>
|
||
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <vector></span></div>
|
||
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * Store large unsigned numbers as a C++ vector</span></div>
|
||
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * The class provides convenience functions to add a</span></div>
|
||
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * digit to the number, perform multiplication of</span></div>
|
||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * large number with long unsigned integers.</span></div>
|
||
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html"> 24</a></span> <span class="keyword">class </span><a class="code" href="../../db/d82/classlarge__number.html">large_number</a> {</div>
|
||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">public</span>:<span class="comment"></span></div>
|
||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> /**< initializer with value = 1 */</span></div>
|
||
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337"> 27</a></span>  <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>() { <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1); }</div>
|
||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="comment">// /**< initializer from an integer */</span></div>
|
||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">// explicit large_number(uint64_t n) {</span></div>
|
||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// uint64_t carry = n;</span></div>
|
||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">// do {</span></div>
|
||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// add_digit(carry % 10);</span></div>
|
||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// carry /= 10;</span></div>
|
||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// } while (carry != 0);</span></div>
|
||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// }</span></div>
|
||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> /**< initializer from an integer */</span></div>
|
||
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a"> 39</a></span>  <span class="keyword">explicit</span> <a class="code" href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number</a>(<span class="keywordtype">int</span> n) {</div>
|
||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">int</span> carry = n;</div>
|
||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">do</span> {</div>
|
||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="code" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">add_digit</a>(carry % 10);</div>
|
||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  carry /= 10;</div>
|
||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  } <span class="keywordflow">while</span> (carry != 0);</div>
|
||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div>
|
||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> /**< initializer from another large_number */</span></div>
|
||
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872"> 48</a></span>  <a class="code" href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number</a>(<span class="keyword">const</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &a) : <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>(a.<a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>) {}</div>
|
||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> /**< initializer from a vector */</span></div>
|
||
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f"> 51</a></span>  <span class="keyword">explicit</span> <a class="code" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<unsigned char></a> &vec) : <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>(vec) {}</div>
|
||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> /**< initializer from a string */</span></div>
|
||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">explicit</span> <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="keywordtype">char</span> <span class="keyword">const</span> *number_str) {</div>
|
||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = strlen(number_str); i > 0; i--) {</div>
|
||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordtype">char</span> a = number_str[i - 1] - <span class="charliteral">'0'</span>;</div>
|
||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (a >= 0 && a <= 9)</div>
|
||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a);</div>
|
||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  }</div>
|
||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div>
|
||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * Function to check implementation</span></div>
|
||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9"> 65</a></span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">test</a>() {</div>
|
||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"------ Checking `large_number` class implementations\t"</span></div>
|
||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> a(40);</div>
|
||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// 1. test multiplication</span></div>
|
||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  a *= 10;</div>
|
||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(400)) {</div>
|
||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 1/6 ("</span> << a << <span class="stringliteral">"!=400)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 1/6..."</span>;</div>
|
||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// 2. test compound addition with integer</span></div>
|
||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  a += 120;</div>
|
||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(520)) {</div>
|
||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 2/6 ("</span> << a << <span class="stringliteral">"!=520)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div>
|
||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 2/6..."</span>;</div>
|
||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// 3. test compound multiplication again</span></div>
|
||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  a *= 10;</div>
|
||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5200)) {</div>
|
||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 3/6 ("</span> << a << <span class="stringliteral">"!=5200)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 3/6..."</span>;</div>
|
||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// 4. test increment (prefix)</span></div>
|
||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  ++a;</div>
|
||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5201)) {</div>
|
||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 4/6 ("</span> << a << <span class="stringliteral">"!=5201)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
|
||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 4/6..."</span>;</div>
|
||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// 5. test increment (postfix)</span></div>
|
||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  a++;</div>
|
||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5202)) {</div>
|
||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 5/6 ("</span> << a << <span class="stringliteral">"!=5202)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div>
|
||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 5/6..."</span>;</div>
|
||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// 6. test addition with another large number</span></div>
|
||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  a = a + <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">"7000000000000000000000000000000"</span>);</div>
|
||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (a != <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">"7000000000000000000000000005202"</span>)) {</div>
|
||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"\tFailed 6/6 ("</span> << a</div>
|
||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  << <span class="stringliteral">"!=7000000000000000000000000005202)"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div>
|
||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\tPassed 6/6..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
|
||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * add a digit at MSB to the large number</span></div>
|
||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615"> 118</a></span>  <span class="keywordtype">void</span> <a class="code" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">add_digit</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> value) {</div>
|
||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (value > 9) {</div>
|
||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"digit > 9!!\n"</span>;</div>
|
||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  exit(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(value);</div>
|
||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
||
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> * Get number of digits in the number</span></div>
|
||
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93"> 130</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); }</div>
|
||
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> * operator over load to access the</span></div>
|
||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> * i^th digit conveniently and also</span></div>
|
||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * assign value to it</span></div>
|
||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00137"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d"> 137</a></span>  <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> &<a class="code" href="../../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d">operator[]</a>(<span class="keywordtype">size_t</span> n) { <span class="keywordflow">return</span> this-><a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n]; }</div>
|
||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">inline</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> &<a class="code" href="../../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d">operator[]</a>(<span class="keywordtype">size_t</span> n)<span class="keyword"> const </span>{</div>
|
||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">return</span> this-><a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n];</div>
|
||
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div>
|
||
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> * operator overload to compare two numbers</span></div>
|
||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab"> 146</a></span>  <span class="keyword">friend</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &<a class="code" href="../../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab">operator<<</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &out, <span class="keyword">const</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &a) {</div>
|
||
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = a.num_digits(); i > 0; i--)</div>
|
||
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  out << static_cast<int>(a[i - 1]);</div>
|
||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span> out;</div>
|
||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
|
||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * operator overload to compare two numbers</span></div>
|
||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca"> 155</a></span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code" href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">operator==</a>(<a class="code" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &a, <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &b) {</div>
|
||
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordtype">size_t</span> N = a.num_digits();</div>
|
||
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (N != b.<a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>())</div>
|
||
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; i++)</div>
|
||
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (a[i] != b[i])</div>
|
||
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
||
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * operator overload to compare two numbers</span></div>
|
||
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94"> 168</a></span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code" href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">operator!=</a>(<a class="code" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &a, <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &b) {</div>
|
||
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> !(a == b);</div>
|
||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div>
|
||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> * operator overload to increment (prefix)</span></div>
|
||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9"> 175</a></span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9">operator++</a>() {</div>
|
||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  (*this) += 1;</div>
|
||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div>
|
||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * operator overload to increment (postfix)</span></div>
|
||
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706"> 183</a></span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706">operator++</a>(<span class="keywordtype">int</span>) {</div>
|
||
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">static</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> tmp(<a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>);</div>
|
||
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++(*this);</div>
|
||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> tmp;</div>
|
||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * operator overload to add</span></div>
|
||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e"> 192</a></span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">operator+=</a>(<a class="code" href="../../db/d82/classlarge__number.html">large_number</a> n) {</div>
|
||
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// if adding with another large_number</span></div>
|
||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> *b = <span class="keyword">reinterpret_cast<</span><a class="code" href="../../db/d82/classlarge__number.html">large_number</a> *<span class="keyword">></span>(&n);</div>
|
||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_L = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(this-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(), b-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>());</div>
|
||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> carry = 0;</div>
|
||
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">size_t</span> i;</div>
|
||
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">for</span> (i = 0; i < max_L || carry != 0; i++) {</div>
|
||
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">if</span> (i < b-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>())</div>
|
||
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  carry += (*b)[i];</div>
|
||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (i < this-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>())</div>
|
||
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  carry += (*this)[i];</div>
|
||
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (i < this-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>())</div>
|
||
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  (*this)[i] = carry % 10;</div>
|
||
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">else</span></div>
|
||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  this-><a class="code" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">add_digit</a>(carry % 10);</div>
|
||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  carry /= 10;</div>
|
||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div>
|
||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div>
|
||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">operator+=</a>(<span class="keywordtype">int</span> n) { <span class="keywordflow">return</span> (*<span class="keyword">this</span>) += <a class="code" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(n); }</div>
|
||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// large_number &operator+=(uint64_t n) { return (*this) += large_number(n);</span></div>
|
||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// }</span></div>
|
||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * operator overload to perform addition</span></div>
|
||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
||
<div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d"> 220</a></span>  <span class="keyword">friend</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d">operator+</a>(<span class="keyword">const</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &a, <span class="keyword">const</span> T &b) {</div>
|
||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">static</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> c = a;</div>
|
||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  c += b;</div>
|
||
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span> c;</div>
|
||
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
||
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> * assignment operator</span></div>
|
||
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb"> 229</a></span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb">operator=</a>(<span class="keyword">const</span> <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &b) {</div>
|
||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  this-><a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a> = b.<a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>;</div>
|
||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> * operator overload to increment</span></div>
|
||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
||
<div class="line"><a name="l00238"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b"> 238</a></span>  <a class="code" href="../../db/d82/classlarge__number.html">large_number</a> &<a class="code" href="../../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b">operator*=</a>(<span class="keyword">const</span> T n) {</div>
|
||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  static_assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral<T>::value</a>,</div>
|
||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="stringliteral">"Must be integer addition unsigned integer types."</span>);</div>
|
||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  this-><a class="code" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">multiply</a>(n);</div>
|
||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
||
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
||
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> * returns i^th digit as an ASCII character</span></div>
|
||
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac"> 248</a></span>  <span class="keywordtype">char</span> <a class="code" href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">digit_char</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const </span>{</div>
|
||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">return</span> <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[<a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>() - i - 1] + <span class="charliteral">'0'</span>;</div>
|
||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div>
|
||
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div>
|
||
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">private</span>:<span class="comment"></span></div>
|
||
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> /**</span></div>
|
||
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> * multiply large number with another integer and</span></div>
|
||
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> * store the result in the same large number</span></div>
|
||
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> **/</span></div>
|
||
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
||
<div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc"> 258</a></span>  <span class="keywordtype">void</span> <a class="code" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">multiply</a>(<span class="keyword">const</span> T n) {</div>
|
||
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  static_assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral<T>::value</a>,</div>
|
||
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="stringliteral">"Can only have integer types."</span>);</div>
|
||
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// assert(!(std::is_signed<T>::value)); //, "Implemented only for</span></div>
|
||
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// unsigned integer types.");</span></div>
|
||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div>
|
||
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordtype">size_t</span> i;</div>
|
||
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  uint64_t carry = 0, temp;</div>
|
||
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (i = 0; i < this-><a class="code" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(); i++) {</div>
|
||
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  temp = <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>((*this)[i]) * n;</div>
|
||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  temp += carry;</div>
|
||
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (temp < 10) {</div>
|
||
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  carry = 0;</div>
|
||
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  } <span class="keywordflow">else</span> {</div>
|
||
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  carry = temp / 10;</div>
|
||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  temp = temp % 10;</div>
|
||
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div>
|
||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  (*this)[i] = temp;</div>
|
||
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
||
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">while</span> (carry != 0) {</div>
|
||
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  this-><a class="code" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">add_digit</a>(carry % 10);</div>
|
||
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  carry /= 10;</div>
|
||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
||
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
||
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
||
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<unsigned char></a></div>
|
||
<div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57"> 285</a></span>  <a class="code" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>; <span class="comment">/**< where individual digits are stored */</span></div>
|
||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> };</div>
|
||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  </div>
|
||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="preprocessor">#endif // MATH_LARGE_NUMBER_H_</span></div>
|
||
</div><!-- fragment --></div><!-- contents -->
|
||
</div><!-- doc-content -->
|
||
<div class="ttc" id="amath_2armstrong__number_8cpp_html_aab733299b170fa5a752503f95f090fcd"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#aab733299b170fa5a752503f95f090fcd">number_of_digits</a></div><div class="ttdeci">int number_of_digits(int num)</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:21</div></div>
|
||
<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:28</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a60c436d1a1c5e3795d6177d3815ad615"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number::add_digit</a></div><div class="ttdeci">void add_digit(unsigned int value)</div><div class="ttdef"><b>Definition:</b> large_number.h:118</div></div>
|
||
<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:36</div></div>
|
||
<div class="ttc" id="ashowpoint_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/showpoint.html">std::showpoint</a></div><div class="ttdeci">T showpoint(T... args)</div></div>
|
||
<div class="ttc" id="aclassstack_html_a6cd4b95d5de00d41b2491392338384dc"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition:</b> stack.h:99</div></div>
|
||
<div class="ttc" id="amath_2armstrong__number_8cpp_html_a9cebd92bc70890c3cfa261d68a5016e7"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#a9cebd92bc70890c3cfa261d68a5016e7">is_armstrong</a></div><div class="ttdeci">bool is_armstrong(int number)</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:36</div></div>
|
||
<div class="ttc" id="astructtrie_html"><div class="ttname"><a href="../../d4/dd9/structtrie.html">trie</a></div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:8</div></div>
|
||
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
|
||
<div class="ttc" id="adouble__factorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:67</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a454891267187a5ec6c6e3f3ad5203ff1"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a454891267187a5ec6c6e3f3ad5203ff1">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector< std::vector< std::pair< int, int >>> *adj, int u, int v, int w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:48</div></div>
|
||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_of_n_numbers.cpp:28</div></div>
|
||
<div class="ttc" id="asetprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">std::setprecision</a></div><div class="ttdeci">T setprecision(T... args)</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a618dce14b4883c20aace1d743d3a3f60"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a618dce14b4883c20aace1d743d3a3f60">graph::breadth_first_search</a></div><div class="ttdeci">std::vector< bool > breadth_first_search(const std::vector< std::vector< int >> &graph, int start)</div><div class="ttdoc">Function performs the breadth first search algorithm over the graph.</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:95</div></div>
|
||
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
|
||
<div class="ttc" id="abitset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset.html">std::bitset< MAXN ></a></div></div>
|
||
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:37</div></div>
|
||
<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
|
||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a878952f2eb3d1fae79d58c994fc10ab1"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">geometry::jarvis::Convexhull::getConvexHull</a></div><div class="ttdeci">std::vector< Point > getConvexHull() const</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:78</div></div>
|
||
<div class="ttc" id="ashortest__common__supersequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:124</div></div>
|
||
<div class="ttc" id="aclass_graph_html_a6cb6fbec4ea7cfdfda368f2c468a757d"><div class="ttname"><a href="../../da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d">Graph::getAdjList</a></div><div class="ttdeci">std::remove_reference< AdjList >::type const & getAdjList() const</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:103</div></div>
|
||
<div class="ttc" id="aclass_cycle_check_html_a399292a33edf87499daa52b51315aca5"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a></div><div class="ttdeci">static bool isCyclicBFS(Graph const &graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:249</div></div>
|
||
<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
|
||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:151</div></div>
|
||
<div class="ttc" id="afibonacci_8cpp_html_ae7c261942e9479f06ac145c08dcb6cc7"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#ae7c261942e9479f06ac145c08dcb6cc7">fibonacci</a></div><div class="ttdeci">unsigned int fibonacci(unsigned int n)</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:17</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a69fe1f7c36fe004ba83eef2ca82e7e30"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:222</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a275227d01fbecdcf2f890b034fcea655"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a275227d01fbecdcf2f890b034fcea655">graph::is_graph_bipartite::Graph::nax</a></div><div class="ttdeci">static const int nax</div><div class="ttdoc">stores the side of the vertex</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:57</div></div>
|
||
<div class="ttc" id="aclass_graph_html_a8dcb5ce0b4a6f65827f5055d9d53a3f1"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph::getVertices</a></div><div class="ttdeci">unsigned int getVertices() const</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:110</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a9c652b2e467e5d250dfe3bed83b12560"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:212</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:58</div></div>
|
||
<div class="ttc" id="adomain_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="anamespaceshortest__common__supersequence_html"><div class="ttname"><a href="../../d3/deb/namespaceshortest__common__supersequence.html">shortest_common_supersequence</a></div><div class="ttdoc">Shortest Common Super Sequence algorithm.</div></div>
|
||
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aequal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a></div><div class="ttdeci">T equal(T... args)</div></div>
|
||
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="anamespaceis__graph__bipartite_html"><div class="ttname"><a href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a></div><div class="ttdoc">Functions for checking whether a graph is bipartite or not.</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_graph_html_a34414f67c2e3ea89774839b36b1575f8"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph::Graph</a></div><div class="ttdeci">Graph(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</div><div class="ttdoc">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:61</div></div>
|
||
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
|
||
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:118</div></div>
|
||
<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:17</div></div>
|
||
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a80825a4fd4c41860b689d253dd2c8e93"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor::LowestCommonAncestor</a></div><div class="ttdeci">LowestCommonAncestor(const RootedTree &tree_)</div><div class="ttdoc">Stores the tree and precomputs "up lifts".</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:151</div></div>
|
||
<div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
|
||
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:36</div></div>
|
||
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
|
||
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:15</div></div>
|
||
<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:20</div></div>
|
||
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
|
||
<div class="ttc" id="afibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:59</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:204</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a778428c4761b6ea5e7770743f0eab5ab"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab">large_number::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &out, const large_number &a)</div><div class="ttdef"><b>Definition:</b> large_number.h:146</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a76ddf1ed1b00fb8c107ea56f7f91e42f"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number::large_number</a></div><div class="ttdeci">large_number(std::vector< unsigned char > &vec)</div><div class="ttdef"><b>Definition:</b> large_number.h:51</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div>
|
||
<div class="ttc" id="aatan2_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html">std::atan2</a></div><div class="ttdeci">T atan2(T... args)</div></div>
|
||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_abe92d63a0ff9bda7e304df510d5dd217"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a></div><div class="ttdeci">void update_step(T *r, T *r0, const T2 quotient)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:24</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
|
||
<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:35</div></div>
|
||
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector< int > level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:105</div></div>
|
||
<div class="ttc" id="adouble__factorial_8cpp_html_a0a3c417360400093891a9ccddaa4be26"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a></div><div class="ttdeci">uint64_t double_factorial_iterative(uint64_t n)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:17</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:227</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a55aa5c6753cb8853152d469c375d946a"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">hash_chain::find</a></div><div class="ttdeci">bool find(int x, int h) const</div><div class="ttdoc">Find if a value and corresponding hash exist.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:101</div></div>
|
||
<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a0acbe32aaab897e7939e5b0454035b8c"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">machine_learning::adaline::adaline</a></div><div class="ttdeci">adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:55</div></div>
|
||
<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">Geometry algorithms.</div></div>
|
||
<div class="ttc" id="aclass_trie_html"><div class="ttname"><a href="../../dd/d2f/class_trie.html">Trie</a></div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:16</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a6a082dc1426a79f866cee6b370df37b0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:138</div></div>
|
||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/find.html">std::map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html">quadratic_probing</a></div><div class="ttdoc">An implementation of hash table using quadratic probing algorithm.</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:369</div></div>
|
||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a74e3c6c037b67895014414c5d75465e5"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline::fit</a></div><div class="ttdeci">double fit(const std::vector< double > &x, const int &y)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:119</div></div>
|
||
<div class="ttc" id="adouble__hash__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:250</div></div>
|
||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a8306e48040a8570e164c58d1c530f870"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">geometry::jarvis::Convexhull::Convexhull</a></div><div class="ttdeci">Convexhull(const std::vector< Point > &pointList)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:66</div></div>
|
||
<div class="ttc" id="aclass_complex_html_ae1e03712837450549e0c9b4017533a41"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">Complex::arg</a></div><div class="ttdeci">double arg() const</div><div class="ttdoc">Member function to give the argument of our complex number.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:87</div></div>
|
||
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
|
||
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_a287b92112b6b43b34808a93778873475"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">double_hashing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:37</div></div>
|
||
<div class="ttc" id="aclass_complex_html_aa9b4a7d6083ca7040ddd4fe93db5c19d"><div class="ttname"><a href="../../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex::operator*</a></div><div class="ttdeci">Complex operator*(const Complex &other)</div><div class="ttdoc">Operator overload of '*' on Complex class. Operator overload to be able to multiple two complex numbe...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:117</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition:</b> large_number.h:24</div></div>
|
||
<div class="ttc" id="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_large.cpp:24</div></div>
|
||
<div class="ttc" id="afibonacci__fast_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:51</div></div>
|
||
<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &str1, const std::string &str2)</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:42</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:582</div></div>
|
||
<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr< TrieNode > node)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:41</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:120</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a36739619a07b5478bcd8a28ad2f8b7da"><div class="ttname"><a href="../../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex::operator-</a></div><div class="ttdeci">Complex operator-(const Complex &other)</div><div class="ttdoc">Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbe...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:106</div></div>
|
||
<div class="ttc" id="aspirograph_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:268</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a466cd7b664cc6a864937ceb3dead1323"><div class="ttname"><a href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">Complex::Complex</a></div><div class="ttdeci">Complex(const Complex &other)</div><div class="ttdoc">Copy Constructor.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:58</div></div>
|
||
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a9fc2ded2807582edf398e6d7c7114914"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector< std::vector< int >> *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:77</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:43</div></div>
|
||
<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aclass_complex_html_ae5b51b749ea4964104b9527af9d8f556"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556">Complex::abs</a></div><div class="ttdeci">double abs() const</div><div class="ttdoc">Member function to give the modulus of our complex number. Member function to which gives the absolut...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:79</div></div>
|
||
<div class="ttc" id="alarge__factorial_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:89</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a9ab8c79ffb674a63f151f282faeb723b"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a9ab8c79ffb674a63f151f282faeb723b">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:359</div></div>
|
||
<div class="ttc" id="astruct_trie_1_1_trie_node_html"><div class="ttname"><a href="../../de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:26</div></div>
|
||
<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
|
||
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:14</div></div>
|
||
<div class="ttc" id="alarge__number_8h_html"><div class="ttname"><a href="../../d4/d86/large__number_8h.html">large_number.h</a></div><div class="ttdoc">Library to perform arithmatic operations on arbitrarily large numbers.</div></div>
|
||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:84</div></div>
|
||
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:201</div></div>
|
||
<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:42</div></div>
|
||
<div class="ttc" id="asearch_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/search.html">std::search</a></div><div class="ttdeci">T search(T... args)</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_adccc63a7e57cc6dba75bd62f40feb88b"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">quadratic_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:106</div></div>
|
||
<div class="ttc" id="ais__graph__bipartite_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:160</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a40d617ebf4d6ba21bcda8d8d1faa2357"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">quadratic_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:142</div></div>
|
||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:37</div></div>
|
||
<div class="ttc" id="agroup__machine__learning_html_ga72699c805c19a6cc47a937a6f3378afa"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector< std::valarray< double >> &X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:58</div></div>
|
||
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html">hash_chain</a></div><div class="ttdoc">Chain class with a given modulus.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:16</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:452</div></div>
|
||
<div class="ttc" id="ahill__cipher_8cpp_html_a04391124480d2a49f2dec900237b0712"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">test2</a></div><div class="ttdeci">void test2(const std::string &text)</div><div class="ttdoc">Self test 2 - using 8x8 randomly generated key.</div><div class="ttdef"><b>Definition:</b> hill_cipher.cpp:505</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_adbe6cd1fd148173ce6a01669925d2d72"><div class="ttname"><a href="../../df/dce/namespacegraph.html#adbe6cd1fd148173ce6a01669925d2d72">graph::add_directed_edge</a></div><div class="ttdeci">void add_directed_edge(std::vector< std::vector< int >> *graph, int u, int v)</div><div class="ttdoc">Adds a directed edge from vertex u to vertex v.</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:66</div></div>
|
||
<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
|
||
<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
|
||
<div class="ttc" id="aclass_graph_html_aa99d44d3179d5bbbfa84a5031cf80cb1"><div class="ttname"><a href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, std::vector< Edge > const &edges)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:88</div></div>
|
||
<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
|
||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:81</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a942fc8407b8001890ea26830cdcd9d77"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">linear_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:110</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ab11242d9ad5b03a75911e29b04f78fd3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline::predict</a></div><div class="ttdeci">int predict(const std::vector< double > &x, double *out=nullptr)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:95</div></div>
|
||
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:206</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:116</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">Machine learning algorithms.</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex & operator=(const Complex &other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:160</div></div>
|
||
<div class="ttc" id="astrerror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a></div><div class="ttdeci">T strerror(T... args)</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a5ceee4128d92ca4412040b7104d1299d"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing::find</a></div><div class="ttdeci">Entry find(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:131</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4921874435266592b222e3f2eda0e01f"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">is_square</a></div><div class="ttdeci">bool is_square(std::vector< std::vector< T >> const &A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:59</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a082f758fb55fe19f22b3df66f89b2325"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325">machine_learning::adaline::activation</a></div><div class="ttdeci">int activation(double x)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:186</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:46</div></div>
|
||
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:42</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_ac4010fe3a52a74e8b5b1aaadfe38b46f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:200</div></div>
|
||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition:</b> large_number.h:130</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:186</div></div>
|
||
<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.cpp:13</div></div>
|
||
<div class="ttc" id="aclass_solution_html"><div class="ttname"><a href="../../dd/d4f/class_solution.html">Solution</a></div><div class="ttdef"><b>Definition:</b> bridge_finding_with_tarjan_algorithm.cpp:11</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_abcf8d033f8115f39f3c93cfb6cee0b28"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">linear_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:173</div></div>
|
||
<div class="ttc" id="agroup__machine__learning_html_gab53c14440b2b2dd3172c66afc5c2f63f"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:105</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_ae8457d13620497fa2046ac566252c4b0"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain::head</a></div><div class="ttdeci">std::vector< std::shared_ptr< Node > > head</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition:</b> chaining.cpp:24</div></div>
|
||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||
<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ac8a9c2aaaa63b0f27ea176857e1e7d56"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">machine_learning::adaline::check_size_match</a></div><div class="ttdeci">bool check_size_match(const std::vector< double > &x)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:196</div></div>
|
||
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
|
||
<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
|
||
<div class="ttc" id="abreadth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:161</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:233</div></div>
|
||
<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a6b4b4de1a8c96f98a63a77f650a9dcff"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain::add</a></div><div class="ttdeci">void add(int x, int h)</div><div class="ttdoc">create and add a new node with a give value and at a given height</div><div class="ttdef"><b>Definition:</b> chaining.cpp:45</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a07a0467b24102260fbb6b554c453c20a"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">quadratic_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:194</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number & operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:55</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ab6171f4db68a5e50ae0f3500a63acd26"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab6171f4db68a5e50ae0f3500a63acd26">operator*</a></div><div class="ttdeci">std::vector< std::vector< T > > operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:78</div></div>
|
||
<div class="ttc" id="agroup__machine__learning_html_ga5118e5cbc4f0886e27b3a7a2544dded1"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a></div><div class="ttdeci">constexpr int MAX_ITER</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:40</div></div>
|
||
<div class="ttc" id="anamespacespirograph_html"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html">spirograph</a></div></div>
|
||
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
|
||
<div class="ttc" id="ais__graph__bipartite_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">namespace graph</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:129</div></div>
|
||
<div class="ttc" id="afast__power_8cpp_html_a8399b847626e5bba983cab7c7918b445"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a></div><div class="ttdeci">double fast_power_recursive(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:26</div></div>
|
||
<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
|
||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div>
|
||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">std::string::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||
<div class="ttc" id="adouble__factorial_8cpp_html_abbbcebf3a2d0c67f4c3cfb5511a97981"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">test</a></div><div class="ttdeci">void test(uint64_t n, uint64_t expected)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:42</div></div>
|
||
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:14</div></div>
|
||
<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:457</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:64</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a0b1efd203274e38a67b78937dfb9b872"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number::large_number</a></div><div class="ttdeci">large_number(const large_number &a)</div><div class="ttdef"><b>Definition:</b> large_number.h:48</div></div>
|
||
<div class="ttc" id="aclass_trie_html_afd8b79959009b554e98ea7128b2886f2"><div class="ttname"><a href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie::insert</a></div><div class="ttdeci">void insert(const std::string &word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:109</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98eb5807f21b783c341cab402ced6732"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732">operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:22</div></div>
|
||
<div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:212</div></div>
|
||
<div class="ttc" id="agraph_2dijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:113</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:537</div></div>
|
||
<div class="ttc" id="aavltree_8cpp_html_a1ecfaaea49d452772dbb2b28133e36e0"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:21</div></div>
|
||
<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:158</div></div>
|
||
<div class="ttc" id="afibonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:32</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector< int > parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:103</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a868530bfaed30e57290a76d5b4402d50"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50">graph::dijkstra</a></div><div class="ttdeci">int dijkstra(std::vector< std::vector< std::pair< int, int >>> *adj, int s, int t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:66</div></div>
|
||
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:170</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ab1af3e0f425cdf7ea2039c9dcfe22f0b"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b">large_number::operator*=</a></div><div class="ttdeci">large_number & operator*=(const T n)</div><div class="ttdef"><b>Definition:</b> large_number.h:238</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition:</b> large_number.h:27</div></div>
|
||
<div class="ttc" id="abinary__exponent_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:55</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_aacdeecac857623e9fbfe92590f3c504d"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree::RootedTree</a></div><div class="ttdeci">RootedTree(const std::vector< std::pair< int, int > > &undirected_edges, int root_)</div><div class="ttdoc">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:93</div></div>
|
||
<div class="ttc" id="astruct_min_heap_node_html"><div class="ttname"><a href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:7</div></div>
|
||
<div class="ttc" id="aline__segment__intersection_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:92</div></div>
|
||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:39</div></div>
|
||
<div class="ttc" id="aconnected__components_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:127</div></div>
|
||
<div class="ttc" id="aclass_complex_html_ac38437c10eb798f176c384a695171b90"><div class="ttname"><a href="../../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex::operator/</a></div><div class="ttdeci">Complex operator/(const Complex &other)</div><div class="ttdoc">Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:142</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a622d84883180ff42f04955909adea5a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9">large_number::operator++</a></div><div class="ttdeci">large_number & operator++()</div><div class="ttdef"><b>Definition:</b> large_number.h:175</div></div>
|
||
<div class="ttc" id="aadaline__learning_8cpp_html_a52053d88ea1bcbbed9aca67ab4eeb499"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a></div><div class="ttdeci">void test1(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:224</div></div>
|
||
<div class="ttc" id="aavltree_8cpp_html_aa7cd8a68075fae1c33df41233c1bed6a"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:66</div></div>
|
||
<div class="ttc" id="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::printf</a></div><div class="ttdeci">T printf(T... args)</div></div>
|
||
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ae35a55607cf52c0b0d485f2129bd39ac"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number::digit_char</a></div><div class="ttdeci">char digit_char(size_t i) const</div><div class="ttdef"><b>Definition:</b> large_number.h:248</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ace19126cf343a09efc0010735f6e3a8d"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d">large_number::operator[]</a></div><div class="ttdeci">unsigned char & operator[](size_t n)</div><div class="ttdef"><b>Definition:</b> large_number.h:137</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition:</b> chaining.cpp:27</div></div>
|
||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
|
||
<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:63</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:207</div></div>
|
||
<div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
|
||
<div class="ttc" id="aeulers__totient__function_8cpp_html_a35e4874a3e1d67eb708dc57944c8aea0"><div class="ttname"><a href="../../da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0">phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdef"><b>Definition:</b> eulers_totient_function.cpp:32</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_graph_html_aee72d7dd4778097a6d852c659de8fe58"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector< std::vector< int > > neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:78</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a70dea3a7ae9738067e6b84abc192e429"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a70dea3a7ae9738067e6b84abc192e429">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector< std::vector< int > > adj</div><div class="ttdoc">size of the graph</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:53</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:47</div></div>
|
||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
|
||
<div class="ttc" id="aclass_edge_html_a415a5d002fe11c58711e48aabe975980"><div class="ttname"><a href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge::Edge</a></div><div class="ttdeci">Edge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:40</div></div>
|
||
<div class="ttc" id="aclass_trie_html_a6af57e9f25d0d0a2d59eea5a4a802908"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908">Trie::Trie</a></div><div class="ttdeci">Trie()</div><div class="ttdoc">constructor to initialise the root of the trie.</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:103</div></div>
|
||
<div class="ttc" id="astructmst_html"><div class="ttname"><a href="../../d1/d77/structmst.html">mst</a></div><div class="ttdef"><b>Definition:</b> prims_minimum_spanning_tree.cpp:9</div></div>
|
||
<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
|
||
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aclass_graph_html_ac85c63bcca4764a621f9f8609a8e5910"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">Graph::addEdge</a></div><div class="ttdeci">void addEdge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:136</div></div>
|
||
<div class="ttc" id="amath_2armstrong__number_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:59</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a00ebcc6d39653eccc26f8432efbfc8d9"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">quadratic_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:182</div></div>
|
||
<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">std::ofstream::close</a></div><div class="ttdeci">T close(T... args)</div></div>
|
||
<div class="ttc" id="afactorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> factorial.cpp:15</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a2f5571e66305cf68bb8283e4aeda58bc"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">large_number::multiply</a></div><div class="ttdeci">void multiply(const T n)</div><div class="ttdef"><b>Definition:</b> large_number.h:258</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a8d5427f6c42c15283031d73e1418c59d"><div class="ttname"><a href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex::operator~</a></div><div class="ttdeci">Complex operator~() const</div><div class="ttdoc">Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the co...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:130</div></div>
|
||
<div class="ttc" id="achaining_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> chaining.cpp:133</div></div>
|
||
<div class="ttc" id="acomplex__numbers_8cpp_html_af738b2a6921f0a6868bb7c5b4c0d18e0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#af738b2a6921f0a6868bb7c5b4c0d18e0">operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &os, const Complex &num)</div><div class="ttdoc">Operator overload of '<<' of ostream for Complex class. Overloaded insersion operator to accommodate ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:186</div></div>
|
||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:103</div></div>
|
||
<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/erase.html">std::set::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector< double > weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:209</div></div>
|
||
<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="astruct_segment_intersection_html"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:22</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:423</div></div>
|
||
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:31</div></div>
|
||
<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4bcaaf41c66da4d3a471dacef133def7"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4bcaaf41c66da4d3a471dacef133def7">predict_OLS_regressor</a></div><div class="ttdeci">std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:352</div></div>
|
||
<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_aeb22d2aae39d1b1e0bd39c7f47b333eb"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb">large_number::operator=</a></div><div class="ttdeci">large_number & operator=(const large_number &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:229</div></div>
|
||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:87</div></div>
|
||
<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html">std::ifstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a8d61f9ed872eef26bca39388cbda6a91"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91">machine_learning::adaline::fit</a></div><div class="ttdeci">void fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:145</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a372ff051a7bc6c91d34a7b58edf8dfce"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector< std::vector< int >> *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:46</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_ab3081e021270ba21a9fd88646f6a6e26"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#ab3081e021270ba21a9fd88646f6a6e26">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:411</div></div>
|
||
<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:30</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_ada6f1f44f7e83b0094fbcbe170788486"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">quadratic_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:160</div></div>
|
||
<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:451</div></div>
|
||
<div class="ttc" id="astruct_segment_intersection_html_a008941b2272866c64cdaf959afa939bf"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">SegmentIntersection::on_segment</a></div><div class="ttdeci">bool on_segment(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:75</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9b0c6400693a5cfff971f768dd5ca5ca"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca">graph::is_graph_bipartite::Graph::is_bipartite</a></div><div class="ttdeci">bool is_bipartite()</div><div class="ttdoc">function to add edges to our graph</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:98</div></div>
|
||
<div class="ttc" id="acomplex__numbers_8cpp_html_a5a73e9d4e68af8cedb95bd0864054b89"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a></div><div class="ttdeci">bool operator==(const Complex &a, const Complex &b)</div><div class="ttdoc">Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:175</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:161</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector< unsigned char > _digits</div><div class="ttdef"><b>Definition:</b> large_number.h:285</div></div>
|
||
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div>
|
||
<div class="ttc" id="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:315</div></div>
|
||
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map< unsigned int, std::vector< unsigned int > ></a></div></div>
|
||
<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
|
||
<div class="ttc" id="acheck__prime_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:45</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a846a2f921f8fb7ea572e03901b671d64"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash_chain::hash</a></div><div class="ttdeci">virtual int hash(int x) const</div><div class="ttdoc">Compute the hash of a value for current chain.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:91</div></div>
|
||
<div class="ttc" id="alarge__factorial_8cpp_html_a76aae4778fbe89a3d59fd61fbc050cfa"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a></div><div class="ttdeci">bool test2()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:54</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a312143ed316d48978084c025ff8d9768"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:207</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:143</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:199</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a59b4441a0e447469e9a4f61c87f33102"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a59b4441a0e447469e9a4f61c87f33102">graph::add_undirected_edge</a></div><div class="ttdeci">void add_undirected_edge(std::vector< std::vector< int >> *graph, int u, int v)</div><div class="ttdoc">Adds an undirected edge from vertex u to vertex v. Essentially adds too directed edges to the adjacen...</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:81</div></div>
|
||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:176</div></div>
|
||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:142</div></div>
|
||
<div class="ttc" id="aclass_graph_html_a8c95e00effaea0cd9404dd74cd802ae3"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList &&adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:76</div></div>
|
||
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
|
||
<div class="ttc" id="anamespacejarvis_html"><div class="ttname"><a href="../../d5/da7/namespacejarvis.html">jarvis</a></div><div class="ttdoc">Functions for Jarvis’s algorithm.</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9d10768f927baa8a4d4a5ffce295b6b6"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph::side</a></div><div class="ttdeci">std::vector< int > side</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:55</div></div>
|
||
<div class="ttc" id="agroup__machine__learning_html_ga6c606bc85a3e9fd9d010f874ad760336"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:65</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></div><div class="ttdoc">An implementation of hash table using linear probing algorithm.</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a412b7afa156306b1f8788643c91a1c60"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:277</div></div>
|
||
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
|
||
<div class="ttc" id="atrie__modern_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:160</div></div>
|
||
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
||
<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
|
||
<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.cpp:7</div></div>
|
||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:38</div></div>
|
||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ac656a51b4c3bd7d63b7dcc75dc3e5576"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:21</div></div>
|
||
<div class="ttc" id="aclassstack_html_a21c0bb6ce7dcfe445cc12031977ea344"><div class="ttname"><a href="../../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344">stack::top</a></div><div class="ttdeci">Type top()</div><div class="ttdef"><b>Definition:</b> stack.h:93</div></div>
|
||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div>
|
||
<div class="ttc" id="abreadth__first__search_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:121</div></div>
|
||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0ceb473236b5dc53a85e281ef528dd96"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0ceb473236b5dc53a85e281ef528dd96">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:30</div></div>
|
||
<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:93</div></div>
|
||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a16d34fd3511626a83ab00665d7bc34d1"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:161</div></div>
|
||
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
|
||
<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:70</div></div>
|
||
<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
|
||
<div class="ttc" id="anamespacespirograph_html_a8e83a64e8443fff1e5ffdc1c299c1e99"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:93</div></div>
|
||
<div class="ttc" id="aremove_reference_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/remove_reference.html">std::remove_reference</a></div></div>
|
||
<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> queue.h:17</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a959c5c1a982949bbf98e1ea0f9afe6a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">large_number::test</a></div><div class="ttdeci">static bool test()</div><div class="ttdef"><b>Definition:</b> large_number.h:65</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a38ff1d954e9b7de93eb20e2dd101a045"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a38ff1d954e9b7de93eb20e2dd101a045">fit_OLS_regressor</a></div><div class="ttdeci">std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:321</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a31be3fe36e76b87d5616ff8e7918cd24"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a31be3fe36e76b87d5616ff8e7918cd24">operator-</a></div><div class="ttdeci">std::vector< T > operator-(std::vector< T > const &A, std::vector< T > const &B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:183</div></div>
|
||
<div class="ttc" id="alower_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/lower_bound.html">std::set::lower_bound</a></div><div class="ttdeci">T lower_bound(T... args)</div></div>
|
||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||
<div class="ttc" id="amath_2armstrong__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:77</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98ab8f75d981088369b89b8be2182483"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98ab8f75d981088369b89b8be2182483">get_inverse</a></div><div class="ttdeci">std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:226</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</div></div>
|
||
<div class="ttc" id="acomplex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:268</div></div>
|
||
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr< struct Node > next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &a, large_number const &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:155</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a1d821a24e1503d468c95d4acedca58b3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3">machine_learning::adaline::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &out, const adaline &ada)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:76</div></div>
|
||
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
|
||
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_a1d577f5d95b774ae97eb6838852d0df5"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a1d577f5d95b774ae97eb6838852d0df5">machine_learning::save_u_matrix</a></div><div class="ttdeci">int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:142</div></div>
|
||
<div class="ttc" id="afactorial_8cpp_html_ae9945c15826a9c1b5c141db314b7f8b4"><div class="ttname"><a href="../../d9/d00/factorial_8cpp.html#ae9945c15826a9c1b5c141db314b7f8b4">factorial</a></div><div class="ttdeci">unsigned int factorial(unsigned int n)</div><div class="ttdef"><b>Definition:</b> factorial.cpp:8</div></div>
|
||
<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
|
||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||
<div class="ttc" id="adouble__factorial_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:50</div></div>
|
||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/insert.html">std::set::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_a7220dbb7fa896d83bfb7a50e4fce1786"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">machine_learning::MIN_DISTANCE</a></div><div class="ttdeci">constexpr double MIN_DISTANCE</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:129</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:201</div></div>
|
||
<div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:73</div></div>
|
||
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:28</div></div>
|
||
<div class="ttc" id="async_with_stdio_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html">std::ios_base::sync_with_stdio</a></div><div class="ttdeci">T sync_with_stdio(T... args)</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a477bf401cab737bb313f687b08fff082"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a477bf401cab737bb313f687b08fff082">graph::is_graph_bipartite::Graph::Graph</a></div><div class="ttdeci">Graph(int size=nax)</div><div class="ttdoc">Constructor that initializes the graph on creation.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:64</div></div>
|
||
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
|
||
<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:234</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:577</div></div>
|
||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a25034543c20f271da04fb24ad2b2747a"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a">gcd</a></div><div class="ttdeci">int gcd(int *a, int n)</div><div class="ttdef"><b>Definition:</b> gcd_of_n_numbers.cpp:15</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a79a9c914a6c68275b3640303d7faad8a"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:185</div></div>
|
||
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:71</div></div>
|
||
<div class="ttc" id="alowest__common__ancestor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:256</div></div>
|
||
<div class="ttc" id="afast__power_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:68</div></div>
|
||
<div class="ttc" id="adouble__factorial_8cpp_html_a68ba20fed2ce427f6469c7689437829d"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a></div><div class="ttdeci">uint64_t double_factorial_recursive(uint64_t n)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:30</div></div>
|
||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph algorithms.</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a80c8b902a15b4fd062ed727ecf8f3595"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain::hash_chain</a></div><div class="ttdeci">hash_chain(int mod)</div><div class="ttdoc">Construct a new chain object.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:35</div></div>
|
||
<div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div>
|
||
<div class="ttc" id="aptrdiff_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a></div></div>
|
||
<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:132</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:52</div></div>
|
||
<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a8e9885e0dd49fcf8262a9868124deac9"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">graph::explore</a></div><div class="ttdeci">void explore(const std::vector< std::vector< int >> *adj, int u, std::vector< bool > *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:59</div></div>
|
||
<div class="ttc" id="astruct_item_html"><div class="ttname"><a href="../../db/d66/struct_item.html">Item</a></div><div class="ttdef"><b>Definition:</b> knapsack.cpp:4</div></div>
|
||
<div class="ttc" id="alinear__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:224</div></div>
|
||
<div class="ttc" id="astrtoul_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">std::strtoull</a></div><div class="ttdeci">T strtoull(T... args)</div></div>
|
||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||
<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
|
||
<div class="ttc" id="aclassstack_html_a67f65710c376f67d1ba3bde45a9cb628"><div class="ttname"><a href="../../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> stack.h:29</div></div>
|
||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:70</div></div>
|
||
<div class="ttc" id="astructgeometry_1_1jarvis_1_1_point_html"><div class="ttname"><a href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:47</div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:414</div></div>
|
||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:56</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:369</div></div>
|
||
<div class="ttc" id="aclassstack_html_a066e4505155b009913c47b2648b1067a"><div class="ttname"><a href="../../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack()</div><div class="ttdef"><b>Definition:</b> stack.h:80</div></div>
|
||
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="astr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">std::stringstream::str</a></div><div class="ttdeci">T str(T... args)</div></div>
|
||
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_af4598f1f2794b5e17e10c25e0501e41a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number::large_number</a></div><div class="ttdeci">large_number(int n)</div><div class="ttdef"><b>Definition:</b> large_number.h:39</div></div>
|
||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
|
||
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:46</div></div>
|
||
<div class="ttc" id="amalloc_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">std::malloc</a></div><div class="ttdeci">T malloc(T... args)</div></div>
|
||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/end.html">std::set::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:56</div></div>
|
||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:20</div></div>
|
||
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:38</div></div>
|
||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &p, const Point &q, const Point &r)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:133</div></div>
|
||
<div class="ttc" id="aclass_complex_html_a820afcbb330df716577459d7a3aa3a1c"><div class="ttname"><a href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex::operator+</a></div><div class="ttdeci">Complex operator+(const Complex &other)</div><div class="ttdoc">Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:95</div></div>
|
||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:41</div></div>
|
||
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:208</div></div>
|
||
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:47</div></div>
|
||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||
<div class="ttc" id="agraph_2dijkstra_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:152</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6b5e744876fd980a3451cbb385d4e755"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:330</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:107</div></div>
|
||
<div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a72ae1ef050c4c28c50952ecab22d4b94"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">large_number::operator!=</a></div><div class="ttdeci">friend bool operator!=(large_number const &a, large_number const &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:168</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></div><div class="ttdoc">Class for representing graph as an adjacency list.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:49</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_adc731720947b4bc2ab047c141e7d0299"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#adc731720947b4bc2ab047c141e7d0299">machine_learning::kohonen_som</a></div><div class="ttdeci">void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:269</div></div>
|
||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:26</div></div>
|
||
<div class="ttc" id="aclass_trie_html_a95216ffc56cb9f8cede982cecb872af4"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4">Trie::removeWordHelper</a></div><div class="ttdeci">std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:64</div></div>
|
||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a0e7435446ed7c763f7de79a468add2e0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a0e7435446ed7c763f7de79a468add2e0">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:493</div></div>
|
||
<div class="ttc" id="anamespacequadratic__probing_html_aeb6bca8db4768226f8ea8291ea4f83f6"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">quadratic_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:119</div></div>
|
||
<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:29</div></div>
|
||
<div class="ttc" id="anamespacelinear__probing_html_ad87b71d810901fab69c4ad9d4d0fa635"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:120</div></div>
|
||
<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:53</div></div>
|
||
<div class="ttc" id="aclass_graph_html_af765dda8f21280e1cecea19e129f1bc5"><div class="ttname"><a href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph::addEdge</a></div><div class="ttdeci">void addEdge(Edge const &edge)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:124</div></div>
|
||
<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:50</div></div>
|
||
<div class="ttc" id="anamespacespirograph_html_aeca22dbe4563358960e907a40cd3e1ac"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph::spirograph</a></div><div class="ttdeci">void spirograph(std::array< std::pair< double, double >, N > *points, double l, double k, double rot)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:70</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a60151e19512b48cc0b14ea121df00488"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor::lowest_common_ancestor</a></div><div class="ttdeci">int lowest_common_ancestor(int u, int v) const</div><div class="ttdoc">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:164</div></div>
|
||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_ad2032148b2443f5b6a0d01e4519d6898"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector< std::vector< int > > up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:206</div></div>
|
||
<div class="ttc" id="aclasshash__chain_html_a706964ad13587fc9a8b3fe8381d410ed"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">Display the chain.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:63</div></div>
|
||
<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:164</div></div>
|
||
<div class="ttc" id="aclass_graph_html_ae30edce9b4e7c6347e67edc343f366d8"><div class="ttname"><a href="../../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList const &adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_ac4fafa6289295419d48d444f0ae4b706"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706">large_number::operator++</a></div><div class="ttdeci">large_number & operator++(int)</div><div class="ttdef"><b>Definition:</b> large_number.h:183</div></div>
|
||
<div class="ttc" id="anamespacesorting_html_a50b66a1c652291b9a346ec7342967178"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a50b66a1c652291b9a346ec7342967178">sorting::quickSort</a></div><div class="ttdeci">void quickSort(int arr[], int low, int high)</div><div class="ttdef"><b>Definition:</b> quick_sort.cpp:63</div></div>
|
||
<div class="ttc" id="aadaline__learning_8cpp_html_a379f7488a305f2571f2932b319931f82"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">test2</a></div><div class="ttdeci">void test2(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:262</div></div>
|
||
<div class="ttc" id="apartition_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/partition.html">std::partition</a></div><div class="ttdeci">T partition(T... args)</div></div>
|
||
<div class="ttc" id="aadaline__learning_8cpp_html_a992bdf1fdb0b9d414bcf7981d2d87aa9"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a></div><div class="ttdeci">void test3(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:313</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a></div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:46</div></div>
|
||
<div class="ttc" id="aeulers__totient__function_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> eulers_totient_function.cpp:48</div></div>
|
||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:122</div></div>
|
||
<div class="ttc" id="aclasslarge__number_html_a70d23d67535e67030db570e56c00e16d"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d">large_number::operator+</a></div><div class="ttdeci">friend large_number & operator+(const large_number &a, const T &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:220</div></div>
|
||
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
|
||
<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
|
||
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a30acf52af3184bc22274234ef5a73536"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536">operator/</a></div><div class="ttdeci">std::vector< float > operator/(std::vector< T > const &A, float const scalar)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:174</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_acc6a28f40512dbda75ab1a3969248898"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:149</div></div>
|
||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:48</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ad8c10df34357b2cd865c81e0c4f0bd8c"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c">graph::is_graph_bipartite::Graph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">Function that add an edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:81</div></div>
|
||
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
|
||
<div class="ttc" id="aclassstack_html_a5cc5efbbd4ea14b3e378580f1388423b"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> stack.h:112</div></div>
|
||
<div class="ttc" id="aadaline__learning_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:357</div></div>
|
||
<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> list_array.cpp:8</div></div>
|
||
<div class="ttc" id="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
|
||
<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
|
||
<div class="ttc" id="akohonen__som__trace_8cpp_html_ab47fb569e63648bd76e7edfdacc02dbd"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd">test_circle</a></div><div class="ttdeci">void test_circle(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:196</div></div>
|
||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:68</div></div>
|
||
<div class="ttc" id="aquadratic__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:246</div></div>
|
||
<div class="ttc" id="astack_8h_html"><div class="ttname"><a href="../../d7/de0/stack_8h.html">stack.h</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div>
|
||
<div class="ttc" id="agraph__coloring_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
|
||
<div class="ttc" id="abasic_ifstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a></div><div class="ttdoc">STL class.</div></div>
|
||
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
|
||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d86/large__number_8h.html">large_number.h</a></li>
|
||
<li class="footer">Generated by
|
||
<a href="http://www.doxygen.org/index.html">
|
||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|