klarkxy/hustoj
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

上传cppreference

Browse Source
This commit is contained in:
klarkxy
2025-08-01 12:57:54 +08:00
parent e29892f8cd
commit 196e706fe4
5485 changed files with 982007 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

297
web/cppreference-zh/chmhelp/cpp-algorithm-ranges-is_heap_until.html Normal file
View File

@@ -0,0 +1,297 @@
<!DOCTYPE html>
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>std::ranges::is_heap_until</title>
<link rel="stylesheet" href="ext.css" />
<link rel="stylesheet" href="site_modules.css" />
</head>
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_algorithm_ranges_is_heap_until skin-cppreference2 action-view cpp-navbar">
<div id="cpp-content-base">
<div id="content"><a id="top"></a>
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::ranges::</span>is_heap_until</h1>
<div id="bodyContent">
<div id="contentSub"><span class="subpages">&lt; <a href="cpp.html">cpp</a>&lrm; | <a href="cpp-algorithm.html">algorithm</a>&lrm; | <a href="cpp-algorithm-ranges.html">ranges</a></span></div>
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
<table class="t-dcl-begin">
<tbody>
<tr class="t-dsc-header">
<td>
<div>&#23450;&#20041;&#20110;&#22836;&#25991;&#20214; <code><a href="cpp-header-algorithm.html">&lt;algorithm&gt;</a></code></div>
</td>
<td></td>
<td></td>
</tr>
<tr class="t-dcl-sep">
<td></td>
<td></td>
<td></td>
</tr>
<tr class="t-dcl-h">
<td>
<div>&#35843;&#29992;&#31614;&#21517;</div>
</td>
<td></td>
<td></td>
</tr>
<tr class="t-dcl t-since-cxx20">
<td>
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> std<span class="sy4">::</span><span class="me2">random_access_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> S,<br /></span>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1">&lt;</span><br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1">&lt;</span>I, Proj<span class="sy1">&gt;&gt;</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">&gt;</span><br /></p>
<span class="kw4">constexpr</span> I is_heap_until<span class="br0">(</span> I first, S last, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span><span class="sy4">;</span></div>
</td>
<td>(1)</td>
<td><span class="t-mark-rev t-since-cxx20">(C++20 &#36215;)</span></td>
</tr>
<tr class="t-dcl t-since-cxx20">
<td>
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> ranges<span class="sy4">::</span><span class="me2">random_access_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1">&lt;</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, Proj<span class="sy1">&gt;&gt;</span><br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span><br /></p>
&nbsp; &nbsp; is_heap_until<span class="br0">(</span> R<span class="sy3">&amp;&amp;</span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span><span class="sy4">;</span></div>
</td>
<td>(2)</td>
<td><span class="t-mark-rev t-since-cxx20">(C++20 &#36215;)</span></td>
</tr>
<tr class="t-dcl-sep">
<td></td>
<td></td>
<td></td>
</tr>
</tbody>
</table>
<p>&#26816;&#39564;&#33539;&#22260; <code>[first, last)</code> &#24182;&#23547;&#25214;&#22987;&#20110; <code>first</code> &#19988;&#20026;<a href="https://en.wikipedia.org/wiki/Binary_heap" class="extiw" title="enwiki:Binary heap"><i>&#26368;&#22823;&#22534;</i></a>&#30340;&#26368;&#22823;&#33539;&#22260;&#12290;</p>
<div class="t-li1"><span class="t-li">1)</span> &#29992;&#32473;&#23450;&#30340;&#20108;&#20803;&#27604;&#36739;&#20989;&#25968; <code>comp</code> &#21644;&#25237;&#24433;&#23545;&#35937; <code>proj</code> &#27604;&#36739;&#20803;&#32032;&#12290;</div>
<div class="t-li1"><span class="t-li">2)</span> &#21516; <span class="t-v">(1)</span> &#65292;&#20294;&#20197; <code>r</code> &#20026;&#33539;&#22260;&#65292;&#22914;&#21516;&#20197; <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r<span class="br0">)</span></span></span> &#20026; <code>first</code> &#24182;&#20197; <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r<span class="br0">)</span></span></span> &#20026; <code>last</code> &#12290;</div>
<p>&#27492;&#39029;&#38754;&#19978;&#25551;&#36848;&#30340;&#20223;&#20989;&#25968;&#23454;&#20307;&#26159; <i>niebloid</i> &#65292;&#21363;&#65306;</p>
<ul>
<li>&#35843;&#29992;&#23427;&#20204;&#20013;&#30340;&#20219;&#20309;&#19968;&#32773;&#26102;&#19981;&#21487;&#25351;&#23450;&#26174;&#24335;&#27169;&#26495;&#23454;&#21442;&#12290;</li>
<li>&#23427;&#20204;&#26080;&#19968;&#23545;<a href="cpp-language-adl.html">&#23454;&#21442;&#20381;&#36182;&#26597;&#25214;</a>&#21487;&#35265;&#12290;</li>
<li>&#22312;<a href="cpp-language-unqualified_lookup.html">&#36890;&#24120;&#26080;&#38480;&#23450;&#26597;&#25214;</a>&#23547;&#25214;&#20989;&#25968;&#35843;&#29992;&#36816;&#31639;&#31526;&#24038;&#20391;&#30340;&#21517;&#31216;&#25214;&#21040;&#23427;&#20204;&#20043;&#19968;&#26102;&#65292;&#23427;&#31105;&#27490;<a href="cpp-language-adl.html">&#23454;&#21442;&#20381;&#36182;&#26597;&#25214;</a>&#12290;</li>
</ul>
<p>&#23454;&#38469;&#19978;&#65292;&#23427;&#20204;&#33021;&#20197;&#20989;&#25968;&#23545;&#35937;&#65292;&#25110;&#20197;&#26576;&#20123;&#29305;&#27530;&#32534;&#35793;&#22120;&#25193;&#23637;&#23454;&#29616;&#12290;</p>
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">&#21442;&#25968;</span></h3>
<table class="t-par-begin">
<tr class="t-par">
<td>first, last</td>
<td>-</td>
<td>&#35201;&#26816;&#39564;&#30340;&#20803;&#32032;&#33539;&#22260;</td>
</tr>
<tr class="t-par">
<td>r</td>
<td>-</td>
<td>&#35201;&#26816;&#39564;&#30340;&#20803;&#32032;&#33539;&#22260;</td>
</tr>
<tr class="t-par">
<td>pred</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#25237;&#24433;&#21518;&#20803;&#32032;&#30340;&#35859;&#35789;</td>
</tr>
<tr class="t-par">
<td>proj</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#20803;&#32032;&#30340;&#25237;&#24433;</td>
</tr>
</table>
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">&#36820;&#22238;&#20540;</span></h3>
<p>&#22987;&#20110; <code>first</code> &#24182;&#20026;<i>&#26368;&#22823;&#22534;</i>&#30340;&#26368;&#22823;&#33539;&#22260;&#30340;&#19978;&#30028;&#12290;&#21363;&#23614;&#36845;&#20195;&#22120; <code>it</code> &#65292;&#20351;&#24471;&#33539;&#22260; <code>[first, it)</code> &#30456;&#23545;&#20110; <code>comp</code> &#19982; <code>proj</code> &#20026;<i>&#26368;&#22823;&#22534;</i>&#12290;</p>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">&#22797;&#26434;&#24230;</span></h3>
<p>&#19982; <code>first</code> &#21644; <code>last</code> &#38388;&#30340;&#36317;&#31163;&#25104;&#32447;&#24615;&#12290;</p>
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">&#27880;&#35299;</span></h3>
<p><i>&#26368;&#22823;&#22534;</i>&#26159;&#25353;&#29031;&#27604;&#36739;&#22120; <code>comp</code> &#19982;&#25237;&#24433; <code>proj</code> &#25490;&#21015;&#30340;&#20803;&#32032;&#33539;&#22260; <code>[f, l)</code> &#65292;&#25317;&#26377;&#19979;&#21015;&#23646;&#24615;&#65306;</p>
<dl>
<dd>
<ul>
<li>&#20196; <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">==</span> l <span class="sy2">-</span> f</span></span> &#65292;&#23545;&#20110;&#25152;&#26377; <code>0 &lt; i &lt; N</code> &#65292; <span class="t-c"><span class="mw-geshi cpp source-cpp">p <span class="sy1">==</span> f<span class="br0">[</span><span class="br0">(</span>i <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">)</span> <span class="sy2">/</span> <span class="nu0">2</span><span class="br0">]</span></span></span> &#21644; <span class="t-c"><span class="mw-geshi cpp source-cpp">q <span class="sy1">==</span> f<span class="br0">[</span>i<span class="br0">]</span></span></span> &#65292;&#34920;&#36798;&#24335; <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>comp, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, p<span class="br0">)</span>, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, q<span class="br0">)</span><span class="br0">)</span></span></span> &#27714;&#20540;&#20026; <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> &#12290;</li>
<li>&#33021;&#29992; <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">push_heap</span><span class="br0">(</span><span class="br0">)</span></span></span> &#22312; <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(\log N)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">&#120030;(log N)</span> &#26102;&#38388;&#20869;&#28155;&#21152;&#26032;&#20803;&#32032;&#12290;</li>
<li>&#33021;&#29992; <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">pop_heap</span><span class="br0">(</span><span class="br0">)</span></span></span> &#22312; <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(\log N)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">&#120030;(log N)</span> &#26102;&#38388;&#20869;&#31227;&#38500;&#39318;&#20803;&#32032;&#12290;</li>
</ul>
</dd>
</dl>
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">&#21487;&#33021;&#30340;&#23454;&#29616;</span></h3>
<table class="eq-fun-cpp-table">
<tr>
<td>
<div dir="ltr" class="mw-geshi" style="text-align: left;">
<div class="cpp source-cpp">
<pre class="de1"><span class="kw1">struct</span> is_heap_until_fn <span class="br0">{</span>
<span class="kw1">template</span><span class="sy1">&lt;</span> std<span class="sy4">::</span><span class="me2">random_access_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> S,
<span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1">&lt;</span>
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1">&lt;</span>I, Proj<span class="sy1">&gt;&gt;</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> I
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> I first, S last, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> n <span class="br0">{</span>ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span><span class="br0">}</span>, dad <span class="br0">{</span><span class="nu0">0</span><span class="br0">}</span>, son <span class="br0">{</span><span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> son <span class="sy3">!</span><span class="sy1">=</span> n<span class="sy4">;</span> <span class="sy2">++</span>son<span class="br0">)</span> <span class="br0">{</span>
<span class="kw1">if</span> <span class="br0">(</span><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>comp, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, <span class="sy2">*</span><span class="br0">(</span>first <span class="sy2">+</span> dad<span class="br0">)</span><span class="br0">)</span>,
<a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, <span class="sy2">*</span><span class="br0">(</span>first <span class="sy2">+</span> son<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
<span class="kw1">return</span> first <span class="sy2">+</span> son<span class="sy4">;</span>
<span class="br0">}</span> <span class="kw1">else</span> <span class="kw1">if</span> <span class="br0">(</span><span class="br0">(</span>son <span class="sy2">%</span> <span class="nu0">2</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
<span class="sy2">++</span>dad<span class="sy4">;</span>
<span class="br0">}</span>
<span class="br0">}</span>
<span class="kw1">return</span> first <span class="sy2">+</span> n<span class="sy4">;</span>
<span class="br0">}</span>
<span class="kw1">template</span><span class="sy1">&lt;</span> ranges<span class="sy4">::</span><span class="me2">random_access_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1">&lt;</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, Proj<span class="sy1">&gt;&gt;</span>
Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> R<span class="sy3">&amp;&amp;</span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
<span class="kw1">return</span> <span class="br0">(</span><span class="sy2">*</span>this<span class="br0">)</span><span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>comp<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span>
<span class="br0">}</span><span class="sy4">;</span>
<span class="kw1">inline</span> <span class="kw4">constexpr</span> is_heap_until_fn is_heap_until<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span></pre></div>
</div>
</td>
</tr>
</table>
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">&#31034;&#20363;</span></h3>
<div class="t-example">
<p>&#27492;&#31034;&#20363;&#23558;&#32473;&#23450;&#30340; vector &#37325;&#32622;&#20026;&#65288;&#24179;&#34913;&#65289;<a href="https://en.wikipedia.org/wiki/Binary_tree" class="extiw" title="enwiki:Binary tree">&#20108;&#21449;&#26641;</a>&#12290;</p>
<div class="t-example-live-link"></div>
<div dir="ltr" class="mw-geshi" style="text-align: left;">
<div class="cpp source-cpp">
<pre class="de1"><span class="co2">#include &lt;algorithm&gt;</span>
<span class="co2">#include &lt;cmath&gt;</span>
<span class="co2">#include &lt;iostream&gt;</span>
<span class="co2">#include &lt;iterator&gt;</span>
<span class="co2">#include &lt;vector&gt;</span>
<span class="kw4">void</span> out<span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&amp;</span> what, <span class="kw4">int</span> n <span class="sy1">=</span> <span class="nu0">1</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw1">while</span> <span class="br0">(</span>n<span class="sy2">--</span> <span class="sy1">&gt;</span> <span class="nu0">0</span><span class="br0">)</span> <a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> what<span class="sy4">;</span> <span class="br0">}</span>
<span class="kw4">void</span> draw_bin_tree<span class="br0">(</span><span class="kw4">auto</span> first, <span class="kw4">auto</span> last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span> v <span class="br0">{</span> <span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">5</span>, <span class="nu0">9</span>, <span class="br0">}</span><span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">make_heap</span><span class="br0">(</span>v<span class="br0">)</span><span class="sy4">;</span>
<span class="co1">// probably mess up the heap</span>
v.<span class="me1">push_back</span><span class="br0">(</span><span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
v.<span class="me1">push_back</span><span class="br0">(</span><span class="nu0">6</span><span class="br0">)</span><span class="sy4">;</span>
out<span class="br0">(</span><span class="st0">&quot;v after make_heap and push_back: <span class="es1">\n</span>&quot;</span><span class="br0">)</span><span class="sy4">;</span>
draw_bin_tree<span class="br0">(</span>v.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
out<span class="br0">(</span><span class="st0">&quot;the max-heap prefix of v: <span class="es1">\n</span>&quot;</span><span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">const</span> <span class="kw4">auto</span> heap_end <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_heap_until</span><span class="br0">(</span>v<span class="br0">)</span><span class="sy4">;</span>
draw_bin_tree<span class="br0">(</span>v.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, heap_end<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span>
<span class="kw4">void</span> draw_bin_tree<span class="br0">(</span><span class="kw4">auto</span> first, <span class="kw4">auto</span> last<span class="br0">)</span>
<span class="br0">{</span>
<span class="kw4">auto</span> bails <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> n, <span class="kw4">int</span> w<span class="br0">)</span> <span class="br0">{</span>
<span class="kw4">auto</span> b <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> w<span class="br0">)</span> <span class="br0">{</span> out<span class="br0">(</span><span class="st0">&quot;&#9484;&quot;</span><span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&quot;&#9472;&quot;</span>, w<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&quot;&#9524;&quot;</span><span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&quot;&#9472;&quot;</span>, w<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&quot;&#9488;&quot;</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
n <span class="sy2">/</span><span class="sy1">=</span> <span class="nu0">2</span><span class="sy4">;</span>
<span class="kw1">if</span> <span class="br0">(</span><span class="sy3">!</span>n<span class="br0">)</span> <span class="kw1">return</span><span class="sy4">;</span>
<span class="kw1">for</span> <span class="br0">(</span>out<span class="br0">(</span><span class="st0">&#39; &#39;</span>, w<span class="br0">)</span><span class="sy4">;</span> n<span class="sy2">--</span> <span class="sy1">&gt;</span> <span class="nu0">0</span><span class="sy4">;</span> <span class="br0">)</span> b<span class="br0">(</span>w<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&#39; &#39;</span>, w <span class="sy2">+</span> w <span class="sy2">+</span> <span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span>
out<span class="br0">(</span><span class="st0">&#39;<span class="es1">\n</span>&#39;</span><span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">auto</span> data <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> n, <span class="kw4">int</span> w, <span class="kw4">auto</span><span class="sy3">&amp;</span> first, <span class="kw4">auto</span> last<span class="br0">)</span> <span class="br0">{</span>
<span class="kw1">for</span><span class="br0">(</span>out<span class="br0">(</span><span class="st0">&#39; &#39;</span>, w<span class="br0">)</span><span class="sy4">;</span> n<span class="sy2">--</span> <span class="sy1">&gt;</span> <span class="nu0">0</span> <span class="sy3">&amp;&amp;</span> first <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>first<span class="br0">)</span>
out<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">&#39; &#39;</span>, w <span class="sy2">+</span> w <span class="sy2">+</span> <span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span>
out<span class="br0">(</span><span class="st0">&#39;<span class="es1">\n</span>&#39;</span><span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">auto</span> tier <span class="sy1">=</span> <span class="br0">[</span><span class="sy3">&amp;</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> t, <span class="kw4">int</span> m, <span class="kw4">auto</span><span class="sy3">&amp;</span> first, <span class="kw4">auto</span> last<span class="br0">)</span> <span class="br0">{</span>
<span class="kw4">const</span> <span class="kw4">int</span> n <span class="br0">{</span><span class="nu0">1</span> <span class="sy1">&lt;&lt;</span> t<span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">const</span> <span class="kw4">int</span> w <span class="br0">{</span><span class="br0">(</span><span class="nu0">1</span> <span class="sy1">&lt;&lt;</span> <span class="br0">(</span>m <span class="sy2">-</span> t <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">)</span><span class="br0">)</span> <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
bails<span class="br0">(</span>n, w<span class="br0">)</span>, data<span class="br0">(</span>n, w, first, last<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">const</span> <span class="kw4">auto</span> size <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">const</span> <span class="kw4">int</span> m <span class="br0">{</span><span class="kw1">static_cast</span><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span><span class="br0">(</span><a href="cpp-numeric-math-ceil.html"><span class="kw1350">std::<span class="me2">ceil</span></span></a><span class="br0">(</span>std<span class="sy4">::</span><span class="me2">log2</span><span class="br0">(</span><span class="nu0">1</span> <span class="sy2">+</span> size<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> i<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> m<span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <span class="br0">{</span> tier<span class="br0">(</span>i, m, first, last<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span>
<span class="br0">}</span></pre></div>
</div>
<p>&#36755;&#20986;&#65306;</p>
<div dir="ltr" class="mw-geshi" style="text-align: left;">
<div class="text source-text">
<pre class="de1">
v after make_heap and push_back:
9
&#9484;&#9472;&#9472;&#9472;&#9524;&#9472;&#9472;&#9472;&#9488;
5 4
&#9484;&#9472;&#9524;&#9472;&#9488; &#9484;&#9472;&#9524;&#9472;&#9488;
1 1 3 2
&#9484;&#9524;&#9488; &#9484;&#9524;&#9488; &#9484;&#9524;&#9488; &#9484;&#9524;&#9488;
6
the max-heap prefix of v:
9
&#9484;&#9472;&#9524;&#9472;&#9488;
5 4
&#9484;&#9524;&#9488; &#9484;&#9524;&#9488;
1 1 3 2</pre></div>
</div>
</div>
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">&#21442;&#38405;</span></h3>
<table class="t-dsc-begin">
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-ranges-is_heap.html"><span class="t-lines"><span>ranges::is_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
</div>
</td>
<td>&#26816;&#26597;&#32473;&#23450;&#33539;&#22260;&#26159;&#21542;&#20026;&#26368;&#22823;&#22534;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-ranges-make_heap.html"><span class="t-lines"><span>ranges::make_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
</div>
</td>
<td>&#20174;&#19968;&#20010;&#20803;&#32032;&#33539;&#22260;&#21019;&#24314;&#20986;&#19968;&#20010;&#26368;&#22823;&#22534;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-ranges-push_heap.html"><span class="t-lines"><span>ranges::push_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
</div>
</td>
<td>&#23558;&#19968;&#20010;&#20803;&#32032;&#21152;&#20837;&#21040;&#19968;&#20010;&#26368;&#22823;&#22534;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-ranges-pop_heap.html"><span class="t-lines"><span>ranges::pop_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
</div>
</td>
<td>&#20174;&#26368;&#22823;&#22534;&#20013;&#31227;&#38500;&#26368;&#22823;&#20803;&#32032;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-ranges-sort_heap.html"><span class="t-lines"><span>ranges::sort_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
</div>
</td>
<td>&#23558;&#19968;&#20010;&#26368;&#22823;&#22534;&#21464;&#25104;&#19968;&#20010;&#25353;&#21319;&#24207;&#25490;&#24207;&#30340;&#20803;&#32032;&#33539;&#22260;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
<tr class="t-dsc">
<td>
<div class="t-dsc-member-div">
<div><a href="cpp-algorithm-is_heap_until.html"><span class="t-lines"><span>is_heap_until</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>&#26597;&#25214;&#33021;&#25104;&#20026;&#26368;&#22823;&#22534;&#30340;&#26368;&#22823;&#23376;&#33539;&#22260;<br />
<span class="t-mark">(&#20989;&#25968;&#27169;&#26495;)</span></td>
</tr>
</table>
</div>
<div class="visualClear"></div>
</div>
</div>
</div>
</body>
</html>