316 lines
26 KiB
HTML
316 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::inner_product</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_inner_product 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>inner_product</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-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 /></span>
|
|
<p>T inner_product<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br /></p>
|
|
InputIt2 first2, 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-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>
|
|
<p><span class="kw4">constexpr</span> T inner_product<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br /></p>
|
|
InputIt2 first2, 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></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-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,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation1, <span class="kw1">class</span> BinaryOperation2<span class="sy1">></span><br />
|
|
T inner_product<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, T init,<br />
|
|
BinaryOperation1 op1,<br /></p>
|
|
BinaryOperation2 op2 <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><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,<br /></span>
|
|
<p> <span class="kw1">class</span> BinaryOperation1, <span class="kw1">class</span> BinaryOperation2<span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> T inner_product<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, T init,<br />
|
|
BinaryOperation1 op1,<br /></p>
|
|
BinaryOperation2 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>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>计算内积(即积之和)或在范围 <code>[first1, last1)</code> 和始于 <code>first2</code> 的范围上进行有序映射/规约操作。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 以初值 <code>init</code> 初始化积累器 <code>acc</code> ,然后
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-until-cxx20">
|
|
<td>
|
|
<p>以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> acc <span class="sy2">+</span> <span class="sy2">*</span>first1 <span class="sy2">*</span> <span class="sy2">*</span>first2</span></span> 修改它,再以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> acc <span class="sy2">+</span> <span class="sy2">*</span><span class="br0">(</span>first1<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span> <span class="sy2">*</span> <span class="sy2">*</span><span class="br0">(</span>first2<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span></span></span> 修改它,以此类推</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
|
</tr>
|
|
<tr class="t-rev t-since-cxx20">
|
|
<td>
|
|
<p>以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>acc<span class="br0">)</span> <span class="sy2">+</span> <span class="sy2">*</span>first1 <span class="sy2">*</span> <span class="sy2">*</span>first2</span></span> 修改它,再以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>acc<span class="br0">)</span> <span class="sy2">+</span> <span class="sy2">*</span><span class="br0">(</span>first1<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span> <span class="sy2">*</span> <span class="sy2">*</span><span class="br0">(</span>first2<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span></span></span> 修改它,以此类推</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
直至抵达 <code>last1</code> 。对于 + 与 * 的内建含义,此算法计算二个范围的内积。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 以初值 <code>init</code> 初始化积累器 <code>acc</code> ,然后
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-until-cxx20">
|
|
<td>
|
|
<p>以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> op1<span class="br0">(</span>acc, 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">acc <span class="sy1">=</span> op1<span class="br0">(</span>acc, op2<span class="br0">(</span><span class="sy2">*</span><span class="br0">(</span>first1<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span>, <span class="sy2">*</span><span class="br0">(</span>first2<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span> 修改它,以此类推</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
|
</tr>
|
|
<tr class="t-rev t-since-cxx20">
|
|
<td>
|
|
<p>以表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">acc <span class="sy1">=</span> op1<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>acc<span class="br0">)</span>, 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">acc <span class="sy1">=</span> op1<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>acc<span class="br0">)</span>, op2<span class="br0">(</span><span class="sy2">*</span><span class="br0">(</span>first1<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span>, <span class="sy2">*</span><span class="br0">(</span>first2<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span> 修改它,以此类推</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
直至抵达 <code>last1</code> 。</div>
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-until-cxx11">
|
|
<td>
|
|
<p><code>op1</code> 或 <code>op2</code> 必须无副作用。</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>op1</code> 或 <code>op2</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.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>first1, last1</td>
|
|
<td>-</td>
|
|
<td>元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first2</td>
|
|
<td>-</td>
|
|
<td>第二个元素范围的起始</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>init</td>
|
|
<td>-</td>
|
|
<td>积的和的初值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>op1</td>
|
|
<td>-</td>
|
|
<td>被使用的二元函数对象。此“和”函数接收 op2 所返回的值和当前积累器的值,并产生存储于积累器的新值。<br />
|
|
<p>该函数的签名应当等价于:</p>
|
|
<p><span class="t-cc"><span class="mw-geshi cpp source-cpp"> Ret fun<span class="br0">(</span><span class="kw4">const</span> Type1 <span class="sy3">&</span>a, <span class="kw4">const</span> Type2 <span class="sy3">&</span>b<span class="br0">)</span><span class="sy4">;</span></span></span></p>
|
|
<p>签名中并不需要有 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">const</span> <span class="sy3">&</span></span></span>。<br />
|
|
类型 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 必须使得 <span class="t-c"><span class="mw-geshi cpp source-cpp">T</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type3</span></span> 类型的对象各能隐式转换成 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 。 类型 <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">T</span></span> 类型对象能被赋 <span class="t-c"><span class="mw-geshi cpp source-cpp">Ret</span></span> 类型值。 ​</p>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>op2</td>
|
|
<td>-</td>
|
|
<td>被使用的二元函数对象。此“积”函数从每个范围接收一个值并产生新值。<br />
|
|
<p>该函数的签名应当等价于:</p>
|
|
<p><span class="t-cc"><span class="mw-geshi cpp source-cpp"> Ret fun<span class="br0">(</span><span class="kw4">const</span> Type1 <span class="sy3">&</span>a, <span class="kw4">const</span> Type2 <span class="sy3">&</span>b<span class="br0">)</span><span class="sy4">;</span></span></span></p>
|
|
<p>签名中并不需要有 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">const</span> <span class="sy3">&</span></span></span>。<br />
|
|
类型 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 必须使得 <span class="t-c"><span class="mw-geshi cpp source-cpp">InputIt1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">InputIt2</span></span> 类型的对象在解引用后分别能隐式转换到 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 。 类型 <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">Type3</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>InputIt1, InputIt2</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>ForwardIt1, 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>T</code> 必须满足<a href="cpp-named_req-CopyAssignable.html"><span style="font-style:italic">可复制赋值</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyAssignable)</span></a> 和 <a href="cpp-named_req-CopyConstructible.html"><span style="font-style:italic">可复制构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyConstructible)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>上述 <code>acc</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">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>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++20 起</span>
|
|
T inner_product<span class="br0">(</span>InputIt1 first1, InputIt1 last1,
|
|
InputIt2 first2, T init<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>first1 <span class="sy3">!</span><span class="sy1">=</span> last1<span class="br0">)</span> <span class="br0">{</span>
|
|
init <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>init<span class="br0">)</span> <span class="sy2">+</span> <span class="sy2">*</span>first1 <span class="sy2">*</span> <span class="sy2">*</span>first2<span class="sy4">;</span> <span class="co1">// C++20 起有 std::move</span>
|
|
<span class="sy2">++</span>first1<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first2<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> init<span class="sy4">;</span>
|
|
<span class="br0">}</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">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> BinaryOperation1, <span class="kw1">class</span> BinaryOperation2<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++20 起</span>
|
|
T inner_product<span class="br0">(</span>InputIt1 first1, InputIt1 last1,
|
|
InputIt2 first2, T init,
|
|
BinaryOperation1 op1,
|
|
BinaryOperation2 op2<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>first1 <span class="sy3">!</span><span class="sy1">=</span> last1<span class="br0">)</span> <span class="br0">{</span>
|
|
init <span class="sy1">=</span> op1<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>init<span class="br0">)</span>, op2<span class="br0">(</span><span class="sy2">*</span>first1, <span class="sy2">*</span>first2<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// C++20 起有 std::move</span>
|
|
<span class="sy2">++</span>first1<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first2<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> init<span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E6.84.8F">注意</span></h3>
|
|
<p>此算法的可并行版本 <span class="t-lc"><a href="cpp-algorithm-transform_reduce.html">std::transform_reduce</a></span> 要求 <code>op1</code> 与 <code>op2</code> 可交换并可结合,但 <code>std::inner_product</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 <numeric></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <vector></span>
|
|
<span class="co2">#include <functional></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">int</span><span class="sy1">></span> a<span class="br0">{</span><span class="nu0">0</span>, <span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">4</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> b<span class="br0">{</span><span class="nu0">5</span>, <span class="nu0">4</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> r1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">inner_product</span><span class="br0">(</span>a.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, a.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, b.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">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> <span class="st0">"Inner product of a and b: "</span> <span class="sy1"><<</span> r1 <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> r2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">inner_product</span><span class="br0">(</span>a.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, a.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, b.<span class="me1">begin</span><span class="br0">(</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="br0">(</span><span class="br0">)</span>, <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><></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="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"Number of pairwise matches between a and b: "</span> <span class="sy1"><<</span> r2 <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">Inner product of a and b: 21
|
|
Number of pairwise matches between a and b: 2</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-transform_reduce.html"><span class="t-lines"><span>transform_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>应用一个函数对象,然后以乱序规约<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<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-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>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|