333 lines
37 KiB
HTML
333 lines
37 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::replace_copy, std::ranges::replace_copy_if, std::ranges::replace_copy_result, std::ranges::replace_copy_if_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_replace_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>replace_copy, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>replace_copy_if, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>replace_copy_result, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>replace_copy_if_result</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">input_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> T1, <span class="kw1">class</span> T2,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T2<span class="sy3">&</span><span class="sy1">></span> O, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1"><</span>I, O<span class="sy1">></span> <span class="sy3">&&</span><br />
|
|
std<span class="sy4">::</span><span class="me2">indirect_binary_predicate</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">equal_to</span>, std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">></span>,<br />
|
|
<span class="kw4">const</span> T1<span class="sy2">*</span><span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> replace_copy_result<span class="sy1"><</span>I, O<span class="sy1">></span><br />
|
|
replace_copy<span class="br0">(</span> I first, S last, O result, <span class="kw4">const</span> T1<span class="sy3">&</span> old_value, <span class="kw4">const</span> T2<span class="sy3">&</span> new_value,<br /></p>
|
|
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">input_range</span> R, <span class="kw1">class</span> T1, <span class="kw1">class</span> T2,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T2<span class="sy3">&</span><span class="sy1">></span> O, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">></span> <span class="sy3">&&</span><br />
|
|
std<span class="sy4">::</span><span class="me2">indirect_binary_predicate</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">equal_to</span>,<br />
|
|
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>, <span class="kw4">const</span> T1<span class="sy2">*</span><span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> replace_copy_result<span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, O<span class="sy1">></span><br />
|
|
replace_copy<span class="br0">(</span> R<span class="sy3">&&</span> r, O result, <span class="kw4">const</span> T1<span class="sy3">&</span> old_value, <span class="kw4">const</span> T2<span class="sy3">&</span> new_value,<br /></p>
|
|
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 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">input_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> T,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> O,<br />
|
|
<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_unary_predicate</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> Pred <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1"><</span>I, O<span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> replace_copy_if_result<span class="sy1"><</span>I, O<span class="sy1">></span><br />
|
|
replace_copy_if<span class="br0">(</span> I first, S last, O result, Pred pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value,<br /></p>
|
|
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>(3)</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">input_range</span> R, <span class="kw1">class</span> T, std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> O,<br /></span>
|
|
<p> <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br />
|
|
std<span class="sy4">::</span><span class="me2">indirect_unary_predicate</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> Pred <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> replace_copy_if_result<span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, O<span class="sy1">></span><br />
|
|
replace_copy_if<span class="br0">(</span> R<span class="sy3">&&</span> r, O result, Pred pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value,<br /></p>
|
|
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>(4)</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>
|
|
<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> <span class="kw1">class</span> I, <span class="kw1">class</span> O <span class="sy1">></span><br />
|
|
<span class="kw1">using</span> replace_copy_result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">in_out_result</span><span class="sy1"><</span>I, O<span class="sy1">></span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(5)</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> <span class="kw1">class</span> I, <span class="kw1">class</span> O <span class="sy1">></span><br />
|
|
<span class="kw1">using</span> replace_copy_if_result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">in_out_result</span><span class="sy1"><</span>I, O<span class="sy1">></span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(6)</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> 复制元素到始于 <code>result</code> 的目标范围，以 <code>new_value</code> 替换所欲满足特定标准的元素。若源范围与目标范围重叠则行为未定义。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 替换所有等于 <code>old_value</code> 的元素，用 <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>proj, <span class="sy2">*</span><span class="br0">(</span>first <span class="sy2">+</span> <span class="br0">(</span>i <span class="sy2">-</span> result<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> old_value</span></span> 比较。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 替换所有谓词 <code>pred</code> 对其求值为 <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"><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>pred, <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> <span class="br0">(</span>i <span class="sy2">-</span> result<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">2,4)</span> 同 <span class="t-v">(1,3)</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>result</td>
|
|
<td>-</td>
|
|
<td>目标范围的起始</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>old_value</td>
|
|
<td>-</td>
|
|
<td>要替换的元素的值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>new_value</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><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> ，其中</p>
|
|
<div class="t-li1"><span class="t-li">1,3)</span> <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> ；</div>
|
|
<div class="t-li1"><span class="t-li">2,4)</span> <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>r<span class="br0">)</span></span></span> 。</div>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>准确应用 <span class="t-c"><span class="mw-geshi cpp source-cpp">N</span></span> 次对应的谓词 <code>comp</code> 与投影 <code>proj</code> 。</p>
|
|
<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>
|
|
<th>版本一</th>
|
|
</tr>
|
|
<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> replace_copy_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span> <span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_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> T1, <span class="kw1">class</span> T2,
|
|
std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T2<span class="sy3">&</span><span class="sy1">></span> O, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1"><</span>I, O<span class="sy1">></span> <span class="sy3">&&</span>
|
|
std<span class="sy4">::</span><span class="me2">indirect_binary_predicate</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">equal_to</span>, std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">></span>,
|
|
<span class="kw4">const</span> T1<span class="sy2">*</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">replace_copy_result</span><span class="sy1"><</span>I, O<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> I first, S last, O result, <span class="kw4">const</span> T1<span class="sy3">&</span> old_value, <span class="kw4">const</span> T2<span class="sy3">&</span> new_value,
|
|
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">for</span> <span class="br0">(</span><span class="sy4">;</span> first <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>first, <span class="sy2">++</span>result<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>result <span class="sy1">=</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>first<span class="br0">)</span> <span class="sy1">==</span> old_value<span class="br0">)</span> <span class="sy4">?</span> new_value <span class="sy4">:</span> <span class="sy2">*</span>first<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first<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"><</span>ranges<span class="sy4">::</span><span class="me2">input_range</span> R, <span class="kw1">class</span> T1, <span class="kw1">class</span> T2,
|
|
std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T2<span class="sy3">&</span><span class="sy1">></span> O, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">></span> <span class="sy3">&&</span>
|
|
std<span class="sy4">::</span><span class="me2">indirect_binary_predicate</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">equal_to</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>, <span class="kw4">const</span> T1<span class="sy2">*</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">replace_copy_result</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, O<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> R<span class="sy3">&&</span> r, O result, <span class="kw4">const</span> T1<span class="sy3">&</span> old_value, <span class="kw4">const</span> T2<span class="sy3">&</span> new_value,
|
|
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>result<span class="br0">)</span>,
|
|
old_value, new_value, 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> replace_copy_fn replace_copy<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<th>版本二</th>
|
|
</tr>
|
|
<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> replace_copy_if_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span> <span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_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> T,
|
|
std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> O,
|
|
<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_unary_predicate</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> Pred<span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</span><span class="sy1"><</span>I, O<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">replace_copy_if_result</span><span class="sy1"><</span>I, O<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> I first, S last, O result, Pred pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value,
|
|
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">for</span> <span class="br0">(</span><span class="sy4">;</span> first <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>first, <span class="sy2">++</span>result<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>result <span class="sy1">=</span> <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>pred, <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>first<span class="br0">)</span><span class="br0">)</span> <span class="sy4">?</span> new_value <span class="sy4">:</span> <span class="sy2">*</span>first<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first<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"><</span>ranges<span class="sy4">::</span><span class="me2">input_range</span> R, <span class="kw1">class</span> T, std<span class="sy4">::</span><span class="me2">output_iterator</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> O,
|
|
<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_unary_predicate</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> Pred<span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable</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>, O<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">replace_copy_if_result</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, O<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> R<span class="sy3">&&</span> r, O result, Pred pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value,
|
|
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>result<span class="br0">)</span>,
|
|
std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>pred<span class="br0">)</span>, new_value, 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> replace_copy_if_fn replace_copy_if<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 <array></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">auto</span> print <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span> rem, <span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> v<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">for</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> rem <span class="sy1"><<</span> <span class="st0">": "</span><span class="sy4">;</span> <span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> e <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> e <span class="sy1"><<</span> <span class="st0">' '</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"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</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"><</span><span class="kw4">int</span><span class="sy1">></span> o<span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a> p<span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">6</span>, <span class="nu0">1</span>, <span class="nu0">6</span>, <span class="nu0">1</span>, <span class="nu0">6</span><span class="br0">}</span><span class="sy4">;</span>
|
|
o.<span class="me1">resize</span><span class="br0">(</span>p.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"p"</span>, p<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">replace_copy</span><span class="br0">(</span>p, o.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">6</span>, <span class="nu0">9</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"o"</span>, o<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a> q<span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">6</span>, <span class="nu0">7</span>, <span class="nu0">8</span>, <span class="nu0">4</span>, <span class="nu0">5</span><span class="br0">}</span><span class="sy4">;</span>
|
|
o.<span class="me1">resize</span><span class="br0">(</span>q.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"q"</span>, q<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">replace_copy_if</span><span class="br0">(</span>q, o.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> x<span class="br0">)</span><span class="br0">{</span> <span class="kw1">return</span> <span class="nu0">5</span> <span class="sy1"><</span> x<span class="sy4">;</span> <span class="br0">}</span>, <span class="nu0">5</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"o"</span>, o<span class="br0">)</span><span class="sy4">;</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">p: 1 6 1 6 1 6
|
|
o: 1 9 1 9 1 9
|
|
q: 1 2 3 6 7 8 4 5
|
|
o: 1 2 3 5 5 5 4 5</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-replace.html"><span class="t-lines"><span>ranges::replace</span><span>ranges::replace_if</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span><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-replace_copy.html"><span class="t-lines"><span>replace_copy</span><span>replace_copy_if</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>
|