<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.5"/> <title>libstdc++: std::priority_queue< _Tp, _Sequence, _Compare > Class Template Reference</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> $(document).ready(initResizable); $(window).load(resizeHeight); </script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.5 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> $(document).ready(function(){initNavTree('a00944.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="summary"> <a href="#pub-types">Public Types</a> | <a href="#pub-methods">Public Member Functions</a> | <a href="#pro-attribs">Protected Attributes</a> | <a href="a03266.html">List of all members</a> </div> <div class="headertitle"> <div class="title">std::priority_queue< _Tp, _Sequence, _Compare > Class Template Reference<div class="ingroups"><a class="el" href="a01683.html">Sequences</a></div></div> </div> </div><!--header--> <div class="contents"> <table class="memberdecls"> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a> Public Types</h2></td></tr> <tr class="memitem:aee5ba345e85d74e43163a38fd0b68711"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aee5ba345e85d74e43163a38fd0b68711"></a> typedef _Sequence::const_reference </td><td class="memItemRight" valign="bottom"><b>const_reference</b></td></tr> <tr class="separator:aee5ba345e85d74e43163a38fd0b68711"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:ad8a7ff58e206f92e5c8d5e0681a3fe99"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ad8a7ff58e206f92e5c8d5e0681a3fe99"></a> typedef _Sequence </td><td class="memItemRight" valign="bottom"><b>container_type</b></td></tr> <tr class="separator:ad8a7ff58e206f92e5c8d5e0681a3fe99"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:ad51180cd1240a49235044c8e5b6fd06e"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ad51180cd1240a49235044c8e5b6fd06e"></a> typedef _Sequence::reference </td><td class="memItemRight" valign="bottom"><b>reference</b></td></tr> <tr class="separator:ad51180cd1240a49235044c8e5b6fd06e"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:abb44ba9344669cb5bf0526427594e184"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="abb44ba9344669cb5bf0526427594e184"></a> typedef _Sequence::size_type </td><td class="memItemRight" valign="bottom"><b>size_type</b></td></tr> <tr class="separator:abb44ba9344669cb5bf0526427594e184"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a5c5f86402aebad559116330af173b829"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a5c5f86402aebad559116330af173b829"></a> typedef _Sequence::value_type </td><td class="memItemRight" valign="bottom"><b>value_type</b></td></tr> <tr class="separator:a5c5f86402aebad559116330af173b829"><td class="memSeparator" colspan="2"> </td></tr> </table><table class="memberdecls"> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a> Public Member Functions</h2></td></tr> <tr class="memitem:a9499ae5886b93b58a2abfe4f73448cc0"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#a9499ae5886b93b58a2abfe4f73448cc0">priority_queue</a> (const _Compare &__x, const _Sequence &__s)</td></tr> <tr class="separator:a9499ae5886b93b58a2abfe4f73448cc0"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a2c3fb3490dfcd32e1c0ee535a846c417"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2c3fb3490dfcd32e1c0ee535a846c417"></a>  </td><td class="memItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x=_Compare(), _Sequence &&__s=_Sequence())</td></tr> <tr class="separator:a2c3fb3490dfcd32e1c0ee535a846c417"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a83695f69303684e73b764c27d2da64d4"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr> <tr class="memitem:a83695f69303684e73b764c27d2da64d4"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00944.html#a83695f69303684e73b764c27d2da64d4">priority_queue</a> (_InputIterator __first, _InputIterator __last, const _Compare &__x, const _Sequence &__s)</td></tr> <tr class="separator:a83695f69303684e73b764c27d2da64d4"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:ac8cd2027e2ab0d1ce646adfbc5c3630e"><td class="memTemplParams" colspan="2"><a class="anchor" id="ac8cd2027e2ab0d1ce646adfbc5c3630e"></a> template<typename _InputIterator > </td></tr> <tr class="memitem:ac8cd2027e2ab0d1ce646adfbc5c3630e"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (_InputIterator __first, _InputIterator __last, const _Compare &__x=_Compare(), _Sequence &&__s=_Sequence())</td></tr> <tr class="separator:ac8cd2027e2ab0d1ce646adfbc5c3630e"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a1d7c165b671c6efa80ceede5a5296499"><td class="memTemplParams" colspan="2"><a class="anchor" id="a1d7c165b671c6efa80ceede5a5296499"></a> template<typename... _Args> </td></tr> <tr class="memitem:a1d7c165b671c6efa80ceede5a5296499"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace</b> (_Args &&...__args)</td></tr> <tr class="separator:a1d7c165b671c6efa80ceede5a5296499"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:af3eaf1d61f0e394e569c5779765023a8"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#af3eaf1d61f0e394e569c5779765023a8">empty</a> () const </td></tr> <tr class="separator:af3eaf1d61f0e394e569c5779765023a8"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a1b9630e3493e0ab731e3aee4888fd6c1"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a1b9630e3493e0ab731e3aee4888fd6c1"></a> void </td><td class="memItemRight" valign="bottom"><b>noexcept</b> (noexcept(<a class="el" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">swap</a>(c, __pq.c))&&noexcept(<a class="el" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">swap</a>(comp, __pq.comp)))</td></tr> <tr class="separator:a1b9630e3493e0ab731e3aee4888fd6c1"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a935091a0132d887f9d3f87686c5598ac"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#a935091a0132d887f9d3f87686c5598ac">pop</a> ()</td></tr> <tr class="separator:a935091a0132d887f9d3f87686c5598ac"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:acf5286a0e5aa7354459ca1553ba54688"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#acf5286a0e5aa7354459ca1553ba54688">push</a> (const value_type &__x)</td></tr> <tr class="separator:acf5286a0e5aa7354459ca1553ba54688"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:ae1a14112c5c831a96231845da4ccf6f3"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ae1a14112c5c831a96231845da4ccf6f3"></a> void </td><td class="memItemRight" valign="bottom"><b>push</b> (value_type &&__x)</td></tr> <tr class="separator:ae1a14112c5c831a96231845da4ccf6f3"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a0b0f6e210f112b5c5f75318481fc9059"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#a0b0f6e210f112b5c5f75318481fc9059">size</a> () const </td></tr> <tr class="separator:a0b0f6e210f112b5c5f75318481fc9059"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a2203f7a919d0a72561a8e05cb570fd17"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a00944.html#a2203f7a919d0a72561a8e05cb570fd17">top</a> () const </td></tr> <tr class="separator:a2203f7a919d0a72561a8e05cb570fd17"><td class="memSeparator" colspan="2"> </td></tr> </table><table class="memberdecls"> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a> Protected Attributes</h2></td></tr> <tr class="memitem:afb4b0f6fc110c254cd402518808556b7"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="afb4b0f6fc110c254cd402518808556b7"></a> _Sequence </td><td class="memItemRight" valign="bottom"><b>c</b></td></tr> <tr class="separator:afb4b0f6fc110c254cd402518808556b7"><td class="memSeparator" colspan="2"> </td></tr> <tr class="memitem:a0666ffbc53da52251ae8e1c8dd99188a"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a0666ffbc53da52251ae8e1c8dd99188a"></a> _Compare </td><td class="memItemRight" valign="bottom"><b>comp</b></td></tr> <tr class="separator:a0666ffbc53da52251ae8e1c8dd99188a"><td class="memSeparator" colspan="2"> </td></tr> </table> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <div class="textblock"><h3>template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>><br/> class std::priority_queue< _Tp, _Sequence, _Compare ></h3> <p>A standard container automatically sorting its contents. </p> <dl class="tparams"><dt>Template Parameters</dt><dd> <table class="tparams"> <tr><td class="paramname">_Tp</td><td>Type of element. </td></tr> <tr><td class="paramname">_Sequence</td><td>Type of underlying sequence, defaults to vector<_Tp>. </td></tr> <tr><td class="paramname">_Compare</td><td>Comparison function object type, defaults to less<_Sequence::value_type>.</td></tr> </table> </dd> </dl> <p>This is not a true container, but an <em>adaptor</em>. It holds another container, and provides a wrapper interface to that container. The wrapper is what enforces priority-based sorting and queue behavior. Very few of the standard container/sequence interface requirements are met (e.g., iterators).</p> <p>The second template parameter defines the type of the underlying sequence/container. It defaults to std::vector, but it can be any type that supports <code>front()</code>, <code>push_back</code>, <code>pop_back</code>, and random-access iterators, such as std::deque or an appropriate user-defined type.</p> <p>The third template parameter supplies the means of making priority comparisons. It defaults to <code>less<value_type></code> but can be anything defining a strict weak ordering.</p> <p>Members not found in <em>normal</em> containers are <code>container_type</code>, which is a typedef for the second Sequence parameter, and <code>push</code>, <code>pop</code>, and <code>top</code>, which are standard queue operations.</p> <dl class="section note"><dt>Note</dt><dd>No equality/comparison operators are provided for priority_queue.</dd> <dd> Sorting of the elements takes place as they are added to, and removed from, the priority_queue using the priority_queue's member functions. If you access the elements by other means, and change their data such that the sorting order would be different, the priority_queue will not re-sort the elements for you. (How could it know to do so?) </dd></dl> <p>Definition at line <a class="el" href="a01562_source.html#l00367">367</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> </div><h2 class="groupheader">Constructor & Destructor Documentation</h2> <a class="anchor" id="a9499ae5886b93b58a2abfe4f73448cc0"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::<a class="el" href="a00944.html">priority_queue</a> </td> <td>(</td> <td class="paramtype">const _Compare & </td> <td class="paramname"><em>__x</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const _Sequence & </td> <td class="paramname"><em>__s</em> </td> </tr> <tr> <td></td> <td>)</td> <td></td><td></td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Default constructor creates no elements. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00402">402</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>References <a class="el" href="a01552_source.html#l00426">std::make_heap()</a>.</p> </div> </div> <a class="anchor" id="a83695f69303684e73b764c27d2da64d4"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <div class="memtemplate"> template<typename _InputIterator > </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname"><a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::<a class="el" href="a00944.html">priority_queue</a> </td> <td>(</td> <td class="paramtype">_InputIterator </td> <td class="paramname"><em>__first</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">_InputIterator </td> <td class="paramname"><em>__last</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const _Compare & </td> <td class="paramname"><em>__x</em>, </td> </tr> <tr> <td class="paramkey"></td> <td></td> <td class="paramtype">const _Sequence & </td> <td class="paramname"><em>__s</em> </td> </tr> <tr> <td></td> <td>)</td> <td></td><td></td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Builds a queue from a range. </p> <dl class="params"><dt>Parameters</dt><dd> <table class="params"> <tr><td class="paramname">__first</td><td>An input iterator. </td></tr> <tr><td class="paramname">__last</td><td>An input iterator. </td></tr> <tr><td class="paramname">__x</td><td>A comparison functor describing a strict weak ordering. </td></tr> <tr><td class="paramname">__s</td><td>An initial sequence with which to start.</td></tr> </table> </dd> </dl> <p>Begins by copying <em>__s</em>, inserting a copy of the elements from <em></em>[first,last) into the copy of <em>__s</em>, then ordering the copy according to <em>__x</em>.</p> <p>For more information on function objects, see the documentation on <a class="el" href="a01717.html">functor base classes</a>. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00442">442</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>References <a class="el" href="a01552_source.html#l00426">std::make_heap()</a>.</p> </div> </div> <h2 class="groupheader">Member Function Documentation</h2> <a class="anchor" id="af3eaf1d61f0e394e569c5779765023a8"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">bool <a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::empty </td> <td>(</td> <td class="paramname"></td><td>)</td> <td> const</td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Returns true if the queue is empty. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00468">468</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>Referenced by <a class="el" href="a01372_source.html#l00122">__gnu_parallel::multiseq_partition()</a>, and <a class="el" href="a01372_source.html#l00388">__gnu_parallel::multiseq_selection()</a>.</p> </div> </div> <a class="anchor" id="a935091a0132d887f9d3f87686c5598ac"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">void <a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::pop </td> <td>(</td> <td class="paramname"></td><td>)</td> <td></td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Removes first element. </p> <p>This is a typical queue operation. It shrinks the queue by one. The time complexity of the operation depends on the underlying sequence.</p> <p>Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop() is called. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00531">531</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>References <a class="el" href="a01552_source.html#l00359">std::pop_heap()</a>.</p> <p>Referenced by <a class="el" href="a01372_source.html#l00122">__gnu_parallel::multiseq_partition()</a>, and <a class="el" href="a01372_source.html#l00388">__gnu_parallel::multiseq_selection()</a>.</p> </div> </div> <a class="anchor" id="acf5286a0e5aa7354459ca1553ba54688"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">void <a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::push </td> <td>(</td> <td class="paramtype">const value_type & </td> <td class="paramname"><em>__x</em></td><td>)</td> <td></td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Add data to the queue. </p> <dl class="params"><dt>Parameters</dt><dd> <table class="params"> <tr><td class="paramname">__x</td><td>Data to be added.</td></tr> </table> </dd> </dl> <p>This is a typical queue operation. The time complexity of the operation depends on the underlying sequence. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00496">496</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>References <a class="el" href="a01552_source.html#l00206">std::push_heap()</a>.</p> <p>Referenced by <a class="el" href="a01372_source.html#l00122">__gnu_parallel::multiseq_partition()</a>, and <a class="el" href="a01372_source.html#l00388">__gnu_parallel::multiseq_selection()</a>.</p> </div> </div> <a class="anchor" id="a0b0f6e210f112b5c5f75318481fc9059"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">size_type <a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::size </td> <td>(</td> <td class="paramname"></td><td>)</td> <td> const</td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Returns the number of elements in the queue. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00473">473</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> </div> </div> <a class="anchor" id="a2203f7a919d0a72561a8e05cb570fd17"></a> <div class="memitem"> <div class="memproto"> <div class="memtemplate"> template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type>> </div> <table class="mlabels"> <tr> <td class="mlabels-left"> <table class="memname"> <tr> <td class="memname">const_reference <a class="el" href="a00944.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::top </td> <td>(</td> <td class="paramname"></td><td>)</td> <td> const</td> </tr> </table> </td> <td class="mlabels-right"> <span class="mlabels"><span class="mlabel">inline</span></span> </td> </tr> </table> </div><div class="memdoc"> <p>Returns a read-only (constant) reference to the data at the first element of the queue. </p> <p>Definition at line <a class="el" href="a01562_source.html#l00481">481</a> of file <a class="el" href="a01562_source.html">stl_queue.h</a>.</p> <p>Referenced by <a class="el" href="a01372_source.html#l00122">__gnu_parallel::multiseq_partition()</a>, and <a class="el" href="a01372_source.html#l00388">__gnu_parallel::multiseq_selection()</a>.</p> </div> </div> <hr/>The documentation for this class was generated from the following file:<ul> <li><a class="el" href="a01562_source.html">stl_queue.h</a></li> </ul> </div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="a01662.html">std</a></li><li class="navelem"><a class="el" href="a00944.html">priority_queue</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.5 </li> </ul> </div> </body> </html>