<!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.3"/>
<title>libstdc++: Heap</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.3 -->
</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('a01664.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">Heap<div class="ingroups"><a class="el" href="a01648.html">Sorting</a></div></div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Collaboration diagram for Heap:</div>
<div class="dyncontent">
<center><table><tr><td><img src="a01664.png" border="0" alt="" usemap="#a01664"/>
<map name="a01664" id="a01664">
<area shape="rect" id="node2" href="a01648.html" title="Sorting" alt="" coords="5,5,67,30"/></map>
</td></tr></table></center>
</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ga33b76a74543508747285e182dce4e7ba"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:ga33b76a74543508747285e182dce4e7ba"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga33b76a74543508747285e182dce4e7ba">std::is_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:ga33b76a74543508747285e182dce4e7ba"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga37f2af54af0ffe3b364736c8bd84314e"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:ga37f2af54af0ffe3b364736c8bd84314e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga37f2af54af0ffe3b364736c8bd84314e">std::is_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:ga37f2af54af0ffe3b364736c8bd84314e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:gad3cf2f5b736b585f20dfd29ba24293e1"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:gad3cf2f5b736b585f20dfd29ba24293e1"><td class="memTemplItemLeft" align="right" valign="top">_RandomAccessIterator </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#gad3cf2f5b736b585f20dfd29ba24293e1">std::is_heap_until</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:gad3cf2f5b736b585f20dfd29ba24293e1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:gac559e3fbb78b63111a38545f7f530f23"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:gac559e3fbb78b63111a38545f7f530f23"><td class="memTemplItemLeft" align="right" valign="top">_RandomAccessIterator </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#gac559e3fbb78b63111a38545f7f530f23">std::is_heap_until</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:gac559e3fbb78b63111a38545f7f530f23"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga3de7da79c8fb3f306ce06ed566235b28"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:ga3de7da79c8fb3f306ce06ed566235b28"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga3de7da79c8fb3f306ce06ed566235b28">std::make_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:ga3de7da79c8fb3f306ce06ed566235b28"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga84545d446162758eb0dc4a9ea5fa5cbc"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:ga84545d446162758eb0dc4a9ea5fa5cbc"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:ga84545d446162758eb0dc4a9ea5fa5cbc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga92aecc13151c6b58598e3dd9e54064b7"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:ga92aecc13151c6b58598e3dd9e54064b7"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga92aecc13151c6b58598e3dd9e54064b7">std::pop_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:ga92aecc13151c6b58598e3dd9e54064b7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga27b771598145e151f01281b5cb0fdbbb"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:ga27b771598145e151f01281b5cb0fdbbb"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga27b771598145e151f01281b5cb0fdbbb">std::pop_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:ga27b771598145e151f01281b5cb0fdbbb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:gad2a3e8fb6069d9cd1b14c186ec125102"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:gad2a3e8fb6069d9cd1b14c186ec125102"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#gad2a3e8fb6069d9cd1b14c186ec125102">std::push_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:gad2a3e8fb6069d9cd1b14c186ec125102"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:gac0d64c0744947b3d233779d9e9f656cc"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:gac0d64c0744947b3d233779d9e9f656cc"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#gac0d64c0744947b3d233779d9e9f656cc">std::push_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:gac0d64c0744947b3d233779d9e9f656cc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga7e302d6652402edae355b8726b2b7e27"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator > </td></tr>
<tr class="memitem:ga7e302d6652402edae355b8726b2b7e27"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga7e302d6652402edae355b8726b2b7e27">std::sort_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last)</td></tr>
<tr class="separator:ga7e302d6652402edae355b8726b2b7e27"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga441060fda917c1aed4e8fab9c860f706"><td class="memTemplParams" colspan="2">template<typename _RandomAccessIterator , typename _Compare > </td></tr>
<tr class="memitem:ga441060fda917c1aed4e8fab9c860f706"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a01664.html#ga441060fda917c1aed4e8fab9c860f706">std::sort_heap</a> (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</td></tr>
<tr class="separator:ga441060fda917c1aed4e8fab9c860f706"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<h2 class="groupheader">Function Documentation</h2>
<a class="anchor" id="ga33b76a74543508747285e182dce4e7ba"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool std::is_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</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>Determines whether a range is a heap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of range. </td></tr>
<tr><td class="paramname">__last</td><td>End of range. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>True if range is a heap, false otherwise. </dd></dl>
<p>Definition at line <a class="el" href="a01496_source.html#l00566">566</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>References <a class="el" href="a01496_source.html#l00544">std::is_heap_until()</a>.</p>
</div>
</div>
<a class="anchor" id="ga37f2af54af0ffe3b364736c8bd84314e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool std::is_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</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>Determines whether a range is a heap using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of range. </td></tr>
<tr><td class="paramname">__last</td><td>End of range. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor to use. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>True if range is a heap, false otherwise. </dd></dl>
<p>Definition at line <a class="el" href="a01496_source.html#l00579">579</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>References <a class="el" href="a01496_source.html#l00544">std::is_heap_until()</a>.</p>
</div>
</div>
<a class="anchor" id="gad3cf2f5b736b585f20dfd29ba24293e1"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">_RandomAccessIterator std::is_heap_until </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</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>Search the end of a heap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of range. </td></tr>
<tr><td class="paramname">__last</td><td>End of range. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the first element not in the heap.</dd></dl>
<p>This operation returns the last iterator i in [__first, __last) for which the range [__first, i) is a heap. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00518">518</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>References <a class="el" href="a01498_source.html#l00114">std::distance()</a>.</p>
</div>
</div>
<a class="anchor" id="gac559e3fbb78b63111a38545f7f530f23"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">_RandomAccessIterator std::is_heap_until </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</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>Search the end of a heap using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of range. </td></tr>
<tr><td class="paramname">__last</td><td>End of range. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor to use. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the first element not in the heap.</dd></dl>
<p>This operation returns the last iterator i in [__first, __last) for which the range [__first, i) is a heap. Comparisons are made using __comp. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00544">544</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>References <a class="el" href="a01498_source.html#l00114">std::distance()</a>.</p>
<p>Referenced by <a class="el" href="a01496_source.html#l00566">std::is_heap()</a>.</p>
</div>
</div>
<a class="anchor" id="ga3de7da79c8fb3f306ce06ed566235b28"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="memname">
<tr>
<td class="memname">void std::make_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Construct a heap over a range. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap.</td></tr>
</table>
</dd>
</dl>
<p>This operation makes the elements in [__first,__last) into a heap. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00381">381</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
</div>
</div>
<a class="anchor" id="ga84545d446162758eb0dc4a9ea5fa5cbc"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="memname">
<tr>
<td class="memname">void std::make_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Construct a heap over a range using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor to use.</td></tr>
</table>
</dd>
</dl>
<p>This operation makes the elements in [__first,__last) into a heap. Comparisons are made using __comp. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00421">421</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>Referenced by <a class="el" href="a01490_source.html#l01961">std::__heap_select()</a>, <a class="el" href="a01490_source.html#l02006">std::partial_sort_copy()</a>, and <a class="el" href="a01506_source.html#l00396">std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue()</a>.</p>
</div>
</div>
<a class="anchor" id="ga92aecc13151c6b58598e3dd9e54064b7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void std::pop_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</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>Pop an element off a heap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap. </td></tr>
</table>
</dd>
</dl>
<dl class="section pre"><dt>Precondition</dt><dd>[__first, __last) is a valid, non-empty range.</dd></dl>
<p>This operation pops the top of the heap. The elements __first and __last-1 are swapped and [__first,__last-1) is made into a heap. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00282">282</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
</div>
</div>
<a class="anchor" id="ga27b771598145e151f01281b5cb0fdbbb"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void std::pop_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</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>Pop an element off a heap using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor to use.</td></tr>
</table>
</dd>
</dl>
<p>This operation pops the top of the heap. The elements __first and __last-1 are swapped and [__first,__last-1) is made into a heap. Comparisons are made using comp. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00357">357</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>Referenced by <a class="el" href="a01506_source.html#l00525">std::priority_queue< _Tp, _Sequence, _Compare >::pop()</a>.</p>
</div>
</div>
<a class="anchor" id="gad2a3e8fb6069d9cd1b14c186ec125102"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void std::push_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</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>Push an element onto a heap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap + element.</td></tr>
</table>
</dd>
</dl>
<p>This operation pushes the element at last-1 onto the valid heap over the range [__first,__last-1). After completion, [__first,__last) is a valid heap. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00157">157</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
</div>
</div>
<a class="anchor" id="gac0d64c0744947b3d233779d9e9f656cc"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void std::push_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</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>Push an element onto a heap using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap + element. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor.</td></tr>
</table>
</dd>
</dl>
<p>This operation pushes the element at __last-1 onto the valid heap over the range [__first,__last-1). After completion, [__first,__last) is a valid heap. Compare operations are performed using comp. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00207">207</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>Referenced by <a class="el" href="a01506_source.html#l00490">std::priority_queue< _Tp, _Sequence, _Compare >::push()</a>.</p>
</div>
</div>
<a class="anchor" id="ga7e302d6652402edae355b8726b2b7e27"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator > </div>
<table class="memname">
<tr>
<td class="memname">void std::sort_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort a heap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap.</td></tr>
</table>
</dd>
</dl>
<p>This operation sorts the valid heap in the range [__first,__last). </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00460">460</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
</div>
</div>
<a class="anchor" id="ga441060fda917c1aed4e8fab9c860f706"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _RandomAccessIterator , typename _Compare > </div>
<table class="memname">
<tr>
<td class="memname">void std::sort_heap </td>
<td>(</td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_RandomAccessIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Compare </td>
<td class="paramname"><em>__comp</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Sort a heap using comparison functor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Start of heap. </td></tr>
<tr><td class="paramname">__last</td><td>End of heap. </td></tr>
<tr><td class="paramname">__comp</td><td>Comparison functor to use.</td></tr>
</table>
</dd>
</dl>
<p>This operation sorts the valid heap in the range [__first,__last). Comparisons are made using __comp. </p>
<p>Definition at line <a class="el" href="a01496_source.html#l00489">489</a> of file <a class="el" href="a01496_source.html">stl_heap.h</a>.</p>
<p>Referenced by <a class="el" href="a01490_source.html#l05317">std::partial_sort()</a>, and <a class="el" href="a01490_source.html#l02006">std::partial_sort_copy()</a>.</p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.3 </li>
</ul>
</div>
</body>
</html>
