|
1988
|
1 // Nothing like a little CPP abuse to brighten everyone's day. Would |
|
|
2 // have been nice to do this with template functions but as of 2.5.x, |
|
|
3 // g++ seems to fail to resolve them properly. |
|
|
4 |
|
3504
|
5 #define DO_VS_OP(r, l, v, OP, s) \ |
|
1988
|
6 if (l > 0) \ |
|
|
7 { \ |
|
|
8 for (int i = 0; i < l; i++) \ |
|
3504
|
9 r[i] = v[i] OP s; \ |
|
1988
|
10 } |
|
|
11 |
|
3504
|
12 #define DO_SV_OP(r, l, s, OP, v) \ |
|
1988
|
13 if (l > 0) \ |
|
|
14 { \ |
|
|
15 for (int i = 0; i < l; i++) \ |
|
3504
|
16 r[i] = s OP v[i]; \ |
|
1988
|
17 } |
|
|
18 |
|
3504
|
19 #define DO_VV_OP(r, l, x, OP, y) \ |
|
1988
|
20 if (l > 0) \ |
|
|
21 { \ |
|
|
22 for (int i = 0; i < l; i++) \ |
|
3504
|
23 r[i] = x[i] OP y[i]; \ |
|
1988
|
24 } |
|
|
25 |
|
3504
|
26 #define NEG_V(r, l, x) \ |
|
1988
|
27 if (l > 0) \ |
|
|
28 { \ |
|
|
29 for (int i = 0; i < l; i++) \ |
|
3504
|
30 r[i] = -x[i]; \ |
|
1988
|
31 } |
|
|
32 |
|
|
33 #define DO_VS_OP2(OP) \ |
|
|
34 int l = a.length (); \ |
|
|
35 if (l > 0) \ |
|
|
36 { \ |
|
|
37 T *tmp = a.fortran_vec (); \ |
|
|
38 for (int i = 0; i < l; i++) \ |
|
|
39 tmp[i] OP s; \ |
|
|
40 } |
|
|
41 |
|
|
42 #define DO_VV_OP2(OP) \ |
|
|
43 do \ |
|
|
44 { \ |
|
|
45 T *a_tmp = a.fortran_vec (); \ |
|
|
46 const T *b_tmp = b.data (); \ |
|
|
47 for (int i = 0; i < l; i++) \ |
|
3243
|
48 a_tmp[i] OP b_tmp[i]; \ |
|
1988
|
49 } \ |
|
|
50 while (0) |
|
|
51 |
|
3573
|
52 // A macro that can be used to declare and instantiate OP= operators. |
|
|
53 #define MARRAY_OP_ASSIGN_DECL(A_T, E_T, OP, PFX, LTGT, RHS_T) \ |
|
|
54 PFX A_T<E_T>& \ |
|
|
55 operator OP LTGT (A_T<E_T>&, const RHS_T&) |
|
|
56 |
|
|
57 // All the OP= operators that we care about. |
|
|
58 #define MARRAY_OP_ASSIGN_DECLS(A_T, E_T, PFX, LTGT, RHS_T) \ |
|
|
59 MARRAY_OP_ASSIGN_DECL (A_T, E_T, +=, PFX, LTGT, RHS_T); \ |
|
|
60 MARRAY_OP_ASSIGN_DECL (A_T, E_T, -=, PFX, LTGT, RHS_T); |
|
|
61 |
|
|
62 // Generate forward declarations for OP= operators. |
|
|
63 #define MARRAY_OP_ASSIGN_FWD_DECLS(A_T) \ |
|
|
64 MARRAY_OP_ASSIGN_DECLS (A_T, T, template <typename T>, , T) \ |
|
|
65 MARRAY_OP_ASSIGN_DECLS (A_T, T, template <typename T>, , A_T<T>) \ |
|
|
66 |
|
|
67 // Generate friend declarations for the OP= operators. |
|
|
68 #define MARRAY_OP_ASSIGN_FRIENDS(A_T) \ |
|
|
69 MARRAY_OP_ASSIGN_DECLS (A_T, T, friend, <>, T) \ |
|
|
70 MARRAY_OP_ASSIGN_DECLS (A_T, T, friend, <>, A_T<T>) |
|
|
71 |
|
|
72 // Instantiate the OP= operators. |
|
|
73 #define MARRAY_OP_ASSIGN_DEFS(A_T, E_T) \ |
|
3574
|
74 MARRAY_OP_ASSIGN_DECLS (A_T, E_T, template, , E_T) \ |
|
3573
|
75 MARRAY_OP_ASSIGN_DECLS (A_T, E_T, template, , A_T<E_T>) |
|
|
76 |
|
|
77 // A function that can be used to forward OP= operations from derived |
|
|
78 // classes back to us. |
|
|
79 #define MARRAY_OP_ASSIGN_FWD_FCN(R, F, T, C_X, X_T, C_Y, Y_T) \ |
|
|
80 inline R \ |
|
|
81 F (X_T& x, const Y_T& y) \ |
|
|
82 { \ |
|
|
83 return R (F (C_X (x), C_Y (y))); \ |
|
|
84 } |
|
|
85 |
|
|
86 // All the OP= operators that we care about forwarding. |
|
|
87 #define MARRAY_OP_ASSIGN_FWD_DEFS(R, T, C_X, X_T, C_Y, Y_T) \ |
|
|
88 MARRAY_OP_ASSIGN_FWD_FCN (R, operator +=, T, C_X, X_T, C_Y, Y_T) \ |
|
|
89 MARRAY_OP_ASSIGN_FWD_FCN (R, operator -=, T, C_X, X_T, C_Y, Y_T) |
|
|
90 |
|
|
91 // A macro that can be used to declare and instantiate unary operators. |
|
|
92 #define MARRAY_UNOP(A_T, E_T, F, PFX, LTGT) \ |
|
|
93 PFX A_T<E_T> \ |
|
|
94 F LTGT (const A_T<E_T>&) |
|
|
95 |
|
|
96 // All the unary operators that we care about. |
|
|
97 #define MARRAY_UNOP_DECLS(A_T, E_T, PFX, LTGT) \ |
|
|
98 MARRAY_UNOP (A_T, E_T, operator +, PFX, LTGT); \ |
|
|
99 MARRAY_UNOP (A_T, E_T, operator -, PFX, LTGT); |
|
|
100 |
|
|
101 // Generate forward declarations for unary operators. |
|
|
102 #define MARRAY_UNOP_FWD_DECLS(A_T) \ |
|
|
103 MARRAY_UNOP_DECLS (A_T, T, template <typename T>, ) |
|
|
104 |
|
|
105 // Generate friend declarations for the unary operators. |
|
|
106 #define MARRAY_UNOP_FRIENDS(A_T) \ |
|
|
107 MARRAY_UNOP_DECLS (A_T, T, friend, <>) |
|
|
108 |
|
|
109 // Instantiate the unary operators. |
|
|
110 #define MARRAY_UNOP_DEFS(A_T, E_T) \ |
|
|
111 MARRAY_UNOP_DECLS (A_T, E_T, template, ) |
|
|
112 |
|
|
113 // A function that can be used to forward unary operations from derived |
|
|
114 // classes back to us. |
|
|
115 #define MARRAY_UNOP_FWD_FCN(R, F, T, C_X, X_T) \ |
|
|
116 inline R \ |
|
|
117 F (const X_T& x) \ |
|
|
118 { \ |
|
|
119 return R (F (C_X (x))); \ |
|
|
120 } |
|
|
121 |
|
|
122 // All the unary operators that we care about forwarding. |
|
|
123 #define MARRAY_UNOP_FWD_DEFS(R, T, C_X, X_T) \ |
|
|
124 MARRAY_UNOP_FWD_FCN (R, operator +, T, C_X, X_T) \ |
|
|
125 MARRAY_UNOP_FWD_FCN (R, operator -, T, C_X, X_T) |
|
|
126 |
|
|
127 // A macro that can be used to declare and instantiate binary operators. |
|
|
128 #define MARRAY_BINOP_DECL(A_T, E_T, F, PFX, LTGT, X_T, Y_T) \ |
|
|
129 PFX A_T<E_T> \ |
|
|
130 F LTGT (const X_T&, const Y_T&) |
|
|
131 |
|
|
132 // All the binary operators that we care about. We have two |
|
|
133 // sets of macros since the MArray OP MArray operations use functions |
|
|
134 // (product and quotient) instead of operators (*, /). |
|
|
135 #define MARRAY_BINOP_DECLS(A_T, E_T, PFX, LTGT, X_T, Y_T) \ |
|
|
136 MARRAY_BINOP_DECL (A_T, E_T, operator +, PFX, LTGT, X_T, Y_T); \ |
|
|
137 MARRAY_BINOP_DECL (A_T, E_T, operator -, PFX, LTGT, X_T, Y_T); \ |
|
|
138 MARRAY_BINOP_DECL (A_T, E_T, operator *, PFX, LTGT, X_T, Y_T); \ |
|
|
139 MARRAY_BINOP_DECL (A_T, E_T, operator /, PFX, LTGT, X_T, Y_T); |
|
|
140 |
|
|
141 #define MARRAY_AA_BINOP_DECLS(A_T, E_T, PFX, LTGT) \ |
|
|
142 MARRAY_BINOP_DECL (A_T, E_T, operator +, PFX, LTGT, A_T<E_T>, A_T<E_T>); \ |
|
|
143 MARRAY_BINOP_DECL (A_T, E_T, operator -, PFX, LTGT, A_T<E_T>, A_T<E_T>); \ |
|
|
144 MARRAY_BINOP_DECL (A_T, E_T, quotient, PFX, LTGT, A_T<E_T>, A_T<E_T>); \ |
|
|
145 MARRAY_BINOP_DECL (A_T, E_T, product, PFX, LTGT, A_T<E_T>, A_T<E_T>); |
|
|
146 |
|
|
147 // Generate forward declarations for binary operators. |
|
|
148 #define MARRAY_BINOP_FWD_DECLS(A_T) \ |
|
|
149 MARRAY_BINOP_DECLS (A_T, T, template <typename T>, , A_T<T>, T) \ |
|
|
150 MARRAY_BINOP_DECLS (A_T, T, template <typename T>, , T, A_T<T>) \ |
|
|
151 MARRAY_AA_BINOP_DECLS (A_T, T, template <typename T>, ) |
|
|
152 |
|
|
153 // Generate friend declarations for the binary operators. |
|
|
154 #define MARRAY_BINOP_FRIENDS(A_T) \ |
|
|
155 MARRAY_BINOP_DECLS (A_T, T, friend, <>, A_T<T>, T) \ |
|
|
156 MARRAY_BINOP_DECLS (A_T, T, friend, <>, T, A_T<T>) \ |
|
|
157 MARRAY_AA_BINOP_DECLS (A_T, T, friend, <>) |
|
|
158 |
|
|
159 // Instantiate the binary operators. |
|
|
160 #define MARRAY_BINOP_DEFS(A_T, E_T) \ |
|
|
161 MARRAY_BINOP_DECLS (A_T, E_T, template, , A_T<E_T>, E_T) \ |
|
|
162 MARRAY_BINOP_DECLS (A_T, E_T, template, , E_T, A_T<E_T>) \ |
|
|
163 MARRAY_AA_BINOP_DECLS (A_T, E_T, template, ) |
|
|
164 |
|
|
165 // A function that can be used to forward binary operations from derived |
|
|
166 // classes back to us. |
|
|
167 #define MARRAY_BINOP_FWD_FCN(R, F, T, C_X, X_T, C_Y, Y_T) \ |
|
|
168 inline R \ |
|
|
169 F (const X_T& x, const Y_T& y) \ |
|
|
170 { \ |
|
|
171 return R (F (C_X (x), C_Y (y))); \ |
|
|
172 } |
|
|
173 |
|
|
174 // The binary operators that we care about forwarding. We have two |
|
|
175 // sets of macros since the MArray OP MArray operations use functions |
|
|
176 // (product and quotient) instead of operators (*, /). |
|
|
177 #define MARRAY_BINOP_FWD_DEFS(R, T, C_X, X_T, C_Y, Y_T) \ |
|
|
178 MARRAY_BINOP_FWD_FCN (R, operator +, T, C_X, X_T, C_Y, Y_T) \ |
|
|
179 MARRAY_BINOP_FWD_FCN (R, operator -, T, C_X, X_T, C_Y, Y_T) \ |
|
|
180 MARRAY_BINOP_FWD_FCN (R, operator *, T, C_X, X_T, C_Y, Y_T) \ |
|
|
181 MARRAY_BINOP_FWD_FCN (R, operator /, T, C_X, X_T, C_Y, Y_T) |
|
|
182 |
|
|
183 #define MARRAY_AA_BINOP_FWD_DEFS(R, T, C_X, X_T, C_Y, Y_T) \ |
|
|
184 MARRAY_BINOP_FWD_FCN (R, operator +, T, C_X, X_T, C_Y, Y_T) \ |
|
|
185 MARRAY_BINOP_FWD_FCN (R, operator -, T, C_X, X_T, C_Y, Y_T) \ |
|
|
186 MARRAY_BINOP_FWD_FCN (R, product, T, C_X, X_T, C_Y, Y_T) \ |
|
|
187 MARRAY_BINOP_FWD_FCN (R, quotient, T, C_X, X_T, C_Y, Y_T) |
|
|
188 |
|
|
189 // Forward declarations for the MArray operators. |
|
|
190 #define MARRAY_OPS_FORWARD_DECLS(A_T) \ |
|
|
191 template <class T> \ |
|
|
192 class A_T; \ |
|
|
193 \ |
|
|
194 MARRAY_OP_ASSIGN_FWD_DECLS (A_T) \ |
|
|
195 MARRAY_UNOP_FWD_DECLS (A_T) \ |
|
|
196 MARRAY_BINOP_FWD_DECLS (A_T) |
|
|
197 |
|
|
198 // Friend declarations for the MArray operators. |
|
|
199 #define MARRAY_OPS_FRIEND_DECLS(A_T) \ |
|
|
200 MARRAY_OP_ASSIGN_FRIENDS (A_T) \ |
|
|
201 MARRAY_UNOP_FRIENDS (A_T) \ |
|
|
202 MARRAY_BINOP_FRIENDS (A_T) |
|
|
203 |
|
|
204 // The following macros are for external use. |
|
|
205 |
|
|
206 // Instantiate all the MArray friends for MArray element type T. |
|
|
207 #define INSTANTIATE_MARRAY_FRIENDS(T) \ |
|
|
208 MARRAY_OP_ASSIGN_DEFS (MArray, T) \ |
|
|
209 MARRAY_UNOP_DEFS (MArray, T) \ |
|
|
210 MARRAY_BINOP_DEFS (MArray, T) |
|
|
211 |
|
|
212 // Instantiate all the MArray friends for MArray element type T. |
|
|
213 #define INSTANTIATE_MARRAY2_FRIENDS(T) \ |
|
|
214 MARRAY_OP_ASSIGN_DEFS (MArray2, T) \ |
|
|
215 MARRAY_UNOP_DEFS (MArray2, T) \ |
|
|
216 MARRAY_BINOP_DEFS (MArray2, T) |
|
|
217 |
|
|
218 // Define all the MArray forwarding functions for return type R and |
|
|
219 // MArray element type T |
|
|
220 #define MARRAY_FORWARD_DEFS(B, R, T) \ |
|
|
221 MARRAY_OP_ASSIGN_FWD_DEFS \ |
|
|
222 (R, T, dynamic_cast<B<T>&>, R, , T) \ |
|
|
223 \ |
|
|
224 MARRAY_OP_ASSIGN_FWD_DEFS \ |
|
|
225 (R, T, \ |
|
|
226 dynamic_cast<B<T>&>, R, dynamic_cast<const B<T>&>, R) \ |
|
|
227 \ |
|
|
228 MARRAY_UNOP_FWD_DEFS \ |
|
|
229 (R, T, dynamic_cast<const B<T>&>, R) \ |
|
|
230 \ |
|
|
231 MARRAY_BINOP_FWD_DEFS \ |
|
|
232 (R, T, dynamic_cast<const B<T>&>, R, , T) \ |
|
|
233 \ |
|
|
234 MARRAY_BINOP_FWD_DEFS \ |
|
|
235 (R, T, , T, dynamic_cast<const B<T>&>, R) \ |
|
|
236 \ |
|
|
237 MARRAY_AA_BINOP_FWD_DEFS \ |
|
|
238 (R, T, dynamic_cast<const B<T>&>, R, dynamic_cast<const B<T>&>, R) |
|
|
239 |
|
|
240 // Now we have all the definitions we need. |
|
|
241 |
