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

313
web/cppreference-zh/chmhelp/cpp-algorithm-ranges-inplace_merge.html Normal file
View File

@@ -0,0 +1,313 @@
<!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::inplace_merge</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_inplace_merge 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>inplace_merge</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">bidirectional_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> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">&gt;</span><br />
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1">&lt;</span>I, Comp, Proj<span class="sy1">&gt;</span><br /></p>
I inplace_merge<span class="br0">(</span> I first, I middle, 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">bidirectional_range</span> R, <span class="kw1">class</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>,<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> <span class="sy1">&gt;</span><br />
requires std<span class="sy4">::</span><span class="me2">sortable</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>, Comp, Proj<span class="sy1">&gt;</span><br />
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>
inplace_merge<span class="br0">(</span> R<span class="sy3">&amp;&amp;</span> r, ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span> middle, 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>&#24402;&#24182;&#20108;&#20010;<i>&#24050;&#25490;&#24207;</i>&#33539;&#22260; <code>[first, middle)</code> &#19982; <code>[middle, last)</code> &#21040;&#19968;&#20010;<i>&#24050;&#25490;&#24207;</i>&#33539;&#22260; <code>[first, last)</code> &#20013;&#12290;</p>
<p>&#31216;&#24207;&#21015;&#20026;&#25353;&#29031;&#27604;&#36739;&#22120; <code>comp</code> &#19982;&#25237;&#24433; <code>proj</code> <i>&#24050;&#25490;&#24207;</i>&#65292;&#33509;&#23545;&#24212;&#20219;&#20309;&#25351;&#21521;&#24207;&#21015;&#30340;&#36845;&#20195;&#22120; <code>it</code> &#19982;&#20219;&#20309;&#20351;&#24471; <code>it + n</code> &#20026;&#25351;&#21521;&#24207;&#21015;&#20803;&#32032;&#30340;&#21512;&#27861;&#36845;&#20195;&#22120;&#30340;&#38750;&#36127;&#25972;&#25968; <code>n</code> &#65292; <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, <span class="sy2">*</span><span class="br0">(</span>it <span class="sy2">+</span> n<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>it<span class="br0">)</span><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;</p>
<p>&#27492;&#24402;&#24182;&#20989;&#25968;&#26159;<i>&#31283;&#23450;</i>&#30340;&#65292;&#36825;&#34920;&#31034;&#23545;&#20110;&#21407;&#22312;&#20108;&#20010;&#33539;&#22260;&#20013;&#30340;&#31561;&#20215;&#20803;&#32032;&#65292;&#26469;&#33258;&#31532;&#19968;&#33539;&#22260;&#30340;&#20803;&#32032;&#65288;&#20445;&#25345;&#20854;&#21407;&#39034;&#24207;&#65289;&#20808;&#20110;&#26469;&#33258;&#31532;&#20108;&#33539;&#22260;&#30340;&#20803;&#32032;&#65288;&#20445;&#25345;&#20854;&#21407;&#39034;&#24207;&#65289;&#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> &#19982;&#25237;&#24433;&#23545;&#35937; <code>proj</code> &#27604;&#36739;&#20803;&#32032;&#65292;&#32780;&#33539;&#22260;&#24517;&#39035;&#25353;&#21516;&#26679;&#26041;&#24335;&#25490;&#24207;&#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</td>
<td>-</td>
<td>&#31532;&#19968;&#24050;&#25490;&#24207;&#33539;&#22260;&#30340;&#36215;&#22987;</td>
</tr>
<tr class="t-par">
<td>middle</td>
<td>-</td>
<td>&#31532;&#19968;&#33539;&#22260;&#30340;&#26411;&#23614;&#19982;&#31532;&#20108;&#33539;&#22260;&#30340;&#36215;&#22987;</td>
</tr>
<tr class="t-par">
<td>last</td>
<td>-</td>
<td>&#31532;&#20108;&#24050;&#25490;&#24207;&#33539;&#22260;&#30340;&#26411;&#23614;</td>
</tr>
<tr class="t-par">
<td>r</td>
<td>-</td>
<td>&#35201;&#21407;&#20301;&#24402;&#24182;&#30340;&#20803;&#32032;&#33539;&#22260;</td>
</tr>
<tr class="t-par">
<td>comp</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#25237;&#24433;&#21518;&#20803;&#32032;&#30340;&#27604;&#36739;&#22120;</td>
</tr>
<tr class="t-par">
<td>proj</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#33539;&#22260;&#20013;&#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>&#31561;&#20110; <code>last</code> &#30340;&#36845;&#20195;&#22120;&#12290;</p>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">&#22797;&#26434;&#24230;</span></h3>
<p>&#33509;&#39069;&#22806;&#20869;&#23384;&#21487;&#29992;&#21017;&#20934;&#30830;&#27604;&#36739; <span class="t-c"><span class="mw-geshi cpp source-cpp">N&minus;<span class="nu0">1</span></span></span> &#27425;&#65292;&#20854;&#20013; <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span></span></span> &#12290;&#21542;&#21017;&#27604;&#36739; <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(N\cdot\log{(N)})\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">&#120030;(N&bull;log(N))</span> &#27425;&#12290;&#21478;&#22806;&#22312;&#20004;&#31181;&#24773;&#20917;&#19979;&#37117;&#36827;&#34892;&#20108;&#20493;&#27425;&#25968;&#30340;&#25237;&#24433;&#12290;</p>
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">&#27880;&#35299;</span></h3>
<p>&#27492;&#20989;&#25968;&#23581;&#35797;&#20998;&#37197;&#20020;&#26102;&#32531;&#20914;&#21306;&#12290;&#33509;&#20998;&#37197;&#22833;&#36133;&#65292;&#21017;&#36873;&#25321;&#36739;&#20302;&#25928;&#30340;&#31639;&#27861;&#12290;</p>
<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>
<p>&#27492;&#23454;&#29616;&#20165;&#23637;&#31034;&#26080;&#39069;&#22806;&#20869;&#23384;&#21487;&#29992;&#26102;&#20351;&#29992;&#30340;&#36739;&#24930;&#30340;&#31639;&#27861;&#12290;&#21442;&#38405; <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/e745bad3b1d05b5b19ec652d68abb37865ffa454/stl/inc/algorithm#L7131-L7235">MSVC STL</a> &#19982; <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/54258e22b0846aaa6bd3265f592feb161eecda75/libstdc%2B%2B-v3/include/bits/ranges_algo.h#L2573-L2602">libstdc++</a> &#20013;&#30340;&#23454;&#29616;&#12290;</p>
<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> inplace_merge_fn <span class="br0">{</span>
<span class="kw1">template</span><span class="sy1">&lt;</span>std<span class="sy4">::</span><span class="me2">bidirectional_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> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1">&lt;</span>I, Comp, Proj<span class="sy1">&gt;</span>
I operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I first, I middle, 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>
I last_it <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>middle, last<span class="br0">)</span><span class="sy4">;</span>
inplace_merge_slow<span class="br0">(</span>first, middle, last_it,
ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, middle<span class="br0">)</span>,
ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>middle, last_it<span class="br0">)</span><span class="sy4">;</span>
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">return</span> last_it<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">bidirectional_range</span> R, <span class="kw1">class</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>,
<span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">sortable</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>, Comp, Proj<span class="sy1">&gt;</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, ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span> middle,
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>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>middle<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="kw1">private</span><span class="sy4">:</span>
<span class="kw1">template</span><span class="sy1">&lt;</span>std<span class="sy4">::</span><span class="me2">bidirectional_iterator</span> I, <span class="kw1">class</span> Comp, <span class="kw1">class</span> Proj<span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1">&lt;</span>I, Comp, Proj<span class="sy1">&gt;</span>
<span class="kw4">static</span> <span class="kw4">void</span> inplace_merge_slow<span class="br0">(</span>I first, I middle, I last, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> n1,
std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> n2, Comp comp, Proj proj<span class="br0">)</span>
<span class="br0">{</span>
<span class="kw1">if</span> <span class="br0">(</span>n1 <span class="sy1">==</span> <span class="nu0">0</span> <span class="sy3">||</span> n2 <span class="sy1">==</span> <span class="nu0">0</span><span class="br0">)</span>
<span class="kw1">return</span><span class="sy4">;</span>
<span class="kw1">if</span> <span class="br0">(</span>n1 <span class="sy2">+</span> n2 <span class="sy1">==</span> <span class="nu0">2</span><span class="br0">)</span>
<span class="kw1">if</span> <span class="br0">(</span>comp<span class="br0">(</span>proj<span class="br0">(</span><span class="sy2">*</span>middle<span class="br0">)</span>, proj<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
ranges<span class="sy4">::</span><span class="me2">iter_swap</span><span class="br0">(</span>first, middle<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">return</span><span class="sy4">;</span>
<span class="br0">}</span>
I cut1 <span class="sy1">=</span> first<span class="sy4">;</span>
I cut2 <span class="sy1">=</span> middle<span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> d1<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> d2<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw1">if</span> <span class="br0">(</span>n1 <span class="sy1">&gt;</span> n2<span class="br0">)</span> <span class="br0">{</span>
d1 <span class="sy1">=</span> n1 <span class="sy2">/</span> <span class="nu0">2</span><span class="sy4">;</span>
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>cut1, d1<span class="br0">)</span><span class="sy4">;</span>
cut2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">lower_bound</span><span class="br0">(</span>middle, last, <span class="sy2">*</span>cut1,
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
d2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>middle, cut2<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span>
<span class="kw1">else</span> <span class="br0">{</span>
d2 <span class="sy1">=</span> n2 <span class="sy2">/</span> <span class="nu0">2</span><span class="sy4">;</span>
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>cut2, d2<span class="br0">)</span><span class="sy4">;</span>
cut1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">upper_bound</span><span class="br0">(</span>first, middle, <span class="sy2">*</span>cut2,
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
d1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, cut1<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span>
I new_middle <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">rotate</span><span class="br0">(</span>cut1, middle, cut2<span class="br0">)</span><span class="sy4">;</span>
inplace_merge_slow<span class="br0">(</span>first, cut1, new_middle, d1, d2,
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
inplace_merge_slow<span class="br0">(</span>new_middle, cut2, last, n1 <span class="sy2">-</span> d1, n2 <span class="sy2">-</span> d2,
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><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> inplace_merge_fn inplace_merge<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">
<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;complex&gt;</span>
<span class="co2">#include &lt;functional&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> print<span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&amp;</span> v, <span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&amp;</span> rem, <span class="kw4">int</span> middle <span class="sy1">=</span> <span class="sy2">-</span><span class="nu0">1</span><span class="br0">)</span>
<span class="br0">{</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> <span class="kw4">auto</span> n <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">&lt;&lt;</span> <span class="br0">(</span>i<span class="sy2">++</span> <span class="sy1">==</span> middle <span class="sy4">?</span> <span class="st0">&quot;&#9474; &quot;</span> <span class="sy4">:</span> <span class="st0">&quot;&quot;</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> n <span class="sy1">&lt;&lt;</span> <span class="st0">&#39; &#39;</span><span class="sy4">;</span>
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> rem <span class="sy1">&lt;&lt;</span> <span class="st0">&#39;<span class="es1">\n</span>&#39;</span><span class="sy4">;</span>
<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="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span>
<span class="kw4">void</span> merge_sort<span class="br0">(</span>I first, S last<span class="br0">)</span>
<span class="br0">{</span>
<span class="kw1">if</span> <span class="br0">(</span>last <span class="sy2">-</span> first <span class="sy1">&gt;</span> <span class="nu0">1</span><span class="br0">)</span> <span class="br0">{</span>
I middle <span class="br0">{</span>first <span class="sy2">+</span> <span class="br0">(</span>last <span class="sy2">-</span> first<span class="br0">)</span> <span class="sy2">/</span> <span class="nu0">2</span><span class="br0">}</span><span class="sy4">;</span>
merge_sort<span class="br0">(</span>first, middle<span class="br0">)</span><span class="sy4">;</span>
merge_sort<span class="br0">(</span>middle, last<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">inplace_merge</span><span class="br0">(</span>first, middle, last<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span>
<span class="br0">}</span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
<span class="co1">// &#23450;&#21046;&#24402;&#24182;&#25490;&#24207;&#28436;&#31034;</span>
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a> v <span class="br0">{</span><span class="nu0">8</span>, <span class="nu0">2</span>, <span class="nu0">0</span>, <span class="nu0">4</span>, <span class="nu0">9</span>, <span class="nu0">8</span>, <span class="nu0">1</span>, <span class="nu0">7</span>, <span class="nu0">3</span><span class="br0">}</span><span class="sy4">;</span>
print<span class="br0">(</span>v, <span class="st0">&quot;: before sort&quot;</span><span class="br0">)</span><span class="sy4">;</span>
merge_sort<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>
print<span class="br0">(</span>v, <span class="st0">&quot;: after sort<span class="es1">\n</span>&quot;</span><span class="br0">)</span><span class="sy4">;</span>
<span class="co1">// &#20197;&#27604;&#36739;&#20989;&#25968;&#23545;&#35937;&#21644;&#25237;&#24433;&#24402;&#24182;</span>
<span class="kw1">using</span> CI <span class="sy1">=</span> <a href="cpp-numeric-complex.html"><span class="kw1472">std::<span class="me2">complex</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span><span class="sy4">;</span>
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1">&lt;</span>CI<span class="sy1">&gt;</span> r <span class="br0">{</span> <span class="br0">{</span><span class="nu0">0</span>,<span class="nu0">1</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">0</span>,<span class="nu0">2</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">0</span>,<span class="nu0">3</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">1</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">2</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">const</span> <span class="kw4">auto</span> middle <span class="br0">{</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>r.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">3</span><span class="br0">)</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">auto</span> comp <span class="br0">{</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">less</span><span class="br0">{</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">auto</span> proj <span class="br0">{</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span>CI z<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> z.<span class="me1">imag</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
print<span class="br0">(</span>r, <span class="st0">&quot;: before merge&quot;</span>, middle <span class="sy2">-</span> r.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</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">inplace_merge</span><span class="br0">(</span>r, middle, comp, proj<span class="br0">)</span><span class="sy4">;</span>
print<span class="br0">(</span>r, <span class="st0">&quot;: after merge&quot;</span><span class="br0">)</span><span class="sy4">;</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">8 2 0 4 9 8 1 7 3 : before sort
0 1 2 3 4 7 8 8 9 : after sort
(0,1) (0,2) (0,3) &#9474; (1,1) (1,2) : before merge
(0,1) (1,1) (0,2) (1,2) (0,3) : after merge</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-merge.html"><span class="t-lines"><span>ranges::merge</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>&#24402;&#24182;&#20108;&#20010;&#24050;&#25490;&#24207;&#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-ranges-set_union.html"><span class="t-lines"><span>ranges::set_union</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>&#35745;&#31639;&#20004;&#20010;&#38598;&#21512;&#30340;&#24182;&#38598;<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-is_sorted.html"><span class="t-lines"><span>ranges::is_sorted</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;&#33539;&#22260;&#26159;&#21542;&#20197;&#21319;&#24207;&#25490;&#24207;<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.html"><span class="t-lines"><span>ranges::sort</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;&#33539;&#22260;&#25353;&#21319;&#24207;&#25490;&#24207;<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-inplace_merge.html"><span class="t-lines"><span>inplace_merge</span></span></a></div>
</div>
</td>
<td>&#23601;&#22320;&#24402;&#24182;&#20004;&#20010;&#26377;&#24207;&#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>