Documentation for c26eea874d

2026-03-30 16:51:57 +08:00 · 2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
--- a/d9/dfd/circularqueueusinglinkedlist_8cpp_source.html
+++ b/d9/dfd/circularqueueusinglinkedlist_8cpp_source.html
@@ -4,7 +4,7 @@
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
-<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="generator" content="Doxygen 1.13.2"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>TheAlgorithms/C++: data_structures/circular_queue_using_linked_list.cpp Source File</title>
 <link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.12.0 -->
+<!-- Generated by Doxygen 1.13.2 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
 var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -128,18 +128,18 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
 <div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
 <div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
 <div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span>    <span class="keywordtype">int</span> data;</div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* next;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keyword">struct </span><a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* next;</div>
 <div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>};</div>
 <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">class </span><a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> {</div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* front = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* rear = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* front = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* rear = <span class="keyword">nullptr</span>;</div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
-<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp;) = <span class="keyword">delete</span>;</div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    Queue(<span class="keyword">const</span> Queue&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    Queue&amp; operator=(<span class="keyword">const</span> Queue&amp;) = <span class="keyword">delete</span>;</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="keyword">public</span>:</div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>() = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">~Queue</a>() {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    Queue() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    ~Queue() {</div>
 <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordflow">while</span> (front) {</div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>            dequeue();</div>
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        }</div>
@@ -159,7 +159,7 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
 <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span> || rear == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            createNode(val);</div>
 <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            nn-&gt;data = val;</div>
 <div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            rear-&gt;next = nn;</div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            nn-&gt;next = front;</div>
@@ -170,7 +170,7 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* <span class="keyword">const</span> n = front;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keyword">const</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* <span class="keyword">const</span> n = front;</div>
 <div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">if</span> (front == rear) {</div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            front = <span class="keyword">nullptr</span>;</div>
 <div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            rear = <span class="keyword">nullptr</span>;</div>
@@ -184,7 +184,7 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
 <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* ptr = front;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keyword">const</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>* ptr = front;</div>
 <div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">do</span> {</div>
 <div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            std::cout &lt;&lt; ptr-&gt;data &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            ptr = ptr-&gt;next;</div>
@@ -216,7 +216,7 @@ $(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_sourc
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>circular_queue_using_linked_list.cpp</b></li>
-    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
  </ul>
 </div>
 </body>
--- a/d9/dfd/comb__sort_8cpp.html
+++ b/d9/dfd/comb__sort_8cpp.html
@@ -4,7 +4,7 @@
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
-<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="generator" content="Doxygen 1.13.2"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>TheAlgorithms/C++: sorting/comb_sort.cpp File Reference</title>
 <link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.12.0 -->
+<!-- Generated by Doxygen 1.13.2 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
 var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -203,14 +203,14 @@ Functions</h2></td></tr>
 <p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                      {</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">int</span> gap = r;</div>
-<div class="line"><span class="lineno">   52</span> </div>
+<div class="line"><span class="lineno">   52</span></div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">   55</span> </div>
+<div class="line"><span class="lineno">   55</span></div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">while</span> (gap != 1 || swapped) {</div>
 <div class="line"><span class="lineno">   59</span>        gap = <a class="code hl_function" href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>        swapped = <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">   62</span> </div>
+<div class="line"><span class="lineno">   62</span></div>
 <div class="line"><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i &lt; r - gap; ++i) {</div>
 <div class="line"><span class="lineno">   65</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + gap]) {</div>
 <div class="line"><span class="lineno">   66</span>                std::swap(arr[i], arr[i + gap]);</div>
@@ -275,7 +275,7 @@ Functions</h2></td></tr>
 <p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>           {</div>
 <div class="line"><span class="lineno">   90</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
-<div class="line"><span class="lineno">   91</span> </div>
+<div class="line"><span class="lineno">   91</span></div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordtype">int</span> n;</div>
 <div class="line"><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
@@ -313,7 +313,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   76</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
 <div class="line"><span class="lineno">   77</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
 <div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   79</span> </div>
+<div class="line"><span class="lineno">   79</span></div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
 <div class="line"><span class="lineno">   83</span>    assert(std::is_sorted(arr2, arr2 + 8));</div>
@@ -328,7 +328,7 @@ Functions</h2></td></tr>
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></li>
-    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
  </ul>
 </div>
 </body>
--- a/d9/dfd/comb__sort_8cpp_source.html
+++ b/d9/dfd/comb__sort_8cpp_source.html
@@ -4,7 +4,7 @@
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
-<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="generator" content="Doxygen 1.13.2"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>TheAlgorithms/C++: sorting/comb_sort.cpp Source File</title>
 <link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.12.0 -->
+<!-- Generated by Doxygen 1.13.2 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
 var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -124,11 +124,12 @@ $(function(){initNavTree('d9/dfd/comb__sort_8cpp_source.html','../../'); initRes
  <div class="headertitle"><div class="title">comb_sort.cpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d9/dfd/comb__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<a href="../../d9/dfd/comb__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span></div>
 <div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
 <div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(<span class="keywordtype">int</span> gap) {</div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    gap = (gap * 10) / 13;</div>
@@ -136,18 +137,18 @@ $(function(){initNavTree('d9/dfd/comb__sort_8cpp_source.html','../../'); initRes
 <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> std::max(1, gap);</div>
 <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
 </div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span></div>
 <div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">   42</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(<span class="keywordtype">int</span> *arr, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
 <div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> gap = r;</div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span></div>
 <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span></div>
 <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">while</span> (gap != 1 || swapped) {</div>
 <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        gap = <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
 <div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
 <div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        swapped = <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span></div>
 <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i &lt; r - gap; ++i) {</div>
 <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + gap]) {</div>
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                std::swap(arr[i], arr[i + gap]);</div>
@@ -164,18 +165,18 @@ $(function(){initNavTree('d9/dfd/comb__sort_8cpp_source.html','../../'); initRes
 <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
 <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span></div>
 <div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
 <div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
 <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(std::is_sorted(arr2, arr2 + 8));</div>
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n&quot;</span>;</div>
 <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
 </div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span></div>
 <div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
 <div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   88</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span></div>
 <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordtype">int</span> n;</div>
 <div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
@@ -196,7 +197,7 @@ $(function(){initNavTree('d9/dfd/comb__sort_8cpp_source.html','../../'); initRes
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></li>
-    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
  </ul>
 </div>
 </body>
--- a/d9/dfd/primesupto__billion_8cpp__incl.svg
+++ b/d9/dfd/primesupto__billion_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 12.2.0 (20241103.1931)
+<!-- Generated by graphviz version 12.2.1 (20241206.2353)
 -->
 <!-- Title: math/primes_up_to_billion.cpp Pages: 1 -->
 <svg width="156pt" height="83pt"
--- a/d9/dfd/primesupto__billion_8cpp__incl_org.svg
+++ b/d9/dfd/primesupto__billion_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 12.2.0 (20241103.1931)
+<!-- Generated by graphviz version 12.2.1 (20241206.2353)
 -->
 <!-- Title: math/primes_up_to_billion.cpp Pages: 1 -->
 <svg width="156pt" height="83pt"
--- a/d9/dfd/uint128__t_8hpp__incl.svg
+++ b/d9/dfd/uint128__t_8hpp__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 12.2.0 (20241103.1931)
+<!-- Generated by graphviz version 12.2.1 (20241206.2353)
 -->
 <!-- Title: ciphers/uint128_t.hpp Pages: 1 -->
 <svg width="313pt" height="83pt"
--- a/d9/dfd/uint128__t_8hpp__incl_org.svg
+++ b/d9/dfd/uint128__t_8hpp__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 12.2.0 (20241103.1931)
+<!-- Generated by graphviz version 12.2.1 (20241206.2353)
 -->
 <!-- Title: ciphers/uint128_t.hpp Pages: 1 -->
 <svg width="313pt" height="83pt"