Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-updates > by-pkgid > bfb47da7e0322bcb0e23e4b1838d9db9 > files > 6705

libstdc++-docs-8.4.0-1.mga7.noarch.rpm

<!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++: split_join_fn_imps.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&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a17118_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">binary_heap_/split_join_fn_imps.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="a17118.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<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>&#160;<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>&#160;<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>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<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>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// purpose. It is provided &quot;as is&quot; without express or implied</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment">// warranty.</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">/**</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment"> * @file binary_heap_/split_join_fn_imps.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment"> * Contains an implementation class for a binary_heap.</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> Pred&gt;</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keywordtype">void</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;split(Pred pred, PB_DS_CLASS_C_DEC&amp; other)</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;{</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;  typedef</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    typename entry_pred&lt;value_type, Pred, _Alloc, simple_value&gt;::type</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    pred_t;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  const size_type <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a> = partition(pred_t(pred));</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;  _GLIBCXX_DEBUG_ASSERT(m_size &gt;= <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>);</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;  const size_type ersd = m_size - <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;  _GLIBCXX_DEBUG_ASSERT(m_size &gt;= ersd);</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;  const size_type new_size = resize_policy::get_new_size_for_arbitrary(<a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>);</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;  const size_type other_actual_size = other.get_new_size_for_arbitrary(ersd);</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;  entry_pointer a_entries = 0;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;  entry_pointer a_other_entries = 0;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;  __try</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    {</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;      a_entries = s_entry_allocator.allocate(new_size);</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;      a_other_entries = s_entry_allocator.allocate(other_actual_size);</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    }</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  __catch(...)</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    {</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;      <span class="keywordflow">if</span> (a_entries != 0)</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        s_entry_allocator.deallocate(a_entries, new_size);</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;      <span class="keywordflow">if</span> (a_other_entries != 0)</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        s_entry_allocator.deallocate(a_other_entries, other_actual_size);</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;      __throw_exception_again;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    };</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;  <span class="keywordflow">for</span> (size_type i = 0; i &lt; other.m_size; ++i)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    erase_at(other.m_a_entries, i, s_no_throw_copies_ind);</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;  _GLIBCXX_DEBUG_ASSERT(new_size &gt;= <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>);</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;  std::copy(m_a_entries, m_a_entries + <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>, a_entries);</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;  std::copy(m_a_entries + <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>, m_a_entries + m_size, a_other_entries);</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;  s_entry_allocator.deallocate(m_a_entries, m_actual_size);</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;  s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size);</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;  m_actual_size = new_size;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;  other.m_actual_size = other_actual_size;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;  m_size = <a class="code" href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">left</a>;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;  other.m_size = ersd;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;  m_a_entries = a_entries;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;  other.m_a_entries = a_other_entries;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;  make_heap();</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;  other.make_heap();</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;  resize_policy::notify_arbitrary(m_actual_size);</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;  other.notify_arbitrary(other.m_actual_size);</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;}</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;inline <span class="keywordtype">void</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;join(PB_DS_CLASS_C_DEC&amp; other)</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;{</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;  const size_type len = m_size + other.m_size;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;  const size_type new_size = resize_policy::get_new_size_for_arbitrary(len);</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;  entry_pointer a_entries = 0;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;  entry_pointer a_other_entries = 0;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;  __try</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    {</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;      a_entries = s_entry_allocator.allocate(new_size);</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;      a_other_entries = s_entry_allocator.allocate(resize_policy::min_size);</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    }</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;  __catch(...)</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    {</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;      <span class="keywordflow">if</span> (a_entries != 0)</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        s_entry_allocator.deallocate(a_entries, new_size);</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;      <span class="keywordflow">if</span> (a_other_entries != 0)</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        s_entry_allocator.deallocate(a_other_entries, resize_policy::min_size);</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;      __throw_exception_again;</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;  std::copy(m_a_entries, m_a_entries + m_size, a_entries);</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;  std::copy(other.m_a_entries, other.m_a_entries + other.m_size,</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;            a_entries + m_size);</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;  s_entry_allocator.deallocate(m_a_entries, m_actual_size);</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;  m_a_entries = a_entries;</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;  m_size = len;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;  m_actual_size = new_size;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;  resize_policy::notify_arbitrary(new_size);</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;  make_heap();</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;  s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size);</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;  other.m_a_entries = a_other_entries;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;  other.m_size = 0;</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;  other.m_actual_size = resize_policy::min_size;</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;  other.notify_arbitrary(resize_policy::min_size);</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;  other.make_heap();</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;  </div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;}</div><div class="ttc" id="a01541_html_a96d1c2cab30f14f4e34ccb460f1ad1c9"><div class="ttname"><a href="a01541.html#a96d1c2cab30f14f4e34ccb460f1ad1c9">std::left</a></div><div class="ttdeci">ios_base &amp; left(ios_base &amp;__base)</div><div class="ttdoc">Calls base.setf(ios_base::left, ios_base::adjustfield).</div><div class="ttdef"><b>Definition:</b> <a href="a00383_source.html#l01001">ios_base.h:1001</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_029334e92d1e3db3ea7d86241898d8b1.html">ext</a></li><li class="navelem"><a class="el" href="dir_6911148039c30421632b2591b843ac64.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_d2bb2cf1f724d87be8822c254402c3cc.html">detail</a></li><li class="navelem"><a class="el" href="dir_b313da311f18667df2d0a33960518f85.html">binary_heap_</a></li><li class="navelem"><a class="el" href="a17118.html">split_join_fn_imps.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>