<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: stl_numeric.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00569_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_numeric.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00569.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Numeric functions implementation -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2001-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996,1997</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_numeric.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{numeric}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_NUMERIC_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_NUMERIC_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00308.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00743.html">debug/debug.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span> <span class="comment">// For _GLIBCXX_MOVE</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">namespace </span><a class="code" href="a01538.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /**</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * @brief Create a range of sequentially increasing values.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> *</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * For each element in the range @p [first,last) assigns @p value and</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * increments @p value as if by @p ++value.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> *</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @param __value Starting value.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> */</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="a01538.html#ae2511dfcafd338758fa6670e3055bec1"> 82</a></span>  <a class="code" href="a01538.html#ae2511dfcafd338758fa6670e3055bec1">iota</a>(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  _ForwardIterator>)</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  __glibcxx_function_requires(_ConvertibleConcept<_Tp,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type>)</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  *__first = __value;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  ++__value;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">namespace </span><a class="code" href="a01538.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> _GLIBCXX_BEGIN_NAMESPACE_ALGO</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"></span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> /**</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * @brief Accumulate values in a range.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> *</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * Accumulates the values in the range [first,last) using operator+(). The</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * initial value is @a init. The values are processed in order.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> *</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * @param __init Starting value to add other values to.</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * @return The final sum.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> */</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">inline</span> _Tp</div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a01538.html#aa0acc8476d79019e12bb3eab3702a352"> 120</a></span>  <a class="code" href="a01538.html#aa0acc8476d79019e12bb3eab3702a352">accumulate</a>(_InputIterator __first, _InputIterator __last, _Tp __init)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  __init = __init + *__first;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span> __init;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"></span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> /**</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> * @brief Accumulate values in a range with operation.</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> *</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> * Accumulates the values in the range [first,last) using the function</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * object @p __binary_op. The initial value is @p __init. The values are</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> * processed in order.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> *</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * @param __first Start of range.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * @param __last End of range.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> * @param __init Starting value to add other values to.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> * @param __binary_op Function object to accumulate with.</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> * @return The final sum.</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> */</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">inline</span> _Tp</div><div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="a01538.html#a9fada48f61b8df42473d9b97f10f5094"> 146</a></span>  <a class="code" href="a01538.html#aa0acc8476d79019e12bb3eab3702a352">accumulate</a>(_InputIterator __first, _InputIterator __last, _Tp __init,</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  _BinaryOperation __binary_op)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  {</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  __init = __binary_op(__init, *__first);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">return</span> __init;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"></span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> /**</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @brief Compute inner product of two ranges.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> *</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * Starting with an initial value of @p __init, multiplies successive</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * elements from the two ranges and adds each product into the accumulated</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * value using operator+(). The values in the ranges are processed in</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> * order.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> *</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * @param __first1 Start of range 1.</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> * @param __last1 End of range 1.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> * @param __first2 Start of range 2.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> * @param __init Starting value to add other values to.</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> * @return The final inner product.</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> */</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">inline</span> _Tp</div><div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="a01538.html#a721f223f1581a1054b7f55c4b456dd57"> 174</a></span>  <a class="code" href="a01538.html#a721f223f1581a1054b7f55c4b456dd57">inner_product</a>(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _InputIterator2 __first2, _Tp __init)</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, (void)++__first2)</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  __init = __init + (*__first1 * *__first2);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> __init;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"></span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> /**</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @brief Compute inner product of two ranges.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> *</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * Starting with an initial value of @p __init, applies @p __binary_op2 to</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * successive elements from the two ranges and accumulates each result into</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * the accumulated value using @p __binary_op1. The values in the ranges are</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * processed in order.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> *</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * @param __first1 Start of range 1.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * @param __last1 End of range 1.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @param __first2 Start of range 2.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * @param __init Starting value to add other values to.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * @param __binary_op1 Function object to accumulate with.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * @param __binary_op2 Function object to apply to pairs of input values.</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * @return The final inner product.</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> */</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">typename</span> _BinaryOperation1, <span class="keyword">typename</span> _BinaryOperation2></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">inline</span> _Tp</div><div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="a01538.html#a20b37d44d13d779f7eab4a1ac98ca674"> 206</a></span>  <a class="code" href="a01538.html#a721f223f1581a1054b7f55c4b456dd57">inner_product</a>(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  _InputIterator2 __first2, _Tp __init,</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  _BinaryOperation1 __binary_op1,</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  _BinaryOperation2 __binary_op2)</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, (void)++__first2)</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> __init;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"></span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> /**</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> * @brief Return list of partial sums</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> *</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> * Accumulates the values in the range [first,last) using the @c + operator.</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> * As each successive input value is added into the total, that partial sum</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> * is written to @p __result. Therefore, the first value in @p __result is</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> * the first value of the input, the second value in @p __result is the sum</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * of the first and second input values, and so on.</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> *</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> * @param __first Start of input range.</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> * @param __last End of input range.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> * @param __result Output sum.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> * @return Iterator pointing just beyond the values written to __result.</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> */</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _OutputIterator></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  _OutputIterator</div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="a01538.html#a9151a0519f8c180edbef22197f39dd5e"> 237</a></span>  <a class="code" href="a01538.html#a9151a0519f8c180edbef22197f39dd5e">partial_sum</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  _OutputIterator __result)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type _ValueType;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  _ValueType>)</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  _ValueType __value = *__first;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  *__result = __value;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">while</span> (++__first != __last)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  __value = __value + *__first;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  *++__result = __value;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> ++__result;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"></span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> /**</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * @brief Return list of partial sums</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> *</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> * Accumulates the values in the range [first,last) using @p __binary_op.</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> * As each successive input value is added into the total, that partial sum</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * is written to @p __result. Therefore, the first value in @p __result is</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> * the first value of the input, the second value in @p __result is the sum</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> * of the first and second input values, and so on.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> *</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> * @param __first Start of input range.</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> * @param __last End of input range.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> * @param __result Output sum.</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> * @param __binary_op Function object.</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> * @return Iterator pointing just beyond the values written to __result.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> */</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  _OutputIterator</div><div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="a01538.html#a17bad49fa9fb1c5c41d019b16970fe9e"> 278</a></span>  <a class="code" href="a01538.html#a9151a0519f8c180edbef22197f39dd5e">partial_sum</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  _OutputIterator __result, _BinaryOperation __binary_op)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type _ValueType;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  _ValueType>)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  _ValueType __value = *__first;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  *__result = __value;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">while</span> (++__first != __last)</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  __value = __binary_op(__value, *__first);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  *++__result = __value;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> ++__result;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> /**</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> * @brief Return differences between adjacent values.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> *</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> * Computes the difference between adjacent values in the range</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"> * [first,last) using operator-() and writes the result to @p __result.</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"> *</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"> * @param __first Start of input range.</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> * @param __last End of input range.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * @param __result Output sums.</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * @return Iterator pointing just beyond the values written to result.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> *</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> * _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> * DR 539. partial_sum and adjacent_difference should mention requirements</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> */</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _OutputIterator></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  _OutputIterator</div><div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="a01538.html#aa32b49ada366c1b4175cd0f9d0d3329d"> 317</a></span>  <a class="code" href="a01538.html#aa32b49ada366c1b4175cd0f9d0d3329d">adjacent_difference</a>(_InputIterator __first,</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  _InputIterator __last, _OutputIterator __result)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type _ValueType;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  _ValueType>)</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  _ValueType __value = *__first;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  *__result = __value;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">while</span> (++__first != __last)</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  _ValueType __tmp = *__first;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  *++__result = __tmp - __value;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  __value = _GLIBCXX_MOVE(__tmp);</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> ++__result;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"></span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> /**</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> * @brief Return differences between adjacent values.</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> *</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> * Computes the difference between adjacent values in the range</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> * [__first,__last) using the function object @p __binary_op and writes the</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"> * result to @p __result.</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> *</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"> * @param __first Start of input range.</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"> * @param __last End of input range.</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> * @param __result Output sum.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * @param __binary_op Function object.</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> * @return Iterator pointing just beyond the values written to result.</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> *</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> * _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> * DR 539. partial_sum and adjacent_difference should mention requirements</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"> */</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  _OutputIterator</div><div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="a01538.html#a4039c3686e6968c94da56cf037d078ae"> 360</a></span>  <a class="code" href="a01538.html#aa32b49ada366c1b4175cd0f9d0d3329d">adjacent_difference</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  _OutputIterator __result, _BinaryOperation __binary_op)</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type _ValueType;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  _ValueType>)</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  _ValueType __value = *__first;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  *__result = __value;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">while</span> (++__first != __last)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  _ValueType __tmp = *__first;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  *++__result = __binary_op(__tmp, __value);</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  __value = _GLIBCXX_MOVE(__tmp);</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> ++__result;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> _GLIBCXX_END_NAMESPACE_ALGO</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_NUMERIC_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00422_html"><div class="ttname"><a href="a00422.html">move.h</a></div></div>
<div class="ttc" id="a01538_html_ae2511dfcafd338758fa6670e3055bec1"><div class="ttname"><a href="a01538.html#ae2511dfcafd338758fa6670e3055bec1">std::iota</a></div><div class="ttdeci">void iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)</div><div class="ttdoc">Create a range of sequentially increasing values.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00082">stl_numeric.h:82</a></div></div>
<div class="ttc" id="a01538_html_aa0acc8476d79019e12bb3eab3702a352"><div class="ttname"><a href="a01538.html#aa0acc8476d79019e12bb3eab3702a352">std::accumulate</a></div><div class="ttdeci">_Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)</div><div class="ttdoc">Accumulate values in a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00120">stl_numeric.h:120</a></div></div>
<div class="ttc" id="a00743_html"><div class="ttname"><a href="a00743.html">debug.h</a></div></div>
<div class="ttc" id="a01538_html_a721f223f1581a1054b7f55c4b456dd57"><div class="ttname"><a href="a01538.html#a721f223f1581a1054b7f55c4b456dd57">std::inner_product</a></div><div class="ttdeci">_Tp inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init)</div><div class="ttdoc">Compute inner product of two ranges.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00174">stl_numeric.h:174</a></div></div>
<div class="ttc" id="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a01538_html_aa32b49ada366c1b4175cd0f9d0d3329d"><div class="ttname"><a href="a01538.html#aa32b49ada366c1b4175cd0f9d0d3329d">std::adjacent_difference</a></div><div class="ttdeci">_OutputIterator adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result)</div><div class="ttdoc">Return differences between adjacent values.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00317">stl_numeric.h:317</a></div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></div></div>
<div class="ttc" id="a01538_html_a9151a0519f8c180edbef22197f39dd5e"><div class="ttname"><a href="a01538.html#a9151a0519f8c180edbef22197f39dd5e">std::partial_sum</a></div><div class="ttdeci">_OutputIterator partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)</div><div class="ttdoc">Return list of partial sums.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00237">stl_numeric.h:237</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_599c955538774c0249d4ddd97c0a9ae8.html">bits</a></li><li class="navelem"><a class="el" href="a00569.html">stl_numeric.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
521
