<!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++: pairing_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('a01361_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">pairing_heap_.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a01361.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 pairing_heap_/pairing_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 pairing 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="comment">/*</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Pairing heap:</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * and Robert Endre Tarjan, The Pairing Heap:</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * A New Form of Self-Adjusting Heap, Algorithmica, 1(1):111-129, 1986.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> */</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</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="l00049"></a><span class="lineno"> 49</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="l00050"></a><span class="lineno"> 50</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="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <<a class="code" href="a00743.html">debug/debug.h</a>></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">namespace </span><a class="code" href="a01590.html">__gnu_pbds</a></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="keyword">namespace </span>detail</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_T_DEC \</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"> template<typename Value_Type, typename Cmp_Fn, typename _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">#define PB_DS_CLASS_C_DEC \</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor"> pairing_heap<Value_Type, Cmp_Fn, _Alloc></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#define PB_DS_P_HEAP_BASE \</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor"> left_child_next_sibling_heap<Value_Type, Cmp_Fn, null_type, _Alloc, false></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#define PB_DS_P_HEAP_BASE \</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"> left_child_next_sibling_heap<Value_Type, Cmp_Fn, null_type, _Alloc></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"></span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> /**</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * Pairing heap.</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"> * @ingroup heap-detail</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="a11808.html"> 77</a></span>  <span class="keyword">class </span><a class="code" href="a11808.html">pairing_heap</a> : <span class="keyword">public</span> PB_DS_P_HEAP_BASE</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">typedef</span> PB_DS_P_HEAP_BASE <a class="code" href="a11724.html">base_type</a>;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node_pointer node_pointer;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</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="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typedef</span> Value_Type value_type;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typedef</span> Cmp_Fn cmp_fn;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::size_type size_type;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::difference_type difference_type;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::pointer pointer;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::const_pointer const_pointer;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::reference reference;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_a::const_reference const_reference;</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>  <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="l00098"></a><span class="lineno"> 98</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="l00099"></a><span class="lineno"> 99</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="l00100"></a><span class="lineno"> 100</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="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="a11808.html">pairing_heap</a>();</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="a11808.html">pairing_heap</a>(<span class="keyword">const</span> Cmp_Fn&);</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>  <a class="code" href="a11808.html">pairing_heap</a>(<span class="keyword">const</span> <a class="code" href="a11808.html">pairing_heap</a>&);</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="keywordtype">void</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  swap(<a class="code" href="a11808.html">pairing_heap</a>&);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  ~<a class="code" href="a11808.html">pairing_heap</a>();</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> <a class="code" href="a11736.html">point_iterator</a></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  push(const_reference);</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>  modify(<a class="code" href="a11736.html">point_iterator</a>, const_reference);</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="keyword">inline</span> const_reference</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  top() <span class="keyword">const</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="keywordtype">void</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  pop();</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="keywordtype">void</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  erase(<a class="code" href="a11736.html">point_iterator</a>);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Pred></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  size_type</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  erase_if(Pred);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Pred></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>  split(Pred, <a class="code" href="a11808.html">pairing_heap</a>&);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  join(<a class="code" href="a11808.html">pairing_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>  <span class="keyword">protected</span>:</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="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  copy_from_range(It, It);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</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="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  push_imp(node_pointer);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  node_pointer</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  join_node_children(node_pointer);</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  node_pointer</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  forward_join(node_pointer, node_pointer);</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>  node_pointer</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  back_join(node_pointer, node_pointer);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  remove_node(node_pointer);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</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> <span class="preprocessor">#define PB_DS_ASSERT_NODE_CONSISTENT(_Node, _Bool) \</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(_Node, _Bool, \</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="preprocessor"> __FILE__, __LINE__);)</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#include <<a class="code" href="a16581.html">ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp</a>></span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor">#include <<a class="code" href="a16653.html">ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp</a>></span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="preprocessor">#include <<a class="code" href="a16764.html">ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp</a>></span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor">#include <<a class="code" href="a16884.html">ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp</a>></span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#include <<a class="code" href="a16716.html">ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp</a>></span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="preprocessor">#include <<a class="code" href="a17127.html">ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp</a>></span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#undef PB_DS_ASSERT_NODE_CONSISTENT</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#undef PB_DS_CLASS_C_DEC</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor">#undef PB_DS_P_HEAP_BASE</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  } <span class="comment">// namespace detail</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> } <span class="comment">// namespace __gnu_pbds</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="a01130_html"><div class="ttname"><a href="a01130.html">cond_dealtor.hpp</a></div></div> <div class="ttc" id="a16653_html"><div class="ttname"><a href="a16653.html">debug_fn_imps.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="a16716_html"><div class="ttname"><a href="a16716.html">erase_fn_imps.hpp</a></div></div> <div class="ttc" id="a17127_html"><div class="ttname"><a href="a17127.html">split_join_fn_imps.hpp</a></div></div> <div class="ttc" id="a11808_html"><div class="ttname"><a href="a11808.html">__gnu_pbds::detail::pairing_heap</a></div><div class="ttdef"><b>Definition:</b> <a href="a01361_source.html#l00077">pairing_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="a16764_html"><div class="ttname"><a href="a16764.html">find_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="a11724_html"><div class="ttname"><a href="a11724.html">__gnu_pbds::detail::left_child_next_sibling_heap< Value_Type, Cmp_Fn, null_type, _Alloc ></a></div></div> <div class="ttc" id="a16884_html"><div class="ttname"><a href="a16884.html">insert_fn_imps.hpp</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 class="ttc" id="a16581_html"><div class="ttname"><a href="a16581.html">constructors_destructor_fn_imps.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_ad9b4766e055c7fbdd2dce8dd383abd2.html">pairing_heap_</a></li><li class="navelem"><a class="el" href="a01361.html">pairing_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>