302 lines
27 KiB
HTML
302 lines
27 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::transform_inclusive_scan</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_transform_inclusive_scan 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>transform_inclusive_scan</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-numeric.html"><numeric></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-since-cxx17 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> InputIt, <span class="kw1">class</span> OutputIt,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation <span class="sy1">></span><br />
|
|
OutputIt transform_inclusive_scan<span class="br0">(</span> InputIt first, InputIt last, OutputIt d_first,<br /></p>
|
|
BinaryOperation binary_op, UnaryOperation unary_op <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</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> InputIt, <span class="kw1">class</span> OutputIt,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> OutputIt transform_inclusive_scan<span class="br0">(</span> InputIt first, InputIt last,<br />
|
|
OutputIt d_first,<br />
|
|
BinaryOperation binary_op,<br /></p>
|
|
UnaryOperation unary_op <span class="br0">)</span><span class="sy4">;</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> ForwardIt1, <span class="kw1">class</span> ForwardIt2,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation <span class="sy1">></span><br />
|
|
ForwardIt2 transform_inclusive_scan<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt1 first, ForwardIt1 last, ForwardIt2 d_first,<br /></p>
|
|
BinaryOperation binary_op, UnaryOperation unary_op <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>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(3)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17 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> InputIt, <span class="kw1">class</span> OutputIt,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation, <span class="kw1">class</span> T <span class="sy1">></span><br />
|
|
OutputIt transform_inclusive_scan<span class="br0">(</span> InputIt first, InputIt last, OutputIt d_first,<br />
|
|
BinaryOperation binary_op, UnaryOperation unary_op,<br /></p>
|
|
T init <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</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> InputIt, <span class="kw1">class</span> OutputIt,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation, <span class="kw1">class</span> T <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> OutputIt transform_inclusive_scan<span class="br0">(</span> InputIt first, InputIt last,<br />
|
|
OutputIt d_first,<br />
|
|
BinaryOperation binary_op,<br />
|
|
UnaryOperation unary_op,<br /></p>
|
|
T init <span class="br0">)</span><span class="sy4">;</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> ForwardIt1, <span class="kw1">class</span> ForwardIt2,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation, <span class="kw1">class</span> UnaryOperation, <span class="kw1">class</span> T <span class="sy1">></span><br />
|
|
ForwardIt2 transform_inclusive_scan<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt1 first, ForwardIt1 last, ForwardIt2 d_first,<br />
|
|
BinaryOperation binary_op, UnaryOperation unary_op,<br /></p>
|
|
T init <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(4)</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>
|
|
<p>以 <code>unary_op</code> 变换范围 <code>[first, last)</code> 中的每个元素，然后用 <code>binary_op</code> 在范围上计算包含前缀和，可选地以 <code>init</code> 为初值，并写结果到始于 <code>d_first</code> 的范围。“包含”表明第 i 个元素包含于第 i 个和。</p>
|
|
<p>形式上，通过每个 <span class="texhtml" style="white-space: nowrap;">[d_first, d_first + (last - first))</span> 中的迭代器 <code>i</code> 赋以下值</p>
|
|
<ul>
|
|
<li>对于重载 <span class="t-v">(1-2)</span> ，对于 <span class="texhtml" style="white-space: nowrap;">[first, first + (i - d_first + 1))</span> 中每个 <code>j</code> ，为 <code>unary_op(*j)...</code> 在 <code>binary_op</code> 上的的广义非交换和，</li>
|
|
<li>对于重载 <span class="t-v">(3-4)</span> ，对于 <span class="texhtml" style="white-space: nowrap;">[first, first + (i - d_first + 1))</span> 中每个 <code>j</code> ，为 <code>init, unary_op(*j)...</code> 在 <code>binary_op</code> 上的广义非交换和，</li>
|
|
</ul>
|
|
<p>其中广义非交换和 <span class="texhtml" style="white-space: nowrap;">GNSUM(op, a<span class="t-su t-su-b"><br />
|
|
1</span>, ..., a<span class="t-su t-su-b"><br />
|
|
N</span>)</span> 定义如下：</p>
|
|
<ul>
|
|
<li>若 <span class="texhtml" style="white-space: nowrap;">N=1</span> ，则为 <span class="texhtml" style="white-space: nowrap;">a<span class="t-su t-su-b"><br />
|
|
1</span></span></li>
|
|
<li>若 <span class="texhtml" style="white-space: nowrap;">N > 1</span> ，则为 <span class="texhtml" style="white-space: nowrap;">op(GNSUM(op, a<span class="t-su t-su-b"><br />
|
|
1</span>, ..., a<span class="t-su t-su-b"><br />
|
|
K</span>), GNSUM(op, a<span class="t-su t-su-b"><br />
|
|
M</span>, ..., a<span class="t-su t-su-b"><br />
|
|
N</span>))</span> ，对于任何 <span class="texhtml" style="white-space: nowrap;">1 < K+1 = M ≤ N</span> 的 K</li>
|
|
</ul>
|
|
<p>换言之，能以任意顺序进行和运算，而若 <code>binary_op</code> 非结合则行为为非确定的。</p>
|
|
<p>重载 <span class="t-v">(2, 4)</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 才参与重载决议。</p>
|
|
<p><code>unary_op</code> 与 <code>binary_op</code> 不应非法化范围 <span class="texhtml" style="white-space: nowrap;">[first, last)</span> 或 <span class="texhtml" style="white-space: nowrap;">[d_first, d_first + (last - first))</span> 中的迭代器（含尾迭代器）或子范围，不修改其中的元素。否则行为未定义。</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>d_first</td>
|
|
<td>-</td>
|
|
<td>目标范围起始；可以等于 <code>first</code></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>init</td>
|
|
<td>-</td>
|
|
<td>初值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>unary_op</td>
|
|
<td>-</td>
|
|
<td>一元<a href="cpp-named_req-FunctionObject.html"><span style="font-style:italic">函数对象</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(FunctionObject)</span></a> ，将要被应用到输入范围中的每个元素。返回类型必须可接受为 <code>binary_op</code> 的输入。</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>binary_op</td>
|
|
<td>-</td>
|
|
<td>二元<a href="cpp-named_req-FunctionObject.html"><span style="font-style:italic">函数对象</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(FunctionObject)</span></a> ，将应用于 <code>unary_op</code> 的结果、其他 <code>binary_op</code> 的结果，还有 <code>init</code> ，若提供它。</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>InputIt</code> 必须满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 的要求。</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>ForwardIt1</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>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>ForwardIt2</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>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
若不提供 <code>init</code> ，则 <code>decltype(first)</code> 的值类型必须为<a href="cpp-named_req-MoveConstructible.html"><span style="font-style:italic">可移动构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(MoveConstructible)</span></a> 而 <code>binary_op(unary_op(*first), unary_op(*first))</code> 必须可转换成 <code>decltype(first)</code> 的值类型</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>T （若提供 init ）</code> 必须满足<a href="cpp-named_req-MoveConstructible.html"><span style="font-style:italic">可移动构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(MoveConstructible)</span></a> 的要求。<code>binary_op(init, unary_op(*first))</code> 、 <code>binary_op(init, init)</code> 和 <code>binary_op(unary_op(*first), unary_op(*first))</code> 都必须可转换为 T</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>指向最后被写入元素后一位置的迭代器。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>每个 <code>binary_op</code> 和 <code>unary_op</code> 应用 <span class="texhtml" style="white-space: nowrap;">O(last - first)</span> 次。</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=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>不应用 <code>unary_op</code> 到 <code>init</code> 。</p>
|
|
<p>不同于 <span class="t-lc"><a href="cpp-algorithm-transform_exclusive_scan.html">std::transform_exclusive_scan</a></span> ，参数 <code>init</code> 出现于最后，因为它对此函数是可选的。</p>
|
|
<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 <functional></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <iterator></span>
|
|
<span class="co2">#include <numeric></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> times_10 <span class="sy1">=</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> x <span class="sy2">*</span> <span class="nu0">10</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> data <span class="br0">{</span><span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">5</span>, <span class="nu0">9</span>, <span class="nu0">2</span>, <span class="nu0">6</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">"10 times exclusive sum: "</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-transform_exclusive_scan.html"><span class="kw1660">std::<span class="me2">transform_exclusive_scan</span></span></a><span class="br0">(</span>data.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, data.<span class="me1">end</span><span class="br0">(</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><span class="kw4">int</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">0</span>, <a href="cpp-utility-functional-plus.html"><span class="kw1029">std::<span class="me2">plus</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">{</span><span class="br0">}</span>, times_10<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>10 times inclusive sum: "</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">transform_inclusive_scan</span><span class="br0">(</span>data.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, data.<span class="me1">end</span><span class="br0">(</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><span class="kw4">int</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>,
|
|
<a href="cpp-utility-functional-plus.html"><span class="kw1029">std::<span class="me2">plus</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">{</span><span class="br0">}</span>, times_10<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">10 times exclusive sum: 0 30 40 80 90 140 230 250
|
|
10 times inclusive sum: 30 40 80 90 140 230 250 310</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-partial_sum.html"><span class="t-lines"><span>partial_sum</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-transform.html"><span class="t-lines"><span>transform</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-inclusive_scan.html"><span class="t-lines"><span>inclusive_scan</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>类似 <span class="t-lc"><a href="cpp-algorithm-partial_sum.html">std::partial_sum</a></span>，第 i 个和中包含第 i 个输入<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-transform_exclusive_scan.html"><span class="t-lines"><span>transform_exclusive_scan</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</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>
|