Documentation for 0f8d1ab

d6/d2c/caesar__cipher_8cpp.html

@@ -408,7 +408,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6
 <div class="ttc" id="anamespacestring__search_html_aeb2cd81064717aedd62bfb096b1a73d8"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">string_search::brute_force</a></div><div class="ttdeci">int brute_force(const std::string &amp;text, const std::string &amp;pattern)</div><div class="ttdef"><b>Definition:</b> brute_force_string_searching.cpp:21</div></div>
 <div class="ttc" id="abuzz__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> buzz_number.cpp:9</div></div>
 <div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:81</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:80</div></div>
 <div class="ttc" id="afibonacci__search_8cpp_html_a0bc61b3903d9a53061bf31e5d110fe61"><div class="ttname"><a href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a></div><div class="ttdeci">int fibonacci_search(const std::vector&lt; int &gt; &amp;arr, int value)</div><div class="ttdoc">using fibonacci search algorithm finds an index of a given element in a sorted array</div><div class="ttdef"><b>Definition:</b> fibonacci_search.cpp:23</div></div>
 <div class="ttc" id="anamespaceqr__algorithm_html"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a></div><div class="ttdoc">Functions to compute QR decomposition of any rectangular matrix.</div></div>
 <div class="ttc" id="aclass_fenwick_tree_html_aaae15ea71455315e257baa11017cec10"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html#aaae15ea71455315e257baa11017cec10">FenwickTree::offset</a></div><div class="ttdeci">int offset(int x)</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:22</div></div>
@@ -425,7 +425,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6
 <div class="ttc" id="anamespaceqr__algorithm_html_a763896dbb4a7e95c4a1e614ac0819d66"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a763896dbb4a7e95c4a1e614ac0819d66">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt;&gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:98</div></div>
 <div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
 <div class="ttc" id="anamespacestring__search_html_aed769d565b705a9b3e0eb1ec74088893"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">string_search::recalculate_hash</a></div><div class="ttdeci">int64_t recalculate_hash(const std::string &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:42</div></div>
-<div class="ttc" id="anamespacerange__queries_html_ab559cdebcd43619f124bf76caca4c562"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#ab559cdebcd43619f124bf76caca4c562">range_queries::computeLogs</a></div><div class="ttdeci">std::vector&lt; int &gt; computeLogs(int n)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:30</div></div>
+<div class="ttc" id="anamespacerange__queries_html_ab559cdebcd43619f124bf76caca4c562"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#ab559cdebcd43619f124bf76caca4c562">range_queries::computeLogs</a></div><div class="ttdeci">std::vector&lt; int &gt; computeLogs(int n)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:29</div></div>
 <div class="ttc" id="asmallest__circle_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:198</div></div>
 <div class="ttc" id="ashell__sort2_8cpp_html_a895b313cb2671e8f712040460325573e"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">test_int</a></div><div class="ttdeci">void test_int(const int NUM_DATA)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:105</div></div>
 <div class="ttc" id="apascal__triangle_8cpp_html_afd3f52dd56ddedbf7af5d26a202a199e"><div class="ttname"><a href="../../dc/d1a/pascal__triangle_8cpp.html#afd3f52dd56ddedbf7af5d26a202a199e">pascal_triangle</a></div><div class="ttdeci">int ** pascal_triangle(int **arr, int n)</div><div class="ttdef"><b>Definition:</b> pascal_triangle.cpp:36</div></div>
@@ -464,7 +464,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6
 <div class="ttc" id="atower__of__hanoi_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:65</div></div>
 <div class="ttc" id="anamespacesorting_html_a140d913e42fb94176a0b2c8b29a80420"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a></div><div class="ttdeci">void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)</div><div class="ttdoc">bottom-up merge sort which sorts elements in a non-decreasing order</div><div class="ttdef"><b>Definition:</b> non_recursive_merge_sort.cpp:25</div></div>
 <div class="ttc" id="amatrix__exponentiation_8cpp_html_ae1d1ec9482079231e898236e2b23c9ba"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba">ll</a></div><div class="ttdeci">#define ll</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:33</div></div>
-<div class="ttc" id="anamespacerange__queries_html_a8fe01264aafdedd47595b9567a34d782"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#a8fe01264aafdedd47595b9567a34d782">range_queries::getMinimum</a></div><div class="ttdeci">int getMinimum(int beg, int end, const std::vector&lt; int &gt; &amp;logs, const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;table)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:71</div></div>
+<div class="ttc" id="anamespacerange__queries_html_a8fe01264aafdedd47595b9567a34d782"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#a8fe01264aafdedd47595b9567a34d782">range_queries::getMinimum</a></div><div class="ttdeci">int getMinimum(int beg, int end, const std::vector&lt; int &gt; &amp;logs, const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;table)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:70</div></div>
 <div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/erase.html">std::string::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
 <div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="abinomial__dist_8cpp_html_af09e51f513cee647d41192ab0a872cdc"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a></div><div class="ttdeci">double binomial_standard_deviation(double n, double p)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:36</div></div>
@@ -485,7 +485,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6
 <div class="ttc" id="astructlist_html_aaab2e33bc1ca6f44e72239bfb58f100c"><div class="ttname"><a href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">list::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value for node</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:30</div></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="anamespacerange__queries_html_ab5bca344e8d5417a19799c0a39b391e3"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#ab5bca344e8d5417a19799c0a39b391e3">range_queries::buildTable</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; buildTable(int n, const std::vector&lt; int &gt; &amp;A, const std::vector&lt; int &gt; &amp;logs)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:46</div></div>
+<div class="ttc" id="anamespacerange__queries_html_ab5bca344e8d5417a19799c0a39b391e3"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html#ab5bca344e8d5417a19799c0a39b391e3">range_queries::buildTable</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; buildTable(int n, const std::vector&lt; int &gt; &amp;A, const std::vector&lt; int &gt; &amp;logs)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:45</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&lt; Point &gt; &amp;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&lt; bool &gt; &amp;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>