Willkommen bei WordPress. Dies ist dein erster Beitrag. Bearbeite oder lösche ihn und beginne mit dem Schreiben!
Hallo Welt!
von raredesign | Dez 3, 2019 | Allgemein | 0 Kommentare
Cokiee Shell
| Current Path : /proc/self/root/usr/share/doc/libclam-doc/html/ |
| Current File : //proc/self/root/usr/share/doc/libclam-doc/html/SearchArray_8hxx_source.html |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<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"/>
<title>CLAM-Development: SearchArray.hxx Source File</title>
<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>
<link href="doxygen.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 style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">CLAM-Development
 <span id="projectnumber">1.4.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_d4791cbe27cfad621555cea90f9c50f6.html">Standard</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">SearchArray.hxx</div> </div>
</div><!--header-->
<div class="contents">
<a href="SearchArray_8hxx.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2001-2004 MUSIC TECHNOLOGY GROUP (MTG)</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * UNIVERSITAT POMPEU FABRA</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * This program is free software; you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * along with this program; if not, write to the Free Software</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#ifndef _SearchArray_</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor"></span><span class="preprocessor">#define _SearchArray_</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="OSDefines_8hxx.html">OSDefines.hxx</a>"</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="DataTypes_8hxx.html">DataTypes.hxx</a>"</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="Array_8hxx.html">Array.hxx</a>"</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>CLAM {</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html"> 31</a></span> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">class </span><a class="code" href="classCLAM_1_1SearchArray.html">SearchArray</a></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> {</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">/* Based on locate() and hunt(), Numerical Recipes,second Edition, 117 */</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">private</span>:</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">const</span> <a class="code" href="classCLAM_1_1Array.html">Array<T></a>* mpArray;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">public</span>:</div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a253073421f9288fed2ebf3f16b54412c"> 37</a></span>  <a class="code" href="classCLAM_1_1SearchArray.html#a253073421f9288fed2ebf3f16b54412c">SearchArray</a>()</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  {</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  mpArray = <a class="code" href="OSDefines_8hxx.html#a070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  }</div>
<div class="line"><a name="l00041"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a0268d6d9281a396528c9c8ffc2c81985"> 41</a></span>  <a class="code" href="classCLAM_1_1SearchArray.html#a253073421f9288fed2ebf3f16b54412c">SearchArray</a>(<span class="keyword">const</span> <a class="code" href="classCLAM_1_1Array.html">Array<T></a>& array)</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="classCLAM_1_1SearchArray.html#a17cd6b8599faa3089930bffd11c731d1">Set</a>(array);</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a4dbee0389f01410bafc8340c3ff5ecb2"> 46</a></span>  <a class="code" href="classCLAM_1_1SearchArray.html#a4dbee0389f01410bafc8340c3ff5ecb2">~SearchArray</a>()</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div>
<div class="line"><a name="l00050"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a17cd6b8599faa3089930bffd11c731d1"> 50</a></span>  <span class="keywordtype">void</span> <a class="code" href="classCLAM_1_1SearchArray.html#a17cd6b8599faa3089930bffd11c731d1">Set</a>(<span class="keyword">const</span> <a class="code" href="classCLAM_1_1Array.html">Array<T></a>& array)</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  mpArray = &array;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a71f9d74e00c701872eb24b8c92d3e16a"> 54</a></span>  <a class="code" href="classint.html">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a71f9d74e00c701872eb24b8c92d3e16a">Find</a>(<span class="keyword">const</span> T& value,<a class="code" href="classint.html">TIndex</a> prevIndex=0)<span class="keyword"> const</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> <a class="code" href="classCLAM_1_1SearchArray.html#a72dedac18af3e693bec8354db0277ec5">Hunt</a>(value,prevIndex);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="namespaceCLAM.html#af934e7dd545c1aed1cd0fd551c135122">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a72dedac18af3e693bec8354db0277ec5">Hunt</a>(<span class="keyword">const</span> T& value,<a class="code" href="namespaceCLAM.html#af934e7dd545c1aed1cd0fd551c135122">TIndex</a> prevIndex=0) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8"> 60</a></span>  <a class="code" href="classint.html">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">Bisection</a>(<span class="keyword">const</span> T& value)<span class="keyword"> const</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">Bisection</a>(value,0,mpArray->Size());</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#ab93eceb001b1ddebee463e56f4b25fef"> 65</a></span>  <a class="code" href="classint.html">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">Bisection</a>(<span class="keyword">const</span> T& value,<a class="code" href="classint.html">TIndex</a> lowerLimit)<span class="keyword"> const</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">Bisection</a>(value,lowerLimit,mpArray->Size());</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="namespaceCLAM.html#af934e7dd545c1aed1cd0fd551c135122">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">Bisection</a>(<span class="keyword">const</span> T& value,<a class="code" href="namespaceCLAM.html#af934e7dd545c1aed1cd0fd551c135122">TIndex</a> lowerLimit,<a class="code" href="namespaceCLAM.html#af934e7dd545c1aed1cd0fd551c135122">TIndex</a> upperLimit) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> };</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">template</span> <<span class="keyword">class</span> T> </div>
<div class="line"><a name="l00074"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#a72dedac18af3e693bec8354db0277ec5"> 74</a></span>  <span class="keyword">inline</span> <a class="code" href="classint.html">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a72dedac18af3e693bec8354db0277ec5">SearchArray<T>::Hunt</a>(</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> T& value,<a class="code" href="classint.html">TIndex</a> guessIndex)<span class="keyword"> const</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="classint.html">TIndex</a> result;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="classint.html">TIndex</a> n = mpArray->Size();</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (guessIndex<0 || guessIndex>=n)</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> Bisection(value);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">bool</span> ascending = (*mpArray)[n-1] >= (*mpArray)[0];</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="classint.html">TIndex</a> inc = 1;</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="classint.html">TIndex</a> upperLimit;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> ( (value >= (*mpArray)[guessIndex]) == ascending)</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (guessIndex == n-1)</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> -1;<span class="comment">//X.A. changed to -1 for consistency</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  upperLimit = guessIndex+1;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">while</span> ( (value >= (*mpArray)[upperLimit]) == ascending)</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  {</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  guessIndex = upperLimit;</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  inc += inc;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  upperLimit += inc;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (upperLimit >= n) </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  result=Bisection(value,guessIndex);</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span>(result==n-1) </div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">else</span> </div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  } </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">else</span> </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (guessIndex==0) </div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  upperLimit = guessIndex--;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">while</span> ( (value < (*mpArray)[guessIndex]) == ascending)</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  {</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  upperLimit = guessIndex;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  inc += inc;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (inc >= upperLimit) </div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  result = Bisection(value,0,upperLimit);</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span>(result==0) </div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">else</span> </div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  guessIndex = upperLimit-inc;</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> Bisection(value,guessIndex,upperLimit);</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="keyword">template</span> <<span class="keyword">class</span> T> </div>
<div class="line"><a name="l00136"></a><span class="lineno"><a class="code" href="classCLAM_1_1SearchArray.html#aa09f9a5c2c1fec0e7fba5f125316bdfb"> 136</a></span>  <span class="keyword">inline</span> <a class="code" href="classint.html">TIndex</a> <a class="code" href="classCLAM_1_1SearchArray.html#a2e09ebec5b49e8127a27d152608f4aa8">SearchArray<T>::Bisection</a>(</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> T& value,<a class="code" href="classint.html">TIndex</a> lowerLimit,<a class="code" href="classint.html">TIndex</a> upperLimit)<span class="keyword"> const</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="keyword"></span>{</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  lowerLimit--;</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">bool</span> ascending = (*mpArray)[mpArray->Size()-1] >= (*mpArray)[0];</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (upperLimit-lowerLimit > 1)</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="classint.html">TIndex</a> midPoint = (upperLimit+lowerLimit)>>1;</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">if</span> ( (value >= (*mpArray)[midPoint]) == ascending)</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  lowerLimit = midPoint;</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  upperLimit = midPoint;</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span> lowerLimit;</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> }</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> }</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor"></span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1
</small></address>
</body>
</html>
Cokiee Shell Web 1.0, Coded By Razor
Neueste Kommentare