307 lines
26 KiB
HTML
307 lines
26 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_reduce</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_reduce 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_reduce</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> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> T<span class="sy1">></span><br />
|
|
T transform_reduce<span class="br0">(</span>InputIt1 first1, InputIt1 last1, InputIt2 first2, T init<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-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> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> T<span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> T transform_reduce<span class="br0">(</span>InputIt1 first1, InputIt1 last1, InputIt2 first2, T init<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></tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(2)</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> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryOp1, <span class="kw1">class</span> BinaryOp2<span class="sy1">></span><br /></span>
|
|
<p>T transform_reduce<span class="br0">(</span>InputIt1 first1, InputIt1 last1, InputIt2 first2,<br /></p>
|
|
T init, BinaryOp1 binary_op1, BinaryOp2 binary_op2<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> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryOp1, <span class="kw1">class</span> BinaryOp2<span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">constexpr</span> T transform_reduce<span class="br0">(</span>InputIt1 first1, InputIt1 last1, InputIt2 first2,<br /></p>
|
|
T init, BinaryOp1 binary_op1, BinaryOp2 binary_op2<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></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> T, <span class="kw1">class</span> BinaryOp, <span class="kw1">class</span> UnaryOp<span class="sy1">></span><br /></span>
|
|
<p>T transform_reduce<span class="br0">(</span>InputIt first, InputIt last,<br /></p>
|
|
T init, BinaryOp binop, UnaryOp 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> T, <span class="kw1">class</span> BinaryOp, <span class="kw1">class</span> UnaryOp<span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">constexpr</span> T transform_reduce<span class="br0">(</span>InputIt first, InputIt last,<br /></p>
|
|
T init, BinaryOp binop, UnaryOp 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,<br /></span>
|
|
<p> <span class="kw1">class</span> ForwardIt1, <span class="kw1">class</span> ForwardIt2, <span class="kw1">class</span> T<span class="sy1">></span><br />
|
|
T transform_reduce<span class="br0">(</span>ExecutionPolicy<span class="sy3">&&</span> policy,<br /></p>
|
|
ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2, 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 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,<br /></span>
|
|
<p> <span class="kw1">class</span> ForwardIt1, <span class="kw1">class</span> ForwardIt2, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryOp1, <span class="kw1">class</span> BinaryOp2<span class="sy1">></span><br />
|
|
T transform_reduce<span class="br0">(</span>ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2,<br /></p>
|
|
T init, BinaryOp1 binary_op1, BinaryOp2 binary_op2<span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(5)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<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,<br /></span>
|
|
<p> <span class="kw1">class</span> ForwardIt, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryOp, <span class="kw1">class</span> UnaryOp<span class="sy1">></span><br />
|
|
T transform_reduce<span class="br0">(</span>ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt first, ForwardIt last,<br /></p>
|
|
T init, BinaryOp binary_op, UnaryOp unary_op<span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(6)</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>transform_reduce(first1, last1, first2, init, std::plus<>(), std::multiplies<>());</code> ，默认的 <span class="t-lc"><a href="cpp-algorithm-inner_product.html">std::inner_product</a></span> 的等效并行版本</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 应用 <code>binary_op2</code> 到来自范围 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">[</span>first<span class="sy4">;</span> last<span class="br0">)</span></span></span> 和始于 <span class="t-c"><span class="mw-geshi cpp source-cpp">first2</span></span> 的范围的每对元素，并在 <code>binary_op1</code> 上与初始值 <code>init</code> 一同规约结果（可以以未指定行为重排聚合）</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 应用 <code>unary_op</code> 到范围 <span class="texhtml" style="white-space: nowrap;">[first; last)</span> 中的每个元素，并在 <code>binary_op</code> 上与初始值 <code>init</code> 一同规约结果（可以以未指定行为重排聚合）。</div>
|
|
<div class="t-li1"><span class="t-li">4-6)</span> 同 <span class="t-v">(1-3)</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>
|
|
<p>若 <code>binary_op</code>/<code>binary_op2</code> 为非交换或非结合则行为不确定。</p>
|
|
<p>若 <code>unary_op</code> 、 <code>binary_op</code> 、 <code>binary_op1</code> 或 <code>binary_op2</code> 修改输入范围中的任何元素或非法化范围中的任何迭代器，含尾迭代器，则行为未定义。</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>init</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>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>将以未指定顺序应用于 <code>unary_op</code> 的结果、其他 <code>binary_op</code> 的结果和 <code>init</code> 的二元<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> 。</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
为使用重载 (3,6) ， <code>T</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> 的要求。且表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op<span class="br0">(</span>init, unary_op<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span><span class="br0">)</span></span></span> 、 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op<span class="br0">(</span>unary_op<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span>, init<span class="br0">)</span></span></span> 、 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op<span class="br0">(</span>init, init<span class="br0">)</span></span></span> 和 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op<span class="br0">(</span>unary_op<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span>, unary_op<span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span><span class="br0">)</span></span></span> 的结果必须可转换为 T</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
为使用重载 (2,5) ， <code>T</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> 的要求。且表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op1<span class="br0">(</span>init, binary_op2<span class="br0">(</span><span class="sy2">*</span>first1, <span class="sy2">*</span>first2<span class="br0">)</span><span class="br0">)</span></span></span> 、 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op1<span class="br0">(</span>binary_op2<span class="br0">(</span><span class="sy2">*</span>first1, <span class="sy2">*</span>first2<span class="br0">)</span>, init<span class="br0">)</span></span></span> 、 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op1<span class="br0">(</span>init, init<span class="br0">)</span></span></span> 和 <span class="t-c"><span class="mw-geshi cpp source-cpp">binary_op1<span class="br0">(</span>binary_op2<span class="br0">(</span><span class="sy2">*</span>first1, <span class="sy2">*</span>first2<span class="br0">)</span>, binary_op2<span class="br0">(</span><span class="sy2">*</span>first1, <span class="sy2">*</span>first2<span class="br0">)</span><span class="br0">)</span></span></span> 的结果必须可转换为 T</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>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>
|
|
<div class="t-li1"><span class="t-li">2)</span> <code>init</code> 和 <code>binary_op2(*first,*first2)</code> 、 <code>binary_op2(*(first+1),*(first2+1))</code> ……在 <code>binary_op1</code> 上的广义和</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> <code>init</code> 和 <code>unary_op(*first)</code> 、 <code>unary_op(*(first+1))</code> …… <code>unary_op(*(last-1))</code> 在 <code>binary_op</code> 上的广义和，</div>
|
|
<p>其中广义和 <span class="texhtml" style="white-space: nowrap;">GSUM(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(GSUM(op, b<span class="t-su t-su-b"><br />
|
|
1</span>, ..., b<span class="t-su t-su-b"><br />
|
|
K</span>), GSUM(op, b<span class="t-su t-su-b"><br />
|
|
M</span>, ..., b<span class="t-su t-su-b"><br />
|
|
N</span>))</span> ，其中</li>
|
|
</ul>
|
|
<dl>
|
|
<dd>
|
|
<ul>
|
|
<li><span class="texhtml" style="white-space: nowrap;">b<span class="t-su t-su-b"><br />
|
|
1</span>, ..., b<span class="t-su t-su-b"><br />
|
|
N</span></span> 可以是 <span class="texhtml" style="white-space: nowrap;">a1, ..., aN</span> 的任意重排，若</li>
|
|
<li><span class="texhtml" style="white-space: nowrap;">1 < K+1 = M ≤ N</span></li>
|
|
</ul>
|
|
</dd>
|
|
</dl>
|
|
<p>换言之， unary_op 或 binary_op1 的结果能以任意顺序组合排列。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<div class="t-li1"><span class="t-li">1,2,4,5)</span> 各使用 <span class="texhtml" style="white-space: nowrap;">O(last1 - first1)</span> 次 <code>binary_op1</code> 和 <code>binary_op2</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">3,6)</span> 各使用 <span class="texhtml" style="white-space: nowrap;">O(last - first)</span> 次 <code>unary_op</code> 和 <code>binary_op</code> 。</div>
|
|
<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>在一元-二元重载 <span class="t-v">(3,6)</span> 中， <code>unary_op</code> 不应用到 <code>init</code></p>
|
|
<p>若 <code>first == last</code> 或 <code>first1 == last1</code> ，则返回不修改的 <code>init</code></p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<p>transform_reduce 能用于并行化的 <span class="t-lc"><a href="cpp-algorithm-inner_product.html">std::inner_product</a></span> ：</p>
|
|
<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 <vector></span>
|
|
<span class="co2">#include <functional></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <numeric></span>
|
|
<span class="co2">#include <execution></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</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">double</span><span class="sy1">></span> xvalues<span class="br0">(</span><span class="nu0">10007</span>, <span class="nu16">1.0</span><span class="br0">)</span>, yvalues<span class="br0">(</span><span class="nu0">10007</span>, <span class="nu16">1.0</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">double</span> result <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">transform_reduce</span><span class="br0">(</span>
|
|
<a href="cpp-algorithm-execution_policy_tag.html"><span class="kw1561">std::<span class="me2">execution</span><span class="sy4">::</span><span class="me2">par</span></span></a>,
|
|
xvalues.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, xvalues.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>,
|
|
yvalues.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu16">0.0</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> result <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">10007</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-accumulate.html"><span class="t-lines"><span>accumulate</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-reduce.html"><span class="t-lines"><span>reduce</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-accumulate.html">std::accumulate</a></span>，但不依序执行<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|