klarkxy/hustoj
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
917ea78c665d97d48f054acfadfcdc36f7c52326
hustoj/web/cppreference-zh/chmhelp/cpp-algorithm-ranges-reverse_copy.html
klarkxy 196e706fe4 上传cppreference
2025-08-01 12:57:54 +08:00

203 lines
18 KiB
HTML
Raw Blame History

<!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::reverse_copy, std::ranges::reverse_copy_result</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_reverse_copy 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>reverse_copy, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>reverse_copy_result</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; std<span class="sy4">::</span><span class="me2">weakly_incrementable</span> O <span class="sy1">&gt;</span><br />
requires &nbsp;std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1">&lt;</span>I, O<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> reverse_copy_result<span class="sy1">&lt;</span>I, O<span class="sy1">&gt;</span><br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; reverse_copy<span class="br0">(</span> I first, S last, O result <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, std<span class="sy4">::</span><span class="me2">weakly_incrementable</span> O <span class="sy1">&gt;</span><br /></span>
<p>requires &nbsp;std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> reverse_copy_result<span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, O<span class="sy1">&gt;</span><br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; reverse_copy<span class="br0">(</span> R<span class="sy3">&amp;&amp;</span> r, O result <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>
<tr class="t-dcl-h">
<td>
<div>&#36741;&#21161;&#31867;&#22411;</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> <span class="kw1">class</span> I, <span class="kw1">class</span> O <span class="sy1">&gt;</span><br />
&nbsp; <span class="kw1">using</span> reverse_copy_result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">in_out_result</span><span class="sy1">&lt;</span>I, O<span class="sy1">&gt;</span><span class="sy4">;</span></span></div>
</td>
<td>(3)</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>
<div class="t-li1"><span class="t-li">1)</span> &#20174;&#28304;&#33539;&#22260; <code>[first, last)</code> &#22797;&#21046;&#20803;&#32032;&#21040;&#30446;&#26631;&#33539;&#22260; <code>[result, result + N)</code> &#65292;&#20854;&#20013; <code>N</code> &#20026; <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> &#65292;&#26041;&#24335;&#20351;&#24471;&#26032;&#33539;&#22260;&#20013;&#30340;&#20803;&#32032;&#22788;&#20110;&#36870;&#24207;&#12290;&#34920;&#29616;&#22914;&#21516;&#36890;&#36807;&#23545; <code>[0, N)</code> &#20013;&#30340;&#27599;&#20010;&#25972;&#25968; <code>i</code> &#25191;&#34892;&#19968;&#27425;&#36171;&#20540; <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span><span class="br0">(</span>result <span class="sy2">+</span> N <span class="sy2">-</span> <span class="nu0">1</span> <span class="sy2">-</span> i<span class="br0">)</span> <span class="sy1">=</span> <span class="sy2">*</span><span class="br0">(</span>first <span class="sy2">+</span> i<span class="br0">)</span></span></span> &#12290;&#33509;&#28304;&#19982;&#30446;&#26631;&#33539;&#22260;&#37325;&#21472;&#21017;&#34892;&#20026;&#26410;&#23450;&#20041;&#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;&#28304;&#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;&#22797;&#21046;&#30340;&#20803;&#32032;&#33539;&#22260;</td>
</tr>
<tr class="t-par">
<td>r</td>
<td>-</td>
<td>&#35201;&#22797;&#21046;&#30340;&#20803;&#32032;&#33539;&#22260;</td>
</tr>
<tr class="t-par">
<td>result</td>
<td>-</td>
<td>&#30446;&#26631;&#33539;&#22260;&#30340;&#36215;&#22987;</td>
</tr>
</table>
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">&#36820;&#22238;&#20540;</span></h3>
<p><span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>last, result <span class="sy2">+</span> N<span class="br0">}</span></span></span> &#12290;</p>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">&#22797;&#26434;&#24230;</span></h3>
<p>&#20934;&#30830;&#36171;&#20540; <code>N</code> &#27425;&#12290;</p>
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">&#27880;&#35299;</span></h3>
<p>&#23454;&#29616;&#65288;&#20363;&#22914; <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/main/stl/src/vector_algorithms.cpp">MSVC STL</a> &#65289;&#21487;&#33021;&#22312;&#20004;&#20010;&#36845;&#20195;&#22120;&#31867;&#22411;&#22343;&#23454;&#29616; <a href="cpp-iterator-contiguous_iterator.html"><code>contiguous_iterator</code></a> &#24182;&#25317;&#26377;&#21516;&#19968;&#20540;&#31867;&#22411;&#65292;&#19988;&#20540;&#31867;&#22411;&#20026;<a href="cpp-named_req-TriviallyCopyable.html"><span style="font-style:italic">&#21487;&#24179;&#20961;&#22797;&#21046;</span> <span style="font-family: Georgia, &#39;DejaVu Serif&#39;, serif; font-style:italic">(TriviallyCopyable)</span></a> &#26102;&#21551;&#29992;&#21521;&#37327;&#21270;&#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>&#21442;&#38405; <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/472161105d596192194d4715ccad307c6c163b4a/stl/inc/algorithm#L4245-L4323">MSVC STL</a> &#19982; <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/14d8a5ae472ca5743016f37da2dd4770d83dea21/libstdc%2B%2B-v3/include/bits/ranges_algo.h#L1330-L1359">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> reverse_copy_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,
std<span class="sy4">::</span><span class="me2">weakly_incrementable</span> O<span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1">&lt;</span>I, O<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">reverse_copy_result</span><span class="sy1">&lt;</span>I, O<span class="sy1">&gt;</span>
operator<span class="br0">(</span><span class="br0">)</span> <span class="br0">(</span> I first, S last, O result <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
<span class="kw4">auto</span> ret <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first, last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> last <span class="sy3">!</span><span class="sy1">=</span> first<span class="sy4">;</span> <span class="sy2">*</span>result <span class="sy1">=</span> <span class="sy2">*--</span>last, <span class="sy2">++</span>result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>ret<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>result<span class="br0">)</span><span class="br0">}</span><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, std<span class="sy4">::</span><span class="me2">weakly_incrementable</span> O<span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">reverse_copy_result</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, O<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, O result <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>result<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> reverse_copy_fn reverse_copy<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;iostream&gt;</span>
<span class="co2">#include &lt;string&gt;</span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
<a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a> x<span class="br0">{</span><span class="st0">&quot;12345&quot;</span><span class="br0">}</span>, y<span class="br0">(</span>x.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span>, <span class="st0">&#39; &#39;</span><span class="br0">)</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> x <span class="sy1">&lt;&lt;</span> <span class="st0">&quot; &rarr; &quot;</span><span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">reverse_copy</span><span class="br0">(</span>x.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, x.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, y.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</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> y <span class="sy1">&lt;&lt;</span> <span class="st0">&quot; &rarr; &quot;</span><span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">reverse_copy</span><span class="br0">(</span>y, x.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</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> x <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></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">12345 &rarr; 54321 &rarr; 12345</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-reverse.html"><span class="t-lines"><span>ranges::reverse</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>&#36870;&#36716;&#33539;&#22260;&#20013;&#30340;&#20803;&#32032;&#39034;&#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-reverse_copy.html"><span class="t-lines"><span>reverse_copy</span></span></a></div>
</div>
</td>
<td>&#21019;&#24314;&#19968;&#20010;&#33539;&#22260;&#30340;&#36870;&#21521;&#21103;&#26412;<br />
<span class="t-mark">(&#20989;&#25968;&#27169;&#26495;)</span></td>
</tr>
</table>
</div>
<div class="visualClear"></div>
</div>
</div>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink