backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-27 00:41:51 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0e9585d080

Browse Source
This commit is contained in:
github-actions
2020-07-08 16:33:27 +00:00
parent f1abbec8bd
commit d970449a19
3 changed files with 68 additions and 68 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
d4/d86/large__number_8h_source.html
View File

@@ -454,7 +454,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:14</div></div>
<div class="ttc" id="alarge__number_8h_html"><div class="ttname"><a href="../../d4/d86/large__number_8h.html">large_number.h</a></div><div class="ttdoc">Library to perform arithmatic operations on arbitrarily large numbers.</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:200</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:201</div></div>
<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:42</div></div>
<div class="ttc" id="aclassgraph_html_a6398e513b9574e029fbee07c6ac6e028"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a6398e513b9574e029fbee07c6ac6e028">graph::explore</a></div><div class="ttdeci">void explore(int, vector&lt; bool &gt; &amp;)</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:101</div></div>
<div class="ttc" id="asearch_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/search.html">std::search</a></div><div class="ttdeci">T search(T... args)</div></div>
@@ -467,7 +467,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<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&lt; Edge &gt; const &amp;edges)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:90</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="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&lt; double &gt; &amp;x, double *out=nullptr)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:92</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:205</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:206</div></div>
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">Machine learning algorithms.</div></div>
<div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex &amp; operator=(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:160</div></div>
<div class="ttc" id="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&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:57</div></div>
@@ -595,7 +595,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<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&lt; std::vector&lt; float &gt; &gt; get_inverse(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:220</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:267</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:268</div></div>
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
<div class="ttc" id="aclassgraph_html_a45045da3d080cb81472ce6d5cc02b911"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a45045da3d080cb81472ce6d5cc02b911">graph::adj</a></div><div class="ttdeci">vector&lt; vector&lt; int &gt; &gt; adj</div><div class="ttdoc">adj stores adjacency list representation of graph</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:40</div></div>
<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &amp;a, large_number const &amp;b)</div><div class="ttdef"><b>Definition:</b> large_number.h:155</div></div>