afb81b8278
Some checks failed
Docker. / Ubuntu (push) Has been cancelled
User-agent updater. / User-agent (push) Failing after 15s
Lock Threads / lock (push) Failing after 10s
Waiting for answer. / waiting-for-answer (push) Failing after 22s
Close stale issues and PRs / stale (push) Successful in 13s
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
185 lines
15 KiB
HTML
185 lines
15 KiB
HTML
<!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=11"/>
|
|
<meta name="generator" content="Doxygen 1.9.4"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Range-v3: range/v3/algorithm/heap_algorithm.hpp File 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>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function() { init_search(); });
|
|
/* @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 id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">Range-v3
|
|
</div>
|
|
<div id="projectbrief">Range algorithms, views, and actions for the Standard Library</div>
|
|
</td>
|
|
<td> <div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.svg"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.svg" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.4 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
</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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('heap__algorithm_8hpp.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">heap_algorithm.hpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:ga39dc9674ed3d76fbc50cbb58ba76d541"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && indirect_strict_weak_order<C, projected<I, P>></td></tr>
|
|
<tr class="memitem:ga39dc9674ed3d76fbc50cbb58ba76d541"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_heap</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga39dc9674ed3d76fbc50cbb58ba76d541"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>is_heap</code> <br /></td></tr>
|
|
<tr class="separator:ga39dc9674ed3d76fbc50cbb58ba76d541"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gaed62ad5a0632efde05c041f1d2e3f6e0"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng> && indirect_strict_weak_order<C, projected<iterator_t<Rng>, P>></td></tr>
|
|
<tr class="memitem:gaed62ad5a0632efde05c041f1d2e3f6e0"><td class="memTemplItemLeft" align="right" valign="top">constexpr bool </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_heap</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gaed62ad5a0632efde05c041f1d2e3f6e0"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:gaed62ad5a0632efde05c041f1d2e3f6e0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gaafbe72aba341a32cb58292ad3a2f7cec"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && indirect_strict_weak_order<C, projected<I, P>></td></tr>
|
|
<tr class="memitem:gaafbe72aba341a32cb58292ad3a2f7cec"><td class="memTemplItemLeft" align="right" valign="top">constexpr I </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_heap_until</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gaafbe72aba341a32cb58292ad3a2f7cec"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>is_heap_until</code> <br /></td></tr>
|
|
<tr class="separator:gaafbe72aba341a32cb58292ad3a2f7cec"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gafaf6a4e446fa5e5332005cf2e561f763"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng> && indirect_strict_weak_order<C, projected<iterator_t<Rng>, P>></td></tr>
|
|
<tr class="memitem:gafaf6a4e446fa5e5332005cf2e561f763"><td class="memTemplItemLeft" align="right" valign="top">constexpr borrowed_iterator_t< Rng > </td><td class="memTemplItemRight" valign="bottom"><b>ranges::is_heap_until</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gafaf6a4e446fa5e5332005cf2e561f763"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:gafaf6a4e446fa5e5332005cf2e561f763"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga8f49437821b5b6e106a64b7638fcafdb"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:ga8f49437821b5b6e106a64b7638fcafdb"><td class="memTemplItemLeft" align="right" valign="top">constexpr I </td><td class="memTemplItemRight" valign="bottom"><b>ranges::make_heap</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga8f49437821b5b6e106a64b7638fcafdb"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>make_heap</code> <br /></td></tr>
|
|
<tr class="separator:ga8f49437821b5b6e106a64b7638fcafdb"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga17774d46bb4d7027d07661e11b048c17"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:ga17774d46bb4d7027d07661e11b048c17"><td class="memTemplItemLeft" align="right" valign="top">constexpr borrowed_iterator_t< Rng > </td><td class="memTemplItemRight" valign="bottom"><b>ranges::make_heap</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga17774d46bb4d7027d07661e11b048c17"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:ga17774d46bb4d7027d07661e11b048c17"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga6df061690b9d700ef786b21c868f296b"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:ga6df061690b9d700ef786b21c868f296b"><td class="memTemplItemLeft" align="right" valign="top">constexpr I </td><td class="memTemplItemRight" valign="bottom"><b>ranges::pop_heap</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga6df061690b9d700ef786b21c868f296b"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>pop_heap</code> <br /></td></tr>
|
|
<tr class="separator:ga6df061690b9d700ef786b21c868f296b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga922bae7ae5634bfec4d697cd687b69a5"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:ga922bae7ae5634bfec4d697cd687b69a5"><td class="memTemplItemLeft" align="right" valign="top">constexpr borrowed_iterator_t< Rng > </td><td class="memTemplItemRight" valign="bottom"><b>ranges::pop_heap</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:ga922bae7ae5634bfec4d697cd687b69a5"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:ga922bae7ae5634bfec4d697cd687b69a5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gadd457f1c18e3a03bd3ce1cfa91e7d0cd"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:gadd457f1c18e3a03bd3ce1cfa91e7d0cd"><td class="memTemplItemLeft" align="right" valign="top">constexpr I </td><td class="memTemplItemRight" valign="bottom"><b>ranges::push_heap</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gadd457f1c18e3a03bd3ce1cfa91e7d0cd"><td class="mdescLeft"> </td><td class="mdescRight">function template <code>push_heap</code> <br /></td></tr>
|
|
<tr class="separator:gadd457f1c18e3a03bd3ce1cfa91e7d0cd"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:gaca4dfd060fba8e9da7015f85929e8030"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:gaca4dfd060fba8e9da7015f85929e8030"><td class="memTemplItemLeft" align="right" valign="top">constexpr borrowed_iterator_t< Rng > </td><td class="memTemplItemRight" valign="bottom"><b>ranges::push_heap</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="memdesc:gaca4dfd060fba8e9da7015f85929e8030"><td class="mdescLeft"> </td><td class="mdescRight">This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. <br /></td></tr>
|
|
<tr class="separator:gaca4dfd060fba8e9da7015f85929e8030"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga4d3c1e2a57291d4e961da35041efe21d"><td class="memTemplParams" colspan="2">
|
|
template<typename I , typename S , typename C = less, typename P = identity> <br />
|
|
requires random_access_iterator<I> && sentinel_for<S, I> && sortable<I, C, P></td></tr>
|
|
<tr class="memitem:ga4d3c1e2a57291d4e961da35041efe21d"><td class="memTemplItemLeft" align="right" valign="top">constexpr I </td><td class="memTemplItemRight" valign="bottom"><b>ranges::sort_heap</b> (I first, S last, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="separator:ga4d3c1e2a57291d4e961da35041efe21d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ga03d56ac44b428cfeed32a65de1c1edd9"><td class="memTemplParams" colspan="2">
|
|
template<typename Rng , typename C = less, typename P = identity> <br />
|
|
requires random_access_range<Rng &> && sortable<iterator_t<Rng>, C, P></td></tr>
|
|
<tr class="memitem:ga03d56ac44b428cfeed32a65de1c1edd9"><td class="memTemplItemLeft" align="right" valign="top">constexpr borrowed_iterator_t< Rng > </td><td class="memTemplItemRight" valign="bottom"><b>ranges::sort_heap</b> (Rng &&rng, C pred=C{}, P proj=P{})</td></tr>
|
|
<tr class="separator:ga03d56ac44b428cfeed32a65de1c1edd9"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
</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="dir_f242af8a7c2c0148e408c78222f177e1.html">range</a></li><li class="navelem"><a class="el" href="dir_b72dce760dba076c3008801bbd43e21d.html">v3</a></li><li class="navelem"><a class="el" href="dir_3bcb3f19c2c8a89df408efd863ca1956.html">algorithm</a></li><li class="navelem"><a class="el" href="heap__algorithm_8hpp.html">heap_algorithm.hpp</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.4 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|