-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnumeric.h
107 lines (95 loc) · 2.6 KB
/
numeric.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#pragma once
#ifndef _NUMERIC_H
#define _NUMERIC_H
namespace stl
{
template<class InputIterator,class T>
T accumulate(InputIterator first, InputIterator last, T init)
{
for (; first != last; first++)
{
init += *first;
}
return init;
}
template<class InputIterator,class BinaryFunc,class T>
T accumulate(InputIterator first, InputIterator last, T init, BinaryFunc fuc)
{
for (; first != last; first++)
{
init = fuc(init, *first);
}
return init;
}
template<class InputIterator,class OutputIterator>
OutputIterator adjacent_difference(InputIterator first, InputIterator last, OutputIterator result)
{
if (first == last) return result;
auto pre = *first;
first++;
while (first != last)
{
auto cur = *first;
*(result++) = cur - pre;
pre = cur;
}
return result;
}
template<class InputIterator,class OutputIterator,class BinaryFuction>
OutputIterator adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryFuction func)
{
if (first == last) return result;
auto pre = *(first++);
while (first != last)
{
auto cur = *first;
*(result++) = func(cur, pre);
pre = cur;
}
return result;
}
template<class InputIterator1,class InputIterator2,class T>
T inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, T init)
{
for (; first1 != last1&&first2 != last2; first1++, first2++)
{
init += (*first1)*(*first2);
}
return init;
}
template<class InputIterator1, class InputIterator2, class T, class BinaryFunction>
T inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryFunction func,T init)
{
for (; first1 != last1&&first2 != last2; first1++, first2++)
{
init += func((*first1), (*first2));
}
return init;
}
template<class InputIterator,class OutputIterator>
OutputIterator partial_sum(InputIterator first, InputIterator last, OutputIterator result)
{
if (first == last) return result;
auto sum = *(first++);
*(result++) = sum;
while (first != last)
{
sum += *(first++);
*(result++) = sum;
}
return result;
}
template<class InputIterator, class OutputIterator, class T, class BinaryOperation>
OutputIterator partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation func)
{
if (first == last) return result;
T value = *first;
while (++first != last)
{
value = func(value, *first);
++result = value;
}
return value;
}
}
#endif