backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 05:42:59 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 341ed50da8

Browse Source
This commit is contained in:
github-actions
2021-09-03 19:56:17 +00:00
parent 52d0c55145
commit 08e8eb037e
3432 changed files with 71392 additions and 72953 deletions
Download Patch File Download Diff File Expand all files Collapse all files

149
d8/d8a/exponential__search_8cpp.html
View File

@@ -2,8 +2,8 @@
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/exponential_search.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -17,9 +17,9 @@
<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"],
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</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>
@@ -32,8 +32,7 @@
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
@@ -42,21 +41,22 @@
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
@@ -70,7 +70,7 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d8a/exponential__search_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
@@ -92,12 +92,11 @@ $(document).ready(function(){initNavTree('d8/d8a/exponential__search_8cpp.html',
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">exponential_search.cpp File Reference</div> </div>
<div class="headertitle"><div class="title">exponential_search.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Exponential_search">Exponential search algorithm</a>
<p><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cmath&gt;</code><br />
@@ -110,24 +109,24 @@ Include dependency graph for exponential_search.cpp:</div>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0f697e2a3b5193324ab84bd4045088f7"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:a0f697e2a3b5193324ab84bd4045088f7"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7">binary_s</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:a0f697e2a3b5193324ab84bd4045088f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a67e9c84b4e2eb30e3c5170eabfbb363d"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:a67e9c84b4e2eb30e3c5170eabfbb363d"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d">struzik_search</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:a67e9c84b4e2eb30e3c5170eabfbb363d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">binary_s</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:ab06cedad209456eae95d37b7cd66acae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:af421bf4b7b95f20ac86c233adfdb9208"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Exponential_search">Exponential search algorithm</a> </p>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </p>
<dl class="section copyright"><dt>Copyright</dt><dd>2020 Divide-et-impera-11</dd></dl>
<p>The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0f697e2a3b5193324ab84bd4045088f7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0f697e2a3b5193324ab84bd4045088f7">&#9670;&nbsp;</a></span>binary_s()</h2>
<a id="ab06cedad209456eae95d37b7cd66acae" name="ab06cedad209456eae95d37b7cd66acae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab06cedad209456eae95d37b7cd66acae">&#9670;&nbsp;</a></span>binary_s()</h2>
<div class="memitem">
<div class="memproto">
@@ -138,7 +137,7 @@ template&lt;class Type &gt; </div>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Type* binary_s </td>
<td class="memname">Type * binary_s </td>
<td>(</td>
<td class="paramtype">Type *&#160;</td>
<td class="paramname"><em>array</em>, </td>
@@ -167,7 +166,7 @@ template&lt;class Type &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p>Binary Search Algorithm (used by <a class="el" href="../../d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d">struzik_search</a>)<br />
<p >Binary Search Algorithm (used by <a class="el" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a>)<br />
</p><ul>
<li>Time Complexity O(log n) where 'n' is the number of elements</li>
<li>Worst Time Complexity O(log n)</li>
@@ -178,27 +177,27 @@ template&lt;class Type &gt; </div>
<code>nullptr</code> if value not found </dd></dl>
</li>
</ul>
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; </div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordflow">while</span> (lower_index &lt;= upper_index) {</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; middle_index = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a>((lower_index + upper_index) / 2);</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; </div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordflow">if</span> (*(array + middle_index) &lt; key)</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; lower_index = (middle_index + 1);</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*(array + middle_index) &gt; key)</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; upper_index = (middle_index - 1);</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keywordflow">return</span> (array + middle_index);</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; }</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordflow">while</span> (lower_index &lt;= upper_index) {</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> middle_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a>((lower_index + upper_index) / 2);</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">if</span> (*(array + middle_index) &lt; key)</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> lower_index = (middle_index + 1);</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*(array + middle_index) &gt; key)</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> upper_index = (middle_index - 1);</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">return</span> (array + middle_index);</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
<div class="ttc" id="afloor_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a></div><div class="ttdeci">T floor(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
@@ -213,23 +212,23 @@ template&lt;class Type &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="comment">// TEST CASES</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordtype">int</span>* sorted_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[7]{7, 10, 15, 23, 70, 105, 203};</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; assert(struzik_search&lt;int&gt;(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; assert(struzik_search&lt;int&gt;(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; assert(struzik_search&lt;int&gt;(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; assert(struzik_search&lt;int&gt;(sorted_array, 7, 7) == sorted_array);</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="comment">// TEST CASES</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keyword">delete</span>[] sorted_array;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;}</div>
<p >Main function </p>
<div class="fragment"><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> <span class="comment">// TEST CASES</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordtype">int</span>* sorted_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[7]{7, 10, 15, 23, 70, 105, 203};</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> assert(struzik_search&lt;int&gt;(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> assert(struzik_search&lt;int&gt;(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> assert(struzik_search&lt;int&gt;(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> assert(struzik_search&lt;int&gt;(sorted_array, 7, 7) == sorted_array);</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// TEST CASES</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">delete</span>[] sorted_array;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a67e9c84b4e2eb30e3c5170eabfbb363d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a67e9c84b4e2eb30e3c5170eabfbb363d">&#9670;&nbsp;</a></span>struzik_search()</h2>
<a id="af421bf4b7b95f20ac86c233adfdb9208" name="af421bf4b7b95f20ac86c233adfdb9208"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af421bf4b7b95f20ac86c233adfdb9208">&#9670;&nbsp;</a></span>struzik_search()</h2>
<div class="memitem">
<div class="memproto">
@@ -237,7 +236,7 @@ template&lt;class Type &gt; </div>
template&lt;class Type &gt; </div>
<table class="memname">
<tr>
<td class="memname">Type* struzik_search </td>
<td class="memname">Type * struzik_search </td>
<td>(</td>
<td class="paramtype">Type *&#160;</td>
<td class="paramname"><em>array</em>, </td>
@@ -261,26 +260,26 @@ template&lt;class Type &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p>Struzik Search Algorithm(Exponential)</p><ul>
<p >Struzik Search Algorithm(Exponential)</p><ul>
<li>Time Complexity O(log i) where i is the position of search key in the list</li>
<li>Worst Time Complexity O(log i)</li>
<li>Best Time Complexity Ω(1)</li>
<li>Space Complexity O(1)</li>
<li>Auxiliary Space Complexity O(1) </li>
</ul>
<div class="fragment"><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; {</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">while</span> (block_front != block_size) {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">if</span> (*(array + block_size - 1) &lt; key) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; block_front = block_size;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; (block_size * 2 - 1 &lt; size) ? (block_size *= 2) : block_size = size;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; }</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="keywordflow">return</span> binary_s&lt;Type&gt;(array + block_front, (block_size - block_front),</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; key);</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">while</span> (block_front != block_size) {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (*(array + block_size - 1) &lt; key) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> block_front = block_size;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> (block_size * 2 - 1 &lt; size) ? (block_size *= 2) : block_size = size;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">continue</span>;</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> <span class="keywordflow">return</span> binary_s&lt;Type&gt;(array + block_front, (block_size - block_front),</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> key);</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -290,7 +289,7 @@ template&lt;class Type &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html">exponential_search.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.9.1 </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.9.2 </li>
</ul>
</div>
</body>