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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
#include <iostream>
#include <vector>
#include <functional>
using namespace std;
enum
{
ADD,
SUB,
};
template <typename LHS, typename RHS, int operation>
struct Operation;
template <typename LHS, typename RHS>
struct Operation<LHS, RHS, ADD>
{
static auto cpt(auto const &lhs, auto const &rhs)
{
return lhs + rhs;
};
};
template <typename LHS, typename RHS>
struct Operation<LHS, RHS, SUB>
{
static auto cpt(auto const &lhs, auto const &rhs)
{
return lhs - rhs;
};
};
template<typename LHS, typename RHS, int operation>
struct BinExpr;
template<typename Type>
struct BasicType
{
typedef Type ObjType;
};
template<typename LHS, typename RHS, int operation>
struct BasicType<BinExpr<LHS, RHS, operation>>
{
typedef typename BinExpr<LHS, RHS, operation>::ObjType ObjType;
};
template<typename LHS, typename RHS, int operation>
struct BinExpr
{
typedef typename BasicType<RHS>::ObjType ObjType;
typedef typename ObjType::value_type value_type;
LHS const &d_lhs;
RHS const &d_rhs;
BinExpr(LHS const &lhs, RHS const &rhs)
:
d_lhs(lhs),
d_rhs(rhs)
{}
size_t size() const
{
return d_lhs.size();
}
value_type operator[](size_t ix) const
{
return Operation<LHS, RHS, operation>::cpt(d_lhs[ix], d_rhs[ix]);
}
operator ObjType() const
{
ObjType retVal;
retVal.resize(size());
retVal.reserve(size());
for (size_t ix = 0, end = size(); ix != end; ++ix)
new(&retVal[ix]) value_type{ (*this)[ix] };
return retVal;
}
};
// define the operators: ADD, SUB, etc. The operation to perform is
// specified as enum value
template<typename LHS, typename RHS>
BinExpr<LHS, RHS, ADD> operator+(LHS const &lhs, RHS const &rhs)
{
return BinExpr<LHS, RHS, ADD>(lhs, rhs);
}
template<typename LHS, typename RHS>
BinExpr<LHS, RHS, SUB> operator-(LHS const &lhs, RHS const &rhs)
{
return BinExpr<LHS, RHS, SUB>(lhs, rhs);
}
struct VI: public vector<int> // define the data structure to
{ // operate on
static size_t const s_max = 10000;
VI()
:
vector<int>(s_max, 1)
{}
};
int main(int argc, char **argv)
{
if (argc == 1)
{
cout << "arg1: number of iterations\n";
return 0;
}
VI a, b, c, d;
for (size_t idx = 0, count = stoul(argv[1]); idx != count; ++idx)
d = a + b + c + d + a + b + c + d;
cout << d.front() << ", " << d.back() << '\n';
for (size_t idx = 0, count = stoul(argv[1]); idx != count; ++idx)
d = a - b - c - d - a - b - c - d;
cout << d.front() << ", " << d.back() << '\n';
}
|
