290 lines
30 KiB
HTML
290 lines
30 KiB
HTML
<!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</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 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</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a>‎ | <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>定义于头文件 <code><a href="cpp-header-algorithm.html"><algorithm></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>调用签名</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"><</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"><</span>I<span class="sy1">></span> S,<br /></span>
|
|
<p> <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"><</span><br />
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span><br /></p>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> is_heap<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 起)</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"><</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> std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, Proj<span class="sy1">>></span><br />
|
|
Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span><br /></p>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> is_heap<span class="br0">(</span> R<span class="sy3">&&</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 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>检查范围 <code>[first, last)</code> 中的元素是否为<a href="https://en.wikipedia.org/wiki/Binary_heap" class="extiw" title="enwiki:Binary heap"><i>最大堆</i></a>。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 用给定的二元比较函数 <code>comp</code> 与投影对象 <code>proj</code> 比较元素。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ，但以 <code>r</code> 为范围，如同以 <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> 为 <code>first</code> 并以 <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> 为 <code>last</code> 。</div>
|
|
<p>此页面上描述的仿函数实体是 <i>niebloid</i> ，即：</p>
|
|
<ul>
|
|
<li>调用它们中的任何一者时不可指定显式模板实参。</li>
|
|
<li>它们无一对<a href="cpp-language-adl.html">实参依赖查找</a>可见。</li>
|
|
<li>在<a href="cpp-language-unqualified_lookup.html">通常无限定查找</a>寻找函数调用运算符左侧的名称找到它们之一时，它禁止<a href="cpp-language-adl.html">实参依赖查找</a>。</li>
|
|
</ul>
|
|
<p>实际上，它们能以函数对象，或以某些特殊编译器扩展实现。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>要检验的元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>r</td>
|
|
<td>-</td>
|
|
<td>要检验的元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>pred</td>
|
|
<td>-</td>
|
|
<td>应用到投影后元素的谓词</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj</td>
|
|
<td>-</td>
|
|
<td>应用到元素的投影</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>若范围为<i>最大堆</i>则为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> ，否则为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>与 <code>first</code> 和 <code>last</code> 间的距离成线性。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p><i>最大堆</i>是按照比较器 <code>comp</code> 与投影 <code>proj</code> 排列的元素范围 <code>[f, l)</code> ，拥有下列属性：</p>
|
|
<dl>
|
|
<dd>
|
|
<ul>
|
|
<li>令 <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">==</span> l <span class="sy2">-</span> f</span></span> ，对于所有 <code>0 < i < N</code> ， <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> 和 <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> ，表达式 <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> 求值为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</li>
|
|
<li>能用 <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> 在 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(\log N)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">𝓞(log N)</span> 时间内添加新元素。</li>
|
|
<li>能用 <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> 在 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(\log N)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">𝓞(log N)</span> 时间内移除首元素。</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">可能的实现</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_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</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"><</span>I<span class="sy1">></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"><</span>
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> 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>
|
|
<span class="kw1">return</span> <span class="br0">(</span>last <span class="sy1">==</span> ranges<span class="sy4">::</span><span class="me2">is_heap_until</span><span class="br0">(</span>first, last, 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="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</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"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, Proj<span class="sy1">>></span>
|
|
Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> R<span class="sy3">&&</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_fn is_heap<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">示例</span></h3>
|
|
<div class="t-example">
|
|
<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 <algorithm></span>
|
|
<span class="co2">#include <bit></span>
|
|
<span class="co2">#include <cmath></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">void</span> out<span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</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">></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"><<</span> what<span class="sy4">;</span> <span class="br0">}</span>
|
|
|
|
<span class="kw4">void</span> draw_heap<span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> v<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"><</span><span class="kw4">int</span><span class="sy1">></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="nu0">2</span>, <span class="nu0">6</span>, <span class="nu0">5</span>, <span class="nu0">3</span>, <span class="nu0">5</span>, <span class="nu0">8</span>, <span class="nu0">9</span>, <span class="nu0">7</span>, <span class="nu0">9</span>, <span class="nu0">3</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">8</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
out<span class="br0">(</span><span class="st0">"initially, v:<span class="es1">\n</span>"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> i <span class="sy4">:</span> v<span class="br0">)</span> <a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> i <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
|
out<span class="br0">(</span><span class="st0">'<span class="es1">\n</span>'</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span><span class="sy3">!</span>std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_heap</span><span class="br0">(</span>v<span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
out<span class="br0">(</span><span class="st0">"making heap...<span class="es1">\n</span>"</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="br0">}</span>
|
|
|
|
out<span class="br0">(</span><span class="st0">"after make_heap, v:<span class="es1">\n</span>"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> t<span class="br0">{</span>1U<span class="br0">}</span><span class="sy4">;</span> <span class="kw4">auto</span> i <span class="sy4">:</span> v<span class="br0">)</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"><<</span> i <span class="sy1"><<</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">has_single_bit</span><span class="br0">(</span><span class="sy2">++</span>t<span class="br0">)</span> <span class="sy4">?</span> <span class="st0">" │ "</span> <span class="sy4">:</span> <span class="st0">" "</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
out<span class="br0">(</span><span class="st0">"<span class="es1">\n</span>"</span> <span class="st0">"corresponding binary tree is:<span class="es1">\n</span>"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
draw_heap<span class="br0">(</span>v<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">void</span> draw_heap<span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> v<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">"┌"</span><span class="br0">)</span>, out<span class="br0">(</span><span class="st0">"─"</span>, w<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">"┴"</span><span class="br0">)</span>, out<span class="br0">(</span><span class="st0">"─"</span>, w<span class="br0">)</span>, out<span class="br0">(</span><span class="st0">"┐"</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">' '</span>, w<span class="br0">)</span><span class="sy4">;</span> n<span class="sy2">--</span> <span class="sy1">></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">' '</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">'<span class="es1">\n</span>'</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">&</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">' '</span>, w<span class="br0">)</span><span class="sy4">;</span> n<span class="sy2">--</span> <span class="sy1">></span> <span class="nu0">0</span> <span class="sy3">&&</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">' '</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">'<span class="es1">\n</span>'</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">&</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">&</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"><<</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"><<</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">int</span> m <span class="br0">{</span><span class="kw1">static_cast</span><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></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> v.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> first <span class="br0">{</span>v.<span class="me1">cbegin</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, v.<span class="me1">cend</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<p>输出：</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">
|
|
initially, v:
|
|
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8
|
|
making heap...
|
|
after make_heap, v:
|
|
9 │ 8 9 │ 6 5 8 9 │ 3 5 3 5 3 4 7 2 │ 1 2 3 1
|
|
corresponding binary tree is:
|
|
9
|
|
┌───────┴───────┐
|
|
8 9
|
|
┌───┴───┐ ┌───┴───┐
|
|
6 5 8 9
|
|
┌─┴─┐ ┌─┴─┐ ┌─┴─┐ ┌─┴─┐
|
|
3 5 3 5 3 4 7 2
|
|
┌┴┐ ┌┴┐ ┌┴┐ ┌┴┐ ┌┴┐ ┌┴┐ ┌┴┐ ┌┴┐
|
|
1 2 3 1</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</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_until.html"><span class="t-lines"><span>ranges::is_heap_until</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>寻找能成为最大堆的最大子范围<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>从一个元素范围创建出一个最大堆<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>将一个元素加入到一个最大堆<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>从最大堆中移除最大元素<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>将一个最大堆变成一个按升序排序的元素范围<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.html"><span class="t-lines"><span>is_heap</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>检查给定范围是否为一个最大堆<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|