mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-30 05:22:46 +08:00
Documentation for a48d05fb62
This commit is contained in:
github-actions
@@ -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 Sun Jun 21 2020 16:00:18 for Algorithms_in_C++ by
|
||||
<li class="footer">Generated on Sun Jun 21 2020 17:42:19 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>
|
||||
|
||||
@@ -321,7 +321,9 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<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:22</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 &x, std::valarray< double > *y, std::valarray< double > *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>
|
||||
<div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div>
|
||||
<div class="ttc" id="aprime__numbers_8cpp_html_a3b91f208e8365c95a295cfe3e67df5c3"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">primes</a></div><div class="ttdeci">std::vector< int > primes(int max)</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:12</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:122</div></div>
|
||||
<div class="ttc" id="afibonacci__fast_8cpp_html_a3ba232425d45f9e9c0b87a8cf7ab69d9"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a></div><div class="ttdeci">uint64_t f[MAX]</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</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="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:195</div></div>
|
||||
@@ -331,7 +333,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="anewton__raphson__method_8cpp_html_a3d3f7f41977394680af6ebbed96f3386"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386">eq_der</a></div><div class="ttdeci">static double eq_der(double i)</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:32</div></div>
|
||||
<div class="ttc" id="aode__forward__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &x, std::valarray< double > *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:67</div></div>
|
||||
<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< int ></a></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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:25</div></div>
|
||||
<div class="ttc" id="aode__forward__euler_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:188</div></div>
|
||||
@@ -346,12 +348,14 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector< std::pair< int, int > > factors</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:19</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:54</div></div>
|
||||
<div class="ttc" id="aprime__factorization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:62</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_a798398d5bfd375a3c0ce68100842f6f5"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a798398d5bfd375a3c0ce68100842f6f5">reverse_binary</a></div><div class="ttdeci">std::vector< T > reverse_binary(T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:18</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="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< 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:71</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 &x, std::valarray< double > *y, std::valarray< double > *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>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> modular_inverse_fermat_little_theorem.cpp:84</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>
|
||||
@@ -362,6 +366,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="aode__forward__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:152</div></div>
|
||||
<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="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< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &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>
|
||||
@@ -374,6 +379,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="asqrt__double_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:42</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_abce89d8999986f085c368969590376b8"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8">sieve</a></div><div class="ttdeci">void sieve(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:25</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="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:42</div></div>
|
||||
<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
|
||||
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a51637ff89e55ca749993d3e84b95d153"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153">poly_function</a></div><div class="ttdeci">std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:53</div></div>
|
||||
<div class="ttc" id="alu__decompose_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> lu_decompose.cpp:91</div></div>
|
||||
@@ -398,6 +404,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<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="aprime__factorization_8cpp_html_affe577b9bce8f604f5e2f861c63c7099"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a></div><div class="ttdeci">void SieveOfEratosthenes(int N)</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:23</div></div>
|
||||
<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:71</div></div>
|
||||
<div class="ttc" id="aleast__common__multiple_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:67</div></div>
|
||||
<div class="ttc" id="aode__forward__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:54</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>
|
||||
@@ -416,6 +423,8 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="anewton__raphson__method_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:37</div></div>
|
||||
<div class="ttc" id="agroup__ode_html_ga36ff0710861ca39d957046c0b09b2985"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.cpp:107</div></div>
|
||||
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:62</div></div>
|
||||
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:180</div></div>
|
||||
<div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtod</a></div><div class="ttdeci">T strtod(T... args)</div></div>
|
||||
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:82</div></div>
|
||||
<div class="ttc" id="aprime__factorization_8cpp_html_a0ece0145fb29a5cf48378c23dde2da46"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a></div><div class="ttdeci">void prime_factorization(int num)</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:40</div></div>
|
||||
@@ -434,6 +443,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<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="aode__semi__implicit__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.cpp:153</div></div>
|
||||
<div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../d7/d6a/bisection__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> bisection_method.cpp:22</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div>
|
||||
<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &x, std::valarray< double > *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.cpp:66</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="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>
|
||||
@@ -456,6 +466,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:10</div></div>
|
||||
<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_ab5b4bfecdf391cae7edb1fe98548b846"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846">statistics::stats_computer1::operator>></a></div><div class="ttdeci">friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:53</div></div>
|
||||
<div class="ttc" id="aode__midpoint__euler_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.cpp:192</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:154</div></div>
|
||||
<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:10</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="aprime__factorization_8cpp_html_a7fe38b570a51e448430d6a0f072c2f23"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a></div><div class="ttdeci">bool isprime[1000006]</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:13</div></div>
|
||||
@@ -464,7 +475,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 Sun Jun 21 2020 16:00:18 for Algorithms_in_C++ by
|
||||
<li class="footer">Generated on Sun Jun 21 2020 17:42:19 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>
|
||||
|
||||
Reference in New Issue
Block a user