<!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++: stl_heap.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('a00545_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_heap.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00545.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">// Heap implementation -*- 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) 2001-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</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later 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,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Copyright (c) 1997</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> *</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> */</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">/** @file bits/stl_heap.h</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * Do not attempt to use it directly. @headername{queue}</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> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#ifndef _STL_HEAP_H</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#define _STL_HEAP_H 1</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#include <<a class="code" href="a00746.html">debug/debug.h</a>></span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00443.html">bits/predefined_ops.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> /**</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @defgroup heap_algorithms Heap</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> */</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Distance,</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  _Distance</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  __is_heap_until(_RandomAccessIterator __first, _Distance __n,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _Compare& __comp)</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  {</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _Distance __parent = 0;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (_Distance __child = 1; __child < __n; ++__child)</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (__comp(__first + __parent, __first + __child))</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> __child;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> ((__child & 1) == 0)</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  ++__parent;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> __n;</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> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// __is_heap, a predicate testing whether or not a range is a heap.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// This function is an extension, not part of the C++ standard.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Distance></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  __is_heap(_RandomAccessIterator __first, _Distance __n)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  __gnu_cxx::__ops::_Iter_less_iter __comp;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">return</span> std::__is_heap_until(__first, __n, __comp) == __n;</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> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typename</span> _Distance></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> std::__is_heap_until(__first, __n, __cmp) == __n;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  { <span class="keywordflow">return</span> std::__is_heap(__first, <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last)); }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _Compare __comp)</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> std::__is_heap(__first, _GLIBCXX_MOVE(__comp),</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last));</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// + is_heap and is_heap_until in C++0x.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Distance, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  __push_heap(_RandomAccessIterator __first,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _Distance __holeIndex, _Distance __topIndex, _Tp __value,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  _Compare& __comp)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  _Distance __parent = (__holeIndex - 1) / 2;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">while</span> (__holeIndex > __topIndex && __comp(__first + __parent, __value))</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __holeIndex = __parent;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  __parent = (__holeIndex - 1) / 2;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"></span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> /**</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> * @brief Push an element onto a heap.</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> * @param __last End of heap + element.</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> *</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> * This operation pushes the element at last-1 onto the valid heap</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> * over the range [__first,__last-1). After completion,</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> * [__first,__last) is a valid heap.</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="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="a01506.html#gad2a3e8fb6069d9cd1b14c186ec125102"> 154</a></span>  push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  _ValueType;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::difference_type</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  _DistanceType;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>)</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  __glibcxx_requires_irreflexive(__first, __last);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __glibcxx_requires_heap(__first, __last - 1);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  __gnu_cxx::__ops::_Iter_less_val __comp;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::__push_heap(__first, _DistanceType((__last - __first) - 1),</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  _DistanceType(0), _GLIBCXX_MOVE(__value), __comp);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"></span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> /**</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> * @brief Push an element onto a heap using comparison functor.</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> * @param __last End of heap + element.</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> * @param __comp Comparison functor.</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> *</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * This operation pushes the element at __last-1 onto the valid</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * heap over the range [__first,__last-1). After completion,</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * [__first,__last) is a valid heap. Compare operations are</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * performed using comp.</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> */</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00189"></a><span class="lineno"><a class="line" href="a01506.html#gac0d64c0744947b3d233779d9e9f656cc"> 189</a></span>  push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  _Compare __comp)</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  _ValueType;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::difference_type</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  _DistanceType;</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">// concept requirements</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  __glibcxx_requires_heap_pred(__first, __last - 1, __comp);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  __decltype(__gnu_cxx::__ops::__iter_comp_val(_GLIBCXX_MOVE(__comp)))</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::__push_heap(__first, _DistanceType((__last - __first) - 1),</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  _DistanceType(0), _GLIBCXX_MOVE(__value), __cmp);</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> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Distance,</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  _Distance __len, _Tp __value, _Compare __comp)</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">const</span> _Distance __topIndex = __holeIndex;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  _Distance __secondChild = __holeIndex;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">while</span> (__secondChild < (__len - 1) / 2)</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  __secondChild = 2 * (__secondChild + 1);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">if</span> (__comp(__first + __secondChild,</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  __first + (__secondChild - 1)))</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  __secondChild--;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  __holeIndex = __secondChild;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)</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>  __secondChild = 2 * (__secondChild + 1);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  + (__secondChild - 1)));</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  __holeIndex = __secondChild - 1;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  __decltype(__gnu_cxx::__ops::__iter_comp_val(_GLIBCXX_MOVE(__comp)))</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::__push_heap(__first, __holeIndex, __topIndex,</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  _GLIBCXX_MOVE(__value), __cmp);</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  _RandomAccessIterator __result, _Compare& __comp)</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  _ValueType;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::difference_type</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  _DistanceType;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  _ValueType __value = _GLIBCXX_MOVE(*__result);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  *__result = _GLIBCXX_MOVE(*__first);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  std::__adjust_heap(__first, _DistanceType(0),</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  _DistanceType(__last - __first),</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  _GLIBCXX_MOVE(__value), __comp);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</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"> /**</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> * @brief Pop an element off a heap.</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * @pre [__first, __last) is a valid, non-empty range.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> *</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * This operation pops the top of the heap. The elements __first</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> * and __last-1 are swapped and [__first,__last-1) is made into a</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> * heap.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> */</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="a01506.html#ga92aecc13151c6b58598e3dd9e54064b7"> 271</a></span>  pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  __glibcxx_requires_non_empty_range(__first, __last);</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  __glibcxx_requires_irreflexive(__first, __last);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  __glibcxx_requires_heap(__first, __last);</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (__last - __first > 1)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  --__last;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  __gnu_cxx::__ops::_Iter_less_iter __comp;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::__pop_heap(__first, __last, __last, __comp);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</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="comment"></span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment"> /**</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"> * @brief Pop an element off a heap using comparison functor.</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> * @param __comp Comparison functor to use.</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> *</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment"> * This operation pops the top of the heap. The elements __first</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> * and __last-1 are swapped and [__first,__last-1) is made into a</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"> * heap. Comparisons are made using comp.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> */</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00304"></a><span class="lineno"><a class="line" href="a01506.html#ga27b771598145e151f01281b5cb0fdbbb"> 304</a></span>  pop_heap(_RandomAccessIterator __first,</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  _RandomAccessIterator __last, _Compare __comp)</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>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  __glibcxx_requires_non_empty_range(__first, __last);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  __glibcxx_requires_heap_pred(__first, __last, __comp);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">if</span> (__last - __first > 1)</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  --__last;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  std::__pop_heap(__first, __last, __last, __cmp);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  _Compare& __comp)</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  _ValueType;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::difference_type</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  _DistanceType;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (__last - __first < 2)</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> _DistanceType __len = __last - __first;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  _DistanceType __parent = (__len - 2) / 2;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  {</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  __comp);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">if</span> (__parent == 0)</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  __parent--;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment"></span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> /**</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * @brief Construct a heap over a range.</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> * @ingroup heap_algorithms</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="comment"> * This operation makes the elements in [__first,__last) into a heap.</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> */</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="a01506.html#ga3de7da79c8fb3f306ce06ed566235b28"> 360</a></span>  make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  __glibcxx_requires_irreflexive(__first, __last);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  __gnu_cxx::__ops::_Iter_less_iter __comp;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::__make_heap(__first, __last, __comp);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"></span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment"> /**</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> * @brief Construct a heap over a range using comparison functor.</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> * @param __comp Comparison functor to use.</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> *</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> * This operation makes the elements in [__first,__last) into a heap.</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> * Comparisons are made using __comp.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> */</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00386"></a><span class="lineno"><a class="line" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc"> 386</a></span>  make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _Compare __comp)</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  {</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</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="keyword">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::__make_heap(__first, __last, __cmp);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  _Compare& __comp)</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  {</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">while</span> (__last - __first > 1)</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  --__last;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  std::__pop_heap(__first, __last, __last, __comp);</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"></span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> /**</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> * @brief Sort a heap.</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> *</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> * This operation sorts the valid heap in the range [__first,__last).</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> */</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00422"></a><span class="lineno"><a class="line" href="a01506.html#ga7e302d6652402edae355b8726b2b7e27"> 422</a></span>  sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  {</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  __glibcxx_requires_irreflexive(__first, __last);</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  __glibcxx_requires_heap(__first, __last);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  __gnu_cxx::__ops::_Iter_less_iter __comp;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  std::__sort_heap(__first, __last, __comp);</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"></span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> /**</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * @brief Sort a heap using comparison functor.</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> * @param __first Start of heap.</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> * @param __last End of heap.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> * @param __comp Comparison functor to use.</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> *</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> * This operation sorts the valid heap in the range [__first,__last).</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> * Comparisons are made using __comp.</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> */</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00449"></a><span class="lineno"><a class="line" href="a01506.html#ga441060fda917c1aed4e8fab9c860f706"> 449</a></span>  sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  _Compare __comp)</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="comment">// concept requirements</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  __glibcxx_requires_heap_pred(__first, __last, __comp);</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">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  std::__sort_heap(__first, __last, __cmp);</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> /**</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * @brief Search the end of a heap.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> * @return An iterator pointing to the first element not in the heap.</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> *</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> * This operation returns the last iterator i in [__first, __last) for which</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> * the range [__first, i) is a heap.</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> */</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">inline</span> _RandomAccessIterator</div><div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="a01506.html#gad3cf2f5b736b585f20dfd29ba24293e1"> 477</a></span>  is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)</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>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  __glibcxx_function_requires(_RandomAccessIteratorConcept<</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">typename</span> iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  __glibcxx_requires_irreflexive(__first, __last);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  __gnu_cxx::__ops::_Iter_less_iter __comp;</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> __first + </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  std::__is_heap_until(__first, <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last), __comp);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"></span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> /**</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> * @brief Search the end of a heap using comparison functor.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> * @param __comp Comparison functor to use.</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"> * @return An iterator pointing to the first element not in the heap.</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> *</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> * This operation returns the last iterator i in [__first, __last) for which</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> * the range [__first, i) is a heap. Comparisons are made using __comp.</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> */</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">inline</span> _RandomAccessIterator</div><div class="line"><a name="l00505"></a><span class="lineno"><a class="line" href="a01506.html#gac559e3fbb78b63111a38545f7f530f23"> 505</a></span>  is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  _Compare __comp)</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  {</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  __glibcxx_function_requires(_RandomAccessIteratorConcept<</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">return</span> __first</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  + std::__is_heap_until(__first, <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last), __cmp);</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"></span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"> /**</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> * @brief Determines whether a range is a heap.</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> * @return True if range is a heap, false otherwise.</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> */</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="a01506.html#ga33b76a74543508747285e182dce4e7ba"> 529</a></span>  is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  { <span class="keywordflow">return</span> <a class="code" href="a01506.html#gac559e3fbb78b63111a38545f7f530f23">std::is_heap_until</a>(__first, __last) == __last; }</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"></span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> /**</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> * @brief Determines whether a range is a heap using comparison functor.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * @param __comp Comparison functor to use.</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * @return True if range is a heap, false otherwise.</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> * @ingroup heap_algorithms</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> */</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00542"></a><span class="lineno"><a class="line" href="a01506.html#ga37f2af54af0ffe3b364736c8bd84314e"> 542</a></span>  is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  _Compare __comp)</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  {</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  __glibcxx_function_requires(_RandomAccessIteratorConcept<</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  __glibcxx_requires_irreflexive_pred(__first, __last, __comp);</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __dist = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">typedef</span> __decltype(__comp) _Cmp;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">return</span> std::__is_heap_until(__first, __dist, __cmp) == __dist;</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> } <span class="comment">// namespace</span></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> <span class="preprocessor">#endif </span><span class="comment">/* _STL_HEAP_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00422_html"><div class="ttname"><a href="a00422.html">move.h</a></div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a00443_html"><div class="ttname"><a href="a00443.html">predefined_ops.h</a></div></div>
<div class="ttc" id="a01506_html_gac559e3fbb78b63111a38545f7f530f23"><div class="ttname"><a href="a01506.html#gac559e3fbb78b63111a38545f7f530f23">std::is_heap_until</a></div><div class="ttdeci">_RandomAccessIterator is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</div><div class="ttdoc">Search the end of a heap using comparison functor.</div><div class="ttdef"><b>Definition:</b> <a href="a00545_source.html#l00505">stl_heap.h:505</a></div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</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_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00545.html">stl_heap.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
>
500
