mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 14:23:03 +08:00
Documentation for b79445ff82
This commit is contained in:
github-actions
@@ -312,27 +312,19 @@ $(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:21</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="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:198</div></div>
|
||||
<div class="ttc" id="anewton__raphson__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:29</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="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:39</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</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="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>
|
||||
<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="agroup__ode_html_ga8c319db420c3d97a83e9dcca803b6812"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a></div><div class="ttdeci">void midpoint_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 midpoint-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.cpp:85</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:57</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="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:74</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="aordinary__least__squares__regressor_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:358</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="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="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="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:204</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>
|
||||
@@ -340,8 +332,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<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="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="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="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:410</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:342</div></div>
|
||||
<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">std::ofstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
|
||||
<div class="ttc" id="anamespaceqr__algorithm_html_a7c63c78d6839b8ad73b77c161210b514"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a7c63c78d6839b8ad73b77c161210b514">qr_algorithm::operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:33</div></div>
|
||||
<div class="ttc" id="agroup__ode_html_gae0509f8843e2bc42de2abbd00a14b7b9"><div class="ttname"><a href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a></div><div class="ttdeci">double forward_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 forward-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.cpp:102</div></div>
|
||||
@@ -350,13 +340,9 @@ $(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="anewton__raphson__method_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:20</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>
|
||||
<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:312</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:177</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="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:220</div></div>
|
||||
<div class="ttc" id="anamespaceqr__algorithm_html_a8ea313a1a1b5f9d0e3e332c29c6446ec"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a></div><div class="ttdeci">double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:76</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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
|
||||
<div class="ttc" id="aode__midpoint__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__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_midpoint_euler.cpp:53</div></div>
|
||||
<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:44</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>
|
||||
@@ -368,14 +354,11 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
|
||||
<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="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="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:238</div></div>
|
||||
<div class="ttc" id="anumeric_limits_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a></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="aode__midpoint__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__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_midpoint_euler.cpp:66</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:168</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="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:291</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@@ -414,6 +414,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:19</div></div>
|
||||
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
|
||||
<div class="ttc" id="afibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:28</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:198</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a778428c4761b6ea5e7770743f0eab5ab"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab">large_number::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &out, const large_number &a)</div><div class="ttdef"><b>Definition:</b> large_number.h:146</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a76ddf1ed1b00fb8c107ea56f7f91e42f"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number::large_number</a></div><div class="ttdeci">large_number(std::vector< unsigned char > &vec)</div><div class="ttdef"><b>Definition:</b> large_number.h:51</div></div>
|
||||
<div class="ttc" id="aatan2_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html">std::atan2</a></div><div class="ttdeci">T atan2(T... args)</div></div>
|
||||
@@ -461,6 +462,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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="afscanf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fscanf.html">std::scanf</a></div><div class="ttdeci">T scanf(T... args)</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:438</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: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>
|
||||
@@ -468,6 +470,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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:191</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">Machine learning algorithms.</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex & operator=(const Complex &other)</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:148</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:57</div></div>
|
||||
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:42</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_ac4010fe3a52a74e8b5b1aaadfe38b46f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:193</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>
|
||||
@@ -484,6 +487,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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:225</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number & operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div>
|
||||
<div class="ttc" id="astructquery_html"><div class="ttname"><a href="../../dd/d1b/structquery.html">query</a></div><div class="ttdef"><b>Definition:</b> mo.cpp:6</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:74</div></div>
|
||||
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
|
||||
<div class="ttc" id="afast__power_8cpp_html_a8399b847626e5bba983cab7c7918b445"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a></div><div class="ttdeci">double fast_power_recursive(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:26</div></div>
|
||||
<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
|
||||
@@ -498,6 +502,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclasslarge__number_html_a0b1efd203274e38a67b78937dfb9b872"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number::large_number</a></div><div class="ttdeci">large_number(const large_number &a)</div><div class="ttdef"><b>Definition:</b> large_number.h:48</div></div>
|
||||
<div class="ttc" id="afibonacci_8cpp_html_a4bc27e88a3da5cc590f1f78622019a7b"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#a4bc27e88a3da5cc590f1f78622019a7b">fibonacci</a></div><div class="ttdeci">int fibonacci(unsigned int n)</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:17</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:206</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:523</div></div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a1ecfaaea49d452772dbb2b28133e36e0"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:21</div></div>
|
||||
@@ -544,7 +549,9 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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:189</div></div>
|
||||
<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="astruct_segment_intersection_html"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:22</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:410</div></div>
|
||||
<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4bcaaf41c66da4d3a471dacef133def7"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4bcaaf41c66da4d3a471dacef133def7">predict_OLS_regressor</a></div><div class="ttdeci">std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:342</div></div>
|
||||
<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_aeb22d2aae39d1b1e0bd39c7f47b333eb"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb">large_number::operator=</a></div><div class="ttdeci">large_number & operator=(const large_number &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:229</div></div>
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:87</div></div>
|
||||
@@ -581,9 +588,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> queue.h:17</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a959c5c1a982949bbf98e1ea0f9afe6a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">large_number::test</a></div><div class="ttdeci">static bool test()</div><div class="ttdef"><b>Definition:</b> large_number.h:65</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a38ff1d954e9b7de93eb20e2dd101a045"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a38ff1d954e9b7de93eb20e2dd101a045">fit_OLS_regressor</a></div><div class="ttdeci">std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:312</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:177</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: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:253</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< vector< int > > 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>
|
||||
@@ -619,6 +629,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a6da44f9820d3b7bae2f0f74bc149c27e"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e">graph::graph</a></div><div class="ttdeci">graph(int n)</div><div class="ttdoc">Constructor that intiliazes the graph on creation and set the connected components to 0.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:53</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:56</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:358</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="aclass_graph_html_a8aa88a88269773cc4dba255dec035898"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898">Graph::getVertices</a></div><div class="ttdeci">std::remove_reference_t< unsigned int > const & getVertices() const</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:112</div></div>
|
||||
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div>
|
||||
@@ -633,6 +644,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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="aclass_complex_html_a820afcbb330df716577459d7a3aa3a1c"><div class="ttname"><a href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex::operator+</a></div><div class="ttdeci">Complex operator+(const Complex &other)</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:88</div></div>
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:41</div></div>
|
||||
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:188</div></div>
|
||||
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:47</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
@@ -664,6 +676,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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="aclassgraph_html_a35c12fba596d8bb48b1877b128c4ba6d"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a35c12fba596d8bb48b1877b128c4ba6d">graph::addEdge</a></div><div class="ttdeci">void addEdge(int, int)</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:75</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:168</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:145</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a822dcbe7978a9fa026f2b37f1a52f5e9"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a822dcbe7978a9fa026f2b37f1a52f5e9">graph::connected_components</a></div><div class="ttdeci">int connected_components</div><div class="ttdoc">keep track of connected components</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:43</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:48</div></div>
|
||||
@@ -679,6 +692,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<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="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:291</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
Reference in New Issue
Block a user