backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 10:33:10 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 96ed582eb2

Browse Source
This commit is contained in:
github-actions
2020-06-23 02:50:36 +00:00
parent a8c4504639
commit 17b3bf5a14
408 changed files with 4390 additions and 3805 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d4/d68/qr__decompose_8h.html
View File

@@ -158,7 +158,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></li>
<li class="footer">Generated on Tue Jun 23 2020 02:47:45 for Algorithms_in_C++ by
<li class="footer">Generated on Tue Jun 23 2020 02:49:48 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

9
d4/d68/qr__decompose_8h_source.html
View File

@@ -319,6 +319,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="afalse__position_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition:</b> false_position.cpp:24</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a7e7a1a2b0a03df0a70cac40d193421d2"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2">statistics::stats_computer2::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer2 &amp;stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:97</div></div>
<div class="ttc" id="anewton__raphson__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:21</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:17</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:188</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="agroup__ode_html_ga827bf009831ddc477c5fa8891d5cb35f"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.cpp:82</div></div>
@@ -344,6 +345,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:59</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_af50a5c87d27cfd3462745b37fb9b0f46"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">print</a></div><div class="ttdeci">void print(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:40</div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a3bada3e58ad8d1b00918db2ffe83a740"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:76</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:123</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:35</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="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
@@ -358,6 +360,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:56</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a></div><div class="ttdoc">Functions to compute QR decomposition of any rectangular matrix.</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&lt; std::vector&lt; T &gt; &gt; operator*(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:72</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:78</div></div>
<div class="ttc" id="aprime__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:26</div></div>
<div class="ttc" id="agroup__ode_html_gaa197c6b7085ac9ea71abc4c063e6f52f"><div class="ttname"><a href="../../d6/d60/group__ode.html#gaa197c6b7085ac9ea71abc4c063e6f52f">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:86</div></div>
<div class="ttc" id="amersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
@@ -374,6 +377,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a02fd73d861ef2e4aabb38c0c9ff82947"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947">init</a></div><div class="ttdeci">void init()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:52</div></div>
<div class="ttc" id="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a></div><div class="ttdeci">T snprintf(T... args)</div></div>
<div class="ttc" id="arandom_device_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a></div></div>
<div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html_a5422c76bfa322620de611083bd518d71"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a5422c76bfa322620de611083bd518d71">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:104</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="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>
@@ -442,7 +446,9 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="asum__of__digits_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:68</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="aclassstatistics_1_1stats__computer1_html"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a></div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:27</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find maxima for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:100</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_acf2e84df4fc386bb3295016ef8fd156e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:92</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:139</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a0560e21edb54d5ad8d80b2d80348ce22"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a></div><div class="ttdeci">bool isprime[MAX]</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:19</div></div>
<div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:40</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html_ab1ac74497ffb2101040cc1efe3546de8"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#ab1ac74497ffb2101040cc1efe3546de8">qr_algorithm::qr_decompose</a></div><div class="ttdeci">void qr_decompose(const std::valarray&lt; std::valarray&lt; T &gt;&gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt;&gt; *Q, std::valarray&lt; std::valarray&lt; T &gt;&gt; *R)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:146</div></div>
@@ -464,6 +470,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="astring__fibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:81</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:34</div></div>
<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:26</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the minima of a function in the given interval. To get the maxima, simply negate the function....</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:29</div></div>
<div class="ttc" id="astring__fibonacci_8cpp_html_ad8055ee368a5d5b24de01bdde6bf8fca"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a></div><div class="ttdeci">void fib_Accurate(uint64_t n)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:68</div></div>
<div class="ttc" id="aprimes__up__to__billion_8cpp_html_a031cada84819ed6426f58e4f7e81261c"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">Sieve</a></div><div class="ttdeci">void Sieve(int64_t n)</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:13</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>
@@ -489,7 +496,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></li>
<li class="footer">Generated on Tue Jun 23 2020 02:47:45 for Algorithms_in_C++ by
<li class="footer">Generated on Tue Jun 23 2020 02:49:48 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>