<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: 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="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a07776.html','');});
/* @license-end */
</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="a07773.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="a01460.html">Containers</a> » <a class="el" href="a01461.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 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 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 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 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:a0811cc9806e28878cc7a461a3db756d4"><td class="memItemLeft" align="right" valign="top"><a id="a0811cc9806e28878cc7a461a3db756d4"></a>
typedef _Compare </td><td class="memItemRight" valign="bottom"><b>value_compare</b></td></tr>
<tr class="separator:a0811cc9806e28878cc7a461a3db756d4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5c5f86402aebad559116330af173b829"><td class="memItemLeft" align="right" valign="top"><a 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:ad9ef96e9ae20769410ce372f0f7c4f42"><td class="memTemplParams" colspan="2">template<typename _Seq = _Sequence, typename _Requires = typename enable_if<__and_<is_default_constructible<_Compare>, is_default_constructible<_Seq>>::value>::type> </td></tr>
<tr class="memitem:ad9ef96e9ae20769410ce372f0f7c4f42"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07776.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a> ()</td></tr>
<tr class="separator:ad9ef96e9ae20769410ce372f0f7c4f42"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9499ae5886b93b58a2abfe4f73448cc0"><td class="memItemLeft" align="right" valign="top"><a id="a9499ae5886b93b58a2abfe4f73448cc0"></a>
 </td><td class="memItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x, const _Sequence &__s)</td></tr>
<tr class="separator:a9499ae5886b93b58a2abfe4f73448cc0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9910d58f614eba393eee951d1c961a89"><td class="memItemLeft" align="right" valign="top"><a id="a9910d58f614eba393eee951d1c961a89"></a>
 </td><td class="memItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x, _Sequence &&__s=_Sequence())</td></tr>
<tr class="separator:a9910d58f614eba393eee951d1c961a89"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad6e30dcfdb3aee51583f5933f75c1854"><td class="memTemplParams" colspan="2"><a id="ad6e30dcfdb3aee51583f5933f75c1854"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:ad6e30dcfdb3aee51583f5933f75c1854"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (const _Alloc &__a)</td></tr>
<tr class="separator:ad6e30dcfdb3aee51583f5933f75c1854"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a066491105f1b5eb52b311dd828ef77e6"><td class="memTemplParams" colspan="2"><a id="a066491105f1b5eb52b311dd828ef77e6"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:a066491105f1b5eb52b311dd828ef77e6"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x, const _Alloc &__a)</td></tr>
<tr class="separator:a066491105f1b5eb52b311dd828ef77e6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aba0d4a491f39a23486e5cfa04cd19d96"><td class="memTemplParams" colspan="2"><a id="aba0d4a491f39a23486e5cfa04cd19d96"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:aba0d4a491f39a23486e5cfa04cd19d96"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x, const _Sequence &__c, const _Alloc &__a)</td></tr>
<tr class="separator:aba0d4a491f39a23486e5cfa04cd19d96"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac86f1f0f6a881dc678c164980298840e"><td class="memTemplParams" colspan="2"><a id="ac86f1f0f6a881dc678c164980298840e"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:ac86f1f0f6a881dc678c164980298840e"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (const _Compare &__x, _Sequence &&__c, const _Alloc &__a)</td></tr>
<tr class="separator:ac86f1f0f6a881dc678c164980298840e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a40ec808d90ccb498c89c5416e12af35e"><td class="memTemplParams" colspan="2"><a id="a40ec808d90ccb498c89c5416e12af35e"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:a40ec808d90ccb498c89c5416e12af35e"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (const <a class="el" href="a07776.html">priority_queue</a> &__q, const _Alloc &__a)</td></tr>
<tr class="separator:a40ec808d90ccb498c89c5416e12af35e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac86c65491f8b899a581d195cdd02f08e"><td class="memTemplParams" colspan="2"><a id="ac86c65491f8b899a581d195cdd02f08e"></a>
template<typename _Alloc , typename _Requires = _Uses<_Alloc>> </td></tr>
<tr class="memitem:ac86c65491f8b899a581d195cdd02f08e"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><b>priority_queue</b> (<a class="el" href="a07776.html">priority_queue</a> &&__q, const _Alloc &__a)</td></tr>
<tr class="separator:ac86c65491f8b899a581d195cdd02f08e"><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="a07776.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 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:a00c79318d5b4aa752151134d404cffb1"><td class="memTemplParams" colspan="2"><a id="a00c79318d5b4aa752151134d404cffb1"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a00c79318d5b4aa752151134d404cffb1"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace</b> (_Args &&... __args)</td></tr>
<tr class="separator:a00c79318d5b4aa752151134d404cffb1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4a1c1fe5e71410e31f9af1467b7c3472"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a07776.html#a4a1c1fe5e71410e31f9af1467b7c3472">empty</a> () const</td></tr>
<tr class="separator:a4a1c1fe5e71410e31f9af1467b7c3472"><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="a07776.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="a07776.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 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:a22575e222bea1d4bdd5e978b2d6c3b04"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07776.html#a22575e222bea1d4bdd5e978b2d6c3b04">size</a> () const</td></tr>
<tr class="separator:a22575e222bea1d4bdd5e978b2d6c3b04"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a08c8401d3022846b3c007771516f39a8"><td class="memItemLeft" align="right" valign="top"><a id="a08c8401d3022846b3c007771516f39a8"></a>
void </td><td class="memItemRight" valign="bottom"><b>swap</b> (<a class="el" href="a07776.html">priority_queue</a> &__pq) noexcept(__and_<//c++1z or gnu++11 __is_nothrow_swappable< _Sequence >, __is_nothrow_swappable< _Compare > >::value)</td></tr>
<tr class="separator:a08c8401d3022846b3c007771516f39a8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abaedbd99739eef4ac53eefb478eb3900"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07776.html#abaedbd99739eef4ac53eefb478eb3900">top</a> () const</td></tr>
<tr class="separator:abaedbd99739eef4ac53eefb478eb3900"><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 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 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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00435">435</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="ad9ef96e9ae20769410ce372f0f7c4f42"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9ef96e9ae20769410ce372f0f7c4f42">◆ </a></span>priority_queue() <span class="overload">[1/2]</span></h2>
<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 _Seq = _Sequence, typename _Requires = typename enable_if<__and_<is_default_constructible<_Compare>, is_default_constructible<_Seq>>::value>::type> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07776.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::<a class="el" href="a07776.html">priority_queue</a> </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>Default constructor creates no elements. </p>
<p class="definition">Definition at line <a class="el" href="a00575_source.html#l00485">485</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<a id="a83695f69303684e73b764c27d2da64d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a83695f69303684e73b764c27d2da64d4">◆ </a></span>priority_queue() <span class="overload">[2/2]</span></h2>
<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="a07776.html">std::priority_queue</a>< _Tp, _Sequence, _Compare >::<a class="el" href="a07776.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="a01496.html">functor base classes</a>. </p>
<p class="definition">Definition at line <a class="el" href="a00575_source.html#l00557">557</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a4a1c1fe5e71410e31f9af1467b7c3472"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4a1c1fe5e71410e31f9af1467b7c3472">◆ </a></span>empty()</h2>
<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="a07776.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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00583">583</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<a id="a935091a0132d887f9d3f87686c5598ac"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a935091a0132d887f9d3f87686c5598ac">◆ </a></span>pop()</h2>
<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="a07776.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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00646">646</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<a id="acf5286a0e5aa7354459ca1553ba54688"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acf5286a0e5aa7354459ca1553ba54688">◆ </a></span>push()</h2>
<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="a07776.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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00611">611</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
<p class="reference">References <a class="el" href="a00545_source.html#l00189">std::push_heap()</a>.</p>
</div>
</div>
<a id="a22575e222bea1d4bdd5e978b2d6c3b04"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a22575e222bea1d4bdd5e978b2d6c3b04">◆ </a></span>size()</h2>
<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="a07776.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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00588">588</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<a id="abaedbd99739eef4ac53eefb478eb3900"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abaedbd99739eef4ac53eefb478eb3900">◆ </a></span>top()</h2>
<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="a07776.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 class="definition">Definition at line <a class="el" href="a00575_source.html#l00596">596</a> of file <a class="el" href="a00575_source.html">stl_queue.h</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li><a class="el" href="a00575_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="a01538.html">std</a></li><li class="navelem"><a class="el" href="a07776.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.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
3997
