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=UTF-8"> 5<title>Class template pairing_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.pairing_heap_hpp" title="Header <boost/heap/pairing_heap.hpp>"> 10<link rel="prev" href="heap_merge.html" title="Function template heap_merge"> 11<link rel="next" href="allocator.html" title="Struct template allocator"> 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="heap_merge.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../heap/reference.html#header.boost.heap.pairing_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="allocator.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> 25</div> 26<div class="refentry"> 27<a name="boost.heap.pairing_heap"></a><div class="titlepage"></div> 28<div class="refnamediv"> 29<h2><span class="refentrytitle">Class template pairing_heap</span></h2> 30<p>boost::heap::pairing_heap — pairing 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: <<a class="link" href="../../heap/reference.html#header.boost.heap.pairing_heap_hpp" title="Header <boost/heap/pairing_heap.hpp>">boost/heap/pairing_heap.hpp</a>> 34 35</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> 36<span class="keyword">class</span> <a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">{</span> 37<span class="keyword">public</span><span class="special">:</span> 38 <span class="comment">// <a class="link" href="pairing_heap.html#boost.heap.pairing_heaptypes">types</a></span> 39 <span class="keyword">typedef</span> <span class="identifier">T</span> <a name="boost.heap.pairing_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.pairing_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.pairing_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.pairing_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.pairing_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.pairing_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.pairing_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.pairing_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.pairing_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="pairing_heap.html#boost.heap.pairing_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.pairing_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.pairing_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.pairing_heap.handle_type"></a><span class="identifier">handle_type</span><span class="special">;</span> 52 53 <span class="comment">// <a class="link" href="pairing_heap.html#boost.heap.pairing_heapconstruct-copy-destruct">construct/copy/destruct</a></span> 54 <span class="keyword">explicit</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_23-bb"><span class="identifier">pairing_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> 55 <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_24-bb"><span class="identifier">pairing_heap</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="keyword">const</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 56 <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_25-bb"><span class="identifier">pairing_heap</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&&</span><span class="special">)</span><span class="special">;</span> 57 <a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_26-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&&</span><span class="special">)</span><span class="special">;</span> 58 <a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_27-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="keyword">const</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 59 <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_28-bb"><span class="special">~</span><span class="identifier">pairing_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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22-bb">public member functions</a></span> 62 <span class="keyword">bool</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_1-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_2-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_3-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_4-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_5-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_6-bb"><span class="identifier">swap</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 68 <span class="identifier">const_reference</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_7-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_8-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> 70 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_9-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> 71 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_10-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_11-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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_12-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> 74 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_13-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> 75 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_14-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> 76 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_15-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> 77 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_16-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> 78 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_17-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">handle_type</span><span class="special">)</span><span class="special">;</span> 79 <span class="identifier">iterator</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_18-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> 80 <span class="identifier">iterator</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_19-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> 81 <span class="identifier">ordered_iterator</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_20-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> 82 <span class="identifier">ordered_iterator</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_21-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> 83 <span class="keyword">void</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_22-bb"><span class="identifier">merge</span></a><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span> 84 <span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_23-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> 85 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_24-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> 86 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_25-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> 87 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_26-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> 88 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_27-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> 89 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_28-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> 90 <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="pairing_heap.html#id-1_3_18_6_6_1_1_1_22_29-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> 91 92 <span class="comment">// <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_29-bb">public static functions</a></span> 93 <span class="keyword">static</span> <span class="identifier">handle_type</span> <a class="link" href="pairing_heap.html#id-1_3_18_6_6_1_1_1_29_1-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> 94 95 <span class="comment">// public data members</span> 96 <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> 97 <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> 98 <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> 99 <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> 100 <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> 101<span class="special">}</span><span class="special">;</span></pre></div> 102<div class="refsect1"> 103<a name="id-1.3.18.6.7.3.4"></a><h2>Description</h2> 104<p>Pairing heaps are self-adjusting binary heaps. Although design and implementation are rather simple, the complexity analysis is yet unsolved. For details, consult:</p> 105<p>Pettie, Seth (2005), "Towards a final analysis of pairing heaps", Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 174-183</p> 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::compare<></code>, defaults to <code class="computeroutput">compare<std::less<T></code> ></p></li> 110<li class="listitem"><p><code class="computeroutput">boost::heap::stable<></code>, defaults to <code class="computeroutput">stable<false></code> </p></li> 111<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> 112<li class="listitem"><p><code class="computeroutput">boost::heap::allocator<></code>, defaults to <code class="computeroutput">allocator<std::allocator<T></code> ></p></li> 113<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> 114</ul></div> 115<p> 116</p> 117<div class="refsect2"> 118<a name="id-1.3.18.6.7.3.4.6"></a><h3> 119<a name="boost.heap.pairing_heaptypes"></a><code class="computeroutput">pairing_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.pairing_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="id-1.3.18.6.7.3.4.7"></a><h3> 130<a name="boost.heap.pairing_heapconstruct-copy-destruct"></a><code class="computeroutput">pairing_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="id-1_3_18_6_6_1_1_1_23-bb"></a><span class="identifier">pairing_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> 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="id-1_3_18_6_6_1_1_1_24-bb"></a><span class="identifier">pairing_heap</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="keyword">const</span> <span class="special">&</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="id-1_3_18_6_6_1_1_1_25-bb"></a><span class="identifier">pairing_heap</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&&</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="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span> <a name="id-1_3_18_6_6_1_1_1_26-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&&</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="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span> <a name="id-1_3_18_6_6_1_1_1_27-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="keyword">const</span> <span class="special">&</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="id-1_3_18_6_6_1_1_1_28-bb"></a><span class="special">~</span><span class="identifier">pairing_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="id-1.3.18.6.7.3.4.8"></a><h3> 166<a name="id-1_3_18_6_6_1_1_1_22-bb"></a><code class="computeroutput">pairing_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="id-1_3_18_6_6_1_1_1_22_1-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="id-1_3_18_6_6_1_1_1_22_2-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, if configured with constant_time_size<true>, otherwise linear. </p> 177</li> 178<li class="listitem"> 179<pre class="literallayout"><span class="identifier">size_type</span> <a name="id-1_3_18_6_6_1_1_1_22_3-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="id-1_3_18_6_6_1_1_1_22_4-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="id-1_3_18_6_6_1_1_1_22_5-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="id-1_3_18_6_6_1_1_1_22_6-bb"></a><span class="identifier">swap</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</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">const_reference</span> <a name="id-1_3_18_6_6_1_1_1_22_7-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="id-1_3_18_6_6_1_1_1_22_8-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> 205<p><span class="bold"><strong>Effects:</strong></span> Adds a new element to the priority queue. Returns handle to element<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized). </p> 206</li> 207<li class="listitem"> 208<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="id-1_3_18_6_6_1_1_1_22_9-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> 209<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.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized). </p> 210</li> 211<li class="listitem"> 212<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_10-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> 213<p><span class="bold"><strong>Effects:</strong></span> Removes the top element from the priority queue.</p> 214<p><span class="bold"><strong>Complexity:</strong></span> Logarithmic (amortized). </p> 215</li> 216<li class="listitem"> 217<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_11-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> 218<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.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized). </p> 219</li> 220<li class="listitem"> 221<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_12-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> 222<p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized).</p> 223<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> 224</li> 225<li class="listitem"> 226<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_13-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> 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> & updates the priority queue.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized).</p> 228<p><span class="bold"><strong>Note:</strong></span> The new value is expected to be greater than the current one </p> 229</li> 230<li class="listitem"> 231<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_14-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> 232<p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized).</p> 233<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> 234</li> 235<li class="listitem"> 236<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_15-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> 237<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.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized).</p> 238<p><span class="bold"><strong>Note:</strong></span> The new value is expected to be less than the current one </p> 239</li> 240<li class="listitem"> 241<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_16-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> 242<p><span class="bold"><strong>Effects:</strong></span> Updates the heap after the element handled by <code class="computeroutput">handle</code> has been changed.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized).</p> 243<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> 244</li> 245<li class="listitem"> 246<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_17-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">handle_type</span> handle<span class="special">)</span><span class="special">;</span></pre> 247<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>.<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized). </p> 248</li> 249<li class="listitem"> 250<pre class="literallayout"><span class="identifier">iterator</span> <a name="id-1_3_18_6_6_1_1_1_22_18-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> 251<p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the first element contained in the priority queue.</p> 252<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> 253</li> 254<li class="listitem"> 255<pre class="literallayout"><span class="identifier">iterator</span> <a name="id-1_3_18_6_6_1_1_1_22_19-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> 256<p><span class="bold"><strong>Effects:</strong></span> Returns an iterator to the end of the priority queue.</p> 257<p><span class="bold"><strong>Complexity:</strong></span> Constant. </p> 258</li> 259<li class="listitem"> 260<pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="id-1_3_18_6_6_1_1_1_22_20-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> 261<p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the first element contained in the priority queue.</p> 262<p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p> 263</li> 264<li class="listitem"> 265<pre class="literallayout"><span class="identifier">ordered_iterator</span> <a name="id-1_3_18_6_6_1_1_1_22_21-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> 266<p><span class="bold"><strong>Effects:</strong></span> Returns an ordered iterator to the first element contained in the priority queue.</p> 267<p><span class="bold"><strong>Note:</strong></span> Ordered iterators traverse the priority queue in heap order. </p> 268</li> 269<li class="listitem"> 270<pre class="literallayout"><span class="keyword">void</span> <a name="id-1_3_18_6_6_1_1_1_22_22-bb"></a><span class="identifier">merge</span><span class="special">(</span><a class="link" href="pairing_heap.html" title="Class template pairing_heap">pairing_heap</a> <span class="special">&</span> rhs<span class="special">)</span><span class="special">;</span></pre> 271<p><span class="bold"><strong>Effects:</strong></span> Merge all elements from rhs into this<span class="bold"><strong>Complexity:</strong></span> 2**2*log(log(N)) (amortized). </p> 272</li> 273<li class="listitem"> 274<pre class="literallayout"><span class="identifier">value_compare</span> <span class="keyword">const</span> <span class="special">&</span> <a name="id-1_3_18_6_6_1_1_1_22_23-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> 275<p><span class="bold"><strong>Effect:</strong></span> Returns the value_compare object used by the priority queue </p> 276</li> 277<li class="listitem"> 278<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="id-1_3_18_6_6_1_1_1_22_24-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> 279<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> 280<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> 281</li> 282<li class="listitem"> 283<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="id-1_3_18_6_6_1_1_1_22_25-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> 284<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> 285<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> 286</li> 287<li class="listitem"> 288<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="id-1_3_18_6_6_1_1_1_22_26-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> 289<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> 290<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> 291</li> 292<li class="listitem"> 293<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="id-1_3_18_6_6_1_1_1_22_27-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> 294<p><span class="bold"><strong>Returns:</strong></span> Element-wise comparison of heap data structures</p> 295<p><span class="bold"><strong>Requirement:</strong></span> the <code class="computeroutput">value_compare</code> object of both heaps must match. </p> 296</li> 297<li class="listitem"> 298<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="id-1_3_18_6_6_1_1_1_22_28-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>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> 299</li> 300<li class="listitem"> 301<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="id-1_3_18_6_6_1_1_1_22_29-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>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> 302</li> 303</ol></div> 304</div> 305<div class="refsect2"> 306<a name="id-1.3.18.6.7.3.4.9"></a><h3> 307<a name="id-1_3_18_6_6_1_1_1_29-bb"></a><code class="computeroutput">pairing_heap</code> public static functions</h3> 308<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="id-1_3_18_6_6_1_1_1_29_1-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></li></ol></div> 309</div> 310</div> 311</div> 312<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 313<td align="left"></td> 314<td align="right"><div class="copyright-footer">Copyright © 2010, 2011 Tim Blechmann<p> 315 Distributed under the Boost Software License, Version 1.0. (See accompanying 316 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>) 317 </p> 318</div></td> 319</tr></table> 320<hr> 321<div class="spirit-nav"> 322<a accesskey="p" href="heap_merge.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../heap/reference.html#header.boost.heap.pairing_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="allocator.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a> 323</div> 324</body> 325</html> 326
