backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-17 12:02:22 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 8b1eab204b

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:43:05 +00:00
parent 4fb6e622e9
commit a7bccf7d01
6732 changed files with 153919 additions and 365711 deletions
Download Patch File Download Diff File Expand all files Collapse all files

119
dd/da8/pigeonhole__sort_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/pigeonhole_sort.cpp File Reference</title>
<title>TheAlgorithms/C++: sorting/pigeonhole_sort.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -122,7 +139,9 @@ Include dependency graph for pigeonhole_sort.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d28/pigeonhole__sort_8cpp__incl.svg" width="344" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
</div>
<p><a href="../../dd/da8/pigeonhole__sort_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -131,8 +150,8 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; arr)</td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a> (std::array&lt; int, N &gt; arr)</td></tr>
<tr class="separator:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a34b8683a2b429de5cce57e6d733ec817" id="r_a34b8683a2b429de5cce57e6d733ec817"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a> ()</td></tr>
<tr class="separator:a34b8683a2b429de5cce57e6d733ec817"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Lownish" target="_blank">Lownish</a></dd></dl>
<p>Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.</p>
<p>The time Complexity of the algorithm is \(O(n+N)\). </p>
<p class="definition">Definition in file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,6 +185,8 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00127">127</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 127</span> {</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_function" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_function" href="#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
@@ -171,15 +194,10 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 131</span> </div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 133</span>}</div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:68</div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:88</div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:109</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="518" height="391"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00068">pigeonhole_sort.cpp:68</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00088">pigeonhole_sort.cpp:88</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00109">pigeonhole_sort.cpp:109</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a34b8683a2b429de5cce57e6d733ec817" name="a34b8683a2b429de5cce57e6d733ec817"></a>
@@ -205,33 +223,24 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>Test function 1 with unsorted array {8, 3, 2, 7, 4, 6, 8} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 68</span> {</div>
<div class="line"><span class="lineno"> 69</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 7;</div>
<div class="line"><span class="lineno"> 70</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {8, 3, 2, 7, 4, 6, 8};</div>
<div class="line"><span class="lineno"> 70</span> std::array&lt;int, n&gt; test_array = {8, 3, 2, 7, 4, 6, 8};</div>
<div class="line"><span class="lineno"> 71</span> </div>
<div class="line"><span class="lineno"> 72</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
<div class="line"><span class="lineno"> 74</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><span class="lineno"> 75</span> </div>
<div class="line"><span class="lineno"> 76</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 78</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 79</span> }</div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 80</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 81</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
<div class="ttc" id="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:34</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00034">pigeonhole_sort.cpp:34</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a458410412185a5f09199deaff7157a8d" name="a458410412185a5f09199deaff7157a8d"></a>
@@ -257,27 +266,24 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>Test function 2 with unsorted array {802, 630, 20, 745, 52, 300, 612, 932, 78, 187} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 88</span> {</div>
<div class="line"><span class="lineno"> 89</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 10;</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {802, 630, 20, 745, 52,</div>
<div class="line"><span class="lineno"> 90</span> std::array&lt;int, n&gt; test_array = {802, 630, 20, 745, 52,</div>
<div class="line"><span class="lineno"> 91</span> 300, 612, 932, 78, 187};</div>
<div class="line"><span class="lineno"> 92</span> </div>
<div class="line"><span class="lineno"> 93</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><span class="lineno"> 94</span> </div>
<div class="line"><span class="lineno"> 95</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
<div class="line"><span class="lineno"> 95</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><span class="lineno"> 96</span> </div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 99</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 101</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 102</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
<a id="af31ec5409537703d9c8a47350386b32a" name="af31ec5409537703d9c8a47350386b32a"></a>
@@ -303,26 +309,23 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>Test function 1 with unsorted array {11,13,12,14} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 109</span> {</div>
<div class="line"><span class="lineno"> 110</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
<div class="line"><span class="lineno"> 111</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {11, 13, 12, 14};</div>
<div class="line"><span class="lineno"> 111</span> std::array&lt;int, n&gt; test_array = {11, 13, 12, 14};</div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
<div class="line"><span class="lineno"> 115</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><span class="lineno"> 116</span> </div>
<div class="line"><span class="lineno"> 117</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 119</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 120</span> }</div>
<div class="line"><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 121</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 122</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

19
dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
View File

@@ -1,19 +0,0 @@
<map id="test_1" name="test_1">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
</map>

1
dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
View File

@@ -1 +0,0 @@
36e07af770e6c43e397474e3904488a7

191
dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
View File

@@ -1,191 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_1 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_1</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.2 KiB

165
dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
View File

@@ -1,165 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_1 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_1</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.5 KiB

19
dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
View File

@@ -1,19 +0,0 @@
<map id="test_2" name="test_2">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
</map>

1
dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
View File

@@ -1 +0,0 @@
8152176e7427c6c5bdcca041f6e318cf

191
dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
View File

@@ -1,191 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_2 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_2</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.2 KiB

165
dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
View File

@@ -1,165 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_2 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_2</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.5 KiB

35
dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,35 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,182,55,208"/>
<area shape="rect" id="Node000002" href="$dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="103,231,160,257"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,204,91,221,88,226,54,209"/>
<area shape="rect" id="Node000010" href="$dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="103,182,160,208"/>
<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="55,192,87,192,87,197,55,197"/>
<area shape="rect" id="Node000011" href="$dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="103,107,160,133"/>
<area shape="poly" id="edge17_Node000001_Node000011" title=" " alt="" coords="47,179,99,140,102,144,51,184"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="226,131,321,157"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="150,228,239,164,243,168,153,233"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="410,334,488,360"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,257,147,281,162,311,182,341,209,363,232,373,257,379,308,381,357,374,400,362,401,368,358,379,308,387,256,384,231,378,207,368,178,344,157,314,142,283,134,258"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="415,185,483,210"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="160,237,399,202,400,207,161,243"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="223,82,323,108"/>
<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,229,158,219,173,191,179,166,187,142,206,117,209,114,212,118,210,121,192,144,184,168,177,193,162,222,152,233"/>
<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="208,283,338,309"/>
<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="161,252,223,275,221,280,160,257"/>
<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="321,307,396,329,394,334,320,312"/>
<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="303,281,337,262,360,241,385,221,399,213,402,217,388,225,364,245,340,266,306,285"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="386,235,512,261"/>
<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="322,280,384,263,386,268,324,285"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="388,285,510,310"/>
<area shape="poly" id="edge10_Node000007_Node000009" title=" " alt="" coords="339,294,373,294,373,299,339,299"/>
<area shape="poly" id="edge12_Node000010_Node000003" title=" " alt="" coords="160,182,220,160,222,165,161,187"/>
<area shape="poly" id="edge13_Node000010_Node000004" title=" " alt="" coords="152,206,162,217,177,247,183,274,190,298,197,308,209,319,254,341,302,352,351,355,394,353,394,358,351,360,301,357,252,346,207,324,193,312,185,300,177,275,172,249,158,220,148,210"/>
<area shape="poly" id="edge14_Node000010_Node000005" title=" " alt="" coords="161,192,400,194,400,200,161,198"/>
<area shape="poly" id="edge15_Node000010_Node000006" title=" " alt="" coords="141,180,168,149,206,117,213,112,216,117,210,121,172,152,145,184"/>
<area shape="poly" id="edge16_Node000010_Node000007" title=" " alt="" coords="152,206,243,272,240,276,149,210"/>
<area shape="poly" id="edge18_Node000011_Node000003" title=" " alt="" coords="161,122,210,131,209,136,160,127"/>
<area shape="poly" id="edge19_Node000011_Node000004" title=" " alt="" coords="145,105,172,84,207,67,245,55,277,47,308,49,340,67,365,96,375,127,376,159,371,191,365,223,363,256,369,289,388,321,398,330,394,334,384,324,364,290,358,256,360,223,365,190,370,158,370,128,360,99,337,71,306,54,277,52,246,60,209,72,175,88,148,109"/>
<area shape="poly" id="edge20_Node000011_Node000005" title=" " alt="" coords="136,105,162,63,182,40,207,23,242,8,274,3,305,8,340,23,360,37,378,54,407,93,428,133,442,169,437,171,423,136,403,95,374,57,357,41,337,28,303,13,274,8,244,13,209,28,185,44,166,66,141,108"/>
<area shape="poly" id="edge21_Node000011_Node000006" title=" " alt="" coords="160,112,207,104,208,109,161,118"/>
<area shape="poly" id="edge22_Node000011_Node000007" title=" " alt="" coords="145,132,254,269,250,272,141,135"/>
</map>

1
dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
8c5e697481dbacd4b478821c96588c39

335
dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,335 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="388pt" height="293pt"
viewBox="0.00 0.00 387.75 292.76" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 288.76)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="37,-152.34 0,-152.34 0,-133.09 37,-133.09 37,-152.34"/>
<text text-anchor="middle" x="18.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-115.34 73,-115.34 73,-96.09 116,-96.09 116,-115.34"/>
<text text-anchor="middle" x="94.5" y="-101.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.41,-133.76C45.14,-129.89 54.39,-125.27 63.13,-120.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-124.04 72.05,-116.44 61.54,-117.78 64.67,-124.04"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-152.34 73,-152.34 73,-133.09 116,-133.09 116,-152.34"/>
<text text-anchor="middle" x="94.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node10 -->
<g id="edge11_Node000001_Node000010" class="edge">
<title>Node1&#45;&gt;Node10</title>
<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.41,-142.71C44.54,-142.71 52.97,-142.71 61.1,-142.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-146.21 71.09,-142.71 61.09,-139.21 61.09,-146.21"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-208.34 73,-208.34 73,-189.09 116,-189.09 116,-208.34"/>
<text text-anchor="middle" x="94.5" y="-194.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node11 -->
<g id="edge17_Node000001_Node000011" class="edge">
<title>Node1&#45;&gt;Node11</title>
<g id="a_edge17_Node000001_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.73,-152.72C43.46,-160.85 58.82,-172.47 71.42,-182"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.09,-184.63 79.18,-187.87 73.32,-179.05 69.09,-184.63"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="236.62,-190.34 165.12,-190.34 165.12,-171.09 236.62,-171.09 236.62,-190.34"/>
<text text-anchor="middle" x="200.88" y="-176.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.58,-115.83C126.79,-128.2 156.17,-149.31 176.73,-164.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="174.63,-166.88 184.79,-169.88 178.71,-161.2 174.63,-166.88"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="362.12,-38.34 303.38,-38.34 303.38,-19.09 362.12,-19.09 362.12,-38.34"/>
<text text-anchor="middle" x="332.75" y="-24.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.2,-95.68C104.12,-75.91 120.31,-32.34 152,-14.71 196.94,10.28 258.23,-2.57 296.37,-14.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.93,-18.19 305.52,-18.12 297.2,-11.57 294.93,-18.19"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="358.38,-150.34 307.12,-150.34 307.12,-131.09 358.38,-131.09 358.38,-150.34"/>
<text text-anchor="middle" x="332.75" y="-136.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.47,-108.82C156.82,-114.8 245.72,-127.97 295.74,-135.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.07,-138.82 305.48,-136.82 296.1,-131.89 295.07,-138.82"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.5,-227.34 163.25,-227.34 163.25,-208.09 238.5,-208.09 238.5,-227.34"/>
<text text-anchor="middle" x="200.88" y="-213.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.44,-115.63C111.14,-118.09 113.83,-120.84 116,-123.71 138.51,-153.55 124.5,-174.4 152,-199.71 152.64,-200.3 153.29,-200.87 153.97,-201.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.02,-204.32 162.32,-206.78 155.8,-198.43 152.02,-204.32"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="249.75,-76.34 152,-76.34 152,-57.09 249.75,-57.09 249.75,-76.34"/>
<text text-anchor="middle" x="200.88" y="-62.84" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-97.91C129.62,-92.97 147.13,-86.42 162.7,-80.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.53,-84.03 171.67,-77.25 161.08,-77.47 163.53,-84.03"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge7_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M236.34,-56.63C253.56,-51.59 274.47,-45.47 292.33,-40.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.2,-43.64 301.82,-37.47 291.24,-36.92 293.2,-43.64"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge8_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.44,-76.61C232.65,-80.58 241.86,-85.45 249.75,-90.71 267.32,-102.42 267.76,-110.65 285.75,-121.71 289.09,-123.77 292.69,-125.69 296.36,-127.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.74,-130.58 305.3,-131.44 297.59,-124.18 294.74,-130.58"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="379.75,-112.34 285.75,-112.34 285.75,-93.09 379.75,-93.09 379.75,-112.34"/>
<text text-anchor="middle" x="332.75" y="-98.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge9_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M238.4,-76.84C252.77,-80.82 269.45,-85.44 284.7,-89.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.47,-92.96 294.04,-92.26 285.34,-86.22 283.47,-92.96"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="378.25,-75.34 287.25,-75.34 287.25,-56.09 378.25,-56.09 378.25,-75.34"/>
<text text-anchor="middle" x="332.75" y="-61.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge10_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge10_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M250.24,-66.34C258.47,-66.28 267.08,-66.21 275.49,-66.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-69.65 285.27,-66.07 275.25,-62.65 275.3,-69.65"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node3 -->
<g id="edge12_Node000010_Node000003" class="edge">
<title>Node10&#45;&gt;Node3</title>
<g id="a_edge12_Node000010_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-150.31C129.3,-155.02 146.29,-161.2 161.57,-166.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.29,-170.03 170.89,-170.16 162.69,-163.45 160.29,-170.03"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node4 -->
<g id="edge13_Node000010_Node000004" class="edge">
<title>Node10&#45;&gt;Node4</title>
<g id="a_edge13_Node000010_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.45,-132.8C111.15,-130.35 113.84,-127.59 116,-124.71 138.68,-94.5 121.24,-69.64 152,-47.71 192.73,-18.68 252.42,-18.43 291.67,-22.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="291.07,-25.84 301.41,-23.51 291.87,-18.88 291.07,-25.84"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node5 -->
<g id="edge14_Node000010_Node000005" class="edge">
<title>Node10&#45;&gt;Node5</title>
<g id="a_edge14_Node000010_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.47,-142.54C156.82,-142.19 245.72,-141.44 295.74,-141.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.49,-144.52 305.46,-140.94 295.43,-137.52 295.49,-144.52"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node6 -->
<g id="edge15_Node000010_Node000006" class="edge">
<title>Node10&#45;&gt;Node6</title>
<g id="a_edge15_Node000010_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.91,-152.45C112.86,-164.94 131.65,-186.53 152,-199.71 153.61,-200.76 155.3,-201.76 157.03,-202.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-205.8 165.91,-206.98 158.42,-199.49 155.38,-205.8"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node7 -->
<g id="edge16_Node000010_Node000007" class="edge">
<title>Node10&#45;&gt;Node7</title>
<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.15,-132.78C126.41,-120.2 156.4,-98.37 177.15,-83.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-86.26 185,-77.54 174.86,-80.6 178.98,-86.26"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node3 -->
<g id="edge18_Node000011_Node000003" class="edge">
<title>Node11&#45;&gt;Node3</title>
<g id="a_edge18_Node000011_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-195.11C127.05,-193.27 140.49,-190.95 153.46,-188.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-192.19 163.16,-187.04 152.71,-185.3 153.9,-192.19"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node4 -->
<g id="edge19_Node000011_Node000004" class="edge">
<title>Node11&#45;&gt;Node4</title>
<g id="a_edge19_Node000011_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-208.76C116.8,-218.07 134.14,-231.26 152,-236.71 193.55,-249.39 216.29,-264.43 249.75,-236.71 315.94,-181.89 230.87,-112.86 285.75,-46.71 287.85,-44.18 290.36,-42 293.11,-40.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-43.32 301.77,-35.56 291.29,-37.12 294.55,-43.32"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node5 -->
<g id="edge20_Node000011_Node000005" class="edge">
<title>Node11&#45;&gt;Node5</title>
<g id="a_edge20_Node000011_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.82,-208.62C107.55,-224.93 125.47,-256.92 152,-269.71 191.13,-288.58 211.67,-290.63 249.75,-269.71 291.86,-246.58 315.42,-191.64 325.61,-161.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="328.93,-162.57 328.61,-151.98 322.25,-160.46 328.93,-162.57"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node6 -->
<g id="edge21_Node000011_Node000006" class="edge">
<title>Node11&#45;&gt;Node6</title>
<g id="a_edge21_Node000011_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-202.51C126.57,-204.37 139.31,-206.69 151.74,-208.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-212.38 161.5,-210.73 152.28,-205.49 151.03,-212.38"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node7 -->
<g id="edge22_Node000011_Node000007" class="edge">
<title>Node11&#45;&gt;Node7</title>
<g id="a_edge22_Node000011_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.35,-188.79C120.65,-166.91 162.33,-114.19 184.85,-85.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.54,-87.95 191,-77.94 182.05,-83.61 187.54,-87.95"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 15 KiB

309
dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,309 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="388pt" height="293pt"
viewBox="0.00 0.00 387.75 292.76" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 288.76)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="37,-152.34 0,-152.34 0,-133.09 37,-133.09 37,-152.34"/>
<text text-anchor="middle" x="18.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-115.34 73,-115.34 73,-96.09 116,-96.09 116,-115.34"/>
<text text-anchor="middle" x="94.5" y="-101.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.41,-133.76C45.14,-129.89 54.39,-125.27 63.13,-120.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-124.04 72.05,-116.44 61.54,-117.78 64.67,-124.04"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-152.34 73,-152.34 73,-133.09 116,-133.09 116,-152.34"/>
<text text-anchor="middle" x="94.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node10 -->
<g id="edge11_Node000001_Node000010" class="edge">
<title>Node1&#45;&gt;Node10</title>
<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.41,-142.71C44.54,-142.71 52.97,-142.71 61.1,-142.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-146.21 71.09,-142.71 61.09,-139.21 61.09,-146.21"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="116,-208.34 73,-208.34 73,-189.09 116,-189.09 116,-208.34"/>
<text text-anchor="middle" x="94.5" y="-194.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node11 -->
<g id="edge17_Node000001_Node000011" class="edge">
<title>Node1&#45;&gt;Node11</title>
<g id="a_edge17_Node000001_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.73,-152.72C43.46,-160.85 58.82,-172.47 71.42,-182"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.09,-184.63 79.18,-187.87 73.32,-179.05 69.09,-184.63"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="236.62,-190.34 165.12,-190.34 165.12,-171.09 236.62,-171.09 236.62,-190.34"/>
<text text-anchor="middle" x="200.88" y="-176.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.58,-115.83C126.79,-128.2 156.17,-149.31 176.73,-164.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="174.63,-166.88 184.79,-169.88 178.71,-161.2 174.63,-166.88"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="362.12,-38.34 303.38,-38.34 303.38,-19.09 362.12,-19.09 362.12,-38.34"/>
<text text-anchor="middle" x="332.75" y="-24.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.2,-95.68C104.12,-75.91 120.31,-32.34 152,-14.71 196.94,10.28 258.23,-2.57 296.37,-14.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.93,-18.19 305.52,-18.12 297.2,-11.57 294.93,-18.19"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="358.38,-150.34 307.12,-150.34 307.12,-131.09 358.38,-131.09 358.38,-150.34"/>
<text text-anchor="middle" x="332.75" y="-136.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.47,-108.82C156.82,-114.8 245.72,-127.97 295.74,-135.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.07,-138.82 305.48,-136.82 296.1,-131.89 295.07,-138.82"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.5,-227.34 163.25,-227.34 163.25,-208.09 238.5,-208.09 238.5,-227.34"/>
<text text-anchor="middle" x="200.88" y="-213.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge5_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.44,-115.63C111.14,-118.09 113.83,-120.84 116,-123.71 138.51,-153.55 124.5,-174.4 152,-199.71 152.64,-200.3 153.29,-200.87 153.97,-201.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.02,-204.32 162.32,-206.78 155.8,-198.43 152.02,-204.32"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="249.75,-76.34 152,-76.34 152,-57.09 249.75,-57.09 249.75,-76.34"/>
<text text-anchor="middle" x="200.88" y="-62.84" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-97.91C129.62,-92.97 147.13,-86.42 162.7,-80.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.53,-84.03 171.67,-77.25 161.08,-77.47 163.53,-84.03"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge7_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M236.34,-56.63C253.56,-51.59 274.47,-45.47 292.33,-40.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.2,-43.64 301.82,-37.47 291.24,-36.92 293.2,-43.64"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge8_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.44,-76.61C232.65,-80.58 241.86,-85.45 249.75,-90.71 267.32,-102.42 267.76,-110.65 285.75,-121.71 289.09,-123.77 292.69,-125.69 296.36,-127.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.74,-130.58 305.3,-131.44 297.59,-124.18 294.74,-130.58"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="379.75,-112.34 285.75,-112.34 285.75,-93.09 379.75,-93.09 379.75,-112.34"/>
<text text-anchor="middle" x="332.75" y="-98.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge9_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M238.4,-76.84C252.77,-80.82 269.45,-85.44 284.7,-89.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="283.47,-92.96 294.04,-92.26 285.34,-86.22 283.47,-92.96"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="378.25,-75.34 287.25,-75.34 287.25,-56.09 378.25,-56.09 378.25,-75.34"/>
<text text-anchor="middle" x="332.75" y="-61.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge10_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge10_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M250.24,-66.34C258.47,-66.28 267.08,-66.21 275.49,-66.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-69.65 285.27,-66.07 275.25,-62.65 275.3,-69.65"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node3 -->
<g id="edge12_Node000010_Node000003" class="edge">
<title>Node10&#45;&gt;Node3</title>
<g id="a_edge12_Node000010_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-150.31C129.3,-155.02 146.29,-161.2 161.57,-166.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.29,-170.03 170.89,-170.16 162.69,-163.45 160.29,-170.03"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node4 -->
<g id="edge13_Node000010_Node000004" class="edge">
<title>Node10&#45;&gt;Node4</title>
<g id="a_edge13_Node000010_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.45,-132.8C111.15,-130.35 113.84,-127.59 116,-124.71 138.68,-94.5 121.24,-69.64 152,-47.71 192.73,-18.68 252.42,-18.43 291.67,-22.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="291.07,-25.84 301.41,-23.51 291.87,-18.88 291.07,-25.84"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node5 -->
<g id="edge14_Node000010_Node000005" class="edge">
<title>Node10&#45;&gt;Node5</title>
<g id="a_edge14_Node000010_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.47,-142.54C156.82,-142.19 245.72,-141.44 295.74,-141.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.49,-144.52 305.46,-140.94 295.43,-137.52 295.49,-144.52"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node6 -->
<g id="edge15_Node000010_Node000006" class="edge">
<title>Node10&#45;&gt;Node6</title>
<g id="a_edge15_Node000010_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.91,-152.45C112.86,-164.94 131.65,-186.53 152,-199.71 153.61,-200.76 155.3,-201.76 157.03,-202.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-205.8 165.91,-206.98 158.42,-199.49 155.38,-205.8"/>
</a>
</g>
</g>
<!-- Node10&#45;&gt;Node7 -->
<g id="edge16_Node000010_Node000007" class="edge">
<title>Node10&#45;&gt;Node7</title>
<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.15,-132.78C126.41,-120.2 156.4,-98.37 177.15,-83.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-86.26 185,-77.54 174.86,-80.6 178.98,-86.26"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node3 -->
<g id="edge18_Node000011_Node000003" class="edge">
<title>Node11&#45;&gt;Node3</title>
<g id="a_edge18_Node000011_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-195.11C127.05,-193.27 140.49,-190.95 153.46,-188.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-192.19 163.16,-187.04 152.71,-185.3 153.9,-192.19"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node4 -->
<g id="edge19_Node000011_Node000004" class="edge">
<title>Node11&#45;&gt;Node4</title>
<g id="a_edge19_Node000011_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-208.76C116.8,-218.07 134.14,-231.26 152,-236.71 193.55,-249.39 216.29,-264.43 249.75,-236.71 315.94,-181.89 230.87,-112.86 285.75,-46.71 287.85,-44.18 290.36,-42 293.11,-40.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-43.32 301.77,-35.56 291.29,-37.12 294.55,-43.32"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node5 -->
<g id="edge20_Node000011_Node000005" class="edge">
<title>Node11&#45;&gt;Node5</title>
<g id="a_edge20_Node000011_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.82,-208.62C107.55,-224.93 125.47,-256.92 152,-269.71 191.13,-288.58 211.67,-290.63 249.75,-269.71 291.86,-246.58 315.42,-191.64 325.61,-161.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="328.93,-162.57 328.61,-151.98 322.25,-160.46 328.93,-162.57"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node6 -->
<g id="edge21_Node000011_Node000006" class="edge">
<title>Node11&#45;&gt;Node6</title>
<g id="a_edge21_Node000011_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.37,-202.51C126.57,-204.37 139.31,-206.69 151.74,-208.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-212.38 161.5,-210.73 152.28,-205.49 151.03,-212.38"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node7 -->
<g id="edge22_Node000011_Node000007" class="edge">
<title>Node11&#45;&gt;Node7</title>
<g id="a_edge22_Node000011_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.35,-188.79C120.65,-166.91 162.33,-114.19 184.85,-85.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.54,-87.95 191,-77.94 182.05,-83.61 187.54,-87.95"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 14 KiB

19
dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
View File

@@ -1,19 +0,0 @@
<map id="test_3" name="test_3">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
</map>

1
dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
View File

@@ -1 +0,0 @@
0bba5cd68fd96a0263b3a7f724f48940

191
dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
View File

@@ -1,191 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_3 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_3</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.2 KiB

165
dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
View File

@@ -1,165 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test_3 Pages: 1 -->
<svg width="315pt" height="178pt"
viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
<title>test_3</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge6_Node000006_Node000003" class="edge">
<title>Node6&#45;&gt;Node3</title>
<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge9_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.5 KiB

244
dd/da8/pigeonhole__sort_8cpp_source.html Normal file
View File

@@ -0,0 +1,244 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<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="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: sorting/pigeonhole_sort.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('dd/da8/pigeonhole__sort_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">pigeonhole_sort.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../dd/da8/pigeonhole__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="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;algorithm&gt;</span> <span class="comment">//for std::is_sorted</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;array&gt;</span> <span class="comment">//for std::array</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">//for assert</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">//for io operations</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> N&gt;</div>
<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3"> 34</a></span>std::array&lt;int, N&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a>(std::array&lt;int, N&gt; arr) {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Finding min and max*</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">auto</span> min = std::min_element(std::begin(arr), std::end(arr));</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">auto</span> max = std::max_element(std::begin(arr), std::end(arr));</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Range refers to the number of holes required</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">int</span> range = *max - *min + 1;</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordtype">int</span> *hole = <span class="keyword">new</span> <span class="keywordtype">int</span>[range]();</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// Copying all array values to pigeonhole</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> hole[arr[i] - *min] = arr[i];</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> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Deleting elements from list and storing to original array</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; range; i++) {</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">while</span> (hole[i] != <span class="charliteral">&#39;\0&#39;</span>) {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> arr[count] = hole[i];</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> hole[i] = {};</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> count++;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> }</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keyword">delete</span>[] hole;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> arr;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span>}</div>
</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span>} <span class="comment">// namespace sorting</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817"> 68</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>() {</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 7;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> std::array&lt;int, n&gt; test_array = {8, 3, 2, 7, 4, 6, 8};</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> </div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</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="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d"> 88</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>() {</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 10;</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::array&lt;int, n&gt; test_array = {802, 630, 20, 745, 52,</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> 300, 612, 932, 78, 187};</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span>}</div>
</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a"> 109</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>() {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> std::array&lt;int, n&gt; test_array = {11, 13, 12, 14};</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> </div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Printing sorted array</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> }</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>}</div>
</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="foldopen" id="foldopen00127" data-start="{" data-end="}">
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 127</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</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="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="#l00034">pigeonhole_sort.cpp:34</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="#l00068">pigeonhole_sort.cpp:68</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="#l00088">pigeonhole_sort.cpp:88</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00127">pigeonhole_sort.cpp:127</a></div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="#l00109">pigeonhole_sort.cpp:109</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<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="../../dd/da8/pigeonhole__sort_8cpp.html">pigeonhole_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>
</ul>
</div>
</body>
</html>

35
dd/da8/struct_segment_intersection-members.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<title>TheAlgorithms/C++: Member List</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>