Documentation for ebd13a7e24

This commit is contained in:
github-actions
2020-07-10 15:05:37 +00:00
parent 870ab60d2f
commit 516f846889
34 changed files with 172 additions and 245 deletions

View File

@@ -212,6 +212,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<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="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="asieve__of__eratosthenes_8cpp_html_ae0de20c22cf2304b1cbe70953d57e7b7"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a></div><div class="ttdeci">void print(uint32_t N, const bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:38</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&lt; int &gt; 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:125</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>
@@ -224,8 +225,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<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="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="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="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:50</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>
@@ -250,7 +250,6 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="aisnan_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a></div><div class="ttdeci">T isnan(T... args)</div></div>
<div class="ttc" id="anamespacestatistics_html"><div class="ttname"><a href="../../d2/dcf/namespacestatistics.html">statistics</a></div><div class="ttdoc">Statistical algorithms.</div></div>
<div class="ttc" id="asum__of__digits_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:49</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="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>
@@ -261,7 +260,6 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:89</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:16</div></div>
<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="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&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:43</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&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; 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:84</div></div>
@@ -278,13 +276,13 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
<div class="ttc" id="alu__decomposition_8h_html"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html">lu_decomposition.h</a></div><div class="ttdoc">Functions associated with LU Decomposition of a square matrix.</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a1e606c2e5ac180a770ebe0d1706b8ca2"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve</a></div><div class="ttdeci">void sieve(uint32_t N, bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:21</div></div>
<div class="ttc" id="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:118</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:73</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="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:29</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:16</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a4c6eefd1254eab3e8d34bf02c205e0f4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a></div><div class="ttdeci">int64_t binExpo(int64_t a, int64_t b, int64_t m)</div><div class="ttdef"><b>Definition:</b> modular_inverse_fermat_little_theorem.cpp:52</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="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:32</div></div>
@@ -306,7 +304,6 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<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="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>
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>

View File

@@ -403,6 +403,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="adomain_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a></div><div class="ttdoc">STL class.</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="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae0de20c22cf2304b1cbe70953d57e7b7"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a></div><div class="ttdeci">void print(uint32_t N, const bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:38</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:122</div></div>
<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:17</div></div>
@@ -438,7 +439,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition:</b> large_number.h:24</div></div>
<div class="ttc" id="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_large.cpp:24</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:51</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="aiterator_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/iterator.html">std::iterator</a></div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:566</div></div>
<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:41</div></div>
@@ -511,7 +511,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="ahill__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> hill_cipher.cpp:532</div></div>
<div class="ttc" id="aclasslarge__number_html_ab1af3e0f425cdf7ea2039c9dcfe22f0b"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b">large_number::operator*=</a></div><div class="ttdeci">large_number &amp; operator*=(const T n)</div><div class="ttdef"><b>Definition:</b> large_number.h:238</div></div>
<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition:</b> large_number.h:27</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="abinary__exponent_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:55</div></div>
<div class="ttc" id="astruct_min_heap_node_html"><div class="ttname"><a href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:7</div></div>
<div class="ttc" id="aline__segment__intersection_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:92</div></div>

View File

@@ -395,6 +395,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a003fb4e1b08279fe4cd50fbbc2782c2d"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a></div><div class="ttdeci">std::string tolowerRoman(int n)</div><div class="ttdef"><b>Definition:</b> decimal_to_roman_numeral.cpp:24</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:145</div></div>
<div class="ttc" id="anamespacestring__search_html"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html">string_search</a></div><div class="ttdoc">String search algorithms.</div><div class="ttdef"><b>Definition:</b> brute_force_string_searching.cpp:13</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae0de20c22cf2304b1cbe70953d57e7b7"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a></div><div class="ttdeci">void print(uint32_t N, const bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:38</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:18</div></div>
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
@@ -414,7 +415,6 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aternary__search_8cpp_html_ae01eda5098801bb6b5b778828fb4fddc"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a></div><div class="ttdeci">#define absolutePrecision</div><div class="ttdef"><b>Definition:</b> ternary_search.cpp:22</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="aclass_fenwick_tree_html"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html">FenwickTree</a></div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:17</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="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition:</b> insertion_sort.cpp:59</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a77c722016053a1d484aa177ce205b367"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">HASHMAX</a></div><div class="ttdeci">#define HASHMAX</div><div class="ttdoc">Determines the length of the hash table.</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:22</div></div>
<div class="ttc" id="arabin__karp_8cpp_html_ac4add2a227a10511e0128d63952030e8"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a></div><div class="ttdeci">#define PRIME</div><div class="ttdoc">Prime modulus for hash functions.</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:16</div></div>

View File

@@ -91,9 +91,7 @@ $(document).ready(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp.ht
<div class="header">
<div class="summary">
<a href="#define-members">Macros</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">sieve_of_eratosthenes.cpp File Reference</div> </div>
</div><!--header-->
@@ -109,72 +107,21 @@ Include dependency graph for sieve_of_eratosthenes.cpp:</div>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;10000000</td></tr>
<tr class="separator:a392fb874e547e582e9c66a08a1f23326"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:abce89d8999986f085c368969590376b8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8">sieve</a> (uint32_t N)</td></tr>
<tr class="separator:abce89d8999986f085c368969590376b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af50a5c87d27cfd3462745b37fb9b0f46"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">print</a> (uint32_t N)</td></tr>
<tr class="separator:af50a5c87d27cfd3462745b37fb9b0f46"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a02fd73d861ef2e4aabb38c0c9ff82947"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947">init</a> ()</td></tr>
<tr class="separator:a02fd73d861ef2e4aabb38c0c9ff82947"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e606c2e5ac180a770ebe0d1706b8ca2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve</a> (uint32_t N, bool *<a class="el" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>)</td></tr>
<tr class="separator:a1e606c2e5ac180a770ebe0d1706b8ca2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae0de20c22cf2304b1cbe70953d57e7b7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a> (uint32_t N, const bool *<a class="el" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>)</td></tr>
<tr class="separator:ae0de20c22cf2304b1cbe70953d57e7b7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a0560e21edb54d5ad8d80b2d80348ce22"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a> [<a class="el" href="../../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>]</td></tr>
<tr class="separator:a0560e21edb54d5ad8d80b2d80348ce22"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main). </p>
<p>Time Complexity : \(O(N \cdot\log N)\) <br />
Space Complexity : \(O(N)\)</p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp.html" title="Compute prime numbers upto 1 billion.">primes_up_to_billion.cpp</a> <a class="el" href="../../de/d9b/prime__numbers_8cpp.html" title="Get list of prime numbers.">prime_numbers.cpp</a> </dd></dl>
</div><h2 class="groupheader">Macro Definition Documentation</h2>
<a id="a392fb874e547e582e9c66a08a1f23326"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&nbsp;</a></span>MAX</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define MAX&#160;&#160;&#160;10000000</td>
</tr>
</table>
</div><div class="memdoc">
<p>Maximum number of primes </p>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a02fd73d861ef2e4aabb38c0c9ff82947"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a02fd73d861ef2e4aabb38c0c9ff82947">&#9670;&nbsp;</a></span>init()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void init </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Initialize the array </p>
<div class="fragment"><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; {</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span> (uint32_t i = 1; i &lt; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>; i++) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[i] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
@@ -189,25 +136,27 @@ Space Complexity : \(O(N)\)</p>
</tr>
</table>
</div><div class="memdoc">
<p>main function </p>
<div class="fragment"><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; {</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; uint32_t N = 100;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947">init</a>();</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8">sieve</a>(N);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">print</a>(N);</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;}</div>
<p>Main function </p>
<div class="fragment"><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; {</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; uint32_t N = 100;</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordtype">bool</span> *<a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a> = <span class="keyword">new</span> <span class="keywordtype">bool</span>[N];</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve</a>(N, <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a>(N, <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keyword">delete</span>[] <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; </div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="283" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="283" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="af50a5c87d27cfd3462745b37fb9b0f46"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af50a5c87d27cfd3462745b37fb9b0f46">&#9670;&nbsp;</a></span>print()</h2>
<a id="ae0de20c22cf2304b1cbe70953d57e7b7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae0de20c22cf2304b1cbe70953d57e7b7">&#9670;&nbsp;</a></span>print()</h2>
<div class="memitem">
<div class="memproto">
@@ -216,31 +165,47 @@ Here is the call graph for this function:</div>
<td class="memname">void print </td>
<td>(</td>
<td class="paramtype">uint32_t&#160;</td>
<td class="paramname"><em>N</em></td><td>)</td>
<td class="paramname"><em>N</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const bool *&#160;</td>
<td class="paramname"><em>isprime</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function prints out the primes to STDOUT </p>
<div class="fragment"><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= N; i++) {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[i]) {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; }</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; }</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;}</div>
<p>This function prints out the primes to STDOUT </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir"></td><td class="paramname">N</td><td>number of primes to check </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">isprime</td><td>a boolean array of size <code>N</code> identifying if <code>i</code>^th number is prime or not </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; {</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keywordflow">for</span> (uint32_t i = 2; i &lt;= N; i++) {</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i]) {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; }</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; }</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg" width="178" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae0de20c22cf2304b1cbe70953d57e7b7_cgraph.svg" width="178" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="abce89d8999986f085c368969590376b8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abce89d8999986f085c368969590376b8">&#9670;&nbsp;</a></span>sieve()</h2>
<a id="a1e606c2e5ac180a770ebe0d1706b8ca2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1e606c2e5ac180a770ebe0d1706b8ca2">&#9670;&nbsp;</a></span>sieve()</h2>
<div class="memitem">
<div class="memproto">
@@ -249,51 +214,49 @@ Here is the call graph for this function:</div>
<td class="memname">void sieve </td>
<td>(</td>
<td class="paramtype">uint32_t&#160;</td>
<td class="paramname"><em>N</em></td><td>)</td>
<td></td>
<td class="paramname"><em>N</em>, </td>
</tr>
</table>
</div><div class="memdoc">
<p>This is the function that finds the primes and eliminates the multiples. </p>
<div class="fragment"><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; {</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[0] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[1] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <span class="keywordflow">for</span> (uint32_t i = 2; i &lt;= N; i++) {</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[i]) {</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; <span class="keywordflow">for</span> (uint32_t j = (i &lt;&lt; 1); j &lt;= N; j += i) {</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">isprime</a>[j] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; }</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; }</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; }</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Variable Documentation</h2>
<a id="a0560e21edb54d5ad8d80b2d80348ce22"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0560e21edb54d5ad8d80b2d80348ce22">&#9670;&nbsp;</a></span>isprime</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool isprime[<a class="el" href="../../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>]</td>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool *&#160;</td>
<td class="paramname"><em>isprime</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>array to store the primes </p>
<p>This is the function that finds the primes and eliminates the multiples. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir"></td><td class="paramname">N</td><td>number of primes to check </td></tr>
<tr><td class="paramdir">[out]</td><td class="paramname">isprime</td><td>a boolean array of size <code>N</code> identifying if <code>i</code>^th number is prime or not </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; {</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[0] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[1] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <span class="keywordflow">for</span> (uint32_t i = 2; i * i &lt;= N; i++) {</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i]) {</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; <span class="keywordflow">for</span> (uint32_t j = (i &lt;&lt; 1); j &lt;= N; j = j + i) {</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; <a class="code" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[j] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; }</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; }</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; }</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<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="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="asieve__of__eratosthenes_8cpp_html_ae0de20c22cf2304b1cbe70953d57e7b7"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">print</a></div><div class="ttdeci">void print(uint32_t N, const bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:38</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="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="asieve__of__eratosthenes_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:16</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a1e606c2e5ac180a770ebe0d1706b8ca2"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve</a></div><div class="ttdeci">void sieve(uint32_t N, bool *isprime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:21</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="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="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>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>

View File

@@ -1,9 +1,6 @@
var sieve__of__eratosthenes_8cpp =
[
[ "MAX", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ],
[ "init", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947", null ],
[ "main", "d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "print", "d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46", null ],
[ "sieve", "d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8", null ],
[ "isprime", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22", null ]
[ "print", "d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7", null ],
[ "sieve", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2", null ]
];

View File

@@ -1,7 +1,6 @@
<map id="main" name="main">
<area shape="rect" id="node1" title=" " alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947" title=" " alt="" coords="111,5,150,32"/>
<area shape="rect" id="node3" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46" title=" " alt="" coords="107,56,154,83"/>
<area shape="rect" id="node5" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8" title=" " alt="" coords="104,107,157,133"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,56,277,83"/>
<area shape="rect" id="node1" title=" " alt="" coords="5,31,56,57"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7" title=" " alt="" coords="107,5,154,32"/>
<area shape="rect" id="node4" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2" title=" " alt="" coords="104,56,157,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,5,277,32"/>
</map>

View File

@@ -1 +1 @@
89e7c28209b67402b63a0ee4694ccc40
ecf5b5d1ed4bad060df4d18414db71ac

View File

@@ -4,77 +4,62 @@
<!-- Generated by graphviz version 2.44.0 (20200408.0750)
-->
<!-- Title: main Pages: 1 -->
<svg width="212pt" height="104pt"
viewBox="0.00 0.00 212.00 104.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 100)">
<svg width="212pt" height="66pt"
viewBox="0.00 0.00 212.00 66.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 62)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 208,-100 208,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 208,-62 208,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 38,-57.5 38,-38.5 0,-38.5"/>
<text text-anchor="middle" x="19" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 38,-38.5 38,-19.5 0,-19.5"/>
<text text-anchor="middle" x="19" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="79.5,-76.5 79.5,-95.5 108.5,-95.5 108.5,-76.5 79.5,-76.5"/>
<text text-anchor="middle" x="94" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">init</text>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="76.5,-38.5 76.5,-57.5 111.5,-57.5 111.5,-38.5 76.5,-38.5"/>
<text text-anchor="middle" x="94" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.04,-57.39C47.74,-62.44 59.8,-68.72 70.15,-74.1"/>
<polygon fill="midnightblue" stroke="midnightblue" points="68.57,-77.23 79.05,-78.74 71.8,-71.02 68.57,-77.23"/>
<path fill="none" stroke="midnightblue" d="M38.04,-33.7C46.6,-35.92 57,-38.63 66.43,-41.09"/>
<polygon fill="midnightblue" stroke="midnightblue" points="65.6,-44.49 76.16,-43.62 67.37,-37.71 65.6,-44.49"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="76.5,-38.5 76.5,-57.5 111.5,-57.5 111.5,-38.5 76.5,-38.5"/>
<text text-anchor="middle" x="94" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.04,-48C46.51,-48 56.78,-48 66.13,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="66.16,-51.5 76.16,-48 66.16,-44.5 66.16,-51.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8" target="_top" xlink:title=" ">
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-0.5 74,-19.5 114,-19.5 114,-0.5 74,-0.5"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">sieve</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M38.04,-38.61C46.4,-34.26 56.52,-28.99 65.78,-24.17"/>
<polygon fill="midnightblue" stroke="midnightblue" points="67.4,-27.27 74.66,-19.55 64.17,-21.06 67.4,-27.27"/>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.04,-24.3C45.87,-22.27 55.24,-19.83 64,-17.55"/>
<polygon fill="midnightblue" stroke="midnightblue" points="65.09,-20.88 73.89,-14.97 63.33,-14.11 65.09,-20.88"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="150,-38.5 150,-57.5 204,-57.5 204,-38.5 150,-38.5"/>
<text text-anchor="middle" x="177" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M111.78,-48C119.97,-48 130.15,-48 139.97,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="139.99,-51.5 149.99,-48 139.99,-44.5 139.99,-51.5"/>
</g>

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

View File

@@ -123,15 +123,14 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
<li>MAX
: <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">fibonacci_fast.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">power_for_huge_numbers.cpp</a>
, <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">paranthesis_matching.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">hash_search.cpp</a>
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">sieve_of_eratosthenes.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">ternary_search.cpp</a>
, <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">paranthesis_matching.cpp</a>
</li>
<li>MAX_ITERATIONS
: <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">newton_raphson_method.cpp</a>
: <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">newton_raphson_method.cpp</a>
, <a class="el" href="dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">false_position.cpp</a>
, <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>
</li>
<li>MAX_NUM
: <a class="el" href="d9/d69/median__search_8cpp.html#a55bfdcfe7613d75fb48ec99c7bf4dd5e">median_search.cpp</a>

View File

@@ -93,9 +93,6 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
&#160;
<h3><a id="index_i"></a>- i -</h3><ul>
<li>init()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947">sieve_of_eratosthenes.cpp</a>
</li>
<li>InSameUnion()
: <a class="el" href="de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">disjoint_set.cpp</a>
</li>

View File

@@ -134,7 +134,7 @@ $(document).ready(function(){initNavTree('globals_func_p.html',''); initResizabl
: <a class="el" href="de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">prime_numbers.cpp</a>
</li>
<li>print()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">sieve_of_eratosthenes.cpp</a>
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">sieve_of_eratosthenes.cpp</a>
</li>
<li>printArray()
: <a class="el" href="d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">heap_sort.cpp</a>

View File

@@ -128,7 +128,7 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8">sieve_of_eratosthenes.cpp</a>
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve_of_eratosthenes.cpp</a>
</li>
<li>SieveOfEratosthenes()
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>

View File

@@ -93,9 +93,6 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<div class="textblock">Here is a list of all documented file members with links to the documentation:</div>
<h3><a id="index_i"></a>- i -</h3><ul>
<li>init()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947">sieve_of_eratosthenes.cpp</a>
</li>
<li>InSameUnion()
: <a class="el" href="de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">disjoint_set.cpp</a>
</li>
@@ -123,15 +120,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>is_square()
: <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">ordinary_least_squares_regressor.cpp</a>
</li>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
</li>
<li>isprime
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">sieve_of_eratosthenes.cpp</a>
</li>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
</li>
<li>it_ternary_search()
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>

View File

@@ -121,7 +121,6 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="df/dd5/binary__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">binary_search.cpp</a>
, <a class="el" href="d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">exponential_search.cpp</a>
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
, <a class="el" href="da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sqrt_double.cpp</a>
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
, <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brute_force_string_searching.cpp</a>
@@ -134,11 +133,12 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ternary_search.cpp</a>
, <a class="el" href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">median_search.cpp</a>
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
, <a class="el" href="da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sqrt_double.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_search.cpp</a>
, <a class="el" href="d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search.cpp</a>
, <a class="el" href="de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">string_fibonacci.cpp</a>
, <a class="el" href="df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search2.cpp</a>
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
@@ -149,7 +149,6 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">smallest_circle.cpp</a>
, <a class="el" href="da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">primality_test.cpp</a>
, <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">pascal_triangle.cpp</a>
@@ -166,10 +165,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
, <a class="el" href="db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.cpp</a>
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">golden_search_extrema.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
@@ -181,10 +181,10 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">number_of_positive_divisors.cpp</a>
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">miller_rabin.cpp</a>
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
, <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_inverse_fermat_little_theorem.cpp</a>
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">number_of_positive_divisors.cpp</a>
</li>
<li>mat_mul()
: <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0">qr_eigen_values.cpp</a>
@@ -196,16 +196,15 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5">lu_decomposition.h</a>
</li>
<li>MAX
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326">sieve_of_eratosthenes.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">power_for_huge_numbers.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">hash_search.cpp</a>
: <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">power_for_huge_numbers.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">fibonacci_fast.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">ternary_search.cpp</a>
, <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">paranthesis_matching.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">fibonacci_fast.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">hash_search.cpp</a>
</li>
<li>MAX_ITERATIONS
: <a class="el" href="dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">false_position.cpp</a>
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">newton_raphson_method.cpp</a>
: <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">newton_raphson_method.cpp</a>
, <a class="el" href="dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">false_position.cpp</a>
, <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>
</li>
<li>MAX_NUM
@@ -248,8 +247,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">tower_of_hanoi.cpp</a>
</li>
<li>multiply()
: <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ac62a499b83c7895dd0aa69da1b64c904">matrix_exponentiation.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">power_for_huge_numbers.cpp</a>
: <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">power_for_huge_numbers.cpp</a>
, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ac62a499b83c7895dd0aa69da1b64c904">matrix_exponentiation.cpp</a>
</li>
</ul>
</div><!-- contents -->

View File

@@ -146,7 +146,7 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
: <a class="el" href="de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">prime_numbers.cpp</a>
</li>
<li>print()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">sieve_of_eratosthenes.cpp</a>
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7">sieve_of_eratosthenes.cpp</a>
</li>
<li>printArray()
: <a class="el" href="d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">heap_sort.cpp</a>

View File

@@ -125,7 +125,7 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
: <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">pascal_triangle.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8">sieve_of_eratosthenes.cpp</a>
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve_of_eratosthenes.cpp</a>
</li>
<li>Sieve()
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>

View File

@@ -108,7 +108,6 @@ $(document).ready(function(){initNavTree('globals_vars.html',''); initResizable(
</li>
<li>isprime
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22">sieve_of_eratosthenes.cpp</a>
</li>
<li>mat_size
: <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">matrix_exponentiation.cpp</a>

View File

@@ -108,8 +108,8 @@ var NAVTREEINDEX =
"annotated.html",
"d5/d15/classcll.html#abb6fb5834563d077a4eaff1b7fdc5b44",
"d8/d10/structlist.html#ad21e95792529f165f01361f9f42505b3",
"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac",
"files.html"
"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a",
"functions_rela.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

View File

@@ -11,10 +11,10 @@ var NAVTREEINDEX1 =
"d5/d4c/group__sorting.html":[5,2],
"d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[5,2,5],
"d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[8,0,11,4,3],
"d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[8,0,11,2,1],
"d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[5,2,1],
"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[5,2,3],
"d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[8,0,11,2,1],
"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[8,0,11,4,1],
"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[5,2,3],
"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[5,2,4],
"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,0,11,4,2],
"d5/d4c/group__sorting.html#gabd9a93f241c5c86f2ec0abf8b66b4145":[8,0,11,2,0],

View File

@@ -35,12 +35,9 @@ var NAVTREEINDEX2 =
"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[7,0,24,4],
"d8/dcc/namespacestd.html":[6,0,5],
"d8/ddf/sieve__of__eratosthenes_8cpp.html":[8,0,5,27],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947":[8,0,5,27,1],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22":[8,0,5,27,5],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[8,0,5,27,0],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8":[8,0,5,27,4],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,5,27,2],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46":[8,0,5,27,3],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2":[8,0,5,27,2],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7":[8,0,5,27,1],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,5,27,0],
"d8/dee/avltree_8cpp.html":[8,0,1,1],
"d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0":[8,0,1,1,2],
"d8/dee/avltree_8cpp.html#a4d93589966920b2756b84f8b92c54d1c":[8,0,1,1,11],
@@ -158,9 +155,9 @@ var NAVTREEINDEX2 =
"da/d9a/class_graph.html#a47336f7cfe4698ef887a34e03f1a3856":[7,0,12,36],
"da/d9a/class_graph.html#a61943646676002a5e75f7b6493c25713":[7,0,12,32],
"da/d9a/class_graph.html#a6afcd41564ea00294a4c089414979ca1":[7,0,12,40],
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,12,15],
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,12,13],
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,12,14],
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,12,13],
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,12,15],
"da/d9a/class_graph.html#a73268574e2528b8e760191113ef6d1eb":[7,0,12,27],
"da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898":[7,0,12,21],
"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[7,0,12,8],
@@ -181,8 +178,8 @@ var NAVTREEINDEX2 =
"da/d9a/class_graph.html#ade809d353b640b9c2773d71d4f57d57d":[7,0,12,5],
"da/d9a/class_graph.html#ae0d2312723fb56a431e6fba4f264d25c":[7,0,12,24],
"da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8":[7,0,12,7],
"da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f":[7,0,12,10],
"da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f":[7,0,12,3],
"da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f":[7,0,12,10],
"da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07":[7,0,12,20],
"da/d9a/class_graph.html#ae93ae98711b868af601d424954fe94ac":[7,0,12,39],
"da/d9a/class_graph.html#af0e8f10f05298718b830d7c01a7cd69c":[7,0,12,35],
@@ -249,5 +246,8 @@ var NAVTREEINDEX2 =
"db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e":[7,0,15,13],
"db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706":[7,0,15,11],
"db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d":[7,0,15,15],
"db/d82/classlarge__number.html#adf804e60309bf016f7954fdcb0a4d103":[7,0,15,4]
"db/d82/classlarge__number.html#adf804e60309bf016f7954fdcb0a4d103":[7,0,15,4],
"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[7,0,15,6],
"db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb":[7,0,15,14],
"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[7,0,15,22]
};

View File

@@ -1,8 +1,5 @@
var NAVTREEINDEX3 =
{
"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[7,0,15,6],
"db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb":[7,0,15,14],
"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[7,0,15,22],
"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[7,0,15,1],
"db/d8b/struct_node.html":[7,0,23],
"db/d8b/struct_node.html#a2559a716f69ccaa76d648d9f1b83065e":[7,0,23,2],
@@ -114,9 +111,9 @@ var NAVTREEINDEX3 =
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[7,0,34,3],
"dd/d3b/struct_entry.html":[7,0,10],
"dd/d3b/struct_entry.html#acef39096ad1bc616755a4c120a713cea":[7,0,10,3],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,10,0],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,10,1],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,10,2],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,10,0],
"dd/d4f/class_solution.html":[7,0,30],
"dd/d4f/class_solution.html#a0a92d4ba2a822ae87e4c8a7c321024c0":[7,0,30,7],
"dd/d4f/class_solution.html#a29d19d87d54fe43d3f22221b8fe1b0bc":[7,0,30,0],
@@ -249,5 +246,8 @@ var NAVTREEINDEX3 =
"dir_9c6faab82c22511b50177aa2e38e2780.html":[8,0,6],
"dir_bb1b521853a9c46347182a9d10420771.html":[8,0,11],
"dir_e3380d2178455503f266746fb14246a5.html":[8,0,2],
"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[8,0,1,0]
"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[8,0,1,0],
"files.html":[8,0],
"functions.html":[7,2,0],
"functions_func.html":[7,2,1]
};

View File

@@ -1,8 +1,5 @@
var NAVTREEINDEX4 =
{
"files.html":[8,0],
"functions.html":[7,2,0],
"functions_func.html":[7,2,1],
"functions_rela.html":[7,2,3],
"functions_vars.html":[7,2,2],
"globals.html":[8,1,0],
@@ -14,8 +11,8 @@ var NAVTREEINDEX4 =
"globals_defs.html":[8,1,4],
"globals_e.html":[8,1,0,5],
"globals_f.html":[8,1,0,6],
"globals_func.html":[8,1,1],
"globals_func.html":[8,1,1,0],
"globals_func.html":[8,1,1],
"globals_func_a.html":[8,1,1,1],
"globals_func_b.html":[8,1,1,2],
"globals_func_c.html":[8,1,1,3],

View File

@@ -67,7 +67,7 @@ var searchData=
['prime_5fnumbers_2ecpp_1197',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]],
['primes_1198',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]],
['primes_5fup_5fto_5fbillion_2ecpp_1199',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]],
['print_1200',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46',1,'sieve_of_eratosthenes.cpp']]],
['print_1200',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7',1,'sieve_of_eratosthenes.cpp']]],
['printarray_1201',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
['printf_1202',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
['priority_5fqueue_1203',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]],

View File

@@ -77,7 +77,7 @@ var searchData=
['shrink_5fto_5ffit_1412',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]],
['shuffle_1413',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]],
['shuffle_5forder_5fengine_1414',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::shuffle_order_engine'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine::shuffle_order_engine()']]],
['sieve_1415',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8',1,'sieve(uint32_t N):&#160;sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n):&#160;primes_up_to_billion.cpp']]],
['sieve_1415',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2',1,'sieve(uint32_t N, bool *isprime):&#160;sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n):&#160;primes_up_to_billion.cpp']]],
['sieve_5fof_5feratosthenes_2ecpp_1416',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]],
['sieveoferatosthenes_1417',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
['sig_5fatomic_5ft_1418',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]],

View File

@@ -11,7 +11,7 @@ var searchData=
['includes_652',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]],
['independent_5fbits_5fengine_653',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std::independent_bits_engine'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine::independent_bits_engine()']]],
['infinity_654',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]],
['init_655',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947',1,'init():&#160;sieve_of_eratosthenes.cpp']]],
['init_655',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()']]],
['initializer_5flist_656',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]],
['inner_5fallocator_657',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]],
['inner_5fproduct_658',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]],
@@ -146,7 +146,7 @@ var searchData=
['islower_787',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]],
['isnan_788',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]],
['isnormal_789',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]],
['isprime_790',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime():&#160;prime_factorization.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22',1,'isprime():&#160;sieve_of_eratosthenes.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m):&#160;modular_inverse_fermat_little_theorem.cpp'],['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number):&#160;primality_test.cpp']]],
['isprime_790',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime():&#160;prime_factorization.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m):&#160;modular_inverse_fermat_little_theorem.cpp'],['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number):&#160;primality_test.cpp']]],
['isprint_791',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]],
['ispunct_792',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]],
['isspace_793',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]],

File diff suppressed because one or more lines are too long

View File

@@ -1,6 +1,6 @@
var searchData=
[
['max_4063',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;power_for_huge_numbers.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;sieve_of_eratosthenes.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;ternary_search.cpp']]],
['max_4063',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX():&#160;ternary_search.cpp']]],
['max_5fiterations_4064',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS():&#160;bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS():&#160;false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS():&#160;newton_raphson_method.cpp']]],
['max_5fnum_4065',['MAX_NUM',['../d9/d69/median__search_8cpp.html#a55bfdcfe7613d75fb48ec99c7bf4dd5e',1,'median_search.cpp']]],
['min_5fdistance_4066',['MIN_DISTANCE',['../d4/def/kohonen__som__topology_8cpp.html#a549d41dcf9444ed7d6df1da3c73e7d16',1,'kohonen_som_topology.cpp']]]

View File

@@ -47,7 +47,7 @@ var searchData=
['prev_5fpermutation_3435',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]],
['prime_5ffactorization_3436',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
['primes_3437',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]],
['print_3438',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46',1,'sieve_of_eratosthenes.cpp']]],
['print_3438',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7',1,'sieve_of_eratosthenes.cpp']]],
['printarray_3439',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
['printf_3440',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
['priority_5fqueue_3441',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]],

View File

@@ -70,7 +70,7 @@ var searchData=
['shrink_5fto_5ffit_3607',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]],
['shuffle_3608',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]],
['shuffle_5forder_5fengine_3609',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine']]],
['sieve_3610',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8',1,'sieve(uint32_t N):&#160;sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n):&#160;primes_up_to_billion.cpp']]],
['sieve_3610',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2',1,'sieve(uint32_t N, bool *isprime):&#160;sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n):&#160;primes_up_to_billion.cpp']]],
['sieveoferatosthenes_3611',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
['signal_3612',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]],
['signaling_5fnan_3613',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]],

View File

@@ -11,7 +11,7 @@ var searchData=
['includes_3078',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]],
['independent_5fbits_5fengine_3079',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine']]],
['infinity_3080',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]],
['init_3081',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947',1,'init():&#160;sieve_of_eratosthenes.cpp']]],
['init_3081',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()']]],
['initializer_5flist_3082',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list']]],
['inner_5fallocator_3083',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]],
['inner_5fproduct_3084',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]],

View File

@@ -1,4 +1,4 @@
var searchData=
[
['isprime_4027',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime():&#160;prime_factorization.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22',1,'isprime():&#160;sieve_of_eratosthenes.cpp']]]
['isprime_4027',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]]
];