276 lines
21 KiB
HTML
276 lines
21 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::copy_n, std::ranges::copy_n_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_copy_n 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>copy_n, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>copy_n_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">weakly_incrementable</span> O <span class="sy1">></span><br /></span>
|
|
<p> 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> copy_n_result<span class="sy1"><</span>I, O<span class="sy1">></span><br /></p>
|
|
copy_n<span class="br0">(</span> I first, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n, 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 起)</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> copy_n_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>(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>
|
|
<div class="t-li1"><span class="t-li">1)</span> 通过对 <code>[0, n)</code> 中的每个整数进行 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span><span class="br0">(</span>result <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> ,准确复制 <code>n</code> 个来自始于 <code>first</code> 的范围的值到始于 <code>result</code> 的范围。若 <code>result</code> 在范围 <code>[first, first + n)</code> 内则行为未定义(在此情况下可能可以用 <span class="t-lc">ranges::copy_backward</span> 代替)。</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</td>
|
|
<td>-</td>
|
|
<td>要复制的元素范围的起始</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>n</td>
|
|
<td>-</td>
|
|
<td>要复制的元素数</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>result</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">ranges<span class="sy4">::</span><span class="me2">copy_n_result</span><span class="br0">{</span>first <span class="sy2">+</span> n, result <span class="sy2">+</span> n<span class="br0">}</span></span></span> ,或更正式地,含有一个等于 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first, n<span class="br0">)</span></span></span> 的 <span class="t-lc">std::input_iterator</span> 迭代器与一个等于 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>result, n<span class="br0">)</span></span></span> 的 <span class="t-lc">std::weakly_incrementable</span> 迭代器的 <span class="t-lc">ranges::in_out_result</span> 类型值。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>准确赋值 <code>n</code> 次。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>实践中,若值类型为<a href="cpp-named_req-TriviallyCopyable.html"><span style="font-style:italic">可平凡复制</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(TriviallyCopyable)</span></a> 并且迭代器类型满足 <a href="cpp-iterator-contiguous_iterator.html"><code>contiguous_iterator</code></a> ,则 <code>std::ranges::copy_n</code> 的实现可以用如 <span class="t-lc"><a href="cpp-string-byte-memmove.html">std::memmove</a></span> 的整块复制函数避免多次赋值。另外,这种复制加速可以由编译优化注入。</p>
|
|
<p>在复制重叠的范围时, <code>std::ranges::copy_n</code> 适合向左复制(目标范围的起始在源范围外),而 <span class="t-lc">std::ranges::copy_backward</span> 适合向右复制(目标范围的末尾在源范围外)。</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>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">struct</span> copy_n_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">weakly_incrementable</span> O<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">copy_n_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, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n, O result<span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> i<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> n<span class="sy4">;</span> <span class="sy2">++</span>i, <span class="sy2">++</span>first, <span class="sy2">++</span>result<span class="br0">)</span>
|
|
<span class="sy2">*</span>result <span class="sy1">=</span> <span class="sy2">*</span>first<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>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="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">inline</span> <span class="kw4">constexpr</span> copy_n_fn copy_n<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 <iterator></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <iomanip></span>
|
|
<span class="co2">#include <string></span>
|
|
<span class="co2">#include <string_view></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">const</span> <a href="cpp-string-basic_string_view.html"><span class="kw1248">std::<span class="me2">string_view</span></span></a> in <span class="br0">{</span><span class="st0">"ABCDEFGH"</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a> out<span class="sy4">;</span>
|
|
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">copy_n</span><span class="br0">(</span>in.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">4</span>, <a href="cpp-iterator-back_inserter.html"><span class="kw665">std::<span class="me2">back_inserter</span></span></a><span class="br0">(</span>out<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"><<</span> <a href="cpp-io-manip-quoted.html"><span class="kw1802">std::<span class="me2">quoted</span></span></a><span class="br0">(</span>out<span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
out <span class="sy1">=</span> <span class="st0">"abcdefgh"</span><span class="sy4">;</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> res <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">copy_n</span><span class="br0">(</span>in.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">5</span>, out.<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"><<</span> <span class="st0">"*(res.in): '"</span> <span class="sy1"><<</span> <span class="sy2">*</span><span class="br0">(</span>res.<span class="me1">in</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">"', distance: "</span>
|
|
<span class="sy1"><<</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>in<span class="br0">)</span>, res.<span class="me1">in</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> <span class="st0">"*(res.out): '"</span> <span class="sy1"><<</span> <span class="sy2">*</span><span class="br0">(</span>res.<span class="me1">out</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">"', distance: "</span>
|
|
<span class="sy1"><<</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>out<span class="br0">)</span>, res.<span class="me1">out</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</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">"ABCD"
|
|
*(res.in): 'F', distance: 5
|
|
*(res.out): 'f', distance: 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-copy.html"><span class="t-lines"><span>ranges::copy</span><span>ranges::copy_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-ranges-copy_backward.html"><span class="t-lines"><span>ranges::copy_backward</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-remove_copy.html"><span class="t-lines"><span>ranges::remove_copy</span><span>ranges::remove_copy_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-ranges-replace_copy.html"><span class="t-lines"><span>ranges::replace_copy</span><span>ranges::replace_copy_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-ranges-reverse_copy.html"><span class="t-lines"><span>ranges::revserse_copy</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-rotate_copy.html"><span class="t-lines"><span>ranges::rotate_copy</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-unique_copy.html"><span class="t-lines"><span>ranges::unique_copy</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-move.html"><span class="t-lines"><span>ranges::move</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-move_backward.html"><span class="t-lines"><span>ranges::move_backword</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-copy_n.html"><span class="t-lines"><span>copy_n</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>将一定数目的元素复制到一个新的位置<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|