mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
Documentation for 42e1246ffc
This commit is contained in:
github-actions
@@ -212,7 +212,6 @@ $(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< int > primes(int max)</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:12</div></div>
|
||||
<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp: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>
|
||||
@@ -225,7 +224,8 @@ $(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:50</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:65</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a60fa6579eab0db3c1c0ab1bf6d651be3"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a></div><div class="ttdeci">std::vector< bool > sieve(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:26</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< double > &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< double(double)> &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>
|
||||
@@ -239,6 +239,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
|
||||
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
|
||||
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:56</div></div>
|
||||
<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:78</div></div>
|
||||
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
|
||||
<div class="ttc" id="aprime__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:26</div></div>
|
||||
<div class="ttc" id="amersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
@@ -274,10 +275,10 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
|
||||
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:72</div></div>
|
||||
<div class="ttc" id="arealtime__stats_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:158</div></div>
|
||||
<div class="ttc" id="afalse__position_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition:</b> false_position.cpp:34</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
<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>
|
||||
@@ -315,6 +316,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
|
||||
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
|
||||
<div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:22</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:56</div></div>
|
||||
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="astring__fibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:81</div></div>
|
||||
|
||||
@@ -406,7 +406,6 @@ $(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:118</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>
|
||||
@@ -581,6 +580,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
|
||||
<div class="ttc" id="acheck__prime_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:45</div></div>
|
||||
<div class="ttc" id="alarge__factorial_8cpp_html_a76aae4778fbe89a3d59fd61fbc050cfa"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a></div><div class="ttdeci">bool test2()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:54</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_a8c95e00effaea0cd9404dd74cd802ae3"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList &&adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:76</div></div>
|
||||
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<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>
|
||||
|
||||
@@ -123,7 +123,7 @@ Variables</h2></td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Compute prime numbers upto 1 billion. </p>
|
||||
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/d9b/prime__numbers_8cpp.html" title="Get list of prime numbers.">prime_numbers.cpp</a> <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find t...">sieve_of_eratosthenes.cpp</a> </dd></dl>
|
||||
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/d9b/prime__numbers_8cpp.html" title="Get list of prime numbers.">prime_numbers.cpp</a> <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Get list of prime numbers using Sieve of Eratosthenes.">sieve_of_eratosthenes.cpp</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -345,7 +345,6 @@ 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>
|
||||
@@ -484,6 +483,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="ttc" id="aqr__eigen__values_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:243</div></div>
|
||||
<div class="ttc" id="aceil_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">std::ceil</a></div><div class="ttdeci">T ceil(T... args)</div></div>
|
||||
<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector< Point > &P)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:87</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
<div class="ttc" id="asuccessive__approximation_8cpp_html_a79c1d08919ff7780a5d7723172602389"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">eq</a></div><div class="ttdeci">static float eq(float y)</div><div class="ttdef"><b>Definition:</b> successive_approximation.cpp:12</div></div>
|
||||
<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition:</b> quick_sort_3.cpp:138</div></div>
|
||||
<div class="ttc" id="aexponential__search_8cpp_html_a67e9c84b4e2eb30e3c5170eabfbb363d"><div class="ttname"><a href="../../d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d">struzik_search</a></div><div class="ttdeci">Type * struzik_search(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition:</b> exponential_search.cpp:59</div></div>
|
||||
|
||||
@@ -97,28 +97,33 @@ $(document).ready(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp.ht
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<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>Get list of prime numbers using Sieve of Eratosthenes.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for sieve_of_eratosthenes.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d35/sieve__of__eratosthenes_8cpp__incl.svg" width="222" height="112"><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="../../da/d35/sieve__of__eratosthenes_8cpp__incl.svg" width="256" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a1e606c2e5ac180a770ebe0d1706b8ca2"><td class="memItemLeft" align="right" valign="top">void </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"> </td></tr>
|
||||
<tr class="memitem:ae0de20c22cf2304b1cbe70953d57e7b7"><td class="memItemLeft" align="right" valign="top">void </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"> </td></tr>
|
||||
<tr class="memitem:a60fa6579eab0db3c1c0ab1bf6d651be3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< bool > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a> (uint32_t N)</td></tr>
|
||||
<tr class="separator:a60fa6579eab0db3c1c0ab1bf6d651be3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a235843bdf82d2a6cc8596ae8fd3b8df9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a> (uint32_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< bool > &<a class="el" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>)</td></tr>
|
||||
<tr class="separator:a235843bdf82d2a6cc8596ae8fd3b8df9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
|
||||
<tr class="separator:a88ec9ad42717780d6caaff9d3d6977f9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </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"> </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 />
|
||||
<div class="textblock"><p>Get list of prime numbers using Sieve of Eratosthenes. </p>
|
||||
<p>Sieve of Eratosthenes is an algorithm that finds all the primes between 2 and N.</p>
|
||||
<p>Time Complexity : \(O(N \cdot\log \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">Function Documentation</h2>
|
||||
@@ -137,26 +142,25 @@ Space Complexity : \(O(N)\)</p>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main function </p>
|
||||
<div class="fragment"><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  uint32_t N = 100;</div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <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>  <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>  <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>  <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>  </div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  {</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  uint32_t N = 100;</div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a> = <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a>(N);</div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(N, <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>);</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> }</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="88"><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="399" height="192"><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="ae0de20c22cf2304b1cbe70953d57e7b7"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae0de20c22cf2304b1cbe70953d57e7b7">◆ </a></span>print()</h2>
|
||||
<a id="a235843bdf82d2a6cc8596ae8fd3b8df9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a235843bdf82d2a6cc8596ae8fd3b8df9">◆ </a></span>print()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -170,8 +174,8 @@ Here is the call graph for this function:</div>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const bool * </td>
|
||||
<td class="paramname"><em>isprime</em> </td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< bool > & </td>
|
||||
<td class="paramname"><em>is_prime</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
@@ -182,81 +186,110 @@ Here is the call graph for this function:</div>
|
||||
</div><div class="memdoc">
|
||||
<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>
|
||||
<tr><td class="paramname">N</td><td>number of primes to check </td></tr>
|
||||
<tr><td class="paramname">is_prime</td><td>a vector of <code>N + 1</code> booleans identifying if <code>i</code>^th number is a prime or not </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  {</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">for</span> (uint32_t i = 2; i <= N; i++) {</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <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>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="charliteral">' '</span>;</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <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> }</div>
|
||||
<div class="fragment"><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  {</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">for</span> (uint32_t i = 2; i <= N; i++) {</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (<a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>[i]) {</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="charliteral">' '</span>;</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <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="l00051"></a><span class="lineno"> 51</span> }</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_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 class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_a235843bdf82d2a6cc8596ae8fd3b8df9_cgraph.svg" width="178" 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="a1e606c2e5ac180a770ebe0d1706b8ca2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a1e606c2e5ac180a770ebe0d1706b8ca2">◆ </a></span>sieve()</h2>
|
||||
<a id="a60fa6579eab0db3c1c0ab1bf6d651be3"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a60fa6579eab0db3c1c0ab1bf6d651be3">◆ </a></span>sieve()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void sieve </td>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><bool> sieve </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">uint32_t </td>
|
||||
<td class="paramname"><em>N</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td class="paramname"><em>N</em></td><td>)</td>
|
||||
<td></td>
|
||||
<td class="paramtype">bool * </td>
|
||||
<td class="paramname"><em>isprime</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>This is the function that finds the primes and eliminates the multiples. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<p>This is the function that finds the primes and eliminates the multiples. Contains a common optimization to start eliminating multiples of a prime p starting from p * p since all of the lower multiples have been already eliminated. </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>
|
||||
<tr><td class="paramname">N</td><td>number of primes to check </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  {</div>
|
||||
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <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>  <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>  <span class="keywordflow">for</span> (uint32_t i = 2; i * i <= N; i++) {</div>
|
||||
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <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>  <span class="keywordflow">for</span> (uint32_t j = (i << 1); j <= N; j = j + i) {</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <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>  }</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  }</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
<dl class="section return"><dt>Returns</dt><dd>is_prime a vector of <code>N + 1</code> booleans identifying if <code>i</code>^th number is a prime or not </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  {</div>
|
||||
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>(N + 1, <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>[0] = <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>[1] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">for</span> (uint32_t i = 2; i * i <= N; i++) {</div>
|
||||
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">if</span> (<a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>[i]) {</div>
|
||||
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">for</span> (uint32_t j = i * i; j <= N; j += i) {</div>
|
||||
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>[j] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
||||
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  }</div>
|
||||
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  }</div>
|
||||
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> <a class="code" href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a>;</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> }</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_a60fa6579eab0db3c1c0ab1bf6d651be3_cgraph.svg" width="183" 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="a88ec9ad42717780d6caaff9d3d6977f9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void tests </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Test implementations </p>
|
||||
<div class="fragment"><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// 0 1 2 3 4 5 6 7 8 9 10</span></div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>};</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  assert(<a class="code" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a>(10) == <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>);</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</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_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="282" 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>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< bool ></a></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_a60fa6579eab0db3c1c0ab1bf6d651be3"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a></div><div class="ttdeci">std::vector< bool > sieve(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:26</div></div>
|
||||
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
|
||||
<div class="ttc" id="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_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="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</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="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>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:56</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
|
||||
@@ -1,6 +1,7 @@
|
||||
var sieve__of__eratosthenes_8cpp =
|
||||
[
|
||||
[ "main", "d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "print", "d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7", null ],
|
||||
[ "sieve", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2", null ]
|
||||
[ "print", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9", null ],
|
||||
[ "sieve", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3", null ],
|
||||
[ "tests", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9", null ]
|
||||
];
|
||||
@@ -1,4 +1,5 @@
|
||||
<map id="print" name="print">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,52,32"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,31,52,57"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="100,5,172,32"/>
|
||||
<area shape="rect" id="node3" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title=" " alt="" coords="101,56,171,83"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
2f8c2e90a637c569a4e48c4d25266a85
|
||||
@@ -0,0 +1,52 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: print Pages: 1 -->
|
||||
<svg width="133pt" height="66pt"
|
||||
viewBox="0.00 0.00 133.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>print</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 129,-62 129,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,-19.5 0,-38.5 35,-38.5 35,-19.5 0,-19.5"/>
|
||||
<text text-anchor="middle" x="17.5" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="71,-38.5 71,-57.5 125,-57.5 125,-38.5 71,-38.5"/>
|
||||
<text text-anchor="middle" x="98" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M35.15,-33.03C42.67,-34.85 51.87,-37.08 60.85,-39.25"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="60.26,-42.71 70.8,-41.66 61.9,-35.9 60.26,-42.71"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="71.5,-0.5 71.5,-19.5 124.5,-19.5 124.5,-0.5 71.5,-0.5"/>
|
||||
<text text-anchor="middle" x="98" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M35.15,-24.97C42.88,-23.1 52.39,-20.8 61.61,-18.56"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="62.52,-21.95 71.41,-16.19 60.87,-15.14 62.52,-21.95"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.3 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="sieve" name="sieve">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,59,32"/>
|
||||
<area shape="rect" id="node2" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title=" " alt="" coords="107,5,177,32"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
a01e272f9d9a830835656af2290340e0
|
||||
@@ -0,0 +1,37 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: sieve Pages: 1 -->
|
||||
<svg width="137pt" height="28pt"
|
||||
viewBox="0.00 0.00 137.00 28.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 24)">
|
||||
<title>sieve</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 133,-24 133,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,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">sieve</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="76,-0.5 76,-19.5 129,-19.5 129,-0.5 76,-0.5"/>
|
||||
<text text-anchor="middle" x="102.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M40.08,-10C47.76,-10 56.89,-10 65.72,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="65.86,-13.5 75.86,-10 65.86,-6.5 65.86,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.6 KiB |
@@ -0,0 +1,6 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,31,56,57"/>
|
||||
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="109,5,152,32"/>
|
||||
<area shape="rect" id="node3" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3" title=" " alt="" coords="104,56,157,83"/>
|
||||
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title=" " alt="" coords="205,56,276,83"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
c8a37f929d53cdd8771c77f29ae37f88
|
||||
@@ -0,0 +1,67 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="211pt" height="66pt"
|
||||
viewBox="0.00 0.00 211.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>tests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 207,-62 207,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,-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">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="78,-38.5 78,-57.5 110,-57.5 110,-38.5 78,-38.5"/>
|
||||
<text text-anchor="middle" x="94" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.04,-33.7C46.97,-36.02 57.9,-38.87 67.66,-41.4"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="67.07,-44.87 77.63,-44 68.83,-38.09 67.07,-44.87"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3" 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->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</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 xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="150,-0.5 150,-19.5 203,-19.5 203,-0.5 150,-0.5"/>
|
||||
<text text-anchor="middle" x="176.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M114.08,-10C121.76,-10 130.89,-10 139.72,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.86,-13.5 149.86,-10 139.86,-6.5 139.86,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.0 KiB |
@@ -1 +0,0 @@
|
||||
6b233f604ffd5f19077b3a917535efb3
|
||||
@@ -1,37 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: print Pages: 1 -->
|
||||
<svg width="133pt" height="28pt"
|
||||
viewBox="0.00 0.00 133.00 28.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 24)">
|
||||
<title>print</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 129,-24 129,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,-0.5 0,-19.5 35,-19.5 35,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="17.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="71,-0.5 71,-19.5 125,-19.5 125,-0.5 71,-0.5"/>
|
||||
<text text-anchor="middle" x="98" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M35.15,-10C42.59,-10 51.67,-10 60.56,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="60.8,-13.5 70.8,-10 60.8,-6.5 60.8,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.6 KiB |
@@ -1,6 +1,9 @@
|
||||
<map id="main" name="main">
|
||||
<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"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,59,56,85"/>
|
||||
<area shape="rect" id="node2" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title=" " alt="" coords="323,8,393,35"/>
|
||||
<area shape="rect" id="node3" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="106,33,153,60"/>
|
||||
<area shape="rect" id="node5" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3" title=" " alt="" coords="212,109,265,136"/>
|
||||
<area shape="rect" id="node6" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="104,135,155,161"/>
|
||||
<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="203,59,275,85"/>
|
||||
<area shape="rect" id="node7" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="217,160,260,187"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ecf5b5d1ed4bad060df4d18414db71ac
|
||||
e2ac51f1772d88e2ca7d3064024667e6
|
||||
@@ -4,64 +4,127 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<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)">
|
||||
<svg width="299pt" height="144pt"
|
||||
viewBox="0.00 0.00 299.00 144.12" 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 140.12)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 208,-62 208,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-140.12 295,-140.12 295,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,-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>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 38,-95.5 38,-76.5 0,-76.5"/>
|
||||
<text text-anchor="middle" x="19" y="-83.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#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>
|
||||
<g id="a_node2"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="238,-114.5 238,-133.5 291,-133.5 291,-114.5 238,-114.5"/>
|
||||
<text text-anchor="middle" x="264.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<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>
|
||||
<!-- 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->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->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"/>
|
||||
<path fill="none" stroke="midnightblue" d="M29.76,-95.54C39.88,-104.74 56.63,-118.11 74,-124 125.12,-141.33 188.56,-136.45 227.52,-130.7"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="228.5,-134.09 237.83,-129.08 227.41,-127.18 228.5,-134.09"/>
|
||||
</g>
|
||||
<!-- 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>
|
||||
<g id="a_node3"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="75.5,-95.5 75.5,-114.5 110.5,-114.5 110.5,-95.5 75.5,-95.5"/>
|
||||
<text text-anchor="middle" x="93" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->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"/>
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.17,-90.79C46.4,-92.97 56.3,-95.58 65.35,-97.97"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="64.51,-101.37 75.07,-100.53 66.3,-94.6 64.51,-101.37"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="155,-38.5 155,-57.5 195,-57.5 195,-38.5 155,-38.5"/>
|
||||
<text text-anchor="middle" x="175" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">sieve</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.27,-81.49C64.61,-74.99 113.53,-62.92 144.89,-55.18"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="145.92,-58.53 154.79,-52.74 144.24,-51.74 145.92,-58.53"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-19.5 74,-38.5 112,-38.5 112,-19.5 74,-19.5"/>
|
||||
<text text-anchor="middle" x="93" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M32.21,-76.33C43.04,-67.76 59.05,-55.09 71.78,-45.01"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="74.3,-47.48 79.97,-38.53 69.95,-41.99 74.3,-47.48"/>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M110.56,-106.86C137.55,-109.88 191.63,-115.94 227.7,-119.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="227.49,-123.49 237.82,-121.12 228.27,-116.53 227.49,-123.49"/>
|
||||
</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=" ">
|
||||
<polygon fill="white" stroke="black" points="148,-76.5 148,-95.5 202,-95.5 202,-76.5 148,-76.5"/>
|
||||
<text text-anchor="middle" x="175" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M110.58,-101.06C118.59,-99.16 128.55,-96.8 138.17,-94.51"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.07,-97.89 148,-92.18 137.46,-91.08 139.07,-97.89"/>
|
||||
</g>
|
||||
<!-- Node5->Node2 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M189.72,-57.57C193.75,-60.5 198.12,-63.8 202,-67 217.67,-79.91 234.51,-95.67 246.61,-107.34"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="244.2,-109.88 253.81,-114.35 249.08,-104.87 244.2,-109.88"/>
|
||||
</g>
|
||||
<!-- Node6->Node5 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node6->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.15,-33.31C121.8,-35.6 133.88,-38.47 144.8,-41.07"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="144.26,-44.54 154.8,-43.44 145.88,-37.72 144.26,-44.54"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="159,-0.5 159,-19.5 191,-19.5 191,-0.5 159,-0.5"/>
|
||||
<text text-anchor="middle" x="175" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6->Node7 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.15,-24.69C123.06,-22.1 137.1,-18.76 149.05,-15.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="149.95,-19.31 158.87,-13.59 148.33,-12.5 149.95,-19.31"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.0 KiB After Width: | Height: | Size: 6.3 KiB |
@@ -1,4 +1,6 @@
|
||||
<map id="math/sieve_of_eratosthenes.cpp" name="math/sieve_of_eratosthenes.cpp">
|
||||
<area shape="rect" id="node1" title="Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find t..." alt="" coords="5,5,216,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="75,80,147,107"/>
|
||||
<area shape="rect" id="node1" title="Get list of prime numbers using Sieve of Eratosthenes." alt="" coords="26,5,237,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="191,80,250,107"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
791cb4e5ff70b85cb6b28271313338ec
|
||||
105fbe458d0099695a2fdcc2aff0a6f7
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: math/sieve_of_eratosthenes.cpp Pages: 1 -->
|
||||
<svg width="166pt" height="84pt"
|
||||
viewBox="0.00 0.00 166.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="192pt" height="84pt"
|
||||
viewBox="0.00 0.00 191.50 84.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 80)">
|
||||
<title>math/sieve_of_eratosthenes.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 162,-80 162,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 187.5,-80 187.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find t...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-75.5 158,-75.5 158,-56.5 0,-56.5"/>
|
||||
<text text-anchor="middle" x="79" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/sieve_of_eratosthenes.cpp</text>
|
||||
<g id="a_node1"><a xlink:title="Get list of prime numbers using Sieve of Eratosthenes.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="15.5,-56.5 15.5,-75.5 173.5,-75.5 173.5,-56.5 15.5,-56.5"/>
|
||||
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/sieve_of_eratosthenes.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,16 +22,46 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="52,-0.5 52,-19.5 106,-19.5 106,-0.5 52,-0.5"/>
|
||||
<text text-anchor="middle" x="79" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M79,-56.08C79,-49.01 79,-38.86 79,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="82.5,-29.75 79,-19.75 75.5,-29.75 82.5,-29.75"/>
|
||||
<path fill="none" stroke="midnightblue" d="M83.25,-56.32C72.7,-48.18 56.7,-35.84 44.06,-26.09"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="46.01,-23.17 35.95,-19.83 41.73,-28.71 46.01,-23.17"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
|
||||
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M94.5,-56.08C94.5,-49.01 94.5,-38.86 94.5,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.75 94.5,-19.75 91,-29.75 98,-29.75"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="139.5,-0.5 139.5,-19.5 183.5,-19.5 183.5,-0.5 139.5,-0.5"/>
|
||||
<text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.26,-56.32C115.27,-48.26 130.39,-36.08 142.43,-26.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="144.95,-28.83 150.54,-19.83 140.56,-23.38 144.95,-28.83"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.7 KiB After Width: | Height: | Size: 2.9 KiB |
@@ -117,7 +117,7 @@ Functions</h2></td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Get list of prime numbers. </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="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find t...">sieve_of_eratosthenes.cpp</a> </dd></dl>
|
||||
<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="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Get list of prime numbers using Sieve of Eratosthenes.">sieve_of_eratosthenes.cpp</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -177,7 +177,7 @@ Files</h2></td></tr>
|
||||
<tr class="memdesc:d0/d08/realtime__stats_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute statistics for data entered in rreal-time. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></td></tr>
|
||||
<tr class="memdesc:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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). <br /></td></tr>
|
||||
<tr class="memdesc:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Get list of prime numbers using Sieve of Eratosthenes. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:da/d24/sqrt__double_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></td></tr>
|
||||
<tr class="memdesc:da/d24/sqrt__double_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> of root-finding. <br /></td></tr>
|
||||
|
||||
@@ -154,7 +154,7 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
|
||||
<tr id="row_6_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
|
||||
<tr id="row_6_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
|
||||
<tr id="row_6_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
|
||||
<tr id="row_6_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">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) </td></tr>
|
||||
<tr id="row_6_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes </td></tr>
|
||||
<tr id="row_6_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> of root-finding </td></tr>
|
||||
<tr id="row_6_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
|
||||
<tr id="row_6_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
|
||||
|
||||
@@ -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#ae0de20c22cf2304b1cbe70953d57e7b7">sieve_of_eratosthenes.cpp</a>
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>printArray()
|
||||
: <a class="el" href="d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">heap_sort.cpp</a>
|
||||
|
||||
@@ -131,7 +131,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#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve_of_eratosthenes.cpp</a>
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>SieveOfEratosthenes()
|
||||
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>
|
||||
|
||||
@@ -176,12 +176,13 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
: <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
@@ -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#ae0de20c22cf2304b1cbe70953d57e7b7">sieve_of_eratosthenes.cpp</a>
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>printArray()
|
||||
: <a class="el" href="d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">heap_sort.cpp</a>
|
||||
|
||||
@@ -128,7 +128,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#a1e606c2e5ac180a770ebe0d1706b8ca2">sieve_of_eratosthenes.cpp</a>
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">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>
|
||||
|
||||
@@ -179,12 +179,13 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
: <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
: <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
@@ -109,8 +109,8 @@ var NAVTREEINDEX =
|
||||
"annotated.html",
|
||||
"d4/da0/gcd__iterative__euclidean_8cpp.html",
|
||||
"d7/d77/class_edge.html",
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0",
|
||||
"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0"
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0",
|
||||
"de/d75/qr__eigen__values_8cpp.html"
|
||||
];
|
||||
|
||||
var SYNCONMSG = 'click to disable panel synchronisation';
|
||||
|
||||
@@ -85,8 +85,9 @@ var NAVTREEINDEX2 =
|
||||
"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[7,0,25,4],
|
||||
"d8/dcc/namespacestd.html":[6,0,8],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html":[8,0,6,27],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2":[8,0,6,27,2],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7":[8,0,6,27,1],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9":[8,0,6,27,1],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3":[8,0,6,27,2],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[8,0,6,27,3],
|
||||
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,6,27,0],
|
||||
"d8/dee/avltree_8cpp.html":[8,0,1,1],
|
||||
"d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0":[8,0,1,1,2],
|
||||
@@ -212,9 +213,9 @@ var NAVTREEINDEX2 =
|
||||
"da/d9a/class_graph.html#a61943646676002a5e75f7b6493c25713":[7,0,13,32],
|
||||
"da/d9a/class_graph.html#a6afcd41564ea00294a4c089414979ca1":[7,0,13,40],
|
||||
"da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d":[7,0,13,20],
|
||||
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,13,13],
|
||||
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,13,15],
|
||||
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,13,14],
|
||||
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,13,15],
|
||||
"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,13,13],
|
||||
"da/d9a/class_graph.html#a73268574e2528b8e760191113ef6d1eb":[7,0,13,27],
|
||||
"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[7,0,13,8],
|
||||
"da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1":[7,0,13,21],
|
||||
@@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
|
||||
"da/de7/decimal__to__hexadecimal_8cpp.html":[8,0,8,2],
|
||||
"da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[8,0,8,2,0],
|
||||
"da/df2/durand__kerner__roots_8cpp.html":[8,0,7,2],
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[8,0,7,2,2],
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,7,2,8]
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[8,0,7,2,2]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
var NAVTREEINDEX3 =
|
||||
{
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,7,2,8],
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,7,2,7],
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a212979f5fc9dcf0a420e90b9b21d780a":[8,0,7,2,1],
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740":[8,0,7,2,3],
|
||||
@@ -173,8 +174,8 @@ var NAVTREEINDEX3 =
|
||||
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[7,0,36,3],
|
||||
"dd/d3b/struct_entry.html":[7,0,11],
|
||||
"dd/d3b/struct_entry.html#acef39096ad1bc616755a4c120a713cea":[7,0,11,3],
|
||||
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,0],
|
||||
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,2],
|
||||
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,0],
|
||||
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,1],
|
||||
"dd/d4f/class_solution.html":[7,0,31],
|
||||
"dd/d4f/class_solution.html#a0a92d4ba2a822ae87e4c8a7c321024c0":[7,0,31,7],
|
||||
@@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html":[8,0,13,1],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93":[8,0,13,1,1],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#aa422aab133d4ed5e5d6022a7f701271f":[8,0,13,1,0],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,13,1,2],
|
||||
"de/d75/qr__eigen__values_8cpp.html":[8,0,7,14]
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,13,1,2]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
var NAVTREEINDEX4 =
|
||||
{
|
||||
"de/d75/qr__eigen__values_8cpp.html":[8,0,7,14],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,7,14,6],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,7,14,5],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a33cb0a68c36aa26fd599c7c66da86ed7":[8,0,7,14,1],
|
||||
@@ -74,8 +75,8 @@ var NAVTREEINDEX4 =
|
||||
"functions_func.html":[7,2,1],
|
||||
"functions_rela.html":[7,2,3],
|
||||
"functions_vars.html":[7,2,2],
|
||||
"globals.html":[8,1,0,0],
|
||||
"globals.html":[8,1,0],
|
||||
"globals.html":[8,1,0,0],
|
||||
"globals_a.html":[8,1,0,1],
|
||||
"globals_b.html":[8,1,0,2],
|
||||
"globals_c.html":[8,1,0,3],
|
||||
|
||||
@@ -67,7 +67,7 @@ var searchData=
|
||||
['prime_5fnumbers_2ecpp_1217',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]],
|
||||
['primes_1218',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]],
|
||||
['primes_5fup_5fto_5fbillion_2ecpp_1219',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]],
|
||||
['print_1220',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7',1,'sieve_of_eratosthenes.cpp']]],
|
||||
['print_1220',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'sieve_of_eratosthenes.cpp']]],
|
||||
['printarray_1221',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
|
||||
['printf_1222',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
|
||||
['priority_5fqueue_1223',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue< T >'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]],
|
||||
|
||||
@@ -80,7 +80,7 @@ var searchData=
|
||||
['shrink_5fto_5ffit_1442',['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_1443',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#aedfb88e2d6fff1871f038221fe5870fe',1,'sorting::shuffle()']]],
|
||||
['shuffle_5forder_5fengine_1444',['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_1445',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2',1,'sieve(uint32_t N, bool *isprime): sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp']]],
|
||||
['sieve_1445',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp']]],
|
||||
['sieve_5fof_5feratosthenes_2ecpp_1446',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]],
|
||||
['sieveoferatosthenes_1447',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
|
||||
['sig_5fatomic_5ft_1448',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]],
|
||||
|
||||
@@ -29,7 +29,7 @@ var searchData=
|
||||
['test_5fint_1604',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int(): quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA): shell_sort2.cpp']]],
|
||||
['test_5flamniscate_1605',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]],
|
||||
['test_5fset_1606',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]],
|
||||
['tests_1607',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp']]],
|
||||
['tests_1607',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp']]],
|
||||
['text_5fsearch_2ecpp_1608',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
|
||||
['tgamma_1609',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
|
||||
['th_1610',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
|
||||
|
||||
@@ -47,7 +47,7 @@ var searchData=
|
||||
['prev_5fpermutation_3502',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]],
|
||||
['prime_5ffactorization_3503',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
|
||||
['primes_3504',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]],
|
||||
['print_3505',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae0de20c22cf2304b1cbe70953d57e7b7',1,'sieve_of_eratosthenes.cpp']]],
|
||||
['print_3505',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'sieve_of_eratosthenes.cpp']]],
|
||||
['printarray_3506',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
|
||||
['printf_3507',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
|
||||
['priority_5fqueue_3508',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]],
|
||||
|
||||
@@ -72,7 +72,7 @@ var searchData=
|
||||
['shrink_5fto_5ffit_3680',['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_3681',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#aedfb88e2d6fff1871f038221fe5870fe',1,'sorting::shuffle()']]],
|
||||
['shuffle_5forder_5fengine_3682',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine']]],
|
||||
['sieve_3683',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a1e606c2e5ac180a770ebe0d1706b8ca2',1,'sieve(uint32_t N, bool *isprime): sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp']]],
|
||||
['sieve_3683',['sieve',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp']]],
|
||||
['sieveoferatosthenes_3684',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
|
||||
['signal_3685',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]],
|
||||
['signaling_5fnan_3686',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]],
|
||||
|
||||
@@ -24,7 +24,7 @@ var searchData=
|
||||
['test_5ffunction_3805',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
|
||||
['test_5fint_3806',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int(): quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA): shell_sort2.cpp']]],
|
||||
['test_5flamniscate_3807',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]],
|
||||
['tests_3808',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp']]],
|
||||
['tests_3808',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): miller_rabin.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests(): insertion_sort.cpp']]],
|
||||
['tgamma_3809',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
|
||||
['th_3810',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
|
||||
['thousands_5fsep_3811',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],
|
||||
|
||||
Reference in New Issue
Block a user