STLdoc
STLdocumentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Macros | Functions
numeric File Reference
#include <xutility>

Macros

#define _NUMERIC_
 

Functions

template<class _InIt , class _Ty , class _Fn2 >
_STD_BEGIN _Ty _Accumulate_unchecked (_InIt _First, _InIt _Last, _Ty _Val, _Fn2 &_Func)
 
template<class _InIt , class _Ty , class _Fn2 >
_Ty accumulate (_InIt _First, _InIt _Last, _Ty _Val, _Fn2 _Func)
 
template<class _InIt , class _Ty >
_Ty accumulate (_InIt _First, _InIt _Last, _Ty _Val)
 
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_unchecked (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2)
 
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate1 (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2, input_iterator_tag, input_iterator_tag)
 
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate1 (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2, random_access_iterator_tag, random_access_iterator_tag)
 
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2)
 
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty inner_product (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 _Func1, _Fn22 _Func2)
 
template<class _InIt1 , class _InIt2 , class _Ty >
_Ty inner_product (_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_unchecked (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate1 (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, input_iterator_tag, _Any_tag)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate1 (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, random_access_iterator_tag, random_access_iterator_tag)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt partial_sum (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
 
template<class _InIt , class _OutIt >
_OutIt partial_sum (_InIt _First, _InIt _Last, _OutIt _Dest)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_unchecked (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate1 (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, input_iterator_tag, _Any_tag)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate1 (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, random_access_iterator_tag, random_access_iterator_tag)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
 
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt adjacent_difference (_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
 
template<class _InIt , class _OutIt >
_OutIt adjacent_difference (_InIt _First, _InIt _Last, _OutIt _Dest)
 
template<class _FwdIt , class _Ty >
void _Iota_unchecked (_FwdIt _First, _FwdIt _Last, _Ty _Val)
 
template<class _FwdIt , class _Ty >
void iota (_FwdIt _First, _FwdIt _Last, _Ty _Val)
 

Macro Definition Documentation

#define _NUMERIC_

Function Documentation

template<class _InIt , class _Ty , class _Fn2 >
_STD_BEGIN _Ty _Accumulate_unchecked ( _InIt  _First,
_InIt  _Last,
_Ty  _Val,
_Fn2 &  _Func 
)
inline
18  { // return sum of _Val and all in [_First, _Last), using _Func
19  for (; _First != _Last; ++_First)
20  _Val = _Func(_Val, *_First);
21  return (_Val);
22  }
_In_ int _Val
Definition: vcruntime_string.h:62
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func 
)
inline
306  { // compute adjacent differences into _Dest, using _Func, no deprecation warnings
307  _DEBUG_RANGE_PTR(_First, _Last, _Dest);
308  _DEBUG_POINTER_IF(_First != _Last, _Func);
310  _Dest, _Func, _Iter_cat_t<_InIt>(), _Iter_cat_t<_OutIt>()));
311  }
#define _DEBUG_POINTER_IF(test, first)
Definition: xutility:820
typename iterator_traits< _Iter >::iterator_category _Iter_cat_t
Definition: xutility:655
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _DEBUG_RANGE_PTR(first, last, ptr)
Definition: xutility:824
_OutIt _Adjacent_difference_no_deprecate1(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, input_iterator_tag, _Any_tag)
Definition: numeric:279
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate1 ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func,
input_iterator_tag  ,
_Any_tag   
)
inline
282  { // compute adjacent differences into _Dest, arbitrary iterators
283  return (_Rechecked(_Dest,
285  _Unchecked_idl0(_Dest), _Func)));
286  }
_OutIt _Adjacent_difference_unchecked(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:258
_Deque_const_iterator< _Mydeque > & _Rechecked(_Deque_const_iterator< _Mydeque > &_Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type _Right)
Definition: deque:534
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_no_deprecate1 ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func,
random_access_iterator_tag  ,
random_access_iterator_tag   
)
inline
294  { // compute adjacent differences into _Dest, random-access iterators
295  _CHECK_RANIT_RANGE(_First, _Last, _Dest);
296  return (_Rechecked(_Dest,
298  _Unchecked(_Dest), _Func)));
299  }
_OutIt _Adjacent_difference_unchecked(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:258
_Deque_const_iterator< _Mydeque > & _Rechecked(_Deque_const_iterator< _Mydeque > &_Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type _Right)
Definition: deque:534
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _CHECK_RANIT_RANGE(_First, _Last, _Target)
Definition: xutility:487
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Adjacent_difference_unchecked ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func 
)
inline
260  { // compute adjacent differences into _Dest, using _Func
261  if (_First != _Last)
262  {
263  _Iter_value_t<_InIt> _Val = *_First;
264  for (*_Dest = _Val; ++_First != _Last; )
265  { // compute another difference
266  _Iter_value_t<_InIt> _Tmp = *_First;
267  *++_Dest = _Func(_Tmp, _Val);
268  _Val = _STD move(_Tmp);
269  }
270  ++_Dest;
271  }
272 
273  return (_Dest);
274  }
_In_ int _Val
Definition: vcruntime_string.h:62
typename iterator_traits< _Iter >::value_type _Iter_value_t
Definition: xutility:647
constexpr remove_reference< _Ty >::type && move(_Ty &&_Arg) _NOEXCEPT
Definition: type_traits:1290
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val,
_Fn21 &  _Func1,
_Fn22 &  _Func2 
)
inline
93  { // return inner product of sequences, using _Func1 and _Func2, no deprecation warnings
94  _DEBUG_RANGE_PTR(_First1, _Last1, _First2);
95  _DEBUG_POINTER_IF(_First1 != _Last1, _Func1);
96  _DEBUG_POINTER_IF(_First1 != _Last1, _Func2);
97  return (_Inner_product_no_deprecate1(_Unchecked(_First1), _Unchecked(_Last1),
98  _First2, _Val, _Func1, _Func2, _Iter_cat_t<_InIt1>(), _Iter_cat_t<_InIt2>()));
99  }
#define _DEBUG_POINTER_IF(test, first)
Definition: xutility:820
typename iterator_traits< _Iter >::iterator_category _Iter_cat_t
Definition: xutility:655
_In_ int _Val
Definition: vcruntime_string.h:62
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _DEBUG_RANGE_PTR(first, last, ptr)
Definition: xutility:824
_Ty _Inner_product_no_deprecate1(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2, input_iterator_tag, input_iterator_tag)
Definition: numeric:61
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate1 ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val,
_Fn21 &  _Func1,
_Fn22 &  _Func2,
input_iterator_tag  ,
input_iterator_tag   
)
inline
65  { // return inner product of sequences, using _Func1 and _Func2
66  return (_Inner_product_unchecked(_First1, _Last1,
67  _Unchecked_idl0(_First2), _Val, _Func1, _Func2));
68  }
_In_ int _Val
Definition: vcruntime_string.h:62
_Ty _Inner_product_unchecked(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2)
Definition: numeric:47
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_no_deprecate1 ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val,
_Fn21 &  _Func1,
_Fn22 &  _Func2,
random_access_iterator_tag  ,
random_access_iterator_tag   
)
inline
79  { // return inner product of sequences, using _Func1 and _Func2
80  _CHECK_RANIT_RANGE(_First1, _Last1, _First2);
81  return (_Inner_product_unchecked(_First1, _Last1,
82  _Unchecked(_First2), _Val, _Func1, _Func2));
83  }
_In_ int _Val
Definition: vcruntime_string.h:62
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
_Ty _Inner_product_unchecked(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2)
Definition: numeric:47
#define _CHECK_RANIT_RANGE(_First, _Last, _Target)
Definition: xutility:487
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty _Inner_product_unchecked ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val,
_Fn21 &  _Func1,
_Fn22 &  _Func2 
)
inline
50  { // return inner product of sequences, using _Func1 and _Func2
51  for (; _First1 != _Last1; ++_First1, (void)++_First2)
52  _Val = _Func1(_Val, _Func2(*_First1, *_First2));
53  return (_Val);
54  }
_In_ int _Val
Definition: vcruntime_string.h:62
_CRT_BEGIN_C_HEADER typedef void(__CRTDECL *unexpected_handler)()
template<class _FwdIt , class _Ty >
void _Iota_unchecked ( _FwdIt  _First,
_FwdIt  _Last,
_Ty  _Val 
)
inline
362  { // compute increasing sequence into [_First, _Last)
363  for (; _First != _Last; ++_First, (void)++_Val)
364  *_First = _Val;
365  }
_In_ int _Val
Definition: vcruntime_string.h:62
_CRT_BEGIN_C_HEADER typedef void(__CRTDECL *unexpected_handler)()
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func 
)
inline
203  { // compute partial sums into _Dest, using _Func, no deprecation warnings
204  _DEBUG_RANGE_PTR(_First, _Last, _Dest);
205  _DEBUG_POINTER_IF(_First != _Last, _Func);
207  _Dest, _Func, _Iter_cat_t<_InIt>(), _Iter_cat_t<_OutIt>()));
208  }
_OutIt _Partial_sum_no_deprecate1(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func, input_iterator_tag, _Any_tag)
Definition: numeric:176
#define _DEBUG_POINTER_IF(test, first)
Definition: xutility:820
typename iterator_traits< _Iter >::iterator_category _Iter_cat_t
Definition: xutility:655
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _DEBUG_RANGE_PTR(first, last, ptr)
Definition: xutility:824
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate1 ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func,
input_iterator_tag  ,
_Any_tag   
)
inline
179  { // compute partial sums into _Dest, arbitrary iterators
180  return (_Rechecked(_Dest,
182  _Unchecked_idl0(_Dest), _Func)));
183  }
_Deque_const_iterator< _Mydeque > & _Rechecked(_Deque_const_iterator< _Mydeque > &_Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type _Right)
Definition: deque:534
_OutIt _Partial_sum_unchecked(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:159
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_no_deprecate1 ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func,
random_access_iterator_tag  ,
random_access_iterator_tag   
)
inline
191  { // compute partial sums into _Dest, random-access iterators
192  _CHECK_RANIT_RANGE(_First, _Last, _Dest);
193  return (_Rechecked(_Dest,
195  _Unchecked(_Dest), _Func)));
196  }
_Deque_const_iterator< _Mydeque > & _Rechecked(_Deque_const_iterator< _Mydeque > &_Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type _Right)
Definition: deque:534
_OutIt _Partial_sum_unchecked(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:159
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _CHECK_RANIT_RANGE(_First, _Last, _Target)
Definition: xutility:487
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt _Partial_sum_unchecked ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2 &  _Func 
)
inline
161  { // compute partial sums into _Dest, using _Func
162  if (_First != _Last)
163  {
164  _Iter_value_t<_InIt> _Val = *_First;
165  for (*_Dest = _Val; ++_First != _Last; *++_Dest = _Val)
166  _Val = _Func(_Val, *_First);
167  ++_Dest;
168  }
169 
170  return (_Dest);
171  }
_In_ int _Val
Definition: vcruntime_string.h:62
typename iterator_traits< _Iter >::value_type _Iter_value_t
Definition: xutility:647
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _Ty , class _Fn2 >
_Ty accumulate ( _InIt  _First,
_InIt  _Last,
_Ty  _Val,
_Fn2  _Func 
)
inline
28  { // return sum of _Val and all in [_First, _Last), using _Func
29  _DEBUG_RANGE_PTR(_First, _Last, _Func);
30  return (_Accumulate_unchecked(_Unchecked(_First), _Unchecked(_Last), _Val, _Func));
31  }
_In_ int _Val
Definition: vcruntime_string.h:62
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
#define _DEBUG_RANGE_PTR(first, last, ptr)
Definition: xutility:824
_STD_BEGIN _Ty _Accumulate_unchecked(_InIt _First, _InIt _Last, _Ty _Val, _Fn2 &_Func)
Definition: numeric:17
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _Ty >
_Ty accumulate ( _InIt  _First,
_InIt  _Last,
_Ty  _Val 
)
inline
37  { // return sum of _Val and all in [_First, _Last)
38  return (_STD accumulate(_First, _Last, _Val, plus<>()));
39  }
_Ty accumulate(_InIt _First, _InIt _Last, _Ty _Val, _Fn2 _Func)
Definition: numeric:27
_In_ int _Val
Definition: vcruntime_string.h:62
Definition: xstddef:175
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt adjacent_difference ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2  _Func 
)
inline
318  { // compute adjacent differences into _Dest, using _Func
320  return (_Adjacent_difference_no_deprecate(_First, _Last, _Dest, _Func));
321  }
#define _DEPRECATE_UNCHECKED(_Func, _Iter)
Definition: xutility:478
_OutIt adjacent_difference(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
Definition: numeric:316
_OutIt _Adjacent_difference_no_deprecate(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:304
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt >
_OutIt adjacent_difference ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest 
)
inline
342  { // compute adjacent differences into _Dest
343  return (_STD adjacent_difference(_First, _Last, _Dest,
344  minus<>()));
345  }
Definition: xstddef:189
_OutIt adjacent_difference(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
Definition: numeric:316
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt1 , class _InIt2 , class _Ty , class _Fn21 , class _Fn22 >
_Ty inner_product ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val,
_Fn21  _Func1,
_Fn22  _Func2 
)
inline
109  { // return inner product of sequences, using _Func1 and _Func2
111  return (_Inner_product_no_deprecate(_First1, _Last1, _First2, _Val, _Func1, _Func2));
112  }
#define _DEPRECATE_UNCHECKED(_Func, _Iter)
Definition: xutility:478
_Ty _Inner_product_no_deprecate(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 &_Func1, _Fn22 &_Func2)
Definition: numeric:90
_In_ int _Val
Definition: vcruntime_string.h:62
_Ty inner_product(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 _Func1, _Fn22 _Func2)
Definition: numeric:106
template<class _InIt1 , class _InIt2 , class _Ty >
_Ty inner_product ( _InIt1  _First1,
_InIt1  _Last1,
_InIt2  _First2,
_Ty  _Val 
)
inline
137  { // return inner product of sequences
138  return (_STD inner_product(_First1, _Last1, _First2, _Val,
139  plus<>(), multiplies<>()));
140  }
_In_ int _Val
Definition: vcruntime_string.h:62
Definition: xstddef:175
_Ty inner_product(_InIt1 _First1, _InIt1 _Last1, _InIt2 _First2, _Ty _Val, _Fn21 _Func1, _Fn22 _Func2)
Definition: numeric:106
Definition: xstddef:203
template<class _FwdIt , class _Ty >
void iota ( _FwdIt  _First,
_FwdIt  _Last,
_Ty  _Val 
)
inline
370  { // compute increasing sequence into [_First, _Last)
371  _DEBUG_RANGE(_First, _Last);
373  }
#define _DEBUG_RANGE(first, last)
Definition: xutility:822
_In_ int _Val
Definition: vcruntime_string.h:62
_Iter_t _Unchecked(_Iter_t _Iter)
Definition: iterator:11
void _Iota_unchecked(_FwdIt _First, _FwdIt _Last, _Ty _Val)
Definition: numeric:361
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt , class _Fn2 >
_OutIt partial_sum ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest,
_Fn2  _Func 
)
inline
215  { // compute partial sums into _Dest, using _Func
217  return (_Partial_sum_no_deprecate(_First, _Last, _Dest, _Func));
218  }
#define _DEPRECATE_UNCHECKED(_Func, _Iter)
Definition: xutility:478
_OutIt partial_sum(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
Definition: numeric:213
_OutIt _Partial_sum_no_deprecate(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 &_Func)
Definition: numeric:201
_FwdIt _Last
Definition: algorithm:1936
template<class _InIt , class _OutIt >
_OutIt partial_sum ( _InIt  _First,
_InIt  _Last,
_OutIt  _Dest 
)
inline
239  { // compute partial sums into _Dest
240  return (_STD partial_sum(_First, _Last, _Dest, plus<>()));
241  }
Definition: xstddef:175
_OutIt partial_sum(_InIt _First, _InIt _Last, _OutIt _Dest, _Fn2 _Func)
Definition: numeric:213
_FwdIt _Last
Definition: algorithm:1936