mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
1063 lines
250 KiB
HTML
1063 lines
250 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.20"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>Algorithms_in_C++: machine_learning/vector_ops.hpp 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.20 -->
|
||
<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('d8/d95/vector__ops_8hpp_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">vector_ops.hpp</div> </div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<a href="../../d8/d95/vector__ops_8hpp.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 vector_ops.hpp</span></div>
|
||
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * @author [Deep Raval](https://github.com/imdeep2905)</span></div>
|
||
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
|
||
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * @brief Various functions for vectors associated with [NeuralNetwork (aka</span></div>
|
||
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Multilayer Perceptron)]</span></div>
|
||
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * (https://en.wikipedia.org/wiki/Multilayer_perceptron).</span></div>
|
||
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> *</span></div>
|
||
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#ifndef VECTOR_OPS_FOR_NN</span></div>
|
||
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#define VECTOR_OPS_FOR_NN</span></div>
|
||
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  </div>
|
||
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <algorithm></span></div>
|
||
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <chrono></span></div>
|
||
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <iostream></span></div>
|
||
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <random></span></div>
|
||
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <valarray></span></div>
|
||
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div>
|
||
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * @namespace machine_learning</span></div>
|
||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * @brief Machine Learning algorithms</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"> 24</span> <span class="keyword">namespace </span><a class="code" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {<span class="comment"></span></div>
|
||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * Overloaded operator "<<" to print 2D vector</span></div>
|
||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * @param out std::ostream to output</span></div>
|
||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * @param A 2D vector to be printed</span></div>
|
||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a8e8b54aaa62ad7f906aec0756ca3a500"> 32</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &<a class="code" href="../../d8/d77/namespacemachine__learning.html#a8e8b54aaa62ad7f906aec0756ca3a500">operator<<</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &out,</div>
|
||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> <span class="keyword">const</span> &A) {</div>
|
||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
|
||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  out.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
|
||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &a : A) { <span class="comment">// For each row in A</span></div>
|
||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &x : a) { <span class="comment">// For each element in row</span></div>
|
||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << x << <span class="charliteral">' '</span>; <span class="comment">// print element</span></div>
|
||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div>
|
||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <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="l00041"></a><span class="lineno"> 41</span>  }</div>
|
||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">return</span> out;</div>
|
||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> }</div>
|
||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * Overloaded operator "<<" to print a pair</span></div>
|
||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @tparam T typename of the pair</span></div>
|
||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * @param out std::ostream to output</span></div>
|
||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * @param A Pair to be printed</span></div>
|
||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a2a282c162e12f193c58232f26f0fa62d"> 52</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &<a class="code" href="../../d8/d77/namespacemachine__learning.html#a8e8b54aaa62ad7f906aec0756ca3a500">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="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<T, T></a> &A) {</div>
|
||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
|
||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  out.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
|
||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// printing pair in the form (p, q)</span></div>
|
||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"("</span> << A.first << <span class="stringliteral">", "</span> << A.second << <span class="stringliteral">")"</span>;</div>
|
||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> out;</div>
|
||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</div>
|
||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * Overloaded operator "<<" to print a 1D vector</span></div>
|
||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * @param out std::ostream to output</span></div>
|
||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * @param A 1D vector to be printed</span></div>
|
||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ad0302cde64c0479379be18286962f6df"> 67</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &<a class="code" href="../../d8/d77/namespacemachine__learning.html#a8e8b54aaa62ad7f906aec0756ca3a500">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="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> &A) {</div>
|
||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
|
||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  out.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
|
||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &a : A) { <span class="comment">// For every element in the vector.</span></div>
|
||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << a << <span class="charliteral">' '</span>; <span class="comment">// Print element</span></div>
|
||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div>
|
||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <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="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> out;</div>
|
||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> }</div>
|
||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * Function to insert element into 1D vector</span></div>
|
||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * @tparam T typename of the 1D vector and the element</span></div>
|
||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * @param A 1D vector in which element will to be inserted</span></div>
|
||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * @param ele element to be inserted</span></div>
|
||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c"> 85</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c">insert_element</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> &A, <span class="keyword">const</span> T &ele) {</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/numeric/valarray.html">std::valarray<T></a> B; <span class="comment">// New 1D vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  B.resize(A.size() + 1); <span class="comment">// Resizing it accordingly</span></div>
|
||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size(); i++) { <span class="comment">// For every element in A</span></div>
|
||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  B[i] = A[i]; <span class="comment">// Copy element in B</span></div>
|
||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div>
|
||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  B[B.size() - 1] = ele; <span class="comment">// Inserting new element in last position</span></div>
|
||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return resultant vector</span></div>
|
||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> }</div>
|
||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * Function to remove first element from 1D vector</span></div>
|
||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * @param A 1D vector from which first element will be removed</span></div>
|
||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc"> 102</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> <a class="code" href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">pop_front</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> &A) {</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/numeric/valarray.html">std::valarray<T></a> B; <span class="comment">// New 1D vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  B.resize(A.size() - 1); <span class="comment">// Resizing it accordingly</span></div>
|
||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i < A.size();</div>
|
||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  i++) { <span class="comment">// // For every (except first) element in A</span></div>
|
||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  B[i - 1] = A[i]; <span class="comment">// Copy element in B with left shifted position</span></div>
|
||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
|
||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return resultant vector</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> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * Function to remove last element from 1D vector</span></div>
|
||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * @param A 1D vector from which last element will be removed</span></div>
|
||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * @return new resultant vector</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"> 118</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a4dd9a9df9f8f05327bcf7b58b0a86576"> 119</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a4dd9a9df9f8f05327bcf7b58b0a86576">pop_back</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> &A) {</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/numeric/valarray.html">std::valarray<T></a> B; <span class="comment">// New 1D vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  B.resize(A.size() - 1); <span class="comment">// Resizing it accordingly</span></div>
|
||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size() - 1;</div>
|
||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  i++) { <span class="comment">// For every (except last) element in A</span></div>
|
||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  B[i] = A[i]; <span class="comment">// Copy element in B</span></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="keywordflow">return</span> B; <span class="comment">// Return resultant vector</span></div>
|
||
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div>
|
||
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"></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"> 130</span> <span class="comment"> * Function to equally shuffle two 3D vectors (used for shuffling training data)</span></div>
|
||
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> * @param A First 3D vector</span></div>
|
||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> * @param B Second 3D vector</span></div>
|
||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a62a418f243cd52b49f59015dddff188e"> 136</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a62a418f243cd52b49f59015dddff188e">equal_shuffle</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>>> &A,</div>
|
||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>>> &B) {</div>
|
||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// If two vectors have different sizes</span></div>
|
||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (A.size() != B.size()) {</div>
|
||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
|
||
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  << <span class="stringliteral">"Can not equally shuffle two vectors with different sizes: "</span>;</div>
|
||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << A.size() << <span class="stringliteral">" and "</span> << B.size() << <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="l00144"></a><span class="lineno"> 144</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
||
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size(); i++) { <span class="comment">// For every element in A and B</span></div>
|
||
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Genrating random index < size of A and B</span></div>
|
||
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
|
||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">size_t</span> random_index = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % A.size();</div>
|
||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// Swap elements in both A and B with same random index</span></div>
|
||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(A[i], A[random_index]);</div>
|
||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(B[i], B[random_index]);</div>
|
||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div>
|
||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">return</span>;</div>
|
||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> }</div>
|
||
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * Function to initialize given 2D vector using uniform random initialization</span></div>
|
||
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @param A 2D vector to be initialized</span></div>
|
||
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * @param shape required shape</span></div>
|
||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * @param low lower limit on value</span></div>
|
||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * @param high upper limit on value</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="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a73ee7ed3546ab9e8792a92336d0d14ab"> 166</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a73ee7ed3546ab9e8792a92336d0d14ab">uniform_random_initialization</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<size_t, size_t></a> &shape,</div>
|
||
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">const</span> T &low, <span class="keyword">const</span> T &high) {</div>
|
||
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  A.clear(); <span class="comment">// Making A empty</span></div>
|
||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Uniform distribution in range [low, high]</span></div>
|
||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a> generator(</div>
|
||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
|
||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution<T></a> distribution(low, high);</div>
|
||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape.first; i++) { <span class="comment">// For every row</span></div>
|
||
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a></div>
|
||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  row; <span class="comment">// Making empty row which will be inserted in vector</span></div>
|
||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  row.resize(shape.second);</div>
|
||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &r : row) { <span class="comment">// For every element in row</span></div>
|
||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  r = distribution(generator); <span class="comment">// copy random number</span></div>
|
||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
|
||
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  A.push_back(row); <span class="comment">// Insert new row in vector</span></div>
|
||
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
||
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span>;</div>
|
||
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> }</div>
|
||
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * Function to Intialize 2D vector as unit matrix</span></div>
|
||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * @param A 2D vector to be initialized</span></div>
|
||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * @param shape required shape</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"> 192</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#abf136b863d804899647f46eeb2e1392b"> 193</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#abf136b863d804899647f46eeb2e1392b">unit_matrix_initialization</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<size_t, size_t></a> &shape) {</div>
|
||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  A.clear(); <span class="comment">// Making A empty</span></div>
|
||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape.first; i++) {</div>
|
||
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a></div>
|
||
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  row; <span class="comment">// Making empty row which will be inserted in vector</span></div>
|
||
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  row.resize(shape.second);</div>
|
||
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  row[i] = T(1); <span class="comment">// Insert 1 at ith position</span></div>
|
||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  A.push_back(row); <span class="comment">// Insert new row in vector</span></div>
|
||
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
||
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span>;</div>
|
||
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div>
|
||
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * Function to Intialize 2D vector as zeroes</span></div>
|
||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * @param A 2D vector to be initialized</span></div>
|
||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * @param shape required shape</span></div>
|
||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a4d136cbf20e3126ed9b934ab2d03f18b"> 213</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a4d136cbf20e3126ed9b934ab2d03f18b">zeroes_initialization</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<size_t, size_t></a> &shape) {</div>
|
||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  A.clear(); <span class="comment">// Making A empty</span></div>
|
||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape.first; i++) {</div>
|
||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a></div>
|
||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  row; <span class="comment">// Making empty row which will be inserted in vector</span></div>
|
||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  row.resize(shape.second); <span class="comment">// By default all elements are zero</span></div>
|
||
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  A.push_back(row); <span class="comment">// Insert new row in vector</span></div>
|
||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div>
|
||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">return</span>;</div>
|
||
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> }</div>
|
||
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"></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"> * Function to get sum of all elements in 2D vector</span></div>
|
||
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * @param A 2D vector for which sum is required</span></div>
|
||
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> * @return returns sum of all elements of 2D vector</span></div>
|
||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00232"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44"> 232</a></span> T <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A) {</div>
|
||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  T cur_sum = 0; <span class="comment">// Initially sum is zero</span></div>
|
||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &a : A) { <span class="comment">// For every row in A</span></div>
|
||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  cur_sum += a.sum(); <span class="comment">// Add sum of that row to current sum</span></div>
|
||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div>
|
||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span> cur_sum; <span class="comment">// Return sum</span></div>
|
||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> }</div>
|
||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> * Function to get shape of given 2D vector</span></div>
|
||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> * @param A 2D vector for which shape is required</span></div>
|
||
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> * @return shape as pair</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="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd"> 247</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<size_t, size_t></a> <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A) {</div>
|
||
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> sub_size = (*A.begin()).size();</div>
|
||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &a : A) {</div>
|
||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// If supplied vector don't have same shape in all rows</span></div>
|
||
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (a.size() != sub_size) {</div>
|
||
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Supplied vector is not 2D Matrix"</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="l00254"></a><span class="lineno"> 254</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
||
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div>
|
||
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(A.size(), sub_size); <span class="comment">// Return shape as pair</span></div>
|
||
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> }</div>
|
||
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * Function to scale given 3D vector using min-max scaler</span></div>
|
||
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> * @param A 3D vector which will be scaled</span></div>
|
||
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> * @param low new minimum value</span></div>
|
||
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * @param high new maximum value</span></div>
|
||
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> * @return new scaled 3D vector</span></div>
|
||
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d"> 269</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::valarray<T></a>>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d">minmax_scaler</a>(</div>
|
||
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>>> &A, <span class="keyword">const</span> T &low,</div>
|
||
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> T &high) {</div>
|
||
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::valarray<T></a>>> B =</div>
|
||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  A; <span class="comment">// Copying into new vector B</span></div>
|
||
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(B[0]); <span class="comment">// Storing shape of B's every element</span></div>
|
||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// As this function is used for scaling training data vector should be of</span></div>
|
||
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// shape (1, X)</span></div>
|
||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (shape.first != 1) {</div>
|
||
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
|
||
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  << <span class="stringliteral">"Supplied vector is not supported for minmax scaling, shape: "</span>;</div>
|
||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << shape << <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="l00282"></a><span class="lineno"> 282</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape.second; i++) {</div>
|
||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  T min = B[0][0][i], max = B[0][0][i];</div>
|
||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < B.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
|
||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Updating minimum and maximum values</span></div>
|
||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  min = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min, B[j][0][i]);</div>
|
||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  max = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max, B[j][0][i]);</div>
|
||
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
||
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < B.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
|
||
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// Applying min-max scaler formula</span></div>
|
||
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  B[j][0][i] =</div>
|
||
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  ((B[j][0][i] - min) / (max - min)) * (high - low) + low;</div>
|
||
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
||
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
||
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return new resultant 3D vector</span></div>
|
||
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> }</div>
|
||
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> * Function to get index of maximum element in 2D vector</span></div>
|
||
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> * @param A 2D vector for which maximum index is required</span></div>
|
||
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> * @return index of maximum element</span></div>
|
||
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a1b42d24ad7bedbfa8e5b59fe96987a44"> 307</a></span> <span class="keywordtype">size_t</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a1b42d24ad7bedbfa8e5b59fe96987a44">argmax</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A) {</div>
|
||
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A);</div>
|
||
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// As this function is used on predicted (or target) vector, shape should be</span></div>
|
||
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// (1, X)</span></div>
|
||
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (shape.first != 1) {</div>
|
||
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Supplied vector is ineligible for argmax"</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="l00314"></a><span class="lineno"> 314</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
||
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// Return distance of max element from first element (i.e. index)</span></div>
|
||
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]),</div>
|
||
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]), <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(A[0])));</div>
|
||
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> }</div>
|
||
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> * Function which applys supplied function to every element of 2D vector</span></div>
|
||
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"> * @param A 2D vector on which function will be applied</span></div>
|
||
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> * @param func Function to be applied</span></div>
|
||
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a8b3b06a63bd16b91237c85a295309774"> 329</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a8b3b06a63bd16b91237c85a295309774">apply_function</a>(</div>
|
||
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A, T (*func)(<span class="keyword">const</span> T &)) {</div>
|
||
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<double></a>> B =</div>
|
||
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  A; <span class="comment">// New vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &b : B) { <span class="comment">// For every row in vector</span></div>
|
||
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  b = b.apply(func); <span class="comment">// Apply function to that row</span></div>
|
||
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div>
|
||
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> }</div>
|
||
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> * Overloaded operator "*" to multiply given 2D vector with scaler</span></div>
|
||
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> * @tparam T typename of both vector and the scaler</span></div>
|
||
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> * @param A 2D vector to which scaler will be multiplied</span></div>
|
||
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> * @param val Scaler value which will be multiplied</span></div>
|
||
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ab58fb68da2cfc5326d3da0cba6f58118"> 347</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#ab58fb68da2cfc5326d3da0cba6f58118">operator*</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> T &val) {</div>
|
||
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<double></a>> B =</div>
|
||
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  A; <span class="comment">// New vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &b : B) { <span class="comment">// For every row in vector</span></div>
|
||
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  b = b * val; <span class="comment">// Multiply row with scaler</span></div>
|
||
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div>
|
||
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> }</div>
|
||
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"> * Overloaded operator "/" to divide given 2D vector with scaler</span></div>
|
||
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> * @tparam T typename of the vector and the scaler</span></div>
|
||
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> * @param A 2D vector to which scaler will be divided</span></div>
|
||
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> * @param val Scaler value which will be divided</span></div>
|
||
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d"> 365</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">operator/</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">const</span> T &val) {</div>
|
||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<double></a>> B =</div>
|
||
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  A; <span class="comment">// New vector to store resultant vector</span></div>
|
||
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &b : B) { <span class="comment">// For every row in vector</span></div>
|
||
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  b = b / val; <span class="comment">// Divide row with scaler</span></div>
|
||
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div>
|
||
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> }</div>
|
||
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> * Function to get transpose of 2D vector</span></div>
|
||
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> * @param A 2D vector which will be transposed</span></div>
|
||
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00382"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac7d9b358f1ef2ba2a1d475a5452ec41f"> 382</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#ac7d9b358f1ef2ba2a1d475a5452ec41f">transpose</a>(</div>
|
||
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A) {</div>
|
||
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A); <span class="comment">// Current shape of vector</span></div>
|
||
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> B; <span class="comment">// New vector to store result</span></div>
|
||
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// Storing transpose values of A in B</span></div>
|
||
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < shape.second; j++) {</div>
|
||
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> row;</div>
|
||
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  row.resize(shape.first);</div>
|
||
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape.first; i++) {</div>
|
||
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  row[i] = A[i][j];</div>
|
||
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div>
|
||
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  B.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
|
||
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div>
|
||
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">return</span> B; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> }</div>
|
||
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * Overloaded operator "+" to add two 2D vectors</span></div>
|
||
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> * @param A First 2D vector</span></div>
|
||
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> * @param B Second 2D vector</span></div>
|
||
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a9225f0ded976096b45ffe13c75d33c05"> 406</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a9225f0ded976096b45ffe13c75d33c05">operator+</a>(</div>
|
||
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &B) {</div>
|
||
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A);</div>
|
||
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(B);</div>
|
||
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="comment">// If vectors don't have equal shape</span></div>
|
||
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
|
||
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Supplied vectors have different shapes "</span>;</div>
|
||
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << shape_a << <span class="stringliteral">" and "</span> << shape_b << <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="l00416"></a><span class="lineno"> 416</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
|
||
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> C;</div>
|
||
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size(); i++) { <span class="comment">// For every row</span></div>
|
||
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  C.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] + B[i]); <span class="comment">// Elementwise addition</span></div>
|
||
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  }</div>
|
||
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">return</span> C; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> }</div>
|
||
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> * Overloaded operator "-" to add subtract 2D vectors</span></div>
|
||
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * @param A First 2D vector</span></div>
|
||
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * @param B Second 2D vector</span></div>
|
||
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00433"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a5f42063207181529413d812ade52f58e"> 433</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5f42063207181529413d812ade52f58e">operator-</a>(</div>
|
||
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &B) {</div>
|
||
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A);</div>
|
||
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(B);</div>
|
||
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// If vectors don't have equal shape</span></div>
|
||
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
|
||
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Supplied vectors have different shapes "</span>;</div>
|
||
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << shape_a << <span class="stringliteral">" and "</span> << shape_b << <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="l00443"></a><span class="lineno"> 443</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div>
|
||
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> C; <span class="comment">// Vector to store result</span></div>
|
||
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size(); i++) { <span class="comment">// For every row</span></div>
|
||
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  C.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] - B[i]); <span class="comment">// Elementwise substraction</span></div>
|
||
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div>
|
||
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">return</span> C; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> }</div>
|
||
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> * Function to multiply two 2D vectors</span></div>
|
||
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> * @param A First 2D vector</span></div>
|
||
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> * @param B Second 2D vector</span></div>
|
||
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00460"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a7491744dcfc8844338d55065d0cd0c79"> 460</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a7491744dcfc8844338d55065d0cd0c79">multiply</a>(<span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &B) {</div>
|
||
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A);</div>
|
||
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(B);</div>
|
||
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// If vectors are not eligible for multiplication</span></div>
|
||
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (shape_a.second != shape_b.first) {</div>
|
||
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Vectors are not eligible for multiplication "</span>;</div>
|
||
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << shape_a << <span class="stringliteral">" and "</span> << shape_b << <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="l00469"></a><span class="lineno"> 469</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div>
|
||
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> C; <span class="comment">// Vector to store result</span></div>
|
||
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="comment">// Normal matrix multiplication</span></div>
|
||
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < shape_a.first; i++) {</div>
|
||
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a> row;</div>
|
||
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  row.resize(shape_b.second);</div>
|
||
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < shape_b.second; j++) {</div>
|
||
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; k < shape_a.second; k++) {</div>
|
||
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  row[j] += A[i][k] * B[k][j];</div>
|
||
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  }</div>
|
||
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div>
|
||
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  C.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
|
||
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
||
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span> C; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> }</div>
|
||
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment"></span> </div>
|
||
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment">/**</span></div>
|
||
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment"> * Function to get hadamard product of two 2D vectors</span></div>
|
||
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment"> * @tparam T typename of the vector</span></div>
|
||
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment"> * @param A First 2D vector</span></div>
|
||
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"> * @param B Second 2D vector</span></div>
|
||
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> * @return new resultant vector</span></div>
|
||
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> */</span></div>
|
||
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
||
<div class="line"><a name="l00494"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75"> 494</a></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75">hadamard_product</a>(</div>
|
||
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &A,</div>
|
||
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">const</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray<T></a>> &B) {</div>
|
||
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(A);</div>
|
||
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code" href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">get_shape</a>(B);</div>
|
||
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">// If vectors are not eligible for hadamard product</span></div>
|
||
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
|
||
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"ERROR ("</span> << __func__ << <span class="stringliteral">") : "</span>;</div>
|
||
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << <span class="stringliteral">"Vectors have different shapes "</span>;</div>
|
||
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << shape_a << <span class="stringliteral">" and "</span> << shape_b << <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="l00504"></a><span class="lineno"> 504</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
|
||
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div>
|
||
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::valarray<T></a>> C; <span class="comment">// Vector to store result</span></div>
|
||
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < A.size(); i++) {</div>
|
||
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  C.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] * B[i]); <span class="comment">// Elementwise multiplication</span></div>
|
||
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div>
|
||
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">return</span> C; <span class="comment">// Return new resultant 2D vector</span></div>
|
||
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> }</div>
|
||
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span> } <span class="comment">// namespace machine_learning</span></div>
|
||
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  </div>
|
||
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="preprocessor">#endif</span></div>
|
||
</div><!-- fragment --></div><!-- contents -->
|
||
</div><!-- doc-content -->
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a6aef65b40347c4606662cad4dd2e14d3"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">graph::is_graph_bipartite::Graph::Graph</a></div><div class="ttdeci">Graph(int size)</div><div class="ttdoc">Constructor that initializes the graph on creation.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:65</div></div>
|
||
<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="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="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="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="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_a73ee7ed3546ab9e8792a92336d0d14ab"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a73ee7ed3546ab9e8792a92336d0d14ab">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape, const T &low, const T &high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:166</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="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="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_ac9cda9453c4a0caf5bae7f9213b019a0"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0">machine_learning::neural_network::layers::DenseLayer::~DenseLayer</a></div><div class="ttdeci">~DenseLayer()=default</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="anamespacemachine__learning_html_a8b3b06a63bd16b91237c85a295309774"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8b3b06a63bd16b91237c85a295309774">machine_learning::apply_function</a></div><div class="ttdeci">std::vector< std::valarray< T > > apply_function(const std::vector< std::valarray< T >> &A, T(*func)(const T &))</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:329</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="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="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="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="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a8809e6df990f37c85c06474dd955cb2b"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a8809e6df990f37c85c06474dd955cb2b">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer & operator=(const DenseLayer &layer)=default</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:62</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="anamespacemachine__learning_html_a4dd9a9df9f8f05327bcf7b58b0a86576"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4dd9a9df9f8f05327bcf7b58b0a86576">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray< T > pop_back(const std::valarray< T > &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:119</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="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="anamespacemachine__learning_html_a62a418f243cd52b49f59015dddff188e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a62a418f243cd52b49f59015dddff188e">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:136</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="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:68</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="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="anamespacemachine__learning_html_a2055c2f3a076b3d4146aade5eb35666d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">machine_learning::operator/</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator/(const std::vector< std::valarray< T >> &A, const T &val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:365</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="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:69</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="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray< T > pop_front(const std::valarray< T > &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8973f687738ddd76f93b5562feae4027"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork::~NeuralNetwork</a></div><div class="ttdeci">~NeuralNetwork()=default</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:106</div></div>
|
||
<div class="ttc" id="ajumpgame_8cpp_html_af205390325e8c999bd68b93fa5252755"><div class="ttname"><a href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755">canJump</a></div><div class="ttdeci">bool canJump(const std::vector< int > &nums)</div><div class="ttdoc">This function implements the above algorithm.</div><div class="ttdef"><b>Definition:</b> jumpgame.cpp:26</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="aclassdata__structures_1_1trie_html_a87d8bf99aea936f9381141753f1e90a8"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">data_structures::trie::trie</a></div><div class="ttdeci">trie()=default</div><div class="ttdoc">Class default constructor.</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8f984bfd3e32b9b71c33a4f62335c710"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8f984bfd3e32b9b71c33a4f62335c710">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const std::vector< std::pair< int, std::string >> &config)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:313</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="aclassdata__structures_1_1trie_html_a0ab94bc6417e3f59fab33cea5b64d546"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie::insert</a></div><div class="ttdeci">void insert(const std::string &str)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:77</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="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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a58ed20abf6ce3744535bd8b5bb9e741b"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b">machine_learning::neural_network::NeuralNetwork::load_model</a></div><div class="ttdeci">NeuralNetwork load_model(const std::string &file_name)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:732</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="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_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">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:68</div></div>
|
||
<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3b49011c09cf90a116ab53bef61cd95a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">function to add edge from u to v</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:242</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="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="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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a955088afdb35d1ea38ac41feb21a77b4"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a955088afdb35d1ea38ac41feb21a77b4">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork & operator=(const NeuralNetwork &model)=default</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="aneural__network_8cpp_html_aa69e95a34054d7989bf446f96b2ffaf9"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9">machine_learning::neural_network::activations::drelu</a></div><div class="ttdeci">double drelu(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:81</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="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="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:168</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4c4ff6b340d0e460d3015ad601a568b6"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4ff6b340d0e460d3015ad601a568b6">machine_learning::neural_network::NeuralNetwork::batch_predict</a></div><div class="ttdeci">std::vector< std::vector< std::valarray< double > > > batch_predict(const std::vector< std::vector< std::valarray< double >>> &X)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:464</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="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="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:117</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="anamespacemachine__learning_html_a5f42063207181529413d812ade52f58e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5f42063207181529413d812ade52f58e">machine_learning::operator-</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator-(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:433</div></div>
|
||
<div class="ttc" id="akadane2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:60</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_ac7d9b358f1ef2ba2a1d475a5452ec41f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac7d9b358f1ef2ba2a1d475a5452ec41f">machine_learning::transpose</a></div><div class="ttdeci">std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:382</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="anamespacekadane_html"><div class="ttname"><a href="../../d6/d74/namespacekadane.html">kadane</a></div><div class="ttdoc">Functions for Kadane algorithm.</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="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="anamespacesorting_html_aedfb88e2d6fff1871f038221fe5870fe"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aedfb88e2d6fff1871f038221fe5870fe">sorting::shuffle</a></div><div class="ttdeci">std::array< T, N > shuffle(std::array< T, N > arr)</div><div class="ttdef"><b>Definition:</b> bogo_sort.cpp:36</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a173bb71780af6953ec2e307a4c74b025"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(NeuralNetwork &&)=default</div></div>
|
||
<div class="ttc" id="aclassdata__structures_1_1trie_html"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a></div><div class="ttdoc">Trie implementation for small-case English alphabets a-z</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:25</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="anamespacemachine__learning_html_a8e8b54aaa62ad7f906aec0756ca3a500"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8e8b54aaa62ad7f906aec0756ca3a500">machine_learning::operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &out, std::vector< std::valarray< T >> const &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:32</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a6385ad4d8186b8a74b17e4a8dc41da11"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6385ad4d8186b8a74b17e4a8dc41da11">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer & operator=(DenseLayer &&)=default</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_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:134</div></div>
|
||
<div class="ttc" id="akadane2_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array< int, N > &n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:42</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a36494e26ff36d6e15c1022bb9a1ee848"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</a></div><div class="ttdeci">void evaluate_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:638</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:174</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="auniform_real_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution</a></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="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="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:136</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_a1b42d24ad7bedbfa8e5b59fe96987a44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a1b42d24ad7bedbfa8e5b59fe96987a44">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:307</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="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="aneural__network_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:805</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="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:30</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="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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a0ee425af6fd83a033c021128b8253f52"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a0ee425af6fd83a033c021128b8253f52">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector< std::vector< std::valarray< double >>> &X, const std::vector< std::vector< std::valarray< double >>> &Y)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:606</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_abf136b863d804899647f46eeb2e1392b"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abf136b863d804899647f46eeb2e1392b">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:193</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a46d10f669791e3da9a4809bd8ff8d3ad"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">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="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:104</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="anamespacegraph_html_a8c7d0cbc90b3b921d02da35d58b63153"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a8c7d0cbc90b3b921d02da35d58b63153">graph::add_undirected_edge</a></div><div class="ttdeci">void add_undirected_edge(adjacency_list *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:92</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="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="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="anamespaceneural__network_html"><div class="ttname"><a href="../../d0/d2e/namespaceneural__network.html">neural_network</a></div><div class="ttdoc">Neural Network or Multilayer Perceptron.</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector< std::vector< size_t >> &adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</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="adepth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:109</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8f8eb4423c57a00b0ab46de226bc6509"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8f8eb4423c57a00b0ab46de226bc6509">machine_learning::neural_network::NeuralNetwork::fit</a></div><div class="ttdeci">void fit(const std::vector< std::vector< std::valarray< double >>> &X_, const std::vector< std::vector< std::valarray< double >>> &Y_, const int &epochs=100, const double &learning_rate=0.01, const size_t &batch_size=32, const bool &shuffle=true)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:485</div></div>
|
||
<div class="ttc" id="ac_str_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">std::string::c_str</a></div><div class="ttdeci">T c_str(T... args)</div></div>
|
||
<div class="ttc" id="anamespaceactivations_html"><div class="ttname"><a href="../../d5/d39/namespaceactivations.html">activations</a></div><div class="ttdoc">Various activation functions used in Neural network.</div></div>
|
||
<div class="ttc" id="aneural__network_8cpp_html_a23aa9d32bcbcd65cfc85f0a41e2afadc"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc">machine_learning::neural_network::activations::sigmoid</a></div><div class="ttdeci">double sigmoid(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:60</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/priority_queue/top.html">std::priority_queue::top</a></div><div class="ttdeci">T top(T... args)</div></div>
|
||
<div class="ttc" id="aneural__network_8cpp_html_af8f264600754602b6a9ea19cc690e50e"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e">machine_learning::neural_network::activations::relu</a></div><div class="ttdeci">double relu(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:74</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="anamespacemachine__learning_html_a725d4ccceda4f32c96348ba1d593cd3c"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray< T > insert_element(const std::valarray< T > &A, const T &ele)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:85</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="ajumpgame_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> jumpgame.cpp:65</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_acd397b51fcf8f690b03e406ada8c9d13"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#acd397b51fcf8f690b03e406ada8c9d13">machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</a></div><div class="ttdeci">std::vector< std::vector< std::valarray< double > > > __detailed_single_prediction(const std::vector< std::valarray< double >> &X)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:289</div></div>
|
||
<div class="ttc" id="aneural__network_8cpp_html_a45d3e30406712ada3d9713ece3c1b153"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">machine_learning::neural_network::util_functions::square</a></div><div class="ttdeci">double square(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:106</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="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< double ></a></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="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="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="anamespacegraph_html_a0e0d3bf6c8a63f8071395c53a3cd148d"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a0e0d3bf6c8a63f8071395c53a3cd148d">graph::breadth_first_search</a></div><div class="ttdeci">std::vector< bool > breadth_first_search(const adjacency_list &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:107</div></div>
|
||
<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">Data Structures algorithms.</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:106</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a11046825be0b6dbb73fbe834aa49200e"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &neurons, const std::string &activation, const std::pair< size_t, size_t > &kernel_shape, const bool &random_kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:141</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="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="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="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="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:27</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ab0efcfa04fff8616aff0062522d1483f"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector< std::vector< int > > adj</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:56</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="acut__rod_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:100</div></div>
|
||
<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:38</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a5172a6791b9bd24f4232bab8d6b81fff"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork::fit_from_csv</a></div><div class="ttdeci">void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:587</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_ae7cf126a3a8f9d20c81b21584d061a08"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork()=default</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_graph_html_afe3c12683248e50a7a1688b40156a842"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#afe3c12683248e50a7a1688b40156a842">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:77</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a></div><div class="ttdef"><b>Definition:</b> neural_network.cpp:247</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">stores the side of the vertex</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:58</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a176b955c90ae57d7dbc3c63f27c84c75"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const NeuralNetwork &model)=default</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="ajumpgame_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> jumpgame.cpp:41</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="anamespacemachine__learning_html_a05b9445c6ab65053b9bf9897a96af82d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector< std::vector< std::valarray< T > > > minmax_scaler(const std::vector< std::vector< std::valarray< T >>> &A, const T &low, const T &high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:269</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="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="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:133</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="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:134</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="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a6c859e3737aa88b29854df0347b29f4e"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(DenseLayer &&)=default</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a61d30113d13304c664057118b92a5931"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">machine_learning::neural_network::NeuralNetwork::summary</a></div><div class="ttdeci">void summary()</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:773</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="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array< std::shared_ptr< trie >, NUM_CHARS<< 1 > arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:29</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="atrie__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:205</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="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="astof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stod</a></div><div class="ttdeci">T stod(T... args)</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="aclassdata__structures_1_1trie_html_a961eb5d576d2420f2036009154397c63"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">data_structures::trie::search</a></div><div class="ttdeci">bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:56</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8d983ebb3225a9901b713a0f05b44aba"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8d983ebb3225a9901b713a0f05b44aba">machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</a></div><div class="ttdeci">std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:382</div></div>
|
||
<div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:306</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="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="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_1neural__network_1_1layers_1_1_dense_layer_html_a35ab6f1b2840f89a858ca36b78739b69"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &neurons, const std::string &activation, const std::vector< std::valarray< double >> &kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:183</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="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_ac130322a5abb1ff763b7c1a55405a35e"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ac130322a5abb1ff763b7c1a55405a35e">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector< std::valarray< double > > single_predict(const std::vector< std::valarray< double >> &X)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:451</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="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="anamespacemachine__learning_html_abe6b58ec16abe0f6f8ac195e04aa8abd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">machine_learning::get_shape</a></div><div class="ttdeci">std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:247</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="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector< std::list< int > > adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:73</div></div>
|
||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/insert.html">std::vector::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_af02b0c83911070ac6d95fc9905e58aa9"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">graph::HKGraph::HKGraph</a></div><div class="ttdeci">HKGraph()</div><div class="ttdoc">Default Constructor for initialization.</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_afa4a080c9526909ea87a6c0f6cfd6a2f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#afa4a080c9526909ea87a6c0f6cfd6a2f">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork & operator=(NeuralNetwork &&)=default</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4f14e473bb0722c6490b9dc8da5982aa"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">machine_learning::neural_network::NeuralNetwork::save_model</a></div><div class="ttdeci">void save_model(const std::string &_file_name)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:652</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:74</div></div>
|
||
<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:255</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="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="aneural__network_8cpp_html_a76eb66212d577f948a457b6e29d87c46"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46">machine_learning::neural_network::activations::dsigmoid</a></div><div class="ttdeci">double dsigmoid(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:67</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="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:255</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="avector__ops_8hpp_html"><div class="ttname"><a href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a></div><div class="ttdoc">Various functions for vectors associated with NeuralNetwork (aka Multilayer Perceptron).</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:53</div></div>
|
||
<div class="ttc" id="aneural__network_8cpp_html_a32c00da08f2cf641dd336270f6e3c407"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407">machine_learning::neural_network::util_functions::identity_function</a></div><div class="ttdeci">double identity_function(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:112</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="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="aclassdata__structures_1_1trie_html_a499f87fd833203ef9492b4870aa6d42d"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d">data_structures::trie::search</a></div><div class="ttdeci">bool search(const std::string &str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:107</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="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="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector< int > dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:77</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="anamespacelayers_html"><div class="ttname"><a href="../../d5/d2c/namespacelayers.html">layers</a></div><div class="ttdoc">This namespace contains layers used in MLP.</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="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a2871146feaaa453558239df67b21e0d2"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const DenseLayer &layer)=default</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_ab58fb68da2cfc5326d3da0cba6f58118"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ab58fb68da2cfc5326d3da0cba6f58118">machine_learning::operator*</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator*(const std::vector< std::valarray< T >> &A, const T &val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:347</div></div>
|
||
<div class="ttc" id="aneural__network_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:830</div></div>
|
||
<div class="ttc" id="atrie__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Testing function.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:178</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="anamespacecut__rod_html"><div class="ttname"><a href="../../d8/d36/namespacecut__rod.html">cut_rod</a></div><div class="ttdoc">Implementation of cutting a rod problem.</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="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="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:67</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="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector< int > pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:76</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="anamespacemachine__learning_html_a9225f0ded976096b45ffe13c75d33c05"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a9225f0ded976096b45ffe13c75d33c05">machine_learning::operator+</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator+(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:406</div></div>
|
||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">machine_learning::neural_network::layers::DenseLayer</a></div><div class="ttdef"><b>Definition:</b> neural_network.cpp:125</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:108</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="anamespacemachine__learning_html_a6ef38e5947aef609f908bfbfeaf11d75"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:494</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:51</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a9dbda80d02bdc26c3e8ff7330c9be75d"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">graph::HKGraph::hopcroftKarpAlgorithm</a></div><div class="ttdeci">int hopcroftKarpAlgorithm()</div><div class="ttdoc">This function counts the number of augmenting paths between left and right sides of the Bipartite gra...</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:95</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="anamespacemachine__learning_html_a7491744dcfc8844338d55065d0cd0c79"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7491744dcfc8844338d55065d0cd0c79">machine_learning::multiply</a></div><div class="ttdeci">std::vector< std::valarray< T > > multiply(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:460</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="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="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="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector< int > pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:75</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="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="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="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="anamespacemachine__learning_html_a4d136cbf20e3126ed9b934ab2d03f18b"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4d136cbf20e3126ed9b934ab2d03f18b">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector< std::valarray< T >> &A, const std::pair< size_t, size_t > &shape)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:213</div></div>
|
||
<div class="ttc" id="anamespacegraph_html_a1a13974bfe597e853bffe91aa2d3944d"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a1a13974bfe597e853bffe91aa2d3944d">graph::add_directed_edge</a></div><div class="ttdeci">void add_directed_edge(adjacency_list *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:77</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="anamespaceutil__functions_html"><div class="ttname"><a href="../../d3/d17/namespaceutil__functions.html">util_functions</a></div><div class="ttdoc">Various utility functions used in Neural network.</div></div>
|
||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:191</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:83</div></div>
|
||
<div class="ttc" id="aeof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html">std::ifstream::eof</a></div><div class="ttdeci">T eof(T... args)</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="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_aefea7ee87a708298c486d5a38ac628ef"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph::n</a></div><div class="ttdeci">int n</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="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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a215d132aa38b9c9aab6716663a751b82"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a215d132aa38b9c9aab6716663a751b82">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const std::vector< std::pair< int, std::string >> &config, const std::vector< std::vector< std::valarray< double >>> &kernels)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:256</div></div>
|
||
<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(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="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="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:71</div></div>
|
||
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</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="acut__rod_8cpp_html_ae550b90e6057a7f976c9d643f706c4f5"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae550b90e6057a7f976c9d643f706c4f5">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array< int, T > &price, const int n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:44</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>
|
||
<div class="ttc" id="aneural__network_8cpp_html_a2a5e874b9774aa5362dbcf288828b95c"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c">machine_learning::neural_network::activations::dtanh</a></div><div class="ttdeci">double dtanh(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:95</div></div>
|
||
<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a></div><div class="ttdeci">T now(T... args)</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_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a></li>
|
||
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|