237 lines
15 KiB
HTML
237 lines
15 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::generate_n</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_generate_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::</span>generate_n</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</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>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(1)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> generate_n<span class="br0">(</span> OutputIt first, Size count, Generator g <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11 t-until-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator <span class="sy1">></span><br />
|
|
OutputIt generate_n<span class="br0">(</span> OutputIt first, Size count, Generator g <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span><br />
|
|
<span class="t-mark-rev t-until-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> OutputIt, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> OutputIt generate_n<span class="br0">(</span> OutputIt first, Size count, Generator g <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> ExecutionPolicy, <span class="kw1">class</span> ForwardIt , <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator <span class="sy1">></span><br /></span>
|
|
<p>ForwardIt generate_n<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy, ForwardIt first,<br /></p>
|
|
Size count, Generator g <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</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>count>0</code> ,则赋值给定函数对象 <code>g</code> 所生成的值给始于 <code>first</code> 的范围的首 <code>count</code> 个元素。否则不做任何事。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ,但按照 <code>policy</code> 执行。此重载仅若 <span class="t-rev-inl t-until-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></span></span><span class="t-rev-inl t-since-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">remove_cvref_t</span><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></span></span> 为 true 才参与重载决议。</div>
|
|
<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>count</td>
|
|
<td>-</td>
|
|
<td>要生成的元素数</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>policy</td>
|
|
<td>-</td>
|
|
<td>所用的执行策略。细节见<a href="cpp-algorithm-execution_policy_tag_t.html">执行策略</a>。</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>g</td>
|
|
<td>-</td>
|
|
<td>将要调用的生成器函数。<br />
|
|
<p>签名应等价于如下:</p>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl">
|
|
<td class="t-dcl-nopad">
|
|
<div><span class="mw-geshi cpp source-cpp">Ret fun<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>类型 <span class="t-c"><span class="mw-geshi cpp source-cpp">Ret</span></span> 必须使得 <span class="t-c"><span class="mw-geshi cpp source-cpp">OutputIt</span></span> 类型对象能被解引用并能被赋 <span class="t-c"><span class="mw-geshi cpp source-cpp">Ret</span></span> 类型值。 ​</p>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>OutputIt</code> 必须满足<a href="cpp-named_req-OutputIterator.html"><span style="font-style:italic">老式输出迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyOutputIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>ForwardIt</code> 必须满足<a href="cpp-named_req-ForwardIterator.html"><span style="font-style:italic">老式向前迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyForwardIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-until-cxx11">
|
|
<td>
|
|
<p>(无)</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></td>
|
|
</tr>
|
|
<tr class="t-rev t-since-cxx11">
|
|
<td>
|
|
<p>若 <code>count>0</code> 则为最后被赋值元素后一位置的迭代器。否则为 <code>first</code> 。</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>对于 <code>count>0</code> ,准确 <code>count</code> 次调用 <code>g()</code> 和赋值。</p>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<p>拥有名为 <code>ExecutionPolicy</code> 的模板形参的重载按下列方式报告错误:</p>
|
|
<ul>
|
|
<li>若作为算法一部分调用的函数的执行抛出异常,且 <code>ExecutionPolicy</code> 为<a href="cpp-algorithm-execution_policy_tag_t.html">标准策略</a>之一,则调用 <span class="t-lc"><a href="cpp-error-terminate.html">std::terminate</a></span> 。对于任何其他 <code>ExecutionPolicy</code> ,行为是实现定义的。</li>
|
|
<li>若算法无法分配内存,则抛出 <span class="t-lc"><a href="cpp-memory-new-bad_alloc.html">std::bad_alloc</a></span> 。</li>
|
|
</ul>
|
|
<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">template</span><span class="sy1"><</span> <span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator <span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++20 起</span>
|
|
OutputIt <span class="co1">// C++11 前为 void</span>
|
|
Ogenerate_n<span class="br0">(</span> OutputIt first, Size count, Generator g <span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">for</span><span class="br0">(</span> Size i <span class="sy1">=</span> <span class="nu0">0</span><span class="sy4">;</span> i <span class="sy1"><</span> count<span class="sy4">;</span> <span class="sy2">++</span>i <span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>first<span class="sy2">++</span> <span class="sy1">=</span> g<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> first<span class="sy4">;</span>
|
|
<span class="br0">}</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 <random></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <iterator></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-numeric-random-mersenne_twister_engine.html"><span class="kw1489">std::<span class="me2">mt19937</span></span></a> rng<span class="sy4">;</span> <span class="co1">// 默认构造,以固定的种子播种</span>
|
|
std<span class="sy4">::</span><span class="me2">generate_n</span><span class="br0">(</span><a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">mt19937</span><span class="sy4">::</span><span class="me2">result_type</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span>,
|
|
<span class="nu0">5</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>rng<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">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></pre></div>
|
|
</div>
|
|
<p>输出:</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">3499211612 581869302 3890346734 3586334585 545404204</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-fill_n.html"><span class="t-lines"><span>fill_n</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>将一个给定值复制赋值给一个范围内的 N 个元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-generate.html"><span class="t-lines"><span>generate</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>将相继的函数调用结果赋值给一个范围中的每个元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-ranges-generate_n.html"><span class="t-lines"><span>ranges::generate_n</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>保存 N 次函数应用的结果<br />
|
|
<span class="t-mark">(niebloid)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|