<!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++: thin_heap_.hpp 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('a01424_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">thin_heap_.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01424.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) 2005-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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// is hereby granted without fee, provided that the above copyright</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// notice appears in all copies, and that both that copyright notice</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// and this permission notice appear in supporting documentation. None</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// representation about the suitability of this software for any</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// purpose. It is provided "as is" without express or implied</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warranty.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/**</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * @file thin_heap_/thin_heap_.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation class for a thin heap.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#ifndef PB_DS_THIN_HEAP_HPP</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#define PB_DS_THIN_HEAP_HPP</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a00038.html">algorithm</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a01130.html">ext/pb_ds/detail/cond_dealtor.hpp</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <<a class="code" href="a01148.html">ext/pb_ds/detail/type_utils.hpp</a>></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a01340.html">ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#include <<a class="code" href="a00743.html">debug/debug.h</a>></span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">namespace </span><a class="code" href="a01590.html">__gnu_pbds</a></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">namespace </span>detail</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#define PB_DS_CLASS_T_DEC \</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor"> template<typename Value_Type, typename Cmp_Fn, typename _Alloc></span></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="preprocessor">#define PB_DS_CLASS_C_DEC \</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"> thin_heap<Value_Type, Cmp_Fn, _Alloc></span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#define PB_DS_BASE_T_P \</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"> <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc, true></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#define PB_DS_BASE_T_P \</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor"> <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#endif</span></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> <span class="comment"></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> <span class="comment"> * Thin heap.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> *</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * @ingroup heap-detail</span></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"> * See Tarjan and Kaplan.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> */</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Value_Type, <span class="keyword">typename</span> Cmp_Fn, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="a11960.html"> 77</a></span>  <span class="keyword">class </span><a class="code" href="a11960.html">thin_heap</a></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  : <span class="keyword">public</span> <a class="code" href="a11724.html">left_child_next_sibling_heap</a> PB_DS_BASE_T_P</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="keyword">private</span>:</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<Value_Type>::other __rebind_a;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typedef</span> <a class="code" href="a11724.html">left_child_next_sibling_heap</a> PB_DS_BASE_T_P <a class="code" href="a11724.html">base_type</a>;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node node;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node_pointer node_pointer;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node_const_pointer node_const_pointer;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typedef</span> Value_Type value_type;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">typedef</span> Cmp_Fn cmp_fn;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::size_type size_type;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::difference_type difference_type;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::pointer pointer;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::const_pointer const_pointer;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::reference reference;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::const_reference const_reference;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a11736.html">base_type::point_iterator</a> <a class="code" href="a11736.html">point_iterator</a>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a11736.html">base_type::point_const_iterator</a> <a class="code" href="a11736.html">point_const_iterator</a>;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a11720.html">base_type::iterator</a> <a class="code" href="a11720.html">iterator</a>;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a11720.html">base_type::const_iterator</a> <a class="code" href="a11720.html">const_iterator</a>;</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> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">inline</span> <a class="code" href="a11736.html">point_iterator</a></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  push(const_reference);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  modify(<a class="code" href="a11736.html">point_iterator</a>, const_reference);</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">inline</span> const_reference</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  top() <span class="keyword">const</span>;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  pop();</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  erase(<a class="code" href="a11736.html">point_iterator</a>);</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  clear();</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> Pred></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  size_type</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  erase_if(Pred);</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Pred></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  split(Pred, PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</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"> 134</span>  join(PB_DS_CLASS_C_DEC&);</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="keyword">protected</span>:</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="a11960.html">thin_heap</a>();</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>  <a class="code" href="a11960.html">thin_heap</a>(<span class="keyword">const</span> Cmp_Fn&);</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>  <a class="code" href="a11960.html">thin_heap</a>(<span class="keyword">const</span> PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  swap(PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  ~<a class="code" href="a11960.html">thin_heap</a>();</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>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  copy_from_range(It, It);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  assert_valid(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</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="keywordtype">void</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  assert_max(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor">#ifdef PB_DS_THIN_HEAP_TRACE_</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  trace() <span class="keyword">const</span>;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  max_rank = (<span class="keyword">sizeof</span>(size_type) << 4) + 2</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  };</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  initialize();</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  update_max(node_pointer);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  fix(node_pointer);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  fix_root(node_pointer);</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  fix_sibling_rank_1_unmarked(node_pointer);</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  fix_sibling_rank_1_marked(node_pointer);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  fix_sibling_general_unmarked(node_pointer);</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">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  fix_sibling_general_marked(node_pointer);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  fix_child(node_pointer);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">inline</span> <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  make_root(node_pointer);</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  make_root_and_link(node_pointer);</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>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  remove_max_node();</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  to_aux_except_max();</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  add_to_aux(node_pointer);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  make_from_aux();</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">inline</span> size_type</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  rank_bound();</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  make_child_of(node_pointer, node_pointer);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  remove_node(node_pointer);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">inline</span> node_pointer</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  join(node_pointer, node_pointer) <span class="keyword">const</span>;</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="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  assert_node_consistent(node_const_pointer, <span class="keywordtype">bool</span>, <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  assert_aux_null(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  node_pointer m_p_max;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  node_pointer m_a_aux[max_rank];</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  };</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>  <span class="keyword">enum</span></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>  num_distinct_rank_bounds = 48</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  };</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// Taken from the SGI implementation; acknowledged in the docs.</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::size_t g_a_rank_bounds[num_distinct_rank_bounds] =</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>  <span class="comment">/* Dealing cards... */</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">/* 0 */</span> 0ul,</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">/* 1 */</span> 1ul,</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">/* 2 */</span> 1ul,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">/* 3 */</span> 2ul,</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">/* 4 */</span> 4ul,</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">/* 5 */</span> 6ul,</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">/* 6 */</span> 11ul,</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">/* 7 */</span> 17ul,</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">/* 8 */</span> 29ul,</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">/* 9 */</span> 46ul,</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">/* 10 */</span> 76ul,</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">/* 11 */</span> 122ul,</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">/* 12 */</span> 199ul,</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">/* 13 */</span> 321ul,</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">/* 14 */</span> 521ul,</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">/* 15 */</span> 842ul,</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">/* 16 */</span> 1364ul,</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">/* 17 */</span> 2206ul,</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">/* 18 */</span> 3571ul,</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">/* 19 */</span> 5777ul,</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">/* 20 */</span> 9349ul,</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">/* 21 */</span> 15126ul,</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">/* 22 */</span> 24476ul,</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">/* 23 */</span> 39602ul,</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">/* 24 */</span> 64079ul</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="preprocessor">#if __SIZE_MAX__ > 0xfffful</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  ,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">/* 25 */</span> 103681ul,</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">/* 26 */</span> 167761ul,</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">/* 27 */</span> 271442ul,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">/* 28 */</span> 439204ul,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">/* 29 */</span> 710646ul</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="preprocessor">#if __SIZE_MAX__ > 0xffffful</span></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="comment">/* 30 */</span> 1149851ul,</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">/* 31 */</span> 1860497ul,</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">/* 32 */</span> 3010349ul,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">/* 33 */</span> 4870846ul,</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">/* 34 */</span> 7881196ul,</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">/* 35 */</span> 12752042ul</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="preprocessor">#if __SIZE_MAX__ > 0xfffffful</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  ,</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">/* 36 */</span> 20633239ul,</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">/* 37 */</span> 33385282ul,</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">/* 38 */</span> 54018521ul,</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">/* 39 */</span> 87403803ul,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">/* 40 */</span> 141422324ul,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">/* 41 */</span> 228826127ul,</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">/* 42 */</span> 370248451ul,</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">/* 43 */</span> 599074578ul,</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">/* 44 */</span> 969323029ul,</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">/* 45 */</span> 1568397607ul,</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">/* 46 */</span> 2537720636ul,</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">/* 47 */</span> 4106118243ul</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">/* Pot's good, let's play */</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> <span class="preprocessor">#define PB_DS_ASSERT_NODE_CONSISTENT(_Node, _Bool) \</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(assert_node_consistent(_Node, _Bool, \</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="preprocessor"> __FILE__, __LINE__);)</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="preprocessor">#define PB_DS_ASSERT_AUX_NULL(X) \</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(X.assert_aux_null(__FILE__, __LINE__);)</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="preprocessor">#include <<a class="code" href="a16596.html">ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp</a>></span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="preprocessor">#include <<a class="code" href="a16668.html">ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp</a>></span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="preprocessor">#include <<a class="code" href="a17184.html">ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp</a>></span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="preprocessor">#include <<a class="code" href="a16776.html">ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp</a>></span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="preprocessor">#include <<a class="code" href="a16896.html">ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp</a>></span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="preprocessor">#include <<a class="code" href="a16731.html">ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp</a>></span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="preprocessor">#include <<a class="code" href="a17139.html">ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp</a>></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="preprocessor">#undef PB_DS_ASSERT_AUX_NULL</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="preprocessor">#undef PB_DS_ASSERT_NODE_CONSISTENT</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="preprocessor">#undef PB_DS_CLASS_C_DEC</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="preprocessor">#undef PB_DS_BASE_T_P</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  } <span class="comment">// namespace detail</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> } <span class="comment">// namespace __gnu_pbds</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="a01148_html"><div class="ttname"><a href="a01148.html">type_utils.hpp</a></div></div>
<div class="ttc" id="a16731_html"><div class="ttname"><a href="a16731.html">erase_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01130_html"><div class="ttname"><a href="a01130.html">cond_dealtor.hpp</a></div></div>
<div class="ttc" id="a11720_html"><div class="ttname"><a href="a11720.html">__gnu_pbds::detail::left_child_next_sibling_heap_const_iterator_</a></div><div class="ttdoc">Const point-type iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a16536_source.html#l00060">left_child_next_sibling_heap_/const_iterator.hpp:60</a></div></div>
<div class="ttc" id="a00743_html"><div class="ttname"><a href="a00743.html">debug.h</a></div></div>
<div class="ttc" id="a00038_html"><div class="ttname"><a href="a00038.html">algorithm</a></div></div>
<div class="ttc" id="a17139_html"><div class="ttname"><a href="a17139.html">split_join_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16668_html"><div class="ttname"><a href="a16668.html">debug_fn_imps.hpp</a></div></div>
<div class="ttc" id="a11960_html"><div class="ttname"><a href="a11960.html">__gnu_pbds::detail::thin_heap</a></div><div class="ttdef"><b>Definition:</b> <a href="a01424_source.html#l00077">thin_heap_.hpp:77</a></div></div>
<div class="ttc" id="a01590_html"><div class="ttname"><a href="a01590.html">__gnu_pbds</a></div><div class="ttdoc">GNU extensions for policy-based data structures for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a01106_source.html#l00051">assoc_container.hpp:51</a></div></div>
<div class="ttc" id="a16776_html"><div class="ttname"><a href="a16776.html">find_fn_imps.hpp</a></div></div>
<div class="ttc" id="a17184_html"><div class="ttname"><a href="a17184.html">trace_fn_imps.hpp</a></div></div>
<div class="ttc" id="a11736_html"><div class="ttname"><a href="a11736.html">__gnu_pbds::detail::left_child_next_sibling_heap_node_point_const_iterator_</a></div><div class="ttdoc">Const point-type iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a17019_source.html#l00061">left_child_next_sibling_heap_/point_const_iterator.hpp:61</a></div></div>
<div class="ttc" id="a16896_html"><div class="ttname"><a href="a16896.html">insert_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16596_html"><div class="ttname"><a href="a16596.html">constructors_destructor_fn_imps.hpp</a></div></div>
<div class="ttc" id="a11724_html"><div class="ttname"><a href="a11724.html">__gnu_pbds::detail::left_child_next_sibling_heap</a></div><div class="ttdoc">Base class for a basic heap.</div><div class="ttdef"><b>Definition:</b> <a href="a01340_source.html#l00090">left_child_next_sibling_heap_.hpp:90</a></div></div>
<div class="ttc" id="a01340_html"><div class="ttname"><a href="a01340.html">left_child_next_sibling_heap_.hpp</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_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="dir_afaff2f5b61f44d50c9875b428318082.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_f37d910f5ba825954160494085256009.html">detail</a></li><li class="navelem"><a class="el" href="dir_6922fd87df585664ddf892d08628f92e.html">thin_heap_</a></li><li class="navelem"><a class="el" href="a01424.html">thin_heap_.hpp</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
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
1174
