backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 11:37:18 +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

105
d8/dcc/binary__insertion__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/binary_insertion_sort.cpp File Reference</title>
<title>TheAlgorithms/C++: sorting/binary_insertion_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 binary_insertion_sort.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d76/binary__insertion__sort_8cpp__incl.svg" width="350" 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="../../d8/dcc/binary__insertion__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>
@@ -132,11 +151,11 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd" id="r_a034d8b276518a902962e87d3158b64fd"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a> (std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
<tr class="memdesc:a034d8b276518a902962e87d3158b64fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Binary search function to find the most suitable pace for an element. <br /></td></tr>
<tr class="separator:a034d8b276518a902962e87d3158b64fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68" id="r_a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a> (std::vector&lt; T &gt; &amp;arr)</td></tr>
<tr class="memdesc:a5f4bc75cca6dd8294af2d0e328006c68"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion sort function to sort the vector. <br /></td></tr>
<tr class="separator:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -177,6 +196,8 @@ Functions</h2></td></tr>
</p>
</li>
</ol>
<p class="definition">Definition in file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_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>
@@ -195,17 +216,14 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit. </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 143</span> {</div>
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 146</span>}</div>
<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:104</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="../../d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="539" height="250"><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="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00104">binary_insertion_sort.cpp:104</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -233,53 +251,44 @@ Here is the call graph for this function:</div>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 104</span> {</div>
<div class="line"><span class="lineno"> 105</span> <span class="comment">/* descriptions of the following test */</span></div>
<div class="line"><span class="lineno"> 106</span> <span class="comment">/* 1st test:</span></div>
<div class="line"><span class="lineno"> 107</span><span class="comment"> [5, -3, -1, -2, 7] returns [-3, -2, -1, 5, 7] */</span></div>
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr1({5, -3, -1, -2, 7});</div>
<div class="line"><span class="lineno"> 109</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;1st test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 108</span> std::vector&lt;int64_t&gt; arr1({5, -3, -1, -2, 7});</div>
<div class="line"><span class="lineno"> 109</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 110</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr1);</div>
<div class="line"><span class="lineno"> 111</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>(arr1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr1)));</div>
<div class="line"><span class="lineno"> 112</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;passed&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 111</span> assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
<div class="line"><span class="lineno"> 112</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 113</span> </div>
<div class="line"><span class="lineno"> 114</span> <span class="comment">/* 2nd test:</span></div>
<div class="line"><span class="lineno"> 115</span><span class="comment"> [12, 26, 15, 91, 32, 54, 41] returns [12, 15, 26, 32, 41, 54, 91] */</span></div>
<div class="line"><span class="lineno"> 116</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr2({12, 26, 15, 91, 32, 54, 41});</div>
<div class="line"><span class="lineno"> 117</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;2nd test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 116</span> std::vector&lt;int64_t&gt; arr2({12, 26, 15, 91, 32, 54, 41});</div>
<div class="line"><span class="lineno"> 117</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 118</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr2);</div>
<div class="line"><span class="lineno"> 119</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>(arr2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2)));</div>
<div class="line"><span class="lineno"> 120</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;passed&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 119</span> assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
<div class="line"><span class="lineno"> 120</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 121</span> </div>
<div class="line"><span class="lineno"> 122</span> <span class="comment">/* 3rd test:</span></div>
<div class="line"><span class="lineno"> 123</span><span class="comment"> [7.1, -2.5, -4.0, -2.1, 5.7] returns [-4.0, -2.5, -2.1, 5.7, 7.1] */</span></div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
<div class="line"><span class="lineno"> 125</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;3rd test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 124</span> std::vector&lt;float&gt; arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
<div class="line"><span class="lineno"> 125</span> std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr3);</div>
<div class="line"><span class="lineno"> 127</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>(arr3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3)));</div>
<div class="line"><span class="lineno"> 128</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;passed&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 127</span> assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
<div class="line"><span class="lineno"> 128</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 129</span> </div>
<div class="line"><span class="lineno"> 130</span> <span class="comment">/* 4th test:</span></div>
<div class="line"><span class="lineno"> 131</span><span class="comment"> [12.8, -3.7, -20.7, -7.1, 2.2] returns [-20.7, -7.1, -3.7, 2.2, 12.8] */</span></div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
<div class="line"><span class="lineno"> 133</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;4th test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 132</span> std::vector&lt;float&gt; arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
<div class="line"><span class="lineno"> 133</span> std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr4);</div>
<div class="line"><span class="lineno"> 135</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>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
<div class="line"><span class="lineno"> 136</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;passed&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 135</span> assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
<div class="line"><span class="lineno"> 136</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 137</span>}</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="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="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_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:84</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></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="../../d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="442" height="250"><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_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00084">binary_insertion_sort.cpp:84</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

18
d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,18 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,104,49,130"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="128,5,206,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="35,102,60,71,95,40,112,31,115,35,98,44,64,75,39,105"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="133,55,202,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,106,96,89,118,81,120,86,98,94,50,111"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="132,104,203,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,116,114,116,120,49,120"/>
<area shape="rect" id="Node000005" href="$d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" title="Insertion sort function to sort the vector." alt="" coords="97,154,238,194"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,123,103,145,101,150,48,128"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="117,219,218,244"/>
<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="38,129,62,166,79,186,98,204,106,209,103,213,95,208,75,190,57,169,33,132"/>
<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" title="Binary search function to find the most suitable pace for an element." alt="" coords="286,137,435,163"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="238,163,270,159,271,164,239,168"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="303,187,418,212"/>
<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="239,181,288,187,287,193,238,186"/>
<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="328,138,322,129,326,119,339,113,361,111,384,113,397,120,394,125,383,118,361,116,340,118,330,123,327,128,333,135"/>
</map>

1
d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +0,0 @@
b81792d9c24c276c977a277424c297fb

183
d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,183 +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 Pages: 1 -->
<svg width="331pt" height="187pt"
viewBox="0.00 0.00 330.50 187.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 183.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-105.25 0,-105.25 0,-86 32.5,-86 32.5,-105.25"/>
<text text-anchor="middle" x="16.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="150.88,-179.25 92.12,-179.25 92.12,-160 150.88,-160 150.88,-179.25"/>
<text text-anchor="middle" x="121.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</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="M24.06,-105.73C32.93,-118.18 49.56,-139.17 68.5,-151.62 72.45,-154.22 76.82,-156.49 81.29,-158.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-161.62 90.37,-161.96 82.31,-155.09 79.78,-161.62"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="147.12,-142.25 95.88,-142.25 95.88,-123 147.12,-123 147.12,-142.25"/>
<text text-anchor="middle" x="121.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</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="M32.92,-101.53C43.05,-105.33 56.53,-110.33 68.5,-114.62 73.87,-116.55 79.57,-118.56 85.14,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.57,-123.66 94.17,-123.63 85.87,-117.05 83.57,-123.66"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="148.25,-105.25 94.75,-105.25 94.75,-86 148.25,-86 148.25,-105.25"/>
<text text-anchor="middle" x="121.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M32.93,-95.62C46.22,-95.62 65.83,-95.62 83.12,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.1,-99.13 93.1,-95.63 83.1,-92.13 83.1,-99.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
<polygon fill="white" stroke="#666666" points="174.5,-67.88 68.5,-67.88 68.5,-37.38 174.5,-37.38 174.5,-67.88"/>
<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
<text text-anchor="middle" x="121.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</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="M32.93,-89.09C43.55,-84.67 58.21,-78.57 72.49,-72.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.48,-76 81.36,-68.92 70.79,-69.54 73.48,-76"/>
</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/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="159.12,-19.25 83.88,-19.25 83.88,0 159.12,0 159.12,-19.25"/>
<text text-anchor="middle" x="121.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M22.5,-85.55C30.55,-71.02 47.26,-44.24 68.5,-28.62 70.3,-27.3 72.2,-26.06 74.17,-24.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.73,-28.04 83.09,-20.42 72.58,-21.78 75.73,-28.04"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
<polygon fill="white" stroke="#666666" points="322.5,-80.25 210.5,-80.25 210.5,-61 322.5,-61 322.5,-80.25"/>
<text text-anchor="middle" x="266.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.94,-59.23C182.74,-60.21 190.87,-61.23 198.91,-62.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="198.33,-65.7 208.69,-63.47 199.2,-58.75 198.33,-65.7"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="309.75,-43.25 223.25,-43.25 223.25,-24 309.75,-24 309.75,-43.25"/>
<text text-anchor="middle" x="266.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge7_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.94,-45.66C186.9,-44.07 199.62,-42.38 211.64,-40.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="211.95,-44.27 221.4,-39.48 211.03,-37.33 211.95,-44.27"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node6 -->
<g id="edge6_Node000006_Node000006" class="edge">
<title>Node6&#45;&gt;Node6</title>
<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M243.8,-80.54C233.44,-89.15 241.01,-98.25 266.5,-98.25 280.84,-98.25 289.5,-95.37 292.5,-91.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.92,-90.52 289.64,-81.99 289.22,-92.57 295.92,-90.52"/>
</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.1 KiB

157
d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -1,157 +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 Pages: 1 -->
<svg width="331pt" height="187pt"
viewBox="0.00 0.00 330.50 187.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 183.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-105.25 0,-105.25 0,-86 32.5,-86 32.5,-105.25"/>
<text text-anchor="middle" x="16.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="150.88,-179.25 92.12,-179.25 92.12,-160 150.88,-160 150.88,-179.25"/>
<text text-anchor="middle" x="121.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</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="M24.06,-105.73C32.93,-118.18 49.56,-139.17 68.5,-151.62 72.45,-154.22 76.82,-156.49 81.29,-158.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-161.62 90.37,-161.96 82.31,-155.09 79.78,-161.62"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="147.12,-142.25 95.88,-142.25 95.88,-123 147.12,-123 147.12,-142.25"/>
<text text-anchor="middle" x="121.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</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="M32.92,-101.53C43.05,-105.33 56.53,-110.33 68.5,-114.62 73.87,-116.55 79.57,-118.56 85.14,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.57,-123.66 94.17,-123.63 85.87,-117.05 83.57,-123.66"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="148.25,-105.25 94.75,-105.25 94.75,-86 148.25,-86 148.25,-105.25"/>
<text text-anchor="middle" x="121.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M32.93,-95.62C46.22,-95.62 65.83,-95.62 83.12,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.1,-99.13 93.1,-95.63 83.1,-92.13 83.1,-99.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
<polygon fill="white" stroke="#666666" points="174.5,-67.88 68.5,-67.88 68.5,-37.38 174.5,-37.38 174.5,-67.88"/>
<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
<text text-anchor="middle" x="121.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</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="M32.93,-89.09C43.55,-84.67 58.21,-78.57 72.49,-72.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.48,-76 81.36,-68.92 70.79,-69.54 73.48,-76"/>
</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/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="159.12,-19.25 83.88,-19.25 83.88,0 159.12,0 159.12,-19.25"/>
<text text-anchor="middle" x="121.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M22.5,-85.55C30.55,-71.02 47.26,-44.24 68.5,-28.62 70.3,-27.3 72.2,-26.06 74.17,-24.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.73,-28.04 83.09,-20.42 72.58,-21.78 75.73,-28.04"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
<polygon fill="white" stroke="#666666" points="322.5,-80.25 210.5,-80.25 210.5,-61 322.5,-61 322.5,-80.25"/>
<text text-anchor="middle" x="266.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.94,-59.23C182.74,-60.21 190.87,-61.23 198.91,-62.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="198.33,-65.7 208.69,-63.47 199.2,-58.75 198.33,-65.7"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="309.75,-43.25 223.25,-43.25 223.25,-24 309.75,-24 309.75,-43.25"/>
<text text-anchor="middle" x="266.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge7_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.94,-45.66C186.9,-44.07 199.62,-42.38 211.64,-40.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="211.95,-44.27 221.4,-39.48 211.03,-37.33 211.95,-44.27"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node6 -->
<g id="edge6_Node000006_Node000006" class="edge">
<title>Node6&#45;&gt;Node6</title>
<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M243.8,-80.54C233.44,-89.15 241.01,-98.25 266.5,-98.25 280.84,-98.25 289.5,-95.37 292.5,-91.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.92,-90.52 289.64,-81.99 289.22,-92.57 295.92,-90.52"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.3 KiB

20
d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,20 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
<area shape="rect" id="Node000002" href="$d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,104,146,130"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
<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="226,5,304,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="133,102,157,71,192,40,210,31,212,35,196,44,161,75,137,105"/>
<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="230,55,299,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,106,193,89,215,81,217,86,195,94,147,111"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="229,104,300,130"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,114,213,114,213,120,147,120"/>
<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" title="Insertion sort function to sort the vector." alt="" coords="194,154,335,194"/>
<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,123,200,145,198,150,146,128"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="214,219,315,244"/>
<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="135,129,159,166,176,186,196,204,203,209,200,213,192,208,172,190,155,169,130,132"/>
<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" title="Binary search function to find the most suitable pace for an element." alt="" coords="383,137,533,163"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="336,163,368,159,368,164,336,168"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="400,187,516,212"/>
<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="336,181,385,187,385,193,336,186"/>
<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="426,138,419,129,423,119,436,113,458,111,482,113,494,120,491,125,480,118,458,116,438,118,427,123,425,128,430,135"/>
</map>

1
d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
12666ce854669873e2a415ae5a928298

201
d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,201 +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="404pt" height="187pt"
viewBox="0.00 0.00 403.50 187.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 183.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
<text text-anchor="middle" x="18.5" y="-91.75" 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="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
</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="223.88,-179.25 165.12,-179.25 165.12,-160 223.88,-160 223.88,-179.25"/>
<text text-anchor="middle" x="194.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</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="M97.06,-105.73C105.93,-118.18 122.56,-139.17 141.5,-151.62 145.45,-154.22 149.82,-156.49 154.29,-158.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.78,-161.62 163.37,-161.96 155.31,-155.09 152.78,-161.62"/>
</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="220.12,-142.25 168.88,-142.25 168.88,-123 220.12,-123 220.12,-142.25"/>
<text text-anchor="middle" x="194.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</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="M105.92,-101.53C116.05,-105.33 129.53,-110.33 141.5,-114.62 146.87,-116.55 152.57,-118.56 158.14,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.57,-123.66 167.17,-123.63 158.87,-117.05 156.57,-123.66"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="221.25,-105.25 167.75,-105.25 167.75,-86 221.25,-86 221.25,-105.25"/>
<text text-anchor="middle" x="194.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M105.93,-95.62C119.22,-95.62 138.83,-95.62 156.12,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.1,-99.13 166.1,-95.63 156.1,-92.13 156.1,-99.13"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
<polygon fill="white" stroke="#666666" points="247.5,-67.88 141.5,-67.88 141.5,-37.38 247.5,-37.38 247.5,-67.88"/>
<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
<text text-anchor="middle" x="194.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</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="M105.93,-89.09C116.55,-84.67 131.21,-78.57 145.49,-72.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.48,-76 154.36,-68.92 143.79,-69.54 146.48,-76"/>
</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/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.12,-19.25 156.88,-19.25 156.88,0 232.12,0 232.12,-19.25"/>
<text text-anchor="middle" x="194.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M95.5,-85.55C103.55,-71.02 120.26,-44.24 141.5,-28.62 143.3,-27.3 145.2,-26.06 147.17,-24.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.73,-28.04 156.09,-20.42 145.58,-21.78 148.73,-28.04"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
<polygon fill="white" stroke="#666666" points="395.5,-80.25 283.5,-80.25 283.5,-61 395.5,-61 395.5,-80.25"/>
<text text-anchor="middle" x="339.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M247.94,-59.23C255.74,-60.21 263.87,-61.23 271.91,-62.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="271.33,-65.7 281.69,-63.47 272.2,-58.75 271.33,-65.7"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="382.75,-43.25 296.25,-43.25 296.25,-24 382.75,-24 382.75,-43.25"/>
<text text-anchor="middle" x="339.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge8_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M247.94,-45.66C259.9,-44.07 272.62,-42.38 284.64,-40.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="284.95,-44.27 294.4,-39.48 284.03,-37.33 284.95,-44.27"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node7 -->
<g id="edge7_Node000007_Node000007" class="edge">
<title>Node7&#45;&gt;Node7</title>
<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.8,-80.54C306.44,-89.15 314.01,-98.25 339.5,-98.25 353.84,-98.25 362.5,-95.37 365.5,-91.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="368.92,-90.52 362.64,-81.99 362.22,-92.57 368.92,-90.52"/>
</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: 9.0 KiB

175
d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,175 +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="404pt" height="187pt"
viewBox="0.00 0.00 403.50 187.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 183.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
<text text-anchor="middle" x="18.5" y="-91.75" 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="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
</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="223.88,-179.25 165.12,-179.25 165.12,-160 223.88,-160 223.88,-179.25"/>
<text text-anchor="middle" x="194.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</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="M97.06,-105.73C105.93,-118.18 122.56,-139.17 141.5,-151.62 145.45,-154.22 149.82,-156.49 154.29,-158.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.78,-161.62 163.37,-161.96 155.31,-155.09 152.78,-161.62"/>
</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="220.12,-142.25 168.88,-142.25 168.88,-123 220.12,-123 220.12,-142.25"/>
<text text-anchor="middle" x="194.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</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="M105.92,-101.53C116.05,-105.33 129.53,-110.33 141.5,-114.62 146.87,-116.55 152.57,-118.56 158.14,-120.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.57,-123.66 167.17,-123.63 158.87,-117.05 156.57,-123.66"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="221.25,-105.25 167.75,-105.25 167.75,-86 221.25,-86 221.25,-105.25"/>
<text text-anchor="middle" x="194.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M105.93,-95.62C119.22,-95.62 138.83,-95.62 156.12,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.1,-99.13 166.1,-95.63 156.1,-92.13 156.1,-99.13"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
<polygon fill="white" stroke="#666666" points="247.5,-67.88 141.5,-67.88 141.5,-37.38 247.5,-37.38 247.5,-67.88"/>
<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
<text text-anchor="middle" x="194.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</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="M105.93,-89.09C116.55,-84.67 131.21,-78.57 145.49,-72.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.48,-76 154.36,-68.92 143.79,-69.54 146.48,-76"/>
</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/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.12,-19.25 156.88,-19.25 156.88,0 232.12,0 232.12,-19.25"/>
<text text-anchor="middle" x="194.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M95.5,-85.55C103.55,-71.02 120.26,-44.24 141.5,-28.62 143.3,-27.3 145.2,-26.06 147.17,-24.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.73,-28.04 156.09,-20.42 145.58,-21.78 148.73,-28.04"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
<polygon fill="white" stroke="#666666" points="395.5,-80.25 283.5,-80.25 283.5,-61 395.5,-61 395.5,-80.25"/>
<text text-anchor="middle" x="339.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M247.94,-59.23C255.74,-60.21 263.87,-61.23 271.91,-62.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="271.33,-65.7 281.69,-63.47 272.2,-58.75 271.33,-65.7"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="382.75,-43.25 296.25,-43.25 296.25,-24 382.75,-24 382.75,-43.25"/>
<text text-anchor="middle" x="339.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge8_Node000006_Node000008" class="edge">
<title>Node6&#45;&gt;Node8</title>
<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M247.94,-45.66C259.9,-44.07 272.62,-42.38 284.64,-40.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="284.95,-44.27 294.4,-39.48 284.03,-37.33 284.95,-44.27"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node7 -->
<g id="edge7_Node000007_Node000007" class="edge">
<title>Node7&#45;&gt;Node7</title>
<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.8,-80.54C306.44,-89.15 314.01,-98.25 339.5,-98.25 353.84,-98.25 362.5,-95.37 365.5,-91.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="368.92,-90.52 362.64,-81.99 362.22,-92.57 368.92,-90.52"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.2 KiB

229
d8/dcc/binary__insertion__sort_8cpp_source.html Normal file
View File

@@ -0,0 +1,229 @@
<!-- 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/binary_insertion_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('d8/dcc/binary__insertion__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">binary_insertion_sort.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d8/dcc/binary__insertion__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="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd"> 63</a></span>int64_t <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(std::vector&lt;T&gt; &amp;arr, T val, int64_t low, int64_t high) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">if</span> (high &lt;= low) {</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> (val &gt; arr[low]) ? (low + 1) : low;</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> int64_t mid = low + (high - low) / 2;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">if</span> (arr[mid] &gt; val) {</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(arr, val, low, mid - 1);</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (arr[mid] &lt; val) {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(arr, val, mid + 1, high);</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> mid + 1;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span>}</div>
</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68"> 84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">insertionSort_binsrch</a>(std::vector&lt;T&gt; &amp;arr) {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> int64_t n = arr.size();</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">for</span> (int64_t i = 1; i &lt; n; i++) {</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> T key = arr[i];</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> int64_t j = i - 1;</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> int64_t loc = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a>(arr, key, 0, j);</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">while</span> (j &gt;= loc) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> arr[j + 1] = arr[j];</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> j--;</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> arr[j + 1] = key;</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>}</div>
</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span>} <span class="comment">// namespace sorting</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 104</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">/* descriptions of the following test */</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">/* 1st test:</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment"> [5, -3, -1, -2, 7] returns [-3, -2, -1, 5, 7] */</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> std::vector&lt;int64_t&gt; arr1({5, -3, -1, -2, 7});</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr1);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">/* 2nd test:</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment"> [12, 26, 15, 91, 32, 54, 41] returns [12, 15, 26, 32, 41, 54, 91] */</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> std::vector&lt;int64_t&gt; arr2({12, 26, 15, 91, 32, 54, 41});</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr2);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">/* 3rd test:</span></div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="comment"> [7.1, -2.5, -4.0, -2.1, 5.7] returns [-4.0, -2.5, -2.1, 5.7, 7.1] */</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> std::vector&lt;float&gt; arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr3);</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> </div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">/* 4th test:</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"> [12.8, -3.7, -20.7, -7.1, 2.2] returns [-20.7, -7.1, -3.7, 2.2, 12.8] */</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::vector&lt;float&gt; arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr4);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span>}</div>
</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 143</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span>}</div>
</div>
<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">binary_insertion_sort.cpp:104</a></div></div>
<div class="ttc" id="abinary__insertion__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00143">binary_insertion_sort.cpp:143</a></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_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">binary_insertion_sort.cpp:63</a></div></div>
<div class="ttc" id="anamespacesorting_html_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">binary_insertion_sort.cpp:84</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="../../d8/dcc/binary__insertion__sort_8cpp.html">binary_insertion_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>

2757
d8/dcc/namespacestd.html
View File

File diff suppressed because it is too large Load Diff

552
d8/dcc/namespacestd.js
View File

@@ -1,552 +0,0 @@
var namespacestd =
[
[ "chrono", "http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html", [
[ "duration_cast", "http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html", null ],
[ "time_point_cast", "http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html", null ]
] ],
[ "experimental", "http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html", [
[ "make_optional", "http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html", null ]
] ],
[ "regex_constants", "http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html", null ],
[ "rel_ops", "http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html", [
[ "operator!=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
[ "operator<=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
[ "operator>", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
[ "operator>=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ]
] ],
[ "this_thread", "http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html", [
[ "get_id", "http://en.cppreference.com/w/cpp/thread/get_id.html", null ],
[ "sleep_for", "http://en.cppreference.com/w/cpp/thread/sleep_for.html", null ],
[ "sleep_until", "http://en.cppreference.com/w/cpp/thread/sleep_until.html", null ],
[ "yield", "http://en.cppreference.com/w/cpp/thread/yield.html", null ]
] ],
[ "is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ],
[ "is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ],
[ "is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ],
[ "is_integral< uint256_t >", "d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html", null ],
[ "is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ],
[ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ],
[ "_Exit", "http://en.cppreference.com/w/cpp/utility/program/_Exit.html", null ],
[ "abort", "http://en.cppreference.com/w/cpp/utility/program/abort.html", null ],
[ "abs(float)", "http://en.cppreference.com/w/cpp/numeric/math/fabs.html", null ],
[ "abs(int)", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
[ "accumulate", "http://en.cppreference.com/w/cpp/algorithm/accumulate.html", null ],
[ "acos", "http://en.cppreference.com/w/cpp/numeric/math/acos.html", null ],
[ "acosh", "http://en.cppreference.com/w/cpp/numeric/math/acosh.html", null ],
[ "addressof", "http://en.cppreference.com/w/cpp/memory/addressof.html", null ],
[ "adjacent_difference", "http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html", null ],
[ "adjacent_find", "http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html", null ],
[ "advance", "http://en.cppreference.com/w/cpp/iterator/advance.html", null ],
[ "align", "http://en.cppreference.com/w/cpp/memory/align.html", null ],
[ "all_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
[ "allocate_shared", "http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html", null ],
[ "any_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
[ "asctime", "http://en.cppreference.com/w/cpp/chrono/c/asctime.html", null ],
[ "asin", "http://en.cppreference.com/w/cpp/numeric/math/asin.html", null ],
[ "asinh", "http://en.cppreference.com/w/cpp/numeric/math/asinh.html", null ],
[ "async", "http://en.cppreference.com/w/cpp/thread/async.html", null ],
[ "at_quick_exit", "http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html", null ],
[ "atan", "http://en.cppreference.com/w/cpp/numeric/math/atan.html", null ],
[ "atan2", "http://en.cppreference.com/w/cpp/numeric/math/atan2.html", null ],
[ "atanh", "http://en.cppreference.com/w/cpp/numeric/math/atanh.html", null ],
[ "atexit", "http://en.cppreference.com/w/cpp/utility/program/atexit.html", null ],
[ "atof", "http://en.cppreference.com/w/cpp/string/byte/atof.html", null ],
[ "atoi", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
[ "atol", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
[ "atoll", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
[ "atomic_compare_exchange_strong", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
[ "atomic_compare_exchange_strong_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
[ "atomic_compare_exchange_weak", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
[ "atomic_compare_exchange_weak_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
[ "atomic_exchange", "http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html", null ],
[ "atomic_exchange_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html", null ],
[ "atomic_fetch_add", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html", null ],
[ "atomic_fetch_add_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html", null ],
[ "atomic_fetch_and", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
[ "atomic_fetch_and_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
[ "atomic_fetch_or", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html", null ],
[ "atomic_fetch_or_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html", null ],
[ "atomic_fetch_sub", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
[ "atomic_fetch_sub_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
[ "atomic_fetch_xor", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html", null ],
[ "atomic_fetch_xor_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html", null ],
[ "atomic_init", "http://en.cppreference.com/w/cpp/atomic/atomic_init.html", null ],
[ "atomic_is_lock_free", "http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html", null ],
[ "atomic_load", "http://en.cppreference.com/w/cpp/atomic/atomic_load.html", null ],
[ "atomic_load_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_load.html", null ],
[ "atomic_signal_fence", "http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html", null ],
[ "atomic_store", "http://en.cppreference.com/w/cpp/atomic/atomic_store.html", null ],
[ "atomic_store_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_store.html", null ],
[ "atomic_thread_fence", "http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html", null ],
[ "back_inserter", "http://en.cppreference.com/w/cpp/iterator/back_inserter.html", null ],
[ "begin", "http://en.cppreference.com/w/cpp/iterator/begin.html", null ],
[ "binary_search", "http://en.cppreference.com/w/cpp/algorithm/binary_search.html", null ],
[ "bind", "http://en.cppreference.com/w/cpp/utility/functional/bind.html", null ],
[ "boolalpha", "http://en.cppreference.com/w/cpp/io/manip/boolalpha.html", null ],
[ "bsearch", "http://en.cppreference.com/w/cpp/algorithm/bsearch.html", null ],
[ "btowc", "http://en.cppreference.com/w/cpp/string/multibyte/btowc.html", null ],
[ "c16rtomb", "http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html", null ],
[ "c32rtomb", "http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html", null ],
[ "call_once", "http://en.cppreference.com/w/cpp/thread/call_once.html", null ],
[ "calloc", "http://en.cppreference.com/w/cpp/memory/c/calloc.html", null ],
[ "cbrt", "http://en.cppreference.com/w/cpp/numeric/math/cbrt.html", null ],
[ "ceil", "http://en.cppreference.com/w/cpp/numeric/math/ceil.html", null ],
[ "clearerr", "http://en.cppreference.com/w/cpp/io/c/clearerr.html", null ],
[ "clock", "http://en.cppreference.com/w/cpp/chrono/c/clock.html", null ],
[ "const_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
[ "copy", "http://en.cppreference.com/w/cpp/algorithm/copy.html", null ],
[ "copy_backward", "http://en.cppreference.com/w/cpp/algorithm/copy_backward.html", null ],
[ "copy_if", "http://en.cppreference.com/w/cpp/algorithm/copy.html", null ],
[ "copy_n", "http://en.cppreference.com/w/cpp/algorithm/copy_n.html", null ],
[ "copysign", "http://en.cppreference.com/w/cpp/numeric/math/copysign.html", null ],
[ "cos", "http://en.cppreference.com/w/cpp/numeric/math/cos.html", null ],
[ "cosh", "http://en.cppreference.com/w/cpp/numeric/math/cosh.html", null ],
[ "count", "http://en.cppreference.com/w/cpp/algorithm/count.html", null ],
[ "count_if", "http://en.cppreference.com/w/cpp/algorithm/count.html", null ],
[ "cref", "http://en.cppreference.com/w/cpp/utility/functional/ref.html", null ],
[ "ctime", "http://en.cppreference.com/w/cpp/chrono/c/ctime.html", null ],
[ "current_exception", "http://en.cppreference.com/w/cpp/error/current_exception.html", null ],
[ "dec", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
[ "declare_no_pointers", "http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html", null ],
[ "declare_reachable", "http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html", null ],
[ "declval", "http://en.cppreference.com/w/cpp/utility/declval.html", null ],
[ "defaultfloat", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
[ "difftime", "http://en.cppreference.com/w/cpp/chrono/c/difftime.html", null ],
[ "distance", "http://en.cppreference.com/w/cpp/iterator/distance.html", null ],
[ "div", "http://en.cppreference.com/w/cpp/numeric/math/div.html", null ],
[ "dynamic_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
[ "end", "http://en.cppreference.com/w/cpp/iterator/end.html", null ],
[ "endl", "http://en.cppreference.com/w/cpp/io/manip/endl.html", null ],
[ "ends", "http://en.cppreference.com/w/cpp/io/manip/ends.html", null ],
[ "equal", "http://en.cppreference.com/w/cpp/algorithm/equal.html", null ],
[ "equal_range", "http://en.cppreference.com/w/cpp/algorithm/equal_range.html", null ],
[ "erf", "http://en.cppreference.com/w/cpp/numeric/math/erf.html", null ],
[ "erfc", "http://en.cppreference.com/w/cpp/numeric/math/erfc.html", null ],
[ "exit", "http://en.cppreference.com/w/cpp/utility/program/exit.html", null ],
[ "exp", "http://en.cppreference.com/w/cpp/numeric/math/exp.html", null ],
[ "exp2", "http://en.cppreference.com/w/cpp/numeric/math/exp2.html", null ],
[ "expm1", "http://en.cppreference.com/w/cpp/numeric/math/expm1.html", null ],
[ "fabs", "http://en.cppreference.com/w/cpp/numeric/math/fabs.html", null ],
[ "fclose", "http://en.cppreference.com/w/cpp/io/c/fclose.html", null ],
[ "fdim", "http://en.cppreference.com/w/cpp/numeric/math/fdim.html", null ],
[ "feclearexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html", null ],
[ "fegetenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html", null ],
[ "fegetexceptflag", "http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html", null ],
[ "fegetround", "http://en.cppreference.com/w/cpp/numeric/fenv/feround.html", null ],
[ "feholdexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html", null ],
[ "feof", "http://en.cppreference.com/w/cpp/io/c/feof.html", null ],
[ "feraiseexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html", null ],
[ "ferror", "http://en.cppreference.com/w/cpp/io/c/ferror.html", null ],
[ "fesetenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html", null ],
[ "fesetexceptflag", "http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html", null ],
[ "fesetround", "http://en.cppreference.com/w/cpp/numeric/fenv/feround.html", null ],
[ "fetestexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html", null ],
[ "feupdateenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html", null ],
[ "fflush", "http://en.cppreference.com/w/cpp/io/c/fflush.html", null ],
[ "fgetc", "http://en.cppreference.com/w/cpp/io/c/fgetc.html", null ],
[ "fgetpos", "http://en.cppreference.com/w/cpp/io/c/fgetpos.html", null ],
[ "fgets", "http://en.cppreference.com/w/cpp/io/c/fgets.html", null ],
[ "fgetwc", "http://en.cppreference.com/w/cpp/io/c/fgetwc.html", null ],
[ "fgetws", "http://en.cppreference.com/w/cpp/io/c/fgetws.html", null ],
[ "fill", "http://en.cppreference.com/w/cpp/algorithm/fill.html", null ],
[ "fill_n", "http://en.cppreference.com/w/cpp/algorithm/fill_n.html", null ],
[ "find", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
[ "find_end", "http://en.cppreference.com/w/cpp/algorithm/find_end.html", null ],
[ "find_first_of", "http://en.cppreference.com/w/cpp/algorithm/find_first_of.html", null ],
[ "find_if", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
[ "find_if_not", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
[ "fixed", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
[ "floor", "http://en.cppreference.com/w/cpp/numeric/math/floor.html", null ],
[ "flush", "http://en.cppreference.com/w/cpp/io/manip/flush.html", null ],
[ "fma", "http://en.cppreference.com/w/cpp/numeric/math/fma.html", null ],
[ "fmax", "http://en.cppreference.com/w/cpp/numeric/math/fmax.html", null ],
[ "fmin", "http://en.cppreference.com/w/cpp/numeric/math/fmin.html", null ],
[ "fmod", "http://en.cppreference.com/w/cpp/numeric/math/fmod.html", null ],
[ "fopen", "http://en.cppreference.com/w/cpp/io/c/fopen.html", null ],
[ "for_each", "http://en.cppreference.com/w/cpp/algorithm/for_each.html", null ],
[ "forward", "http://en.cppreference.com/w/cpp/utility/forward.html", null ],
[ "forward_as_tuple", "http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html", null ],
[ "fpclassify", "http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html", null ],
[ "fprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
[ "fputc", "http://en.cppreference.com/w/cpp/io/c/fputc.html", null ],
[ "fputs", "http://en.cppreference.com/w/cpp/io/c/fputs.html", null ],
[ "fputwc", "http://en.cppreference.com/w/cpp/io/c/fputwc.html", null ],
[ "fputws", "http://en.cppreference.com/w/cpp/io/c/fputws.html", null ],
[ "fread", "http://en.cppreference.com/w/cpp/io/c/fread.html", null ],
[ "free", "http://en.cppreference.com/w/cpp/memory/c/free.html", null ],
[ "freopen", "http://en.cppreference.com/w/cpp/io/c/freopen.html", null ],
[ "frexp", "http://en.cppreference.com/w/cpp/numeric/math/frexp.html", null ],
[ "front_inserter", "http://en.cppreference.com/w/cpp/iterator/front_inserter.html", null ],
[ "fscanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
[ "fseek", "http://en.cppreference.com/w/cpp/io/c/fseek.html", null ],
[ "fsetpos", "http://en.cppreference.com/w/cpp/io/c/fsetpos.html", null ],
[ "ftell", "http://en.cppreference.com/w/cpp/io/c/ftell.html", null ],
[ "future_category", "http://en.cppreference.com/w/cpp/thread/future/future_category.html", null ],
[ "fwprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
[ "fwrite", "http://en.cppreference.com/w/cpp/io/c/fwrite.html", null ],
[ "fwscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ],
[ "generate", "http://en.cppreference.com/w/cpp/algorithm/generate.html", null ],
[ "generate_canonical", "http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html", null ],
[ "generate_n", "http://en.cppreference.com/w/cpp/algorithm/generate_n.html", null ],
[ "generic_category", "http://en.cppreference.com/w/cpp/error/generic_category.html", null ],
[ "get_money", "http://en.cppreference.com/w/cpp/io/manip/get_money.html", null ],
[ "get_new_handler", "http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html", null ],
[ "get_pointer_safety", "http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html", null ],
[ "get_temporary_buffer", "http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html", null ],
[ "get_terminate", "http://en.cppreference.com/w/cpp/error/get_terminate.html", null ],
[ "get_time", "http://en.cppreference.com/w/cpp/io/manip/get_time.html", null ],
[ "get_unexpected", "http://en.cppreference.com/w/cpp/error/get_unexpected.html", null ],
[ "getc", "http://en.cppreference.com/w/cpp/io/c/fgetc.html", null ],
[ "getchar", "http://en.cppreference.com/w/cpp/io/c/getchar.html", null ],
[ "getenv", "http://en.cppreference.com/w/cpp/utility/program/getenv.html", null ],
[ "getline", "http://en.cppreference.com/w/cpp/string/basic_string/getline.html", null ],
[ "gets", "http://en.cppreference.com/w/cpp/io/c/gets.html", null ],
[ "getwchar", "http://en.cppreference.com/w/cpp/io/c/getwchar.html", null ],
[ "gmtime", "http://en.cppreference.com/w/cpp/chrono/c/gmtime.html", null ],
[ "has_facet", "http://en.cppreference.com/w/cpp/locale/has_facet.html", null ],
[ "hex", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
[ "hexfloat", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
[ "hypot", "http://en.cppreference.com/w/cpp/numeric/math/hypot.html", null ],
[ "ilogb", "http://en.cppreference.com/w/cpp/numeric/math/ilogb.html", null ],
[ "includes", "http://en.cppreference.com/w/cpp/algorithm/includes.html", null ],
[ "inner_product", "http://en.cppreference.com/w/cpp/algorithm/inner_product.html", null ],
[ "inplace_merge", "http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html", null ],
[ "inserter", "http://en.cppreference.com/w/cpp/iterator/inserter.html", null ],
[ "internal", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
[ "iota", "http://en.cppreference.com/w/cpp/algorithm/iota.html", null ],
[ "is_heap", "http://en.cppreference.com/w/cpp/algorithm/is_heap.html", null ],
[ "is_heap_until", "http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html", null ],
[ "is_partitioned", "http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html", null ],
[ "is_permutation", "http://en.cppreference.com/w/cpp/algorithm/is_permutation.html", null ],
[ "is_sorted", "http://en.cppreference.com/w/cpp/algorithm/is_sorted.html", null ],
[ "is_sorted_until", "http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html", null ],
[ "isalnum", "http://en.cppreference.com/w/cpp/string/byte/isalnum.html", null ],
[ "isalpha", "http://en.cppreference.com/w/cpp/string/byte/isalpha.html", null ],
[ "isblank", "http://en.cppreference.com/w/cpp/string/byte/isblank.html", null ],
[ "iscntrl", "http://en.cppreference.com/w/cpp/string/byte/iscntrl.html", null ],
[ "isdigit", "http://en.cppreference.com/w/cpp/string/byte/isdigit.html", null ],
[ "isfinite", "http://en.cppreference.com/w/cpp/numeric/math/isfinite.html", null ],
[ "isgraph", "http://en.cppreference.com/w/cpp/string/byte/isgraph.html", null ],
[ "isinf", "http://en.cppreference.com/w/cpp/numeric/math/isinf.html", null ],
[ "islower", "http://en.cppreference.com/w/cpp/string/byte/islower.html", null ],
[ "isnan", "http://en.cppreference.com/w/cpp/numeric/math/isnan.html", null ],
[ "isnormal", "http://en.cppreference.com/w/cpp/numeric/math/isnormal.html", null ],
[ "isprint", "http://en.cppreference.com/w/cpp/string/byte/isprint.html", null ],
[ "ispunct", "http://en.cppreference.com/w/cpp/string/byte/ispunct.html", null ],
[ "isspace", "http://en.cppreference.com/w/cpp/string/byte/isspace.html", null ],
[ "isupper", "http://en.cppreference.com/w/cpp/string/byte/isupper.html", null ],
[ "iswalnum", "http://en.cppreference.com/w/cpp/string/wide/iswalnum.html", null ],
[ "iswalpha", "http://en.cppreference.com/w/cpp/string/wide/iswalpha.html", null ],
[ "iswblank", "http://en.cppreference.com/w/cpp/string/wide/iswblank.html", null ],
[ "iswcntrl", "http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html", null ],
[ "iswctype", "http://en.cppreference.com/w/cpp/string/wide/iswctype.html", null ],
[ "iswdigit", "http://en.cppreference.com/w/cpp/string/wide/iswdigit.html", null ],
[ "iswgraph", "http://en.cppreference.com/w/cpp/string/wide/iswgraph.html", null ],
[ "iswlower", "http://en.cppreference.com/w/cpp/string/wide/iswlower.html", null ],
[ "iswprint", "http://en.cppreference.com/w/cpp/string/wide/iswprint.html", null ],
[ "iswpunct", "http://en.cppreference.com/w/cpp/string/wide/iswpunct.html", null ],
[ "iswspace", "http://en.cppreference.com/w/cpp/string/wide/iswspace.html", null ],
[ "iswupper", "http://en.cppreference.com/w/cpp/string/wide/iswupper.html", null ],
[ "iswxdigit", "http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html", null ],
[ "isxdigit", "http://en.cppreference.com/w/cpp/string/byte/isxdigit.html", null ],
[ "iter_swap", "http://en.cppreference.com/w/cpp/algorithm/iter_swap.html", null ],
[ "kill_dependency", "http://en.cppreference.com/w/cpp/atomic/kill_dependency.html", null ],
[ "labs", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
[ "ldexp", "http://en.cppreference.com/w/cpp/numeric/math/ldexp.html", null ],
[ "ldiv", "http://en.cppreference.com/w/cpp/numeric/math/div.html", null ],
[ "left", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
[ "lexicographical_compare", "http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html", null ],
[ "lgamma", "http://en.cppreference.com/w/cpp/numeric/math/lgamma.html", null ],
[ "llabs", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
[ "llrint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
[ "llround", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
[ "localeconv", "http://en.cppreference.com/w/cpp/locale/localeconv.html", null ],
[ "localtime", "http://en.cppreference.com/w/cpp/chrono/c/localtime.html", null ],
[ "lock", "http://en.cppreference.com/w/cpp/thread/lock.html", null ],
[ "log", "http://en.cppreference.com/w/cpp/numeric/math/log.html", null ],
[ "log10", "http://en.cppreference.com/w/cpp/numeric/math/log10.html", null ],
[ "log1p", "http://en.cppreference.com/w/cpp/numeric/math/log1p.html", null ],
[ "logb", "http://en.cppreference.com/w/cpp/numeric/math/logb.html", null ],
[ "longjmp", "http://en.cppreference.com/w/cpp/utility/program/longjmp.html", null ],
[ "lower_bound", "http://en.cppreference.com/w/cpp/algorithm/lower_bound.html", null ],
[ "lrint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
[ "lround", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
[ "make_exception_ptr", "http://en.cppreference.com/w/cpp/error/make_exception_ptr.html", null ],
[ "make_heap", "http://en.cppreference.com/w/cpp/algorithm/make_heap.html", null ],
[ "make_move_iterator", "http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html", null ],
[ "make_pair", "http://en.cppreference.com/w/cpp/utility/pair/make_pair.html", null ],
[ "make_shared", "http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html", null ],
[ "make_tuple", "http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html", null ],
[ "malloc", "http://en.cppreference.com/w/cpp/memory/c/malloc.html", null ],
[ "max", "http://en.cppreference.com/w/cpp/algorithm/max.html", null ],
[ "max_element", "http://en.cppreference.com/w/cpp/algorithm/max_element.html", null ],
[ "mblen", "http://en.cppreference.com/w/cpp/string/multibyte/mblen.html", null ],
[ "mbrlen", "http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html", null ],
[ "mbrtoc16", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html", null ],
[ "mbrtoc32", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html", null ],
[ "mbrtowc", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html", null ],
[ "mbsinit", "http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html", null ],
[ "mbsrtowcs", "http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html", null ],
[ "mbstowcs", "http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html", null ],
[ "mbtowc", "http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html", null ],
[ "mem_fn", "http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html", null ],
[ "memchr", "http://en.cppreference.com/w/cpp/string/byte/memchr.html", null ],
[ "memcmp", "http://en.cppreference.com/w/cpp/string/byte/memcmp.html", null ],
[ "memcpy", "http://en.cppreference.com/w/cpp/string/byte/memcpy.html", null ],
[ "memmove", "http://en.cppreference.com/w/cpp/string/byte/memmove.html", null ],
[ "memset", "http://en.cppreference.com/w/cpp/string/byte/memset.html", null ],
[ "merge", "http://en.cppreference.com/w/cpp/algorithm/merge.html", null ],
[ "min", "http://en.cppreference.com/w/cpp/algorithm/min.html", null ],
[ "min_element", "http://en.cppreference.com/w/cpp/algorithm/min_element.html", null ],
[ "minmax", "http://en.cppreference.com/w/cpp/algorithm/minmax.html", null ],
[ "minmax_element", "http://en.cppreference.com/w/cpp/algorithm/minmax_element.html", null ],
[ "mismatch", "http://en.cppreference.com/w/cpp/algorithm/mismatch.html", null ],
[ "mktime", "http://en.cppreference.com/w/cpp/chrono/c/mktime.html", null ],
[ "modf", "http://en.cppreference.com/w/cpp/numeric/math/modf.html", null ],
[ "move", "http://en.cppreference.com/w/cpp/utility/move.html", null ],
[ "move_backward", "http://en.cppreference.com/w/cpp/algorithm/move_backward.html", null ],
[ "move_if_noexcept", "http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html", null ],
[ "nan", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
[ "nanf", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
[ "nanl", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
[ "nearbyint", "http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html", null ],
[ "next", "http://en.cppreference.com/w/cpp/iterator/next.html", null ],
[ "next_permutation", "http://en.cppreference.com/w/cpp/algorithm/next_permutation.html", null ],
[ "nextafter", "http://en.cppreference.com/w/cpp/numeric/math/nextafter.html", null ],
[ "nexttoward", "http://en.cppreference.com/w/cpp/numeric/math/nextafter.html", null ],
[ "noboolalpha", "http://en.cppreference.com/w/cpp/io/manip/boolalpha.html", null ],
[ "none_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
[ "noshowbase", "http://en.cppreference.com/w/cpp/io/manip/showbase.html", null ],
[ "noshowpoint", "http://en.cppreference.com/w/cpp/io/manip/showpoint.html", null ],
[ "noshowpos", "http://en.cppreference.com/w/cpp/io/manip/showpos.html", null ],
[ "noskipws", "http://en.cppreference.com/w/cpp/io/manip/skipws.html", null ],
[ "not1", "http://en.cppreference.com/w/cpp/utility/functional/not1.html", null ],
[ "not2", "http://en.cppreference.com/w/cpp/utility/functional/not2.html", null ],
[ "notify_all_at_thread_exit", "http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html", null ],
[ "nounitbuf", "http://en.cppreference.com/w/cpp/io/manip/unitbuf.html", null ],
[ "nouppercase", "http://en.cppreference.com/w/cpp/io/manip/uppercase.html", null ],
[ "nth_element", "http://en.cppreference.com/w/cpp/algorithm/nth_element.html", null ],
[ "oct", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
[ "partial_sort", "http://en.cppreference.com/w/cpp/algorithm/partial_sort.html", null ],
[ "partial_sort_copy", "http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html", null ],
[ "partial_sum", "http://en.cppreference.com/w/cpp/algorithm/partial_sum.html", null ],
[ "partition", "http://en.cppreference.com/w/cpp/algorithm/partition.html", null ],
[ "partition_copy", "http://en.cppreference.com/w/cpp/algorithm/partition_copy.html", null ],
[ "partition_point", "http://en.cppreference.com/w/cpp/algorithm/partition_point.html", null ],
[ "perror", "http://en.cppreference.com/w/cpp/io/c/perror.html", null ],
[ "pop_heap", "http://en.cppreference.com/w/cpp/algorithm/pop_heap.html", null ],
[ "pow", "http://en.cppreference.com/w/cpp/numeric/math/pow.html", null ],
[ "prev", "http://en.cppreference.com/w/cpp/iterator/prev.html", null ],
[ "prev_permutation", "http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html", null ],
[ "printf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
[ "push_heap", "http://en.cppreference.com/w/cpp/algorithm/push_heap.html", null ],
[ "put_money", "http://en.cppreference.com/w/cpp/io/manip/put_money.html", null ],
[ "put_time", "http://en.cppreference.com/w/cpp/io/manip/put_time.html", null ],
[ "putc", "http://en.cppreference.com/w/cpp/io/c/fputc.html", null ],
[ "putchar", "http://en.cppreference.com/w/cpp/io/c/putchar.html", null ],
[ "puts", "http://en.cppreference.com/w/cpp/io/c/puts.html", null ],
[ "putwchar", "http://en.cppreference.com/w/cpp/io/c/putwchar.html", null ],
[ "qsort", "http://en.cppreference.com/w/cpp/algorithm/qsort.html", null ],
[ "quick_exit", "http://en.cppreference.com/w/cpp/utility/program/quick_exit.html", null ],
[ "raise", "http://en.cppreference.com/w/cpp/utility/program/raise.html", null ],
[ "rand", "http://en.cppreference.com/w/cpp/numeric/random/rand.html", null ],
[ "random_shuffle", "http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html", null ],
[ "realloc", "http://en.cppreference.com/w/cpp/memory/c/realloc.html", null ],
[ "ref", "http://en.cppreference.com/w/cpp/utility/functional/ref.html", null ],
[ "regex_match", "http://en.cppreference.com/w/cpp/regex/regex_match.html", null ],
[ "regex_replace", "http://en.cppreference.com/w/cpp/regex/regex_replace.html", null ],
[ "regex_search", "http://en.cppreference.com/w/cpp/regex/regex_search.html", null ],
[ "remainder", "http://en.cppreference.com/w/cpp/numeric/math/remainder.html", null ],
[ "remove", "http://en.cppreference.com/w/cpp/algorithm/remove.html", null ],
[ "remove_copy", "http://en.cppreference.com/w/cpp/algorithm/remove_copy.html", null ],
[ "remove_copy_if", "http://en.cppreference.com/w/cpp/algorithm/remove_copy.html", null ],
[ "remove_if", "http://en.cppreference.com/w/cpp/algorithm/remove.html", null ],
[ "remquo", "http://en.cppreference.com/w/cpp/numeric/math/remquo.html", null ],
[ "rename", "http://en.cppreference.com/w/cpp/io/c/rename.html", null ],
[ "replace", "http://en.cppreference.com/w/cpp/algorithm/replace.html", null ],
[ "replace_copy", "http://en.cppreference.com/w/cpp/algorithm/replace_copy.html", null ],
[ "replace_copy_if", "http://en.cppreference.com/w/cpp/algorithm/replace_copy.html", null ],
[ "replace_if", "http://en.cppreference.com/w/cpp/algorithm/replace.html", null ],
[ "resetiosflags", "http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html", null ],
[ "rethrow_exception", "http://en.cppreference.com/w/cpp/error/rethrow_exception.html", null ],
[ "rethrow_if_nested", "http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html", null ],
[ "return_temporary_buffer", "http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html", null ],
[ "reverse", "http://en.cppreference.com/w/cpp/algorithm/reverse.html", null ],
[ "reverse_copy", "http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html", null ],
[ "rewind", "http://en.cppreference.com/w/cpp/io/c/rewind.html", null ],
[ "right", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
[ "rint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
[ "rotate", "http://en.cppreference.com/w/cpp/algorithm/rotate.html", null ],
[ "rotate_copy", "http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html", null ],
[ "round", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
[ "scalbln", "http://en.cppreference.com/w/cpp/numeric/math/scalbn.html", null ],
[ "scalbn", "http://en.cppreference.com/w/cpp/numeric/math/scalbn.html", null ],
[ "scanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
[ "scientific", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
[ "search", "http://en.cppreference.com/w/cpp/algorithm/search.html", null ],
[ "search_n", "http://en.cppreference.com/w/cpp/algorithm/search_n.html", null ],
[ "set_difference", "http://en.cppreference.com/w/cpp/algorithm/set_difference.html", null ],
[ "set_intersection", "http://en.cppreference.com/w/cpp/algorithm/set_intersection.html", null ],
[ "set_new_handler", "http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html", null ],
[ "set_symmetric_difference", "http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html", null ],
[ "set_terminate", "http://en.cppreference.com/w/cpp/error/set_terminate.html", null ],
[ "set_unexpected", "http://en.cppreference.com/w/cpp/error/set_unexpected.html", null ],
[ "set_union", "http://en.cppreference.com/w/cpp/algorithm/set_union.html", null ],
[ "setbase", "http://en.cppreference.com/w/cpp/io/manip/setbase.html", null ],
[ "setbuf", "http://en.cppreference.com/w/cpp/io/c/setbuf.html", null ],
[ "setfill", "http://en.cppreference.com/w/cpp/io/manip/setfill.html", null ],
[ "setiosflags", "http://en.cppreference.com/w/cpp/io/manip/setiosflags.html", null ],
[ "setlocale", "http://en.cppreference.com/w/cpp/locale/setlocale.html", null ],
[ "setprecision", "http://en.cppreference.com/w/cpp/io/manip/setprecision.html", null ],
[ "setvbuf", "http://en.cppreference.com/w/cpp/io/c/setvbuf.html", null ],
[ "setw", "http://en.cppreference.com/w/cpp/io/manip/setw.html", null ],
[ "showbase", "http://en.cppreference.com/w/cpp/io/manip/showbase.html", null ],
[ "showpoint", "http://en.cppreference.com/w/cpp/io/manip/showpoint.html", null ],
[ "showpos", "http://en.cppreference.com/w/cpp/io/manip/showpos.html", null ],
[ "shuffle", "http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html", null ],
[ "signal", "http://en.cppreference.com/w/cpp/utility/program/signal.html", null ],
[ "signbit", "http://en.cppreference.com/w/cpp/numeric/math/signbit.html", null ],
[ "sin", "http://en.cppreference.com/w/cpp/numeric/math/sin.html", null ],
[ "sinh", "http://en.cppreference.com/w/cpp/numeric/math/sinh.html", null ],
[ "skipws", "http://en.cppreference.com/w/cpp/io/manip/skipws.html", null ],
[ "snprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
[ "sort", "http://en.cppreference.com/w/cpp/algorithm/sort.html", null ],
[ "sort_heap", "http://en.cppreference.com/w/cpp/algorithm/sort_heap.html", null ],
[ "sprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
[ "sqrt", "http://en.cppreference.com/w/cpp/numeric/math/sqrt.html", null ],
[ "srand", "http://en.cppreference.com/w/cpp/numeric/random/srand.html", null ],
[ "sscanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
[ "stable_partition", "http://en.cppreference.com/w/cpp/algorithm/stable_partition.html", null ],
[ "stable_sort", "http://en.cppreference.com/w/cpp/algorithm/stable_sort.html", null ],
[ "static_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
[ "stod", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
[ "stof", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
[ "stoi", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
[ "stol", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
[ "stold", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
[ "stoll", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
[ "stoul", "http://en.cppreference.com/w/cpp/string/basic_string/stoul.html", null ],
[ "stoull", "http://en.cppreference.com/w/cpp/string/basic_string/stoul.html", null ],
[ "strcat", "http://en.cppreference.com/w/cpp/string/byte/strcat.html", null ],
[ "strchr", "http://en.cppreference.com/w/cpp/string/byte/strchr.html", null ],
[ "strcmp", "http://en.cppreference.com/w/cpp/string/byte/strcmp.html", null ],
[ "strcoll", "http://en.cppreference.com/w/cpp/string/byte/strcoll.html", null ],
[ "strcpy", "http://en.cppreference.com/w/cpp/string/byte/strcpy.html", null ],
[ "strcspn", "http://en.cppreference.com/w/cpp/string/byte/strcspn.html", null ],
[ "strerror", "http://en.cppreference.com/w/cpp/string/byte/strerror.html", null ],
[ "strftime", "http://en.cppreference.com/w/cpp/chrono/c/strftime.html", null ],
[ "strlen", "http://en.cppreference.com/w/cpp/string/byte/strlen.html", null ],
[ "strncat", "http://en.cppreference.com/w/cpp/string/byte/strncat.html", null ],
[ "strncmp", "http://en.cppreference.com/w/cpp/string/byte/strncmp.html", null ],
[ "strncpy", "http://en.cppreference.com/w/cpp/string/byte/strncpy.html", null ],
[ "strpbrk", "http://en.cppreference.com/w/cpp/string/byte/strpbrk.html", null ],
[ "strrchr", "http://en.cppreference.com/w/cpp/string/byte/strrchr.html", null ],
[ "strspn", "http://en.cppreference.com/w/cpp/string/byte/strspn.html", null ],
[ "strstr", "http://en.cppreference.com/w/cpp/string/byte/strstr.html", null ],
[ "strtod", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
[ "strtof", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
[ "strtoimax", "http://en.cppreference.com/w/cpp/string/byte/strtoimax.html", null ],
[ "strtok", "http://en.cppreference.com/w/cpp/string/byte/strtok.html", null ],
[ "strtol", "http://en.cppreference.com/w/cpp/string/byte/strtol.html", null ],
[ "strtold", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
[ "strtoll", "http://en.cppreference.com/w/cpp/string/byte/strtol.html", null ],
[ "strtoul", "http://en.cppreference.com/w/cpp/string/byte/strtoul.html", null ],
[ "strtoull", "http://en.cppreference.com/w/cpp/string/byte/strtoul.html", null ],
[ "strtoumax", "http://en.cppreference.com/w/cpp/string/byte/strtoimax.html", null ],
[ "strxfrm", "http://en.cppreference.com/w/cpp/string/byte/strxfrm.html", null ],
[ "swap", "http://en.cppreference.com/w/cpp/algorithm/swap.html", null ],
[ "swap_ranges", "http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html", null ],
[ "swprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
[ "swscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ],
[ "system", "http://en.cppreference.com/w/cpp/utility/program/system.html", null ],
[ "system_category", "http://en.cppreference.com/w/cpp/error/system_category.html", null ],
[ "tan", "http://en.cppreference.com/w/cpp/numeric/math/tan.html", null ],
[ "tanh", "http://en.cppreference.com/w/cpp/numeric/math/tanh.html", null ],
[ "terminate", "http://en.cppreference.com/w/cpp/error/terminate.html", null ],
[ "tgamma", "http://en.cppreference.com/w/cpp/numeric/math/tgamma.html", null ],
[ "throw_with_nested", "http://en.cppreference.com/w/cpp/error/throw_with_nested.html", null ],
[ "tie", "http://en.cppreference.com/w/cpp/utility/tuple/tie.html", null ],
[ "time", "http://en.cppreference.com/w/cpp/chrono/c/time.html", null ],
[ "tmpfile", "http://en.cppreference.com/w/cpp/io/c/tmpfile.html", null ],
[ "tmpnam", "http://en.cppreference.com/w/cpp/io/c/tmpnam.html", null ],
[ "to_string", "http://en.cppreference.com/w/cpp/string/basic_string/to_string.html", null ],
[ "to_wstring", "http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html", null ],
[ "tolower", "http://en.cppreference.com/w/cpp/string/byte/tolower.html", null ],
[ "toupper", "http://en.cppreference.com/w/cpp/string/byte/toupper.html", null ],
[ "towctrans", "http://en.cppreference.com/w/cpp/string/wide/towctrans.html", null ],
[ "towlower", "http://en.cppreference.com/w/cpp/string/wide/towlower.html", null ],
[ "towupper", "http://en.cppreference.com/w/cpp/string/wide/towupper.html", null ],
[ "transform", "http://en.cppreference.com/w/cpp/algorithm/transform.html", null ],
[ "trunc", "http://en.cppreference.com/w/cpp/numeric/math/trunc.html", null ],
[ "try_lock", "http://en.cppreference.com/w/cpp/thread/try_lock.html", null ],
[ "tuple_cat", "http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html", null ],
[ "uncaught_exception", "http://en.cppreference.com/w/cpp/error/uncaught_exception.html", null ],
[ "undeclare_no_pointers", "http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html", null ],
[ "undeclare_reachable", "http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html", null ],
[ "unexpected", "http://en.cppreference.com/w/cpp/error/unexpected.html", null ],
[ "ungetc", "http://en.cppreference.com/w/cpp/io/c/ungetc.html", null ],
[ "ungetwc", "http://en.cppreference.com/w/cpp/io/c/ungetwc.html", null ],
[ "uninitialized_copy", "http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html", null ],
[ "uninitialized_copy_n", "http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html", null ],
[ "uninitialized_fill", "http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html", null ],
[ "uninitialized_fill_n", "http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html", null ],
[ "unique", "http://en.cppreference.com/w/cpp/algorithm/unique.html", null ],
[ "unique_copy", "http://en.cppreference.com/w/cpp/algorithm/unique_copy.html", null ],
[ "unitbuf", "http://en.cppreference.com/w/cpp/io/manip/unitbuf.html", null ],
[ "upper_bound", "http://en.cppreference.com/w/cpp/algorithm/upper_bound.html", null ],
[ "uppercase", "http://en.cppreference.com/w/cpp/io/manip/uppercase.html", null ],
[ "use_facet", "http://en.cppreference.com/w/cpp/locale/use_facet.html", null ],
[ "vfprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
[ "vfscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
[ "vfwprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
[ "vfwscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
[ "vprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
[ "vscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
[ "vsnprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
[ "vsprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
[ "vsscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
[ "vswprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
[ "vswscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
[ "vwprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
[ "vwscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
[ "wcrtomb", "http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html", null ],
[ "wcscat", "http://en.cppreference.com/w/cpp/string/wide/wcscat.html", null ],
[ "wcschr", "http://en.cppreference.com/w/cpp/string/wide/wcschr.html", null ],
[ "wcscmp", "http://en.cppreference.com/w/cpp/string/wide/wcscmp.html", null ],
[ "wcscoll", "http://en.cppreference.com/w/cpp/string/wide/wcscoll.html", null ],
[ "wcscpy", "http://en.cppreference.com/w/cpp/string/wide/wcscpy.html", null ],
[ "wcscspn", "http://en.cppreference.com/w/cpp/string/wide/wcscspn.html", null ],
[ "wcsftime", "http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html", null ],
[ "wcslen", "http://en.cppreference.com/w/cpp/string/wide/wcslen.html", null ],
[ "wcsncat", "http://en.cppreference.com/w/cpp/string/wide/wcsncat.html", null ],
[ "wcsncmp", "http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html", null ],
[ "wcsncpy", "http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html", null ],
[ "wcspbrk", "http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html", null ],
[ "wcsrchr", "http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html", null ],
[ "wcsspn", "http://en.cppreference.com/w/cpp/string/wide/wcsspn.html", null ],
[ "wcsstr", "http://en.cppreference.com/w/cpp/string/wide/wcsstr.html", null ],
[ "wcstod", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
[ "wcstof", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
[ "wcstoimax", "http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html", null ],
[ "wcstok", "http://en.cppreference.com/w/cpp/string/wide/wcstok.html", null ],
[ "wcstol", "http://en.cppreference.com/w/cpp/string/wide/wcstol.html", null ],
[ "wcstold", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
[ "wcstoll", "http://en.cppreference.com/w/cpp/string/wide/wcstol.html", null ],
[ "wcstombs", "http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html", null ],
[ "wcstoul", "http://en.cppreference.com/w/cpp/string/wide/wcstoul.html", null ],
[ "wcstoull", "http://en.cppreference.com/w/cpp/string/wide/wcstoul.html", null ],
[ "wcstoumax", "http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html", null ],
[ "wcsxfrm", "http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html", null ],
[ "wctob", "http://en.cppreference.com/w/cpp/string/multibyte/wctob.html", null ],
[ "wctomb", "http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html", null ],
[ "wctrans", "http://en.cppreference.com/w/cpp/string/wide/wctrans.html", null ],
[ "wctype", "http://en.cppreference.com/w/cpp/string/wide/wctype.html", null ],
[ "wmemchr", "http://en.cppreference.com/w/cpp/string/wide/wmemchr.html", null ],
[ "wmemcmp", "http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html", null ],
[ "wmemcpy", "http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html", null ],
[ "wmemmove", "http://en.cppreference.com/w/cpp/string/wide/wmemmove.html", null ],
[ "wmemset", "http://en.cppreference.com/w/cpp/string/wide/wmemset.html", null ],
[ "wprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
[ "ws", "http://en.cppreference.com/w/cpp/io/manip/ws.html", null ],
[ "wscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ]
];