Documentation for fb27d4d304

d1/d06/ternary__search_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: search/ternary_search.cpp Pages: 1 -->
 <svg width="140pt" height="83pt"

d1/d06/ternary__search_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: search/ternary_search.cpp Pages: 1 -->
 <svg width="140pt" height="83pt"

d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures::linked_list::list Pages: 1 -->
 <svg width="306pt" height="157pt"

d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures::linked_list::list Pages: 1 -->
 <svg width="306pt" height="157pt"

d1/d1d/pascal__triangle_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/pascal_triangle.cpp Pages: 1 -->
 <svg width="193pt" height="83pt"

d1/d1d/pascal__triangle_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/pascal_triangle.cpp Pages: 1 -->
 <svg width="193pt" height="83pt"

d1/d33/caesar__cipher_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: ciphers/caesar_cipher.cpp Pages: 1 -->
 <svg width="186pt" height="83pt"

d1/d33/caesar__cipher_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: ciphers/caesar_cipher.cpp Pages: 1 -->
 <svg width="186pt" height="83pt"

d1/d3c/queue__using__two__stacks_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures/queue_using_two_stacks.cpp Pages: 1 -->
 <svg width="186pt" height="94pt"

d1/d3c/queue__using__two__stacks_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures/queue_using_two_stacks.cpp Pages: 1 -->
 <svg width="186pt" height="94pt"

d1/d40/longest__increasing__subsequence_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: dynamic_programming/longest_increasing_subsequence.cpp Pages: 1 -->
 <svg width="314pt" height="105pt"

d1/d40/longest__increasing__subsequence_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: dynamic_programming/longest_increasing_subsequence.cpp Pages: 1 -->
 <svg width="314pt" height="105pt"

d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/finding_number_of_digits_in_a_number.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"

d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/finding_number_of_digits_in_a_number.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"

d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/ordinary_least_squares_regressor.cpp Pages: 1 -->
 <svg width="318pt" height="94pt"

d1/d4b/ordinary__least__squares__regressor_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/ordinary_least_squares_regressor.cpp Pages: 1 -->
 <svg width="318pt" height="94pt"

d1/d52/lcm__sum_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/lcm_sum.cpp Pages: 1 -->
 <svg width="252pt" height="83pt"

d1/d52/lcm__sum_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/lcm_sum.cpp Pages: 1 -->
 <svg width="252pt" height="83pt"

d1/d57/classcll__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: cll Pages: 1 -->
 <svg width="96pt" height="174pt"

d1/d57/classcll__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: cll Pages: 1 -->
 <svg width="96pt" height="174pt"

d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: std::is_arithmetic&lt; uint256_t &gt; Pages: 1 -->
 <svg width="99pt" height="94pt"

d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: std::is_arithmetic&lt; uint256_t &gt; Pages: 1 -->
 <svg width="99pt" height="94pt"

d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
 <svg width="117pt" height="122pt"

d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
 <svg width="117pt" height="122pt"

d1/d6c/classstats__computer1__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: stats_computer1&lt; T &gt; Pages: 1 -->
 <svg width="121pt" height="100pt"

d1/d6c/classstats__computer1__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: stats_computer1&lt; T &gt; Pages: 1 -->
 <svg width="121pt" height="100pt"

d1/d6d/lru__cache_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/lru_cache.cpp Pages: 1 -->
 <svg width="339pt" height="83pt"

d1/d6d/lru__cache_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/lru_cache.cpp Pages: 1 -->
 <svg width="339pt" height="83pt"

d1/d6d/queue__using__array_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures/queue_using_array.cpp Pages: 1 -->
 <svg width="181pt" height="94pt"

d1/d6d/queue__using__array_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures/queue_using_array.cpp Pages: 1 -->
 <svg width="181pt" height="94pt"

d1/d6f/vector__ops_8hpp__dep__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/vector_ops.hpp Pages: 1 -->
 <svg width="130pt" height="105pt"

d1/d6f/vector__ops_8hpp__dep__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/vector_ops.hpp Pages: 1 -->
 <svg width="130pt" height="105pt"

d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: graph::LowestCommonAncestor Pages: 1 -->
 <svg width="313pt" height="359pt"

d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: graph::LowestCommonAncestor Pages: 1 -->
 <svg width="313pt" height="359pt"

d1/d73/jarvis__algorithm_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: geometry/jarvis_algorithm.cpp Pages: 1 -->
 <svg width="189pt" height="83pt"

d1/d73/jarvis__algorithm_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: geometry/jarvis_algorithm.cpp Pages: 1 -->
 <svg width="189pt" height="83pt"

d1/d7c/fibonacci__bottom__up_8cpp_source.html

@@ -129,7 +129,7 @@ $(function(){initNavTree('d1/d7c/fibonacci__bottom__up_8cpp_source.html','../../
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    }</div>
 <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">return</span> res[1];</div>
 <div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>}</div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">int</span> n;</div>
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter n: &quot;</span>;</div>
 <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    cin &gt;&gt; n;</div>

d1/d7d/gcd__of__n__numbers_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/gcd_of_n_numbers.cpp Pages: 1 -->
 <svg width="258pt" height="83pt"

d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: math/gcd_of_n_numbers.cpp Pages: 1 -->
 <svg width="258pt" height="83pt"

d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: dynamic_programming/unbounded_0_1_knapsack.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"

d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: dynamic_programming/unbounded_0_1_knapsack.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"

d1/d90/subarray__sum_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: backtracking/subarray_sum.cpp Pages: 1 -->
 <svg width="353pt" height="94pt"

d1/d90/subarray__sum_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: backtracking/subarray_sum.cpp Pages: 1 -->
 <svg width="353pt" height="94pt"

d1/da1/decimal__to__hexadecimal_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/decimal_to_hexadecimal.cpp Pages: 1 -->
 <svg width="180pt" height="83pt"

d1/da1/decimal__to__hexadecimal_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others/decimal_to_hexadecimal.cpp Pages: 1 -->
 <svg width="180pt" height="83pt"

d1/daa/random__pivot__quick__sort_8cpp.html

@@ -163,8 +163,8 @@ Functions</h2></td></tr>
 <tr class="memdesc:a40675d2eb960c71ca31ec475ba90120d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function utility to generate unsorted array of given size and range.  <br /></td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
-<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
-<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
+<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
+<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 </table>
 <a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm. </p>
@@ -289,8 +289,8 @@ template&lt;size_t size&gt; </div>
 </div><!-- fragment -->
 </div>
 </div>
-<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
+<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -298,44 +298,33 @@ template&lt;size_t size&gt; </div>
         <tr>
           <td class="memname">int main </td>
           <td>(</td>
-          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
-        </tr>
-        <tr>
-          <td class="paramkey"></td>
+          <td class="paramtype">void</td>          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
-          <td class="paramtype">char *</td>          <td class="paramname"><span class="paramname"><em>argv</em></span>[]&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>Main function. </p>
-<dl class="params"><dt>Parameters</dt><dd>
-  <table class="params">
-    <tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
-    <tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
-  </table>
-  </dd>
-</dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 
-<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00323">323</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
-<div class="fragment"><div class="line"><span class="lineno">  323</span>                                 {</div>
-<div class="line"><span class="lineno">  324</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
-<div class="line"><span class="lineno">  325</span> </div>
-<div class="line"><span class="lineno">  326</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
-<div class="line"><span class="lineno">  327</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
-<div class="line"><span class="lineno">  328</span>        <a class="code hl_function" href="#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;</a>(</div>
-<div class="line"><span class="lineno">  329</span>            50, 1000);</div>
-<div class="line"><span class="lineno">  330</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><span class="lineno">  331</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(unsorted_array);</div>
-<div class="line"><span class="lineno">  332</span> </div>
-<div class="line"><span class="lineno">  333</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
-<div class="line"><span class="lineno">  334</span>        <a class="code hl_function" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(</div>
-<div class="line"><span class="lineno">  335</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
-<div class="line"><span class="lineno">  336</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><span class="lineno">  337</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(sorted_array);</div>
-<div class="line"><span class="lineno">  338</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><span class="lineno">  339</span>}</div>
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00321">321</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  321</span>           {</div>
+<div class="line"><span class="lineno">  322</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
+<div class="line"><span class="lineno">  323</span> </div>
+<div class="line"><span class="lineno">  324</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
+<div class="line"><span class="lineno">  325</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
+<div class="line"><span class="lineno">  326</span>        <a class="code hl_function" href="#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;</a>(</div>
+<div class="line"><span class="lineno">  327</span>            50, 1000);</div>
+<div class="line"><span class="lineno">  328</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  329</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(unsorted_array);</div>
+<div class="line"><span class="lineno">  330</span> </div>
+<div class="line"><span class="lineno">  331</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
+<div class="line"><span class="lineno">  332</span>        <a class="code hl_function" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(</div>
+<div class="line"><span class="lineno">  333</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
+<div class="line"><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  335</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(sorted_array);</div>
+<div class="line"><span class="lineno">  336</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><span class="lineno">  337</span>}</div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a40675d2eb960c71ca31ec475ba90120d"><div class="ttname"><a href="#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; generateUnsortedArray(int64_t from, int64_t to)</div><div class="ttdoc">A function utility to generate unsorted array of given size and range.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00160">random_pivot_quick_sort.cpp:160</a></div></div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00130">random_pivot_quick_sort.cpp:130</a></div></div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00312">random_pivot_quick_sort.cpp:312</a></div></div>

d1/daa/random__pivot__quick__sort_8cpp.js

@@ -3,7 +3,7 @@ var random__pivot__quick__sort_8cpp =
     [ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ],
     [ "sorting::random_pivot_quick_sort::generateUnsortedArray", "d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d", null ],
     [ "sorting::random_pivot_quick_sort::getRandomIndex", "d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5", null ],
-    [ "main", "d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
+    [ "main", "d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
     [ "sorting::random_pivot_quick_sort::partition", "d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e", null ],
     [ "sorting::random_pivot_quick_sort::quickSortRP", "d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5", null ],
     [ "sorting::random_pivot_quick_sort::showArray", "d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10", null ],

d1/daa/random__pivot__quick__sort_8cpp_source.html

@@ -335,24 +335,24 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
 <div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>}</div>
 </div>
 <div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span></div>
-<div class="foldopen" id="foldopen00323" data-start="{" data-end="}">
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  323</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;</a>(</div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>            50, 1000);</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(unsorted_array);</div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>        <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(sorted_array);</div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>}</div>
+<div class="foldopen" id="foldopen00321" data-start="{" data-end="}">
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  321</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span> </div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;</a>(</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>            50, 1000);</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(unsorted_array);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span> </div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>        <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(sorted_array);</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>}</div>
 </div>
 <div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
 <div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print64_t given message on console.</div><div class="ttdef"><b>Definition</b> <a href="#l00189">random_pivot_quick_sort.cpp:189</a></div></div>
@@ -360,7 +360,6 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
 <div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00259">inorder_successor_of_bst.cpp:259</a></div></div>
 <div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00345">inorder_successor_of_bst.cpp:345</a></div></div>
 <div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="#l00199">random_pivot_quick_sort.cpp:199</a></div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
 <div class="ttc" id="anamespacerandom__pivot__quick__sort_html"><div class="ttname"><a href="../../de/d6b/namespacerandom__pivot__quick__sort.html">random_pivot_quick_sort</a></div><div class="ttdoc">Functions for the Random Pivot Quick Sort implementation.</div></div>
 <div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e">sorting::random_pivot_quick_sort::partition</a></div><div class="ttdeci">std::tuple&lt; int64_t, std::array&lt; int64_t, size &gt; &gt; partition(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">A partition function which handles the partition logic of quick sort.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">random_pivot_quick_sort.cpp:103</a></div></div>
@@ -369,6 +368,7 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00312">random_pivot_quick_sort.cpp:312</a></div></div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aac5657b4fe2251cd21073f44233f6ea5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5">sorting::random_pivot_quick_sort::getRandomIndex</a></div><div class="ttdeci">int64_t getRandomIndex(int64_t start, int64_t end)</div><div class="ttdoc">Takes the start and end indices of an array and returns a random int64_teger between the range of tho...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">random_pivot_quick_sort.cpp:88</a></div></div>
 <div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_ac3281dc34a9cfd7beb332419b8a0aa10"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a></div><div class="ttdeci">void showArray(std::array&lt; int64_t, T &gt; arr)</div><div class="ttdoc">Utility function to print the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00073">random_pivot_quick_sort.cpp:73</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00321">random_pivot_quick_sort.cpp:321</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 </div><!-- container -->

d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: std::is_integral&lt; uint128_t &gt; Pages: 1 -->
 <svg width="146pt" height="83pt"

d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: std::is_integral&lt; uint128_t &gt; Pages: 1 -->
 <svg width="146pt" height="83pt"

d1/db6/boyer__moore_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: strings/boyer_moore.cpp Pages: 1 -->
 <svg width="373pt" height="83pt"

d1/db6/boyer__moore_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: strings/boyer_moore.cpp Pages: 1 -->
 <svg width="373pt" height="83pt"

d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
 <!--zoomable 130 -->

d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
 <svg width="548pt" height="130pt"

d1/dbb/k__nearest__neighbors_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/k_nearest_neighbors.cpp Pages: 1 -->
 <svg width="493pt" height="94pt"

d1/dbb/k__nearest__neighbors_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: machine_learning/k_nearest_neighbors.cpp Pages: 1 -->
 <svg width="493pt" height="94pt"

d1/dbb/n__choose__r_8cpp.html

@@ -142,8 +142,8 @@ Functions</h2></td></tr>
 <tr class="memdesc:a6e2dff75c5de70455b90c799d6ad6967"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is the function implementation of \( \binom{n}{r} \).  <br /></td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test implementations.  <br /></td></tr>
-<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
-<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
+<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
+<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 </table>
 <a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </p>
@@ -152,8 +152,8 @@ Functions</h2></td></tr>
 
 <p class="definition">Definition in file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
 </div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
-<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
+<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -161,31 +161,20 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">int main </td>
           <td>(</td>
-          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
-        </tr>
-        <tr>
-          <td class="paramkey"></td>
+          <td class="paramtype">void</td>          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
-          <td class="paramtype">char *</td>          <td class="paramname"><span class="paramname"><em>argv</em></span>[]&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>Main function. </p>
-<dl class="params"><dt>Parameters</dt><dd>
-  <table class="params">
-    <tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
-    <tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
-  </table>
-  </dd>
-</dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 
-<p class="definition">Definition at line <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
-<div class="fragment"><div class="line"><span class="lineno">   80</span>                                 {</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
-<div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><span class="lineno">   83</span>}</div>
+<p class="definition">Definition at line <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   78</span>           {</div>
+<div class="line"><span class="lineno">   79</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
+<div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><span class="lineno">   81</span>}</div>
 <div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbb/n__choose__r_8cpp_source.html#l00052">n_choose_r.cpp:52</a></div></div>
 </div><!-- fragment -->
 </div>

d1/dbb/n__choose__r_8cpp.js

@@ -1,6 +1,6 @@
 var n__choose__r_8cpp =
 [
-    [ "main", "d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
+    [ "main", "d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
     [ "math::n_choose_r", "dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967", null ],
     [ "test", "d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
 ];

d1/dbb/n__choose__r_8cpp_source.html

@@ -162,14 +162,14 @@ $(function(){initNavTree('d1/dbb/n__choose__r_8cpp_source.html','../../',''); })
 <div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
 </div>
 <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span></div>
-<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   80</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   78</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_function" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
 </div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
 <div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">n_choose_r.cpp:52</a></div></div>
+<div class="ttc" id="an__choose__r_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00078">n_choose_r.cpp:78</a></div></div>
 <div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
 <div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition</b> <a href="#l00035">n_choose_r.cpp:35</a></div></div>
 </div><!-- fragment --></div><!-- contents -->

d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp Pages: 1 -->
 <svg width="191pt" height="105pt"

d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp Pages: 1 -->
 <svg width="191pt" height="105pt"

d1/dc2/class_graph__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: Graph Pages: 1 -->
 <svg width="419pt" height="268pt"

d1/dc2/class_graph__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: Graph Pages: 1 -->
 <svg width="419pt" height="268pt"

d1/dc5/classlarge__number__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: large_number Pages: 1 -->
 <svg width="119pt" height="111pt"

d1/dc5/classlarge__number__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: large_number Pages: 1 -->
 <svg width="119pt" height="111pt"

d1/dce/classuint256__t__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: uint256_t Pages: 1 -->
 <svg width="64pt" height="115pt"

d1/dce/classuint256__t__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: uint256_t Pages: 1 -->
 <svg width="64pt" height="115pt"

d1/dd7/union__of__two__arrays_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: operations_on_datastructures/union_of_two_arrays.cpp Pages: 1 -->
 <svg width="262pt" height="94pt"

d1/dd7/union__of__two__arrays_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: operations_on_datastructures/union_of_two_arrays.cpp Pages: 1 -->
 <svg width="262pt" height="94pt"

d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures::trie_using_hashmap::Trie::Node Pages: 1 -->
 <!--zoomable 101 -->

d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: data_structures::trie_using_hashmap::Trie::Node Pages: 1 -->
 <svg width="532pt" height="101pt"

d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
 <svg width="117pt" height="128pt"

d1/de6/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__inherit__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: range_queries::heavy_light_decomposition::SG&lt; X &gt; Pages: 1 -->
 <svg width="117pt" height="128pt"

d1/ded/windowed__median_8cpp.html

@@ -154,8 +154,8 @@ Typedefs</h2></td></tr>
 Functions</h2></td></tr>
 <tr class="memitem:a6dc652a36ea42ba262c4e4236e3e6601" id="r_a6dc652a36ea42ba262c4e4236e3e6601"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6dc652a36ea42ba262c4e4236e3e6601">test</a> (const std::vector&lt; int &gt; &amp;vals, int windowSize)</td></tr>
 <tr class="memdesc:a6dc652a36ea42ba262c4e4236e3e6601"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
-<tr class="memitem:ac0f2228420376f4db7e1274f2b41667c" id="r_ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
-<tr class="memdesc:ac0f2228420376f4db7e1274f2b41667c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
+<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
+<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 </table>
 <a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>An implementation of a median calculation of a sliding window along a data stream. </p>
@@ -200,8 +200,8 @@ Algorithm</h3>
 </div>
 </div>
 <a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
-<a id="ac0f2228420376f4db7e1274f2b41667c" name="ac0f2228420376f4db7e1274f2b41667c"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#ac0f2228420376f4db7e1274f2b41667c">&#9670;&#160;</a></span>main()</h2>
+<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -209,24 +209,13 @@ Algorithm</h3>
         <tr>
           <td class="memname">int main </td>
           <td>(</td>
-          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
-        </tr>
-        <tr>
-          <td class="paramkey"></td>
+          <td class="paramtype">void</td>          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
-          <td class="paramtype">const char *</td>          <td class="paramname"><span class="paramname"><em>argv</em></span>[]&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>Main function. </p>
-<dl class="params"><dt>Parameters</dt><dd>
-  <table class="params">
-    <tr><td class="paramname">argc</td><td>command line argument count (ignored) </td></tr>
-    <tr><td class="paramname">argv</td><td>command line array of arguments (ignored) </td></tr>
-  </table>
-  </dd>
-</dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 <p>A few fixed test cases</p>
 <p>Array of sorted values; odd window size</p>
@@ -242,41 +231,41 @@ Algorithm</h3>
 <p>Random array values (positive/negative)</p>
 <p>Testing randomized test</p>
 
-<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00198">198</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
-<div class="fragment"><div class="line"><span class="lineno">  198</span>                                       {</div>
-<div class="line"><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  196</span>           {</div>
+<div class="line"><span class="lineno">  198</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<div class="line"><span class="lineno">  199</span>         3);  </div>
+<div class="line"><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
 <div class="line"><span class="lineno">  201</span>         3);  </div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
-<div class="line"><span class="lineno">  203</span>         3);  </div>
-<div class="line"><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
-<div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
-<div class="line"><span class="lineno">  207</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
-<div class="line"><span class="lineno">  208</span>         5);  </div>
-<div class="line"><span class="lineno">  209</span></div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
-<div class="line"><span class="lineno">  214</span>          1115438165, 1784484492, 74243042, 114807987},</div>
-<div class="line"><span class="lineno">  215</span>         6);</div>
-<div class="line"><span class="lineno">  216</span></div>
-<div class="line"><span class="lineno">  218</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
-<div class="line"><span class="lineno">  219</span>    std::vector&lt;int&gt; vals;</div>
-<div class="line"><span class="lineno">  220</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
-<div class="line"><span class="lineno">  221</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
-<div class="line"><span class="lineno">  222</span>            1 + std::rand() /</div>
-<div class="line"><span class="lineno">  223</span>                    ((RAND_MAX + 5u) / 20);  </div>
-<div class="line"><span class="lineno">  224</span>        <span class="keyword">auto</span> windowSize =</div>
-<div class="line"><span class="lineno">  225</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
-<div class="line"><span class="lineno">  226</span>                               10);  </div>
-<div class="line"><span class="lineno">  227</span>        vals.clear();</div>
-<div class="line"><span class="lineno">  228</span>        vals.reserve(n);</div>
-<div class="line"><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">  230</span>            vals.push_back(</div>
-<div class="line"><span class="lineno">  231</span>                rand() - RAND_MAX);  </div>
-<div class="line"><span class="lineno">  232</span>        }</div>
-<div class="line"><span class="lineno">  233</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
-<div class="line"><span class="lineno">  234</span>    }</div>
-<div class="line"><span class="lineno">  235</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><span class="lineno">  236</span>}</div>
+<div class="line"><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
+<div class="line"><span class="lineno">  203</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
+<div class="line"><span class="lineno">  206</span>         5);  </div>
+<div class="line"><span class="lineno">  207</span></div>
+<div class="line"><span class="lineno">  211</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
+<div class="line"><span class="lineno">  212</span>          1115438165, 1784484492, 74243042, 114807987},</div>
+<div class="line"><span class="lineno">  213</span>         6);</div>
+<div class="line"><span class="lineno">  214</span></div>
+<div class="line"><span class="lineno">  216</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
+<div class="line"><span class="lineno">  217</span>    std::vector&lt;int&gt; vals;</div>
+<div class="line"><span class="lineno">  218</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
+<div class="line"><span class="lineno">  219</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
+<div class="line"><span class="lineno">  220</span>            1 + std::rand() /</div>
+<div class="line"><span class="lineno">  221</span>                    ((RAND_MAX + 5u) / 20);  </div>
+<div class="line"><span class="lineno">  222</span>        <span class="keyword">auto</span> windowSize =</div>
+<div class="line"><span class="lineno">  223</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
+<div class="line"><span class="lineno">  224</span>                               10);  </div>
+<div class="line"><span class="lineno">  225</span>        vals.clear();</div>
+<div class="line"><span class="lineno">  226</span>        vals.reserve(n);</div>
+<div class="line"><span class="lineno">  227</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><span class="lineno">  228</span>            vals.push_back(</div>
+<div class="line"><span class="lineno">  229</span>                rand() - RAND_MAX);  </div>
+<div class="line"><span class="lineno">  230</span>        }</div>
+<div class="line"><span class="lineno">  231</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
+<div class="line"><span class="lineno">  232</span>    }</div>
+<div class="line"><span class="lineno">  233</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><span class="lineno">  234</span>}</div>
 <div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
 </div><!-- fragment -->
 </div>

d1/ded/windowed__median_8cpp.js

@@ -1,6 +1,6 @@
 var windowed__median_8cpp =
 [
     [ "probability::windowed_median::WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median" ],
-    [ "main", "d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c", null ],
+    [ "main", "d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
     [ "test", "d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601", null ]
 ];

d1/ded/windowed__median_8cpp_source.html

@@ -227,41 +227,41 @@ $(function(){initNavTree('d1/ded/windowed__median_8cpp_source.html','../../','')
 <div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>}</div>
 </div>
 <div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span></div>
-<div class="foldopen" id="foldopen00198" data-start="{" data-end="}">
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="../../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">  198</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keyword">const</span> <span class="keywordtype">char</span> *argv[]) {</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<div class="foldopen" id="foldopen00196" data-start="{" data-end="}">
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="../../d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  196</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>         3);  </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
 <div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>         3);  </div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>         3);  </div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>         5);  </div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span></div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>          1115438165, 1784484492, 74243042, 114807987},</div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>         6);</div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span></div>
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::vector&lt;int&gt; vals;</div>
-<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>            1 + std::rand() /</div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>                    ((RAND_MAX + 5u) / 20);  </div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <span class="keyword">auto</span> windowSize =</div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>                               10);  </div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        vals.clear();</div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        vals.reserve(n);</div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            vals.push_back(</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                rand() - RAND_MAX);  </div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        }</div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>}</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>         5);  </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>          1115438165, 1784484492, 74243042, 114807987},</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>         6);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    std::vector&lt;int&gt; vals;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            1 + std::rand() /</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>                    ((RAND_MAX + 5u) / 20);  </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        <span class="keyword">auto</span> windowSize =</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>                               10);  </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        vals.clear();</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        vals.reserve(n);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            vals.push_back(</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>                rand() - RAND_MAX);  </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        }</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    }</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>}</div>
 </div>
 <div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></div><div class="ttdoc">A class to calculate the median of a leading sliding window at the back of a stream of integer values...</div><div class="ttdef"><b>Definition</b> <a href="#l00056">windowed_median.cpp:56</a></div></div>
 <div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a3a7f57679e9cd6c9f042dfd0612b2b24"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian::insertToSorted</a></div><div class="ttdeci">void insertToSorted(int value)</div><div class="ttdoc">Inserts a value to a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">windowed_median.cpp:69</a></div></div>
@@ -275,9 +275,9 @@ $(function(){initNavTree('d1/ded/windowed__median_8cpp_source.html','../../','')
 <div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aafda847b152684578dab891e5268d750"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian::_windowSize</a></div><div class="ttdeci">const size_type _windowSize</div><div class="ttdoc">sliding window size</div><div class="ttdef"><b>Definition</b> <a href="#l00057">windowed_median.cpp:57</a></div></div>
 <div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_af544e271ea19a6fd69a6b3ed6816453e"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian::eraseFromSorted</a></div><div class="ttdeci">void eraseFromSorted(int value)</div><div class="ttdoc">Erases a value from a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">windowed_median.cpp:95</a></div></div>
 <div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
 <div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
 <div class="ttc" id="anamespacewindowed__median_html"><div class="ttname"><a href="../../dd/d21/namespacewindowed__median.html">windowed_median</a></div><div class="ttdoc">Functions for the Windowed Median algorithm implementation.</div></div>
+<div class="ttc" id="awindowed__median_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00196">windowed_median.cpp:196</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 </div><!-- container -->

d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: backtracking::generate_parentheses Pages: 1 -->
 <svg width="132pt" height="251pt"

d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: backtracking::generate_parentheses Pages: 1 -->
 <svg width="132pt" height="251pt"

d1/df6/bidirectional__dijkstra_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: graph/bidirectional_dijkstra.cpp Pages: 1 -->
 <svg width="427pt" height="94pt"

d1/df6/bidirectional__dijkstra_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: graph/bidirectional_dijkstra.cpp Pages: 1 -->
 <svg width="427pt" height="94pt"

d1/df9/qr__decomposition_8cpp__incl.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: numerical_methods/qr_decomposition.cpp Pages: 1 -->
 <svg width="459pt" height="149pt"

d1/df9/qr__decomposition_8cpp__incl_org.svg

@@ -1,7 +1,7 @@
 <?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 13.1.1 (20250719.2154)
+<!-- Generated by graphviz version 13.1.2 (20250808.2320)
  -->
 <!-- Title: numerical_methods/qr_decomposition.cpp Pages: 1 -->
 <svg width="459pt" height="149pt"