diff options
Diffstat (limited to 'doc/html/boost/heap/fibonacci_heap.html')
| -rwxr-xr-x | doc/html/boost/heap/fibonacci_heap.html | 404 |
1 files changed, 404 insertions, 0 deletions
diff --git a/doc/html/boost/heap/fibonacci_heap.html b/doc/html/boost/heap/fibonacci_heap.html new file mode 100755 index 0000000000..a2eb5d4093 --- /dev/null +++ b/doc/html/boost/heap/fibonacci_heap.html @@ -0,0 +1,404 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Class template fibonacci_heap</title> +<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset"> +<link rel="up" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp" title="Header <boost/heap/fibonacci_heap.hpp>"> +<link rel="prev" href="d_ary_heap.html" title="Class template d_ary_heap"> +<link rel="next" href="PriorityQueue.html" title="Struct template PriorityQueue"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> +<td align="center"><a href="../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<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> +</div> +<div class="refentry"> +<a name="boost.heap.fibonacci_heap"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Class template fibonacci_heap</span></h2> +<p>boost::heap::fibonacci_heap — fibonacci heap </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../heap/reference.html#header.boost.heap.fibonacci_heap_hpp" title="Header <boost/heap/fibonacci_heap.hpp>">boost/heap/fibonacci_heap.hpp</a>> + +</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">class</span><span class="special">...</span> Options<span class="special">></span> +<span class="keyword">class</span> <a class="link" href="fibonacci_heap.html" title="Class template fibonacci_heap">fibonacci_heap</a> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="comment">// <a class="link" href="fibonacci_heap.html#boost.heap.fibonacci_heaptypes">types</a></span> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + <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> + + <span class="comment">// <a class="link" href="fibonacci_heap.html#boost.heap.fibonacci_heapconstruct-copy-destruct">construct/copy/destruct</a></span> + <span class="keyword">explicit</span> <a class="link" href="fibonacci_heap.html#id681284-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">&</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> + <a class="link" href="fibonacci_heap.html#id463746-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">&</span><span class="special">)</span><span class="special">;</span> + <a class="link" href="fibonacci_heap.html#id662458-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">&&</span><span class="special">)</span><span class="special">;</span> + fibonacci_heap& <a class="link" href="fibonacci_heap.html#id371378-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">&&</span><span class="special">)</span><span class="special">;</span> + fibonacci_heap& <a class="link" href="fibonacci_heap.html#id739605-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">&</span><span class="special">)</span><span class="special">;</span> + <a class="link" href="fibonacci_heap.html#id346072-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> + + <span class="comment">// <a class="link" href="fibonacci_heap.html#id751635-bb">public member functions</a></span> + <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id751638-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> + <span class="identifier">size_type</span> <a class="link" href="fibonacci_heap.html#id751670-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> + <span class="identifier">size_type</span> <a class="link" href="fibonacci_heap.html#id751701-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id719263-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span> + <span class="identifier">allocator_type</span> <a class="link" href="fibonacci_heap.html#id719294-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id377222-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">&</span><span class="special">)</span><span class="special">;</span> + <span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="fibonacci_heap.html#id366373-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> + <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#id748637-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">&</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">></span> <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#id748674-bb"><span class="identifier">emplace</span></a><span class="special">(</span><span class="identifier">Args</span> <span class="special">&&</span><span class="special">...</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id719979-bb"><span class="identifier">pop</span></a><span class="special">(</span><span class="keyword">void</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id363284-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id671256-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id706786-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id700136-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id330407-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id330457-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id718837-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id384833-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id373078-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">&</span><span class="special">)</span><span class="special">;</span> + <span class="identifier">iterator</span> <a class="link" href="fibonacci_heap.html#id346640-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> + <span class="identifier">iterator</span> <a class="link" href="fibonacci_heap.html#id371777-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> + <span class="identifier">ordered_iterator</span> <a class="link" href="fibonacci_heap.html#id681698-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> + <span class="identifier">ordered_iterator</span> <a class="link" href="fibonacci_heap.html#id395052-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> + <span class="keyword">void</span> <a class="link" href="fibonacci_heap.html#id725613-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">&</span><span class="special">)</span><span class="special">;</span> + <span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="fibonacci_heap.html#id719012-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> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id457477-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id717197-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id717239-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id382779-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id685079-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="fibonacci_heap.html#id443093-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">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + + <span class="comment">// <a class="link" href="fibonacci_heap.html#id346079-bb">public static functions</a></span> + <span class="keyword">static</span> <span class="identifier">handle_type</span> <a class="link" href="fibonacci_heap.html#id346082-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">&</span><span class="special">)</span><span class="special">;</span> + + <span class="comment">// public data members</span> + <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> + <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> + <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> + <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> + <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> +<span class="special">}</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id1595911"></a><h2>Description</h2> +<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> +<p>The container supports the following options:</p> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"><p><code class="computeroutput">boost::heap::stable<></code>, defaults to <code class="computeroutput">stable<false></code> </p></li> +<li class="listitem"><p><code class="computeroutput">boost::heap::compare<></code>, defaults to <code class="computeroutput">compare<std::less<T></code> ></p></li> +<li class="listitem"><p><code class="computeroutput">boost::heap::allocator<></code>, defaults to <code class="computeroutput">allocator<std::allocator<T></code> ></p></li> +<li class="listitem"><p><code class="computeroutput">boost::heap::constant_time_size<></code>, defaults to <code class="computeroutput">constant_time_size<true></code> </p></li> +<li class="listitem"><p><code class="computeroutput">boost::heap::stability_counter_type<></code>, defaults to <code class="computeroutput">stability_counter_type<boost::uintmax_t></code> </p></li> +</ul></div> +<p> +</p> +<div class="refsect2"> +<a name="id1596001"></a><h3> +<a name="boost.heap.fibonacci_heaptypes"></a><code class="computeroutput">fibonacci_heap</code> + public + types</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"> +<p> +<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> +<p><span class="bold"><strong>Note:</strong></span> The iterator does not traverse the priority queue in order of the priorities. </p> +<p> + </p> +</li></ol></div> +</div> +<div class="refsect2"> +<a name="id1596067"></a><h3> +<a name="boost.heap.fibonacci_heapconstruct-copy-destruct"></a><code class="computeroutput">fibonacci_heap</code> + public + construct/copy/destruct</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">explicit</span> <a name="id681284-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">&</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> +<p><span class="bold"><strong>Effects:</strong></span> constructs an empty priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><a name="id463746-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">&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> copy-constructs priority queue from rhs.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Linear. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><a name="id662458-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">&&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> C++11-style move constructor.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<p><span class="bold"><strong>Note:</strong></span> Only available, if BOOST_HAS_RVALUE_REFS is defined </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout">fibonacci_heap& <a name="id371378-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">&&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> C++11-style move assignment.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<p><span class="bold"><strong>Note:</strong></span> Only available, if BOOST_HAS_RVALUE_REFS is defined </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout">fibonacci_heap& <a name="id739605-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">&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> Assigns priority queue from rhs.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Linear. </p> +<p> + </p> +</li> +<li class="listitem"><pre class="literallayout"><a name="id346072-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> +</ol></div> +</div> +<div class="refsect2"> +<a name="id1596485"></a><h3> +<a name="id751635-bb"></a><code class="computeroutput">fibonacci_heap</code> public member functions</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">bool</span> <a name="id751638-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns true, if the priority queue contains no elements.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">size_type</span> <a name="id751670-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns the number of elements contained in the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">size_type</span> <a name="id751701-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns the maximum number of elements the priority queue can contain.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id719263-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> +<p><span class="bold"><strong>Effects:</strong></span> Removes all elements from the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Linear. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">allocator_type</span> <a name="id719294-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns allocator.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id377222-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">&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> Swaps two priority queues.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">value_type</span> <span class="keyword">const</span> <span class="special">&</span> <a name="id366373-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns a const_reference to the maximum element.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">handle_type</span> <a name="id748637-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">&</span> v<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> Adds a new element to the priority queue. Returns handle to element</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<p><span class="bold"><strong>Note:</strong></span> Does not invalidate iterators. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span><span class="special">...</span> Args<span class="special">></span> <span class="identifier">handle_type</span> <a name="id748674-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span> <span class="special">&&</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre> +<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> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<p><span class="bold"><strong>Note:</strong></span> Does not invalidate iterators. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id719979-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> +<p><span class="bold"><strong>Effects:</strong></span> Removes the top element from the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic (amortized). Linear (worst case). </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id363284-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> +<p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> & updates the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value < v, Constant otherwise. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id671256-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> +<p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> & updates the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value < v, Constant otherwise. </p> +<p> +</p> +<p><span class="bold"><strong>Rationale:</strong></span> The lazy update function is a modification of the traditional update, that just invalidates the iterator the the object referred to by the handle. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id706786-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> +<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> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p> +<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> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id700136-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> +<p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> & updates the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic if current value < v, Constant otherwise. </p> +<p> + (handle_type handle)</p> +<p><span class="bold"><strong>Rationale:</strong></span> The lazy update function is a modification of the traditional update, that just invalidates the iterator the the object referred to by the handle. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id330407-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> +<p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> & updates the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<p><span class="bold"><strong>Note:</strong></span> The new value is expected to be greater than the current one </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id330457-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> +<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> +<p><span class="bold"><strong>Complexity:</strong></span> Constant.</p> +<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> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id718837-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> +<p><span class="bold"><strong>Effects:</strong></span> Assigns <code class="computeroutput">v</code> to the element handled by <code class="computeroutput">handle</code> & updates the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p> +<p><span class="bold"><strong>Note:</strong></span> The new value is expected to be less than the current one </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id384833-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> +<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> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic.</p> +<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> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id373078-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">&</span> handle<span class="special">)</span><span class="special">;</span></pre> +<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> +<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">iterator</span> <a name="id346640-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the first element contained in the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">iterator</span> <a name="id371777-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the end of the priority queue.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="id681698-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the first element contained in the priority queue.</p> +<p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="id395052-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> +<p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the first element contained in the priority queue.</p> +<p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">void</span> <a name="id725613-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">&</span> rhs<span class="special">)</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Effects:</strong></span> Merge with priority queue rhs.</p> +<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&</span> <a name="id719012-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> +<p><span class="bold"><strong>Effect:</strong></span> Returns the value_compare object used by the priority queue </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id457477-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id717197-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id717239-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id382779-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id685079-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p>Equivalent comparison <span class="bold"><strong>Returns:</strong></span> True, if both heap data structures are equivalent. </p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +<li class="listitem"> +<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> HeapType<span class="special">></span> <span class="keyword">bool</span> <a name="id443093-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">&</span> rhs<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre> +<p>Equivalent comparison <span class="bold"><strong>Returns:</strong></span> True, if both heap data structures are not equivalent. </p> +<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> +<p> + </p> +</li> +</ol></div> +</div> +<div class="refsect2"> +<a name="id1598898"></a><h3> +<a name="id346079-bb"></a><code class="computeroutput">fibonacci_heap</code> public static functions</h3> +<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="id346082-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">&</span> it<span class="special">)</span><span class="special">;</span></pre> +<p> + </p> +</li></ol></div> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010, 2011 Tim Blechmann<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + 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>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<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> +</div> +</body> +</html> |