doc/html/boost/heap/fibonacci_heap.html

   1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
   2 <html>
   3 <head>
   4 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
   5 <title>Class template fibonacci_heap</title>
   6 <link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
   7 <meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
   8 <link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
   9 <link rel="up" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp" title="Header &lt;boost/heap/fibonacci_heap.hpp&gt;">
  10 <link rel="prev" href="d_ary_heap.html" title="Class template d_ary_heap">
  11 <link rel="next" href="PriorityQueue.html" title="Struct template PriorityQueue">
  12 </head>
  13 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
  14 <table cellpadding="2" width="100%"><tr>
  15 <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
  16 <td align="center"><a href="../../../../index.html">Home</a></td>
  17 <td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td>
  18 <td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
  19 <td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
  20 <td align="center"><a href="../../../../more/index.htm">More</a></td>
  21 </tr></table>
  22 <hr>
  23 <div class="spirit-nav">
  24 <a accesskey="p" href="d_ary_heap.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="PriorityQueue.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
  25 </div>
  26 <div class="refentry">
  27 <a name="boost.heap.fibonacci_heap"></a><div class="titlepage"></div>
  28 <div class="refnamediv">
  29 <h2><span class="refentrytitle">Class template fibonacci_heap</span></h2>
  30 <p>boost::heap::fibonacci_heap &#8212; fibonacci heap </p>
  31 </div>
  32 <h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
  33 <div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;<a class="link" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp" title="Header &lt;boost/heap/fibonacci_heap.hpp&gt;">boost/heap/fibonacci_heap.hpp</a>&gt;
  34
  35 </span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">class</span><span class="special">...</span> Options<span class="special">&gt;</span>
  36 <span class="keyword">class</span> <a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">{</span>
  37 <span class="keyword">public</span><span class="special">:</span>
  38   <span class="comment">// <a class="link" href="fibonacci_heap.html#boost.heap.fibonacci_heaptypes">types</a></span>
  39   <span class="keyword">typedef</span> <span class="identifier">T</span>                                        <a name="boost.heap.fibonacci_heap.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
  40   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">size_type</span>        <a name="boost.heap.fibonacci_heap.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
  41   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">difference_type</span>  <a name="boost.heap.fibonacci_heap.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
  42   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">value_compare</span>    <a name="boost.heap.fibonacci_heap.value_compare"></a><span class="identifier">value_compare</span><span class="special">;</span>
  43   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">allocator_type</span>   <a name="boost.heap.fibonacci_heap.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
  44   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">reference</span>        <a name="boost.heap.fibonacci_heap.reference"></a><span class="identifier">reference</span><span class="special">;</span>
  45   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_reference</span>  <a name="boost.heap.fibonacci_heap.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
  46   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">pointer</span>          <a name="boost.heap.fibonacci_heap.pointer"></a><span class="identifier">pointer</span><span class="special">;</span>
  47   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_pointer</span>    <a name="boost.heap.fibonacci_heap.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span>
  48   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">iterator</span>         <a class="link" href="fibonacci_heap.html#boost.heap.fibonacci_heap.iterator"><span class="identifier">iterator</span></a><span class="special">;</span>
  49   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">const_iterator</span>   <a name="boost.heap.fibonacci_heap.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
  50   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">ordered_iterator</span> <a name="boost.heap.fibonacci_heap.ordered_iterator"></a><span class="identifier">ordered_iterator</span><span class="special">;</span>
  51   <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">handle_type</span>      <a name="boost.heap.fibonacci_heap.handle_type"></a><span class="identifier">handle_type</span><span class="special">;</span>
  52
  53   <span class="comment">// <a class="link" href="fibonacci_heap.html#boost.heap.fibonacci_heapconstruct-copy-destruct">construct/copy/destruct</a></span>
  54   <span class="keyword">explicit</span> <a class="link" href="fibonacci_heap.html#idp510796896-bb"><span class="identifier">fibonacci_heap</span></a><span class="special">(</span><span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
  55   <a class="link" href="fibonacci_heap.html#idp510800272-bb"><span class="identifier">fibonacci_heap</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  56   <a class="link" href="fibonacci_heap.html#idp510803392-bb"><span class="identifier">fibonacci_heap</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  57   <a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> <a class="link" href="fibonacci_heap.html#idp510807392-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  58   <a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> <a class="link" href="fibonacci_heap.html#idp510811968-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  59   <a class="link" href="fibonacci_heap.html#idp510815648-bb"><span class="special">~</span><span class="identifier">fibonacci_heap</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span>
  60
  61   <span class="comment">// <a class="link" href="fibonacci_heap.html#idp510658800-bb">public member functions</a></span>
  62   <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510659360-bb"><span class="identifier">empty</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  63   <span class="identifier">size_type</span> <a class="link" href="fibonacci_heap.html#idp510663040-bb"><span class="identifier">size</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  64   <span class="identifier">size_type</span> <a class="link" href="fibonacci_heap.html#idp510666720-bb"><span class="identifier">max_size</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  65   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510670400-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span>
  66   <span class="identifier">allocator_type</span> <a class="link" href="fibonacci_heap.html#idp510673792-bb"><span class="identifier">get_allocator</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  67   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510677424-bb"><span class="identifier">swap</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  68   <span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&amp;</span> <a class="link" href="fibonacci_heap.html#idp510681088-bb"><span class="identifier">top</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  69   <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#idp510684752-bb"><span class="identifier">push</span></a><span class="special">(</span><span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  70   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#idp510689024-bb"><span class="identifier">emplace</span></a><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
  71   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510694480-bb"><span class="identifier">pop</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span>
  72   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510697904-bb"><span class="identifier">update</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">,</span> <span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span>
  73   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510702912-bb"><span class="identifier">update_lazy</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">,</span> <span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span>
  74   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510708896-bb"><span class="identifier">update</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">)</span><span class="special">;</span>
  75   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510713680-bb"><span class="identifier">update_lazy</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">)</span><span class="special">;</span>
  76   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510719296-bb"><span class="identifier">increase</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">,</span> <span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span>
  77   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510725168-bb"><span class="identifier">increase</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">)</span><span class="special">;</span>
  78   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510729952-bb"><span class="identifier">decrease</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">,</span> <span class="identifier">const_reference</span><span class="special">)</span><span class="special">;</span>
  79   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510735824-bb"><span class="identifier">decrease</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">)</span><span class="special">;</span>
  80   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510740656-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">handle_type</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  81   <span class="identifier">iterator</span> <a class="link" href="fibonacci_heap.html#idp510745216-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  82   <span class="identifier">iterator</span> <a class="link" href="fibonacci_heap.html#idp510748912-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  83   <span class="identifier">ordered_iterator</span> <a class="link" href="fibonacci_heap.html#idp510752576-bb"><span class="identifier">ordered_begin</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  84   <span class="identifier">ordered_iterator</span> <a class="link" href="fibonacci_heap.html#idp510756320-bb"><span class="identifier">ordered_end</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  85   <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#idp510760048-bb"><span class="identifier">merge</span></a><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  86   <span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&amp;</span> <a class="link" href="fibonacci_heap.html#idp510763712-bb"><span class="identifier">value_comp</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  87   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510766544-bb"><span class="keyword">operator</span><span class="special">&lt;</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  88   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510771520-bb"><span class="keyword">operator</span><span class="special">&gt;</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  89   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510776496-bb"><span class="keyword">operator</span><span class="special">&gt;=</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  90   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510781472-bb"><span class="keyword">operator</span><span class="special">&lt;=</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  91   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510786448-bb"><span class="keyword">operator</span><span class="special">==</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  92   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#idp510791584-bb"><span class="keyword">operator</span><span class="special">!=</span></a><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  93
  94   <span class="comment">// <a class="link" href="fibonacci_heap.html#idp510816624-bb">public static functions</a></span>
  95   <span class="keyword">static</span> <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#idp510817184-bb"><span class="identifier">s_handle_from_iterator</span></a><span class="special">(</span><span class="identifier">iterator</span> <span class="keyword">const</span> <span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  96
  97   <span class="comment">// public data members</span>
  98   <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">constant_time_size</span><span class="special">;</span>
  99   <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">has_ordered_iterators</span><span class="special">;</span>
 100   <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">is_mergable</span><span class="special">;</span>
 101   <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">is_stable</span><span class="special">;</span>
 102   <span class="keyword">static</span> <span class="keyword">const</span> <span class="keyword">bool</span> <span class="identifier">has_reserve</span><span class="special">;</span>
 103 <span class="special">}</span><span class="special">;</span></pre></div>
 104 <div class="refsect1">
 105 <a name="idp255617056"></a><h2>Description</h2>
 106 <p>The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.</p>
 107 <p>The container supports the following options:</p>
 108 <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
 109 <li class="listitem"><p><code class="computeroutput">boost::heap::stable&lt;&gt;</code>, defaults to <code class="computeroutput">stable&lt;false&gt;</code> </p></li>
 110 <li class="listitem"><p><code class="computeroutput">boost::heap::compare&lt;&gt;</code>, defaults to <code class="computeroutput">compare&lt;std::less&lt;T&gt;</code> &gt;</p></li>
 111 <li class="listitem"><p><code class="computeroutput">boost::heap::allocator&lt;&gt;</code>, defaults to <code class="computeroutput">allocator&lt;std::allocator&lt;T&gt;</code> &gt;</p></li>
 112 <li class="listitem"><p><code class="computeroutput">boost::heap::constant_time_size&lt;&gt;</code>, defaults to <code class="computeroutput">constant_time_size&lt;true&gt;</code> </p></li>
 113 <li class="listitem"><p><code class="computeroutput">boost::heap::stability_counter_type&lt;&gt;</code>, defaults to <code class="computeroutput">stability_counter_type&lt;boost::uintmax_t&gt;</code> </p></li>
 114 </ul></div>
 115 <p>
 116 </p>
 117 <div class="refsect2">
 118 <a name="idp255627312"></a><h3>
 119 <a name="boost.heap.fibonacci_heaptypes"></a><code class="computeroutput">fibonacci_heap</code>
 120         public
 121        types</h3>
 122 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
 123 <p>
 124 <span class="keyword">typedef</span> <span class="identifier">implementation_defined</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.heap.fibonacci_heap.iterator"></a><span class="identifier">iterator</span><span class="special">;</span></p>
 125 <p><span class="bold"><strong>Note:</strong></span> The iterator does not traverse the priority queue in order of the priorities. </p>
 126 </li></ol></div>
 127 </div>
 128 <div class="refsect2">
 129 <a name="idp255635056"></a><h3>
 130 <a name="boost.heap.fibonacci_heapconstruct-copy-destruct"></a><code class="computeroutput">fibonacci_heap</code>
 131         public
 132        construct/copy/destruct</h3>
 133 <div class="orderedlist"><ol class="orderedlist" type="1">
 134 <li class="listitem">
 135 <pre class="literallayout"><span class="keyword">explicit</span> <a name="idp510796896-bb"></a><span class="identifier">fibonacci_heap</span><span class="special">(</span><span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&amp;</span> cmp <span class="special">=</span> <span class="identifier">value_compare</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 136 <p><span class="bold"><strong>Effects:</strong></span> constructs an empty priority queue.</p>
 137 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 138 </li>
 139 <li class="listitem">
 140 <pre class="literallayout"><a name="idp510800272-bb"></a><span class="identifier">fibonacci_heap</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 141 <p><span class="bold"><strong>Effects:</strong></span> copy-constructs priority queue from rhs.</p>
 142 <p><span class="bold"><strong>Complexity:</strong></span> Linear. </p>
 143 </li>
 144 <li class="listitem">
 145 <pre class="literallayout"><a name="idp510803392-bb"></a><span class="identifier">fibonacci_heap</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 146 <p><span class="bold"><strong>Effects:</strong></span> C++11-style move constructor.</p>
 147 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 148 <p><span class="bold"><strong>Note:</strong></span> Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined </p>
 149 </li>
 150 <li class="listitem">
 151 <pre class="literallayout"><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> <a name="idp510807392-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 152 <p><span class="bold"><strong>Effects:</strong></span> C++11-style move assignment.</p>
 153 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 154 <p><span class="bold"><strong>Note:</strong></span> Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined </p>
 155 </li>
 156 <li class="listitem">
 157 <pre class="literallayout"><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> <a name="idp510811968-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 158 <p><span class="bold"><strong>Effects:</strong></span> Assigns priority queue from rhs.</p>
 159 <p><span class="bold"><strong>Complexity:</strong></span> Linear. </p>
 160 </li>
 161 <li class="listitem"><pre class="literallayout"><a name="idp510815648-bb"></a><span class="special">~</span><span class="identifier">fibonacci_heap</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span></pre></li>
 162 </ol></div>
 163 </div>
 164 <div class="refsect2">
 165 <a name="idp255687040"></a><h3>
 166 <a name="idp510658800-bb"></a><code class="computeroutput">fibonacci_heap</code> public member functions</h3>
 167 <div class="orderedlist"><ol class="orderedlist" type="1">
 168 <li class="listitem">
 169 <pre class="literallayout"><span class="keyword">bool</span> <a name="idp510659360-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 170 <p><span class="bold"><strong>Effects:</strong></span> Returns true, if the priority queue contains no elements.</p>
 171 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 172 </li>
 173 <li class="listitem">
 174 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp510663040-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 175 <p><span class="bold"><strong>Effects:</strong></span> Returns the number of elements contained in the priority queue.</p>
 176 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 177 </li>
 178 <li class="listitem">
 179 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp510666720-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 180 <p><span class="bold"><strong>Effects:</strong></span> Returns the maximum number of elements the priority queue can contain.</p>
 181 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 182 </li>
 183 <li class="listitem">
 184 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510670400-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span></pre>
 185 <p><span class="bold"><strong>Effects:</strong></span> Removes all elements from the priority queue.</p>
 186 <p><span class="bold"><strong>Complexity:</strong></span> Linear. </p>
 187 </li>
 188 <li class="listitem">
 189 <pre class="literallayout"><span class="identifier">allocator_type</span> <a name="idp510673792-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 190 <p><span class="bold"><strong>Effects:</strong></span> Returns allocator.</p>
 191 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 192 </li>
 193 <li class="listitem">
 194 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510677424-bb"></a><span class="identifier">swap</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 195 <p><span class="bold"><strong>Effects:</strong></span> Swaps two priority queues.</p>
 196 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 197 </li>
 198 <li class="listitem">
 199 <pre class="literallayout"><span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&amp;</span> <a name="idp510681088-bb"></a><span class="identifier">top</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 200 <p><span class="bold"><strong>Effects:</strong></span> Returns a const_reference to the maximum element.</p>
 201 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 202 </li>
 203 <li class="listitem">
 204 <pre class="literallayout"><span class="identifier">handle_type</span> <a name="idp510684752-bb"></a><span class="identifier">push</span><span class="special">(</span><span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&amp;</span> v<span class="special">)</span><span class="special">;</span></pre>
 205 <p><span class="bold"><strong>Effects:</strong></span> Adds a new element to the priority queue. Returns handle to element</p>
 206 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 207 <p><span class="bold"><strong>Note:</strong></span> Does not invalidate iterators. </p>
 208 </li>
 209 <li class="listitem">
 210 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">handle_type</span> <a name="idp510689024-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 211 <p><span class="bold"><strong>Effects:</strong></span> Adds a new element to the priority queue. The element is directly constructed in-place. Returns handle to element.</p>
 212 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 213 <p><span class="bold"><strong>Note:</strong></span> Does not invalidate iterators. </p>
 214 </li>
 215 <li class="listitem">
 216 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510694480-bb"></a><span class="identifier">pop</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span></pre>
 217 <p><span class="bold"><strong>Effects:</strong></span> Removes the top element from the priority queue.</p>
 218 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic (amortized). Linear (worst case). </p>
 219 </li>
 220 <li class="listitem">
 221 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510697904-bb"></a><span class="identifier">update</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">,</span> <span class="identifier">const_reference</span> v<span class="special">)</span><span class="special">;</span></pre>
 222 <p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> &amp; updates the priority queue.</p>
 223 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value &lt; v, Constant otherwise. </p>
 224 </li>
 225 <li class="listitem">
 226 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510702912-bb"></a><span class="identifier">update_lazy</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">,</span> <span class="identifier">const_reference</span> v<span class="special">)</span><span class="special">;</span></pre>
 227 <p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> &amp; updates the priority queue.</p>
 228 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value &lt; v, Constant otherwise.</p>
 229 <p><span class="bold"><strong>Rationale:</strong></span> The lazy update function is a modification of the traditional update, that just invalidates the iterator to the object referred to by the handle. </p>
 230 </li>
 231 <li class="listitem">
 232 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510708896-bb"></a><span class="identifier">update</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">)</span><span class="special">;</span></pre>
 233 <p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.</p>
 234 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p>
 235 <p><span class="bold"><strong>Note:</strong></span> If this is not called, after a handle has been updated, the behavior of the data structure is undefined! </p>
 236 </li>
 237 <li class="listitem">
 238 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510713680-bb"></a><span class="identifier">update_lazy</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">)</span><span class="special">;</span></pre>(handle_type handle) <p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> &amp; updates the priority queue.</p>
 239 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value &lt; v, Constant otherwise. (handle_type handle)</p>
 240 <p><span class="bold"><strong>Rationale:</strong></span> The lazy update function is a modification of the traditional update, that just invalidates the iterator to the object referred to by the handle. </p>
 241 </li>
 242 <li class="listitem">
 243 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510719296-bb"></a><span class="identifier">increase</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">,</span> <span class="identifier">const_reference</span> v<span class="special">)</span><span class="special">;</span></pre>
 244 <p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> &amp; updates the priority queue.</p>
 245 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 246 <p><span class="bold"><strong>Note:</strong></span> The new value is expected to be greater than the current one </p>
 247 </li>
 248 <li class="listitem">
 249 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510725168-bb"></a><span class="identifier">increase</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">)</span><span class="special">;</span></pre>
 250 <p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.</p>
 251 <p><span class="bold"><strong>Complexity:</strong></span> Constant.</p>
 252 <p><span class="bold"><strong>Note:</strong></span> If this is not called, after a handle has been updated, the behavior of the data structure is undefined! </p>
 253 </li>
 254 <li class="listitem">
 255 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510729952-bb"></a><span class="identifier">decrease</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">,</span> <span class="identifier">const_reference</span> v<span class="special">)</span><span class="special">;</span></pre>
 256 <p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> &amp; updates the priority queue.</p>
 257 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p>
 258 <p><span class="bold"><strong>Note:</strong></span> The new value is expected to be less than the current one </p>
 259 </li>
 260 <li class="listitem">
 261 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510735824-bb"></a><span class="identifier">decrease</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">)</span><span class="special">;</span></pre>
 262 <p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.</p>
 263 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p>
 264 <p><span class="bold"><strong>Note:</strong></span> The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined! </p>
 265 </li>
 266 <li class="listitem">
 267 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510740656-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">handle_type</span> <span class="keyword">const</span> <span class="special">&amp;</span> handle<span class="special">)</span><span class="special">;</span></pre>
 268 <p><span class="bold"><strong>Effects:</strong></span> Removes the element handled by <code class="computeroutput">handle</code> from the <code class="computeroutput"><a class="link" href="priority_queue.html" title="Class template priority_queue">priority_queue</a></code>.</p>
 269 <p><span class="bold"><strong>Complexity:</strong></span> Logarithmic. </p>
 270 </li>
 271 <li class="listitem">
 272 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp510745216-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 273 <p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the first element contained in the priority queue.</p>
 274 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 275 </li>
 276 <li class="listitem">
 277 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp510748912-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 278 <p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the end of the priority queue.</p>
 279 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 280 </li>
 281 <li class="listitem">
 282 <pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="idp510752576-bb"></a><span class="identifier">ordered_begin</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 283 <p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the first element contained in the priority queue.</p>
 284 <p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p>
 285 </li>
 286 <li class="listitem">
 287 <pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="idp510756320-bb"></a><span class="identifier">ordered_end</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 288 <p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the end of the priority queue.</p>
 289 <p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p>
 290 </li>
 291 <li class="listitem">
 292 <pre class="literallayout"><span class="keyword">void</span> <a name="idp510760048-bb"></a><span class="identifier">merge</span><span class="special">(</span><a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">&amp;</span> rhs<span class="special">)</span><span class="special">;</span></pre>
 293 <p><span class="bold"><strong>Effects:</strong></span> Merge with priority queue rhs.</p>
 294 <p><span class="bold"><strong>Complexity:</strong></span> Constant. </p>
 295 </li>
 296 <li class="listitem">
 297 <pre class="literallayout"><span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&amp;</span> <a name="idp510763712-bb"></a><span class="identifier">value_comp</span><span class="special">(</span><span class="keyword">void</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 298 <p><span class="bold"><strong>Effect:</strong></span> Returns the value_compare object used by the priority queue </p>
 299 </li>
 300 <li class="listitem">
 301 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510766544-bb"></a><span class="keyword">operator</span><span class="special">&lt;</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 302 <p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p>
 303 <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 304 </li>
 305 <li class="listitem">
 306 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510771520-bb"></a><span class="keyword">operator</span><span class="special">&gt;</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 307 <p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p>
 308 <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 309 </li>
 310 <li class="listitem">
 311 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510776496-bb"></a><span class="keyword">operator</span><span class="special">&gt;=</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 312 <p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p>
 313 <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 314 </li>
 315 <li class="listitem">
 316 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510781472-bb"></a><span class="keyword">operator</span><span class="special">&lt;=</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 317 <p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p>
 318 <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 319 </li>
 320 <li class="listitem">
 321 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510786448-bb"></a><span class="keyword">operator</span><span class="special">==</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>Equivalent comparison <span class="bold"><strong>Returns:</strong></span> True, if both heap data structures are equivalent. <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 322 </li>
 323 <li class="listitem">
 324 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> HeapType<span class="special">&gt;</span> <span class="keyword">bool</span> <a name="idp510791584-bb"></a><span class="keyword">operator</span><span class="special">!=</span><span class="special">(</span><span class="identifier">HeapType</span> <span class="keyword">const</span> <span class="special">&amp;</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>Equivalent comparison <span class="bold"><strong>Returns:</strong></span> True, if both heap data structures are not equivalent. <p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p>
 325 </li>
 326 </ol></div>
 327 </div>
 328 <div class="refsect2">
 329 <a name="idp255973808"></a><h3>
 330 <a name="idp510816624-bb"></a><code class="computeroutput">fibonacci_heap</code> public static functions</h3>
 331 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><pre class="literallayout"><span class="keyword">static</span> <span class="identifier">handle_type</span> <a name="idp510817184-bb"></a><span class="identifier">s_handle_from_iterator</span><span class="special">(</span><span class="identifier">iterator</span> <span class="keyword">const</span> <span class="special">&amp;</span> it<span class="special">)</span><span class="special">;</span></pre></li></ol></div>
 332 </div>
 333 </div>
 334 </div>
 335 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 336 <td align="left"></td>
 337 <td align="right"><div class="copyright-footer">Copyright &#169; 2010, 2011 Tim Blechmann<p>
 338         Distributed under the Boost Software License, Version 1.0. (See accompanying
 339         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
 340       </p>
 341 </div></td>
 342 </tr></table>
 343 <hr>
 344 <div class="spirit-nav">
 345 <a accesskey="p" href="d_ary_heap.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="PriorityQueue.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
 346 </div>
 347 </body>
 348 </html>