<!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">
<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.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: losertree.h 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="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</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 id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00908_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">losertree.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00908.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">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2007-2018 Free Software Foundation, Inc.</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">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// 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 GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file parallel/losertree.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">* @brief Many generic loser tree variants.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">* This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">*/</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_LOSERTREE_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_LOSERTREE_H 1</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00530.html">bits/stl_algobase.h</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00542.html">bits/stl_function.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a00887.html">parallel/features.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a16491.html">parallel/base.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {<span class="comment"></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> /**</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * @brief Guarded loser/tournament tree.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> *</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * The smallest element is at the top.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> *</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * Guarding is done explicitly through one flag _M_sup per element,</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * inf is not needed due to a better initialization routine. This</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * is a well-performing variant.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> *</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @param _Tp the element type</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @param _Compare the comparator to use, defaults to std::less<_Tp></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> */</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="a09443.html"> 55</a></span>  <span class="keyword">class </span><a class="code" href="a09443.html">_LoserTreeBase</a></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">protected</span>:<span class="comment"></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> /** @brief Internal representation of a _LoserTree element. */</span></div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="a09447.html"> 59</a></span>  <span class="keyword">struct </span><a class="code" href="a09447.html">_Loser</a></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  {<span class="comment"></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> /** @brief flag, true iff this is a "maximum" __sentinel. */</span></div><div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="a09447.html#a704e30d74cc22713c993d8a22c145fef"> 62</a></span>  <span class="keywordtype">bool</span> <a class="code" href="a09447.html#a704e30d74cc22713c993d8a22c145fef">_M_sup</a>;<span class="comment"></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> /** @brief __index of the __source __sequence. */</span></div><div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="a09447.html#a6887fcf9b3448e958f46c5a822befc5b"> 64</a></span>  <span class="keywordtype">int</span> <a class="code" href="a09447.html#a6887fcf9b3448e958f46c5a822befc5b">_M_source</a>;<span class="comment"></span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> /** @brief _M_key of the element in the _LoserTree. */</span></div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="a09447.html#a8450fa226312185aa27a526f23677a75"> 66</a></span>  _Tp <a class="code" href="a09447.html#a8450fa226312185aa27a526f23677a75">_M_key</a>;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  };</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>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _M_ik, _M_k, _M_offset;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"></span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> /** log_2{_M_k} */</span></div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="a09443.html#a75bba27325ffeb227186440dfc836fb9"> 72</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09443.html#a75bba27325ffeb227186440dfc836fb9">_M_log_k</a>;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"></span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /** @brief _LoserTree __elements. */</span></div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974"> 75</a></span>  <a class="code" href="a09447.html">_Loser</a>* <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"></span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> /** @brief _Compare to use. */</span></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="a09443.html#a7bbc4162a7a7aad013038e076f516512"> 78</a></span>  _Compare <a class="code" href="a09443.html#a7bbc4162a7a7aad013038e076f516512">_M_comp</a>;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"></span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> /**</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * @brief State flag that determines whether the _LoserTree is empty.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> *</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * Only used for building the _LoserTree.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> */</span></div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="a09443.html#afd84c329905b58ec69ade3066f138124"> 85</a></span>  <span class="keywordtype">bool</span> <a class="code" href="a09443.html#afd84c329905b58ec69ade3066f138124">_M_first_insert</a>;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> /**</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * @brief The constructor.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> *</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * @param __k The number of sequences to merge.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * @param __comp The comparator to use.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> */</span></div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="a09443.html#acae75ac10b89e74fcabfd598399280e8"> 94</a></span>  <a class="code" href="a09443.html#acae75ac10b89e74fcabfd598399280e8">_LoserTreeBase</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, _Compare __comp)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  : <a class="code" href="a09443.html#a7bbc4162a7a7aad013038e076f516512">_M_comp</a>(__comp)</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>  _M_ik = __k;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// Compute log_2{_M_k} for the _Loser Tree</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="a09443.html#a75bba27325ffeb227186440dfc836fb9">_M_log_k</a> = <a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(_M_ik - 1) + 1;</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>  <span class="comment">// Next greater power of 2.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _M_k = 1 << <a class="code" href="a09443.html#a75bba27325ffeb227186440dfc836fb9">_M_log_k</a>;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _M_offset = _M_k;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Avoid default-constructing _M_losers[]._M_key</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a> = static_cast<_Loser*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(2 * _M_k</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  * <span class="keyword">sizeof</span>(<a class="code" href="a09447.html">_Loser</a>)));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = _M_ik - 1; __i < _M_k; ++__i)</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__i + _M_k]._M_sup = <span class="keyword">true</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>  <a class="code" href="a09443.html#afd84c329905b58ec69ade3066f138124">_M_first_insert</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"></span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> /**</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * @brief The destructor.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> */</span></div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="a09443.html#aab2d1be8f756025bc63f64218c88a559"> 118</a></span>  <a class="code" href="a09443.html#aab2d1be8f756025bc63f64218c88a559">~_LoserTreeBase</a>()</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = 0; __i < (2 * _M_k); ++__i)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__i].~<a class="code" href="a09447.html">_Loser</a>();</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  ::operator <span class="keyword">delete</span>(<a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>);</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="comment"></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> /**</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> * @brief Initializes the sequence "_M_source" with the element "__key".</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> *</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> * @param __key the element to insert</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> * @param __source __index of the __source __sequence</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * @param __sup flag that determines whether the value to insert is an</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> * explicit __supremum.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> */</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="a09443.html#ae40e9ed966e6afbbdcfca290b3992130"> 134</a></span>  <a class="code" href="a09443.html#ae40e9ed966e6afbbdcfca290b3992130">__insert_start</a>(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">int</span> __source, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = _M_k + __source;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (<a class="code" href="a09443.html#afd84c329905b58ec69ade3066f138124">_M_first_insert</a>)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Construct all keys, so we can easily destruct them.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = 0; __i < (2 * _M_k); ++__i)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  ::<span class="keyword">new</span>(&(<a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__i]._M_key)) _Tp(__key);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="a09443.html#afd84c329905b58ec69ade3066f138124">_M_first_insert</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__pos].<a class="code" href="a09447.html#a8450fa226312185aa27a526f23677a75">_M_key</a> = __key;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__pos].<a class="code" href="a09447.html#a704e30d74cc22713c993d8a22c145fef">_M_sup</a> = __sup;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[__pos].<a class="code" href="a09447.html#a6887fcf9b3448e958f46c5a822befc5b">_M_source</a> = __source;</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> <span class="comment"></span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> /**</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * @return the index of the sequence with the smallest element.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> */</span></div><div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="a09443.html#ae03e177c456afb3093d6aed490de7b70"> 155</a></span>  <span class="keywordtype">int</span> <a class="code" href="a09443.html#ae03e177c456afb3093d6aed490de7b70">__get_min_source</a>()</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  { <span class="keywordflow">return</span> <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_M_losers</a>[0].<a class="code" href="a09447.html#a6887fcf9b3448e958f46c5a822befc5b">_M_source</a>; }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  };</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"></span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> /**</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @brief Stable _LoserTree variant.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> *</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * Provides the stable implementations of insert_start, __init_winner,</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * __init and __delete_min_insert.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> *</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * Unstable variant is done using partial specialisation below.</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> */</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable<span class="comment">/* default == true */</span>, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="a09451.html"> 169</a></span>  <span class="keyword">class </span><a class="code" href="a09451.html">_LoserTree</a></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  : <span class="keyword">public</span> <a class="code" href="a09443.html">_LoserTreeBase</a><_Tp, _Compare></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">typedef</span> <a class="code" href="a09443.html">_LoserTreeBase<_Tp, _Compare></a> <a class="code" href="a09443.html">_Base</a>;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">using</span> <a class="code" href="a09443.html#a7bbc4162a7a7aad013038e076f516512">_Base::_M_comp</a>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">using</span> <a class="code" href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">_Base::_M_losers</a>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">using</span> <a class="code" href="a09443.html#afd84c329905b58ec69ade3066f138124">_Base::_M_first_insert</a>;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="a09451.html">_LoserTree</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, _Compare __comp)</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  : <a class="code" href="a09443.html#acae75ac10b89e74fcabfd598399280e8">_Base::_LoserTreeBase</a>(__k, __comp)</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  { }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  {</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (_M_losers[__right]._M_sup</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  || (!_M_losers[__left]._M_sup</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  && !_M_comp(_M_losers[__right]._M_key,</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  _M_losers[__left]._M_key)))</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">void</span> __init()</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  { _M_losers[0] = _M_losers[__init_winner(1)]; }</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"></span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> /**</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> * @brief Delete the smallest element and insert a new element from</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> * the previously smallest element's sequence.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> *</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * This implementation is stable.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> */</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// Do not pass a const reference since __key will be used as</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// local variable.</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="a09451.html#a35d4c47719d2f41603ba9c650f3f1e5a"> 222</a></span>  <a class="code" href="a09451.html#a35d4c47719d2f41603ba9c650f3f1e5a">__delete_min_insert</a>(_Tp __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  __pos /= 2)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// The smaller one gets promoted, ties are broken by _M_source.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> ((__sup && (!_M_losers[__pos]._M_sup</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  || _M_losers[__pos]._M_source < __source))</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  || (!__sup && !_M_losers[__pos]._M_sup</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  && ((_M_comp(_M_losers[__pos]._M_key, __key))</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  || (!_M_comp(__key, _M_losers[__pos]._M_key)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  && _M_losers[__pos]._M_source < __source))))</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  std::swap(_M_losers[__pos]._M_sup, __sup);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  swap(_M_losers[__pos]._M_key, __key);</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  _M_losers[0]._M_sup = __sup;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  _M_losers[0]._M_key = __key;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  };</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"></span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> /**</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> * @brief Unstable _LoserTree variant.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"> *</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> * Stability (non-stable here) is selected with partial specialization.</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> */</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00261"></a><span class="lineno"><a class="line" href="a09455.html"> 261</a></span>  <span class="keyword">class </span><a class="code" href="a09451.html">_LoserTree</a><<span class="comment">/* __stable == */</span>false, _Tp, _Compare></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  : <span class="keyword">public</span> <a class="code" href="a09443.html">_LoserTreeBase</a><_Tp, _Compare></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">typedef</span> <a class="code" href="a09443.html">_LoserTreeBase<_Tp, _Compare></a> <a class="code" href="a09443.html">_Base</a>;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">using</span> _Base::_M_log_k;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">using</span> _Base::_M_first_insert;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="a09451.html">_LoserTree</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, _Compare __comp)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  : _Base::_LoserTreeBase(__k, __comp)</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  { }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"></span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> /**</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"> * Computes the winner of the competition at position "__root".</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> *</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * Called recursively (starting at 0) to build the initial tree.</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> *</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> * @param __root __index of the "game" to start.</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> */</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="a09455.html#a72f173966387d5b8bd2fe3f9cedd32c8"> 284</a></span>  <a class="code" href="a09455.html#a72f173966387d5b8bd2fe3f9cedd32c8">__init_winner</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (_M_losers[__right]._M_sup</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  || (!_M_losers[__left]._M_sup</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  && !_M_comp(_M_losers[__right]._M_key,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  _M_losers[__left]._M_key)))</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  __init()</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  { _M_losers[0] = _M_losers[__init_winner(1)]; }</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"></span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> /**</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * Delete the _M_key smallest element and insert the element __key</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> * instead.</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> *</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> * @param __key the _M_key to insert</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"> * @param __sup true iff __key is an explicitly marked supremum</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> */</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Do not pass a const reference since __key will be used as local</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// variable.</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00324"></a><span class="lineno"><a class="line" href="a09455.html#aadac29421984aa702191fc81c3942afb"> 324</a></span>  <a class="code" href="a09455.html#aadac29421984aa702191fc81c3942afb">__delete_min_insert</a>(_Tp __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  {</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  __pos /= 2)</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  {</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// The smaller one gets promoted.</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">if</span> (__sup || (!_M_losers[__pos]._M_sup</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  && _M_comp(_M_losers[__pos]._M_key, __key)))</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  std::swap(_M_losers[__pos]._M_sup, __sup);</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  swap(_M_losers[__pos]._M_key, __key);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  _M_losers[0]._M_sup = __sup;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  _M_losers[0]._M_key = __key;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  };</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"></span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> /**</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> * @brief Base class of _Loser Tree implementation using pointers.</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> */</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="a09459.html"> 357</a></span>  <span class="keyword">class </span><a class="code" href="a09459.html">_LoserTreePointerBase</a></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  {</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">protected</span>:<span class="comment"></span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> /** @brief Internal representation of _LoserTree __elements. */</span></div><div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="a09463.html"> 361</a></span>  <span class="keyword">struct </span><a class="code" href="a09463.html">_Loser</a></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">bool</span> _M_sup;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordtype">int</span> _M_source;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">const</span> _Tp* _M_keyp;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  };</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _M_ik, _M_k, _M_offset;</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="a09463.html">_Loser</a>* _M_losers;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  _Compare _M_comp;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="a09459.html">_LoserTreePointerBase</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k,</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  : _M_comp(__comp)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  _M_ik = __k;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// Next greater power of 2.</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  _M_k = 1 << (<a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(_M_ik - 1) + 1);</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  _M_offset = _M_k;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  _M_losers = <span class="keyword">new</span> <a class="code" href="a09463.html">_Loser</a>[_M_k * 2];</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = _M_ik - 1; __i < _M_k; __i++)</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  _M_losers[__i + _M_k]._M_sup = <span class="keyword">true</span>;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  ~<a class="code" href="a09459.html">_LoserTreePointerBase</a>()</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  { <span class="keyword">delete</span>[] _M_losers; }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordtype">int</span> __get_min_source()</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  { <span class="keywordflow">return</span> _M_losers[0]._M_source; }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">void</span> __insert_start(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">int</span> __source, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  {</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = _M_k + __source;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  _M_losers[__pos]._M_sup = __sup;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  _M_losers[__pos]._M_source = __source;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  _M_losers[__pos]._M_keyp = &__key;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  };</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"></span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> /**</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * @brief Stable _LoserTree implementation.</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> *</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * The unstable variant is implemented using partial instantiation below.</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> */</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable<span class="comment">/* default == true */</span>, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00409"></a><span class="lineno"><a class="line" href="a09467.html"> 409</a></span>  <span class="keyword">class </span><a class="code" href="a09467.html">_LoserTreePointer</a></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  : <span class="keyword">public</span> <a class="code" href="a09459.html">_LoserTreePointerBase</a><_Tp, _Compare></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">typedef</span> <a class="code" href="a09459.html">_LoserTreePointerBase<_Tp, _Compare></a> <a class="code" href="a09459.html">_Base</a>;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="code" href="a09467.html">_LoserTreePointer</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  : _Base::_LoserTreePointerBase(__k, __comp)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  { }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  {</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (_M_losers[__right]._M_sup</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  || (!_M_losers[__left]._M_sup</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  && !_M_comp(*_M_losers[__right]._M_keyp,</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  *_M_losers[__left]._M_keyp)))</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  {</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordtype">void</span> __init()</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  { _M_losers[0] = _M_losers[__init_winner(1)]; }</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">void</span> __delete_min_insert(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  {</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keyword">const</span> _Tp* __keyp = &__key;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  __pos /= 2)</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  {</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// The smaller one gets promoted, ties are broken by __source.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> ((__sup && (!_M_losers[__pos]._M_sup</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  || _M_losers[__pos]._M_source < __source))</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  || (!__sup && !_M_losers[__pos]._M_sup &&</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  ((_M_comp(*_M_losers[__pos]._M_keyp, *__keyp))</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  || (!_M_comp(*__keyp, *_M_losers[__pos]._M_keyp)</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  && _M_losers[__pos]._M_source < __source))))</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  std::swap(_M_losers[__pos]._M_sup, __sup);</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  std::swap(_M_losers[__pos]._M_keyp, __keyp);</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  _M_losers[0]._M_sup = __sup;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  _M_losers[0]._M_keyp = __keyp;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  };</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"></span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment"> /**</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment"> * @brief Unstable _LoserTree implementation.</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment"> *</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment"> * The stable variant is above.</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment"> */</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00491"></a><span class="lineno"><a class="line" href="a09471.html"> 491</a></span>  <span class="keyword">class </span><a class="code" href="a09467.html">_LoserTreePointer</a><<span class="comment">/* __stable == */</span>false, _Tp, _Compare></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  : <span class="keyword">public</span> <a class="code" href="a09459.html">_LoserTreePointerBase</a><_Tp, _Compare></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keyword">typedef</span> <a class="code" href="a09459.html">_LoserTreePointerBase<_Tp, _Compare></a> <a class="code" href="a09459.html">_Base</a>;</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="a09467.html">_LoserTreePointer</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  : _Base::_LoserTreePointerBase(__k, __comp)</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  { }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  {</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (_M_losers[__right]._M_sup</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  || (!_M_losers[__left]._M_sup</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  && !_M_comp(*_M_losers[__right]._M_keyp,</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  *_M_losers[__left]._M_keyp)))</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  {</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  }</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  {</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> </div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">void</span> __init()</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  { _M_losers[0] = _M_losers[__init_winner(1)]; }</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> </div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordtype">void</span> __delete_min_insert(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  {</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keyword">const</span> _Tp* __keyp = &__key;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  __pos /= 2)</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  {</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// The smaller one gets promoted.</span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (__sup || (!_M_losers[__pos]._M_sup</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  && _M_comp(*_M_losers[__pos]._M_keyp, *__keyp)))</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  std::swap(_M_losers[__pos]._M_sup, __sup);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  std::swap(_M_losers[__pos]._M_keyp, __keyp);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  _M_losers[0]._M_sup = __sup;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  _M_losers[0]._M_keyp = __keyp;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  };</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"></span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> /** @brief Base class for unguarded _LoserTree implementation.</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> * </span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> * The whole element is copied into the tree structure.</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> *</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * No guarding is done, therefore not a single input sequence must</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * run empty. Unused __sequence heads are marked with a sentinel which</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * is &gt; all elements that are to be merged.</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> *</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * This is a very fast variant.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> */</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00574"></a><span class="lineno"><a class="line" href="a09475.html"> 574</a></span>  <span class="keyword">class </span><a class="code" href="a09475.html">_LoserTreeUnguardedBase</a></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">struct </span>_Loser</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">int</span> _M_source;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  _Tp _M_key;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  };</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _M_ik, _M_k, _M_offset;</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  _Loser* _M_losers;</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  _Compare _M_comp;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <a class="code" href="a09475.html">_LoserTreeUnguardedBase</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  : _M_comp(__comp)</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  {</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  _M_ik = __k;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Next greater power of 2.</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  _M_k = 1 << (<a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(_M_ik - 1) + 1);</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  _M_offset = _M_k;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// Avoid default-constructing _M_losers[]._M_key</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  _M_losers = static_cast<_Loser*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(2 * _M_k</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  * <span class="keyword">sizeof</span>(_Loser)));</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = 0; __i < _M_k; ++__i)</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  {</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  ::new(&(_M_losers[__i]._M_key)) _Tp(__sentinel);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  _M_losers[__i]._M_source = -1;</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = _M_k + _M_ik - 1; __i < (2 * _M_k); ++__i)</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  {</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  ::new(&(_M_losers[__i]._M_key)) _Tp(__sentinel);</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  _M_losers[__i]._M_source = -1;</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  }</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  ~<a class="code" href="a09475.html">_LoserTreeUnguardedBase</a>()</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  {</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = 0; __i < (2 * _M_k); ++__i)</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  _M_losers[__i].~_Loser();</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  ::operator <span class="keyword">delete</span>(_M_losers);</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordtype">int</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  __get_min_source()</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  {</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">return</span> _M_losers[0]._M_source;</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> </div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  __insert_start(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">int</span> __source, <span class="keywordtype">bool</span>)</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  {</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = _M_k + __source;</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  ::new(&(_M_losers[__pos]._M_key)) _Tp(__key);</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  _M_losers[__pos]._M_source = __source;</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  };</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"></span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> /**</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * @brief Stable implementation of unguarded _LoserTree.</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> *</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * Unstable variant is selected below with partial specialization.</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> */</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable<span class="comment">/* default == true */</span>, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00646"></a><span class="lineno"><a class="line" href="a09483.html"> 646</a></span>  <span class="keyword">class </span><a class="code" href="a09483.html">_LoserTreeUnguarded</a></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  : <span class="keyword">public</span> <a class="code" href="a09475.html">_LoserTreeUnguardedBase</a><_Tp, _Compare></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  {</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">typedef</span> <a class="code" href="a09475.html">_LoserTreeUnguardedBase<_Tp, _Compare></a> <a class="code" href="a09475.html">_Base</a>;</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <a class="code" href="a09483.html">_LoserTreeUnguarded</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  : _Base::_LoserTreeUnguardedBase(__k, __sentinel, __comp)</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  { }</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  {</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (!_M_comp(_M_losers[__right]._M_key,</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  _M_losers[__left]._M_key))</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  {</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  }</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  {</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  }</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  }</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> </div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  __init()</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  _M_losers[0] = _M_losers[__init_winner(1)];</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// no dummy sequence can ever be at the top at the beginning</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// (0 sequences!)</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> </div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="comment">// Do not pass a const reference since __key will be used as</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// local variable.</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  __delete_min_insert(_Tp __key, <span class="keywordtype">bool</span>)</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  {</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  __pos /= 2)</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  {</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// The smaller one gets promoted, ties are broken by _M_source.</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">if</span> (_M_comp(_M_losers[__pos]._M_key, __key)</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  || (!_M_comp(__key, _M_losers[__pos]._M_key)</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  && _M_losers[__pos]._M_source < __source))</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  {</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  swap(_M_losers[__pos]._M_key, __key);</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  }</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> </div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  _M_losers[0]._M_key = __key;</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  }</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  };</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"></span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"> /**</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="comment"> * @brief Non-Stable implementation of unguarded _LoserTree.</span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="comment"> *</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment"> * Stable implementation is above.</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"> */</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00734"></a><span class="lineno"><a class="line" href="a09487.html"> 734</a></span>  <span class="keyword">class </span><a class="code" href="a09483.html">_LoserTreeUnguarded</a><<span class="comment">/* __stable == */</span>false, _Tp, _Compare></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  : <span class="keyword">public</span> <a class="code" href="a09475.html">_LoserTreeUnguardedBase</a><_Tp, _Compare></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keyword">typedef</span> <a class="code" href="a09475.html">_LoserTreeUnguardedBase<_Tp, _Compare></a> <a class="code" href="a09475.html">_Base</a>;</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> </div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <a class="code" href="a09483.html">_LoserTreeUnguarded</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  : _Base::_LoserTreeUnguardedBase(__k, __sentinel, __comp)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  { }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  {</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  {</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> </div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// If __left one is sentinel then __right one must be, too.</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">if</span> (_M_losers[__left]._M_source == -1)</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[__right]._M_source == -1);</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> </div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">if</span> (!_M_comp(_M_losers[__right]._M_key,</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  _M_losers[__left]._M_key))</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  }</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  {</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  }</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  }</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  __init()</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  {</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  _M_losers[0] = _M_losers[__init_winner(1)];</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> </div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// no dummy sequence can ever be at the top at the beginning</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// (0 sequences!)</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// Do not pass a const reference since __key will be used as</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="comment">// local variable.</span></div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  __delete_min_insert(_Tp __key, <span class="keywordtype">bool</span>)</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  {</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> </div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  __pos /= 2)</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  {</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">// The smaller one gets promoted.</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">if</span> (_M_comp(_M_losers[__pos]._M_key, __key))</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  {</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  swap(_M_losers[__pos]._M_key, __key);</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> </div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  _M_losers[0]._M_key = __key;</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  }</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  };</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"></span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"> /** @brief Unguarded loser tree, keeping only pointers to the</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> * elements in the tree structure.</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment"> *</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="comment"> * No guarding is done, therefore not a single input sequence must</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="comment"> * run empty. This is a very fast variant.</span></div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="comment"> */</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00828"></a><span class="lineno"><a class="line" href="a09491.html"> 828</a></span>  <span class="keyword">class </span><a class="code" href="a09491.html">_LoserTreePointerUnguardedBase</a></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  {</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">struct </span>_Loser</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  {</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordtype">int</span> _M_source;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">const</span> _Tp* _M_keyp;</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  };</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _M_ik, _M_k, _M_offset;</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  _Loser* _M_losers;</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  _Compare _M_comp;</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> </div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="a09491.html">_LoserTreePointerUnguardedBase</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  : _M_comp(__comp)</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  {</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  _M_ik = __k;</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// Next greater power of 2.</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  _M_k = 1 << (<a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(_M_ik - 1) + 1);</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  _M_offset = _M_k;</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="comment">// Avoid default-constructing _M_losers[]._M_key</span></div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  _M_losers = <span class="keyword">new</span> _Loser[2 * _M_k];</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> </div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __i = _M_k + _M_ik - 1; __i < (2 * _M_k); ++__i)</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  {</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  _M_losers[__i]._M_keyp = &__sentinel;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  _M_losers[__i]._M_source = -1;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  }</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> </div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  ~<a class="code" href="a09491.html">_LoserTreePointerUnguardedBase</a>()</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  { <span class="keyword">delete</span>[] _M_losers; }</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> </div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordtype">int</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  __get_min_source()</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  {</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">return</span> _M_losers[0]._M_source;</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> </div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  __insert_start(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">int</span> __source, <span class="keywordtype">bool</span>)</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  {</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = _M_k + __source;</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> </div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  _M_losers[__pos]._M_keyp = &__key;</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  _M_losers[__pos]._M_source = __source;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  };</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="comment"></span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="comment"> /**</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="comment"> * @brief Stable unguarded _LoserTree variant storing pointers.</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="comment"> *</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="comment"> * Unstable variant is implemented below using partial specialization.</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="comment"> */</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable<span class="comment">/* default == true */</span>, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00891"></a><span class="lineno"><a class="line" href="a09499.html"> 891</a></span>  <span class="keyword">class </span><a class="code" href="a09499.html">_LoserTreePointerUnguarded</a></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  : <span class="keyword">public</span> <a class="code" href="a09491.html">_LoserTreePointerUnguardedBase</a><_Tp, _Compare></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  {</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">typedef</span> <a class="code" href="a09491.html">_LoserTreePointerUnguardedBase<_Tp, _Compare></a> <a class="code" href="a09491.html">_Base</a>;</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> </div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="a09499.html">_LoserTreePointerUnguarded</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  : _Base::_LoserTreePointerUnguardedBase(__k, __sentinel, __comp)</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  { }</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  {</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  {</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (!_M_comp(*_M_losers[__right]._M_keyp,</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  *_M_losers[__left]._M_keyp))</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  {</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  {</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  }</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  __init()</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  {</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  _M_losers[0] = _M_losers[__init_winner(1)];</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> </div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// no dummy sequence can ever be at the top at the beginning</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// (0 sequences!)</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  __delete_min_insert(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  {</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> </div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keyword">const</span> _Tp* __keyp = &__key;</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  __pos /= 2)</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  {</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="comment">// The smaller one gets promoted, ties are broken by _M_source.</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">if</span> (_M_comp(*_M_losers[__pos]._M_keyp, *__keyp)</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  || (!_M_comp(*__keyp, *_M_losers[__pos]._M_keyp)</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  && _M_losers[__pos]._M_source < __source))</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  {</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  std::swap(_M_losers[__pos]._M_keyp, __keyp);</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  }</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  }</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> </div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  _M_losers[0]._M_keyp = __keyp;</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  }</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  };</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"></span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> /**</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"> * @brief Unstable unguarded _LoserTree variant storing pointers.</span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"> *</span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"> * Stable variant is above.</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> */</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00977"></a><span class="lineno"><a class="line" href="a09503.html"> 977</a></span>  <span class="keyword">class </span><a class="code" href="a09499.html">_LoserTreePointerUnguarded</a><<span class="comment">/* __stable == */</span>false, _Tp, _Compare></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  : <span class="keyword">public</span> <a class="code" href="a09491.html">_LoserTreePointerUnguardedBase</a><_Tp, _Compare></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  {</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keyword">typedef</span> <a class="code" href="a09491.html">_LoserTreePointerUnguardedBase<_Tp, _Compare></a> <a class="code" href="a09491.html">_Base</a>;</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">using</span> _Base::_M_k;</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keyword">using</span> _Base::_M_comp;</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keyword">using</span> _Base::_M_losers;</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> </div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <a class="code" href="a09499.html">_LoserTreePointerUnguarded</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __k, <span class="keyword">const</span> _Tp& __sentinel,</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  : _Base::_LoserTreePointerUnguardedBase(__k, __sentinel, __comp)</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  { }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> </div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  __init_winner(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __root)</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  {</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">if</span> (__root >= _M_k)</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordflow">return</span> __root;</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  {</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __left = __init_winner(2 * __root);</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __right = __init_winner(2 * __root + 1);</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> </div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// If __left one is sentinel then __right one must be, too.</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keywordflow">if</span> (_M_losers[__left]._M_source == -1)</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[__right]._M_source == -1);</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keywordflow">if</span> (!_M_comp(*_M_losers[__right]._M_keyp,</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  *_M_losers[__left]._M_keyp))</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  {</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="comment">// Left one is less or equal.</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  _M_losers[__root] = _M_losers[__right];</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  {</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="comment">// Right one is less.</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  _M_losers[__root] = _M_losers[__left];</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  }</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  }</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  }</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  __init()</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  {</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  _M_losers[0] = _M_losers[__init_winner(1)];</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> </div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="comment">// no dummy sequence can ever be at the top at the beginning</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="comment">// (0 sequences!)</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> </div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  __delete_min_insert(<span class="keyword">const</span> _Tp& __key, <span class="keywordtype">bool</span> __sup)</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  {</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="comment">// no dummy sequence can ever be at the top!</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> </div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keyword">const</span> _Tp* __keyp = &__key;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordtype">int</span> __source = _M_losers[0]._M_source;</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __pos = (_M_k + __source) / 2; __pos > 0;</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  __pos /= 2)</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  {</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// The smaller one gets promoted.</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">if</span> (_M_comp(*(_M_losers[__pos]._M_keyp), *__keyp))</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  {</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="comment">// The other one is smaller.</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  std::swap(_M_losers[__pos]._M_source, __source);</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  std::swap(_M_losers[__pos]._M_keyp, __keyp);</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> </div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  _M_losers[0]._M_source = __source;</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  _M_losers[0]._M_keyp = __keyp;</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  };</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> } <span class="comment">// namespace __gnu_parallel</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> </div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_LOSERTREE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09491_html"><div class="ttname"><a href="a09491.html">__gnu_parallel::_LoserTreePointerUnguardedBase</a></div><div class="ttdoc">Unguarded loser tree, keeping only pointers to the elements in the tree structure.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00828">losertree.h:828</a></div></div>
<div class="ttc" id="a09451_html_a35d4c47719d2f41603ba9c650f3f1e5a"><div class="ttname"><a href="a09451.html#a35d4c47719d2f41603ba9c650f3f1e5a">__gnu_parallel::_LoserTree::__delete_min_insert</a></div><div class="ttdeci">void __delete_min_insert(_Tp __key, bool __sup)</div><div class="ttdoc">Delete the smallest element and insert a new element from the previously smallest element's sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00222">losertree.h:222</a></div></div>
<div class="ttc" id="a07379_html"><div class="ttname"><a href="a07379.html">std::less</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00340">stl_function.h:340</a></div></div>
<div class="ttc" id="a09459_html"><div class="ttname"><a href="a09459.html">__gnu_parallel::_LoserTreePointerBase</a></div><div class="ttdoc">Base class of _Loser Tree implementation using pointers.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00357">losertree.h:357</a></div></div>
<div class="ttc" id="a09447_html_a6887fcf9b3448e958f46c5a822befc5b"><div class="ttname"><a href="a09447.html#a6887fcf9b3448e958f46c5a822befc5b">__gnu_parallel::_LoserTreeBase::_Loser::_M_source</a></div><div class="ttdeci">int _M_source</div><div class="ttdoc">__index of the __source __sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00064">losertree.h:64</a></div></div>
<div class="ttc" id="a09447_html"><div class="ttname"><a href="a09447.html">__gnu_parallel::_LoserTreeBase::_Loser</a></div><div class="ttdoc">Internal representation of a _LoserTree element.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00059">losertree.h:59</a></div></div>
<div class="ttc" id="a00542_html"><div class="ttname"><a href="a00542.html">stl_function.h</a></div></div>
<div class="ttc" id="a00530_html"><div class="ttname"><a href="a00530.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a09443_html_ae40e9ed966e6afbbdcfca290b3992130"><div class="ttname"><a href="a09443.html#ae40e9ed966e6afbbdcfca290b3992130">__gnu_parallel::_LoserTreeBase::__insert_start</a></div><div class="ttdeci">void __insert_start(const _Tp &__key, int __source, bool __sup)</div><div class="ttdoc">Initializes the sequence "_M_source" with the element "__key".</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00134">losertree.h:134</a></div></div>
<div class="ttc" id="a09467_html"><div class="ttname"><a href="a09467.html">__gnu_parallel::_LoserTreePointer</a></div><div class="ttdoc">Stable _LoserTree implementation.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00409">losertree.h:409</a></div></div>
<div class="ttc" id="a09443_html_acae75ac10b89e74fcabfd598399280e8"><div class="ttname"><a href="a09443.html#acae75ac10b89e74fcabfd598399280e8">__gnu_parallel::_LoserTreeBase::_LoserTreeBase</a></div><div class="ttdeci">_LoserTreeBase(unsigned int __k, _Compare __comp)</div><div class="ttdoc">The constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00094">losertree.h:94</a></div></div>
<div class="ttc" id="a09443_html_a7bbc4162a7a7aad013038e076f516512"><div class="ttname"><a href="a09443.html#a7bbc4162a7a7aad013038e076f516512">__gnu_parallel::_LoserTreeBase::_M_comp</a></div><div class="ttdeci">_Compare _M_comp</div><div class="ttdoc">_Compare to use.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00078">losertree.h:78</a></div></div>
<div class="ttc" id="a09443_html"><div class="ttname"><a href="a09443.html">__gnu_parallel::_LoserTreeBase</a></div><div class="ttdoc">Guarded loser/tournament tree.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00055">losertree.h:55</a></div></div>
<div class="ttc" id="a09499_html"><div class="ttname"><a href="a09499.html">__gnu_parallel::_LoserTreePointerUnguarded</a></div><div class="ttdoc">Stable unguarded _LoserTree variant storing pointers.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00891">losertree.h:891</a></div></div>
<div class="ttc" id="a09475_html"><div class="ttname"><a href="a09475.html">__gnu_parallel::_LoserTreeUnguardedBase</a></div><div class="ttdoc">Base class for unguarded _LoserTree implementation.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00574">losertree.h:574</a></div></div>
<div class="ttc" id="a09447_html_a8450fa226312185aa27a526f23677a75"><div class="ttname"><a href="a09447.html#a8450fa226312185aa27a526f23677a75">__gnu_parallel::_LoserTreeBase::_Loser::_M_key</a></div><div class="ttdeci">_Tp _M_key</div><div class="ttdoc">_M_key of the element in the _LoserTree.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00066">losertree.h:66</a></div></div>
<div class="ttc" id="a09463_html"><div class="ttname"><a href="a09463.html">__gnu_parallel::_LoserTreePointerBase::_Loser</a></div><div class="ttdoc">Internal representation of _LoserTree __elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00361">losertree.h:361</a></div></div>
<div class="ttc" id="a00887_html"><div class="ttname"><a href="a00887.html">features.h</a></div><div class="ttdoc">Defines on whether to include algorithm variants.</div></div>
<div class="ttc" id="a09443_html_aab2d1be8f756025bc63f64218c88a559"><div class="ttname"><a href="a09443.html#aab2d1be8f756025bc63f64218c88a559">__gnu_parallel::_LoserTreeBase::~_LoserTreeBase</a></div><div class="ttdeci">~_LoserTreeBase()</div><div class="ttdoc">The destructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00118">losertree.h:118</a></div></div>
<div class="ttc" id="a09483_html"><div class="ttname"><a href="a09483.html">__gnu_parallel::_LoserTreeUnguarded</a></div><div class="ttdoc">Stable implementation of unguarded _LoserTree.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00646">losertree.h:646</a></div></div>
<div class="ttc" id="a09443_html_afd84c329905b58ec69ade3066f138124"><div class="ttname"><a href="a09443.html#afd84c329905b58ec69ade3066f138124">__gnu_parallel::_LoserTreeBase::_M_first_insert</a></div><div class="ttdeci">bool _M_first_insert</div><div class="ttdoc">State flag that determines whether the _LoserTree is empty.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00085">losertree.h:85</a></div></div>
<div class="ttc" id="a16491_html"><div class="ttname"><a href="a16491.html">base.h</a></div><div class="ttdoc">Sequential helper functions. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a09455_html_a72f173966387d5b8bd2fe3f9cedd32c8"><div class="ttname"><a href="a09455.html#a72f173966387d5b8bd2fe3f9cedd32c8">__gnu_parallel::_LoserTree< false, _Tp, _Compare >::__init_winner</a></div><div class="ttdeci">unsigned int __init_winner(unsigned int __root)</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00284">losertree.h:284</a></div></div>
<div class="ttc" id="a09443_html_ae03e177c456afb3093d6aed490de7b70"><div class="ttname"><a href="a09443.html#ae03e177c456afb3093d6aed490de7b70">__gnu_parallel::_LoserTreeBase::__get_min_source</a></div><div class="ttdeci">int __get_min_source()</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00155">losertree.h:155</a></div></div>
<div class="ttc" id="a09455_html_aadac29421984aa702191fc81c3942afb"><div class="ttname"><a href="a09455.html#aadac29421984aa702191fc81c3942afb">__gnu_parallel::_LoserTree< false, _Tp, _Compare >::__delete_min_insert</a></div><div class="ttdeci">void __delete_min_insert(_Tp __key, bool __sup)</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00324">losertree.h:324</a></div></div>
<div class="ttc" id="a09451_html"><div class="ttname"><a href="a09451.html">__gnu_parallel::_LoserTree</a></div><div class="ttdoc">Stable _LoserTree variant.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00169">losertree.h:169</a></div></div>
<div class="ttc" id="a09443_html_a018ad8a7b6c35a776bce15ce4c1d7974"><div class="ttname"><a href="a09443.html#a018ad8a7b6c35a776bce15ce4c1d7974">__gnu_parallel::_LoserTreeBase::_M_losers</a></div><div class="ttdeci">_Loser * _M_losers</div><div class="ttdoc">_LoserTree __elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00075">losertree.h:75</a></div></div>
<div class="ttc" id="a09447_html_a704e30d74cc22713c993d8a22c145fef"><div class="ttname"><a href="a09447.html#a704e30d74cc22713c993d8a22c145fef">__gnu_parallel::_LoserTreeBase::_Loser::_M_sup</a></div><div class="ttdeci">bool _M_sup</div><div class="ttdoc">flag, true iff this is a "maximum" __sentinel.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00062">losertree.h:62</a></div></div>
<div class="ttc" id="a01575_html_ae8e1f6dc07de01f28bf591339cf8aa9c"><div class="ttname"><a href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__gnu_parallel::__rd_log2</a></div><div class="ttdeci">_Size __rd_log2(_Size __n)</div><div class="ttdoc">Calculates the rounded-down logarithm of __n for base 2.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00102">parallel/base.h:102</a></div></div>
<div class="ttc" id="a09443_html_a75bba27325ffeb227186440dfc836fb9"><div class="ttname"><a href="a09443.html#a75bba27325ffeb227186440dfc836fb9">__gnu_parallel::_LoserTreeBase::_M_log_k</a></div><div class="ttdeci">unsigned int _M_log_k</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00072">losertree.h:72</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_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_8c50ddefd65cfbc3979f354ad979e527.html">parallel</a></li><li class="navelem"><a class="el" href="a00908.html">losertree.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
803
