|
2829
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 1996 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #if !defined (octave_mx_op_defs_h) |
|
|
24 #define octave_mx_op_defs_h 1 |
|
|
25 |
|
|
26 #include "mx-inlines.cc" |
|
|
27 |
|
|
28 #define BIN_OP_DECL(R, OP, X, Y) \ |
|
|
29 extern R OP (const X&, const Y&) |
|
|
30 |
|
|
31 #define MS_OP_DECLS(R, M, S) \ |
|
|
32 BIN_OP_DECL (R, operator +, M, S); \ |
|
|
33 BIN_OP_DECL (R, operator -, M, S); \ |
|
|
34 BIN_OP_DECL (R, operator *, M, S); \ |
|
|
35 BIN_OP_DECL (R, operator /, M, S); |
|
|
36 |
|
|
37 #define SM_OP_DECLS(R, S, M) \ |
|
|
38 BIN_OP_DECL (R, operator +, S, M); \ |
|
|
39 BIN_OP_DECL (R, operator -, S, M); \ |
|
|
40 BIN_OP_DECL (R, operator *, S, M); \ |
|
|
41 BIN_OP_DECL (R, operator /, S, M); |
|
|
42 |
|
|
43 #define MM_OP_DECLS(R, M1, M2) \ |
|
|
44 BIN_OP_DECL (R, operator +, M1, M2); \ |
|
|
45 BIN_OP_DECL (R, operator -, M1, M2); \ |
|
|
46 BIN_OP_DECL (R, product, M1, M2); \ |
|
|
47 BIN_OP_DECL (R, quotient, M1, M2); |
|
|
48 |
|
|
49 #define SDM_OP_DECLS(R, S, DM) \ |
|
|
50 BIN_OP_DECL (R, operator +, S, DM); \ |
|
|
51 BIN_OP_DECL (R, operator -, S, DM); |
|
|
52 |
|
|
53 #define DMS_OP_DECLS(R, DM, S) \ |
|
|
54 BIN_OP_DECL (R, operator +, DM, S); \ |
|
|
55 BIN_OP_DECL (R, operator -, DM, S); |
|
|
56 |
|
|
57 #define MDM_OP_DECLS(R, M, DM) \ |
|
|
58 BIN_OP_DECL (R, operator +, M, DM); \ |
|
|
59 BIN_OP_DECL (R, operator -, M, DM); \ |
|
|
60 BIN_OP_DECL (R, operator *, M, DM); |
|
|
61 |
|
|
62 #define DMM_OP_DECLS(R, DM, M) \ |
|
|
63 BIN_OP_DECL (R, operator +, DM, M); \ |
|
|
64 BIN_OP_DECL (R, operator -, DM, M); \ |
|
|
65 BIN_OP_DECL (R, operator *, DM, M); |
|
|
66 |
|
|
67 #define DMDM_OP_DECLS(R, DM1, DM2) \ |
|
|
68 BIN_OP_DECL (R, operator +, DM1, DM2); \ |
|
|
69 BIN_OP_DECL (R, operator -, DM1, DM2); \ |
|
|
70 BIN_OP_DECL (R, product, DM1, DM2); |
|
|
71 |
|
|
72 #define MS_OP(R, OP, M, S, F) \ |
|
|
73 R \ |
|
|
74 OP (const M& m, const S& s) \ |
|
|
75 { \ |
|
|
76 int nr = m.rows (); \ |
|
|
77 int nc = m.cols (); \ |
|
|
78 \ |
|
|
79 R r (nr, nc); \ |
|
|
80 \ |
|
|
81 if (nr > 0 && nc > 0) \ |
|
|
82 F ## _vs (r.fortran_vec (), m.data (), nr * nc, s); \ |
|
|
83 \ |
|
|
84 return r; \ |
|
|
85 } |
|
|
86 |
|
|
87 #define MS_OPS(R, M, S) \ |
|
|
88 MS_OP (R, operator +, M, S, add) \ |
|
|
89 MS_OP (R, operator -, M, S, subtract) \ |
|
|
90 MS_OP (R, operator *, M, S, multiply) \ |
|
|
91 MS_OP (R, operator /, M, S, divide) |
|
|
92 |
|
|
93 #define SM_OP(R, OP, S, M, F) \ |
|
|
94 R \ |
|
|
95 OP (const S& s, const M& m) \ |
|
|
96 { \ |
|
|
97 int nr = m.rows (); \ |
|
|
98 int nc = m.cols (); \ |
|
|
99 \ |
|
|
100 R r (nr, nc); \ |
|
|
101 \ |
|
|
102 if (nr > 0 && nc > 0) \ |
|
|
103 F ## _sv (r.fortran_vec (), s, m.data (), nr * nc); \ |
|
|
104 \ |
|
|
105 return r; \ |
|
|
106 } |
|
|
107 |
|
|
108 #define SM_OPS(R, S, M) \ |
|
|
109 SM_OP (R, operator +, S, M, add) \ |
|
|
110 SM_OP (R, operator -, S, M, subtract) \ |
|
|
111 SM_OP (R, operator *, S, M, multiply) \ |
|
|
112 SM_OP (R, operator /, S, M, divide) |
|
|
113 |
|
|
114 #define MM_OP(R, OP, M1, M2, F) \ |
|
|
115 R \ |
|
|
116 OP (const M1& m1, const M2& m2) \ |
|
|
117 { \ |
|
|
118 R r; \ |
|
|
119 \ |
|
|
120 int m1_nr = m1.rows (); \ |
|
|
121 int m1_nc = m1.cols (); \ |
|
|
122 \ |
|
|
123 int m2_nr = m2.rows (); \ |
|
|
124 int m2_nc = m2.cols (); \ |
|
|
125 \ |
|
|
126 if (m1_nr != m2_nr || m1_nc != m2_nc) \ |
|
|
127 gripe_nonconformant (#OP, m1_nr, m1_nc, m2_nr, m2_nc); \ |
|
|
128 else \ |
|
|
129 { \ |
|
|
130 r.resize (m1_nr, m1_nc); \ |
|
|
131 \ |
|
|
132 if (m1_nr > 0 && m1_nc > 0) \ |
|
|
133 F ## _vv (r.fortran_vec (), m1.data (), m2.data (), m1_nr * m1_nc); \ |
|
|
134 } \ |
|
|
135 \ |
|
|
136 return r; \ |
|
|
137 } |
|
|
138 |
|
|
139 #define MM_OPS(R, M1, M2) \ |
|
|
140 MM_OP (R, operator +, M1, M2, add) \ |
|
|
141 MM_OP (R, operator -, M1, M2, subtract) \ |
|
|
142 MM_OP (R, product, M1, M2, multiply) \ |
|
|
143 MM_OP (R, quotient, M1, M2, divide) |
|
|
144 |
|
|
145 #define SDM_OP(R, OP, S, DM, OPEQ) \ |
|
|
146 R \ |
|
|
147 OP (const S& s, const DM& dm) \ |
|
|
148 { \ |
|
|
149 int nr = dm.rows (); \ |
|
|
150 int nc = dm.cols (); \ |
|
|
151 \ |
|
|
152 R r (nr, nc, s); \ |
|
|
153 \ |
|
|
154 int len = dm.length (); \ |
|
|
155 \ |
|
|
156 for (int i = 0; i < len; i++) \ |
|
|
157 r.elem (i, i) OPEQ dm.elem (i, i); \ |
|
|
158 \ |
|
|
159 return r; \ |
|
|
160 } |
|
|
161 |
|
|
162 #define SDM_OPS(R, S, DM) \ |
|
|
163 SDM_OP (R, operator +, S, DM, +=) \ |
|
|
164 SDM_OP (R, operator -, S, DM, -=) |
|
|
165 |
|
|
166 #define DMS_OP(R, OP, DM, S, SGN) \ |
|
|
167 R \ |
|
|
168 OP (const DM& dm, const S& s) \ |
|
|
169 { \ |
|
|
170 int nr = dm.rows (); \ |
|
|
171 int nc = dm.cols (); \ |
|
|
172 \ |
|
|
173 R r (nr, nc, SGN s); \ |
|
|
174 \ |
|
|
175 int len = dm.length (); \ |
|
|
176 \ |
|
|
177 for (int i = 0; i < len; i++) \ |
|
|
178 r.elem (i, i) += dm.elem (i, i); \ |
|
|
179 \ |
|
|
180 return r; \ |
|
|
181 } |
|
|
182 |
|
|
183 #define DMS_OPS(R, DM, S) \ |
|
|
184 DMS_OP (R, operator +, DM, S, ) \ |
|
|
185 DMS_OP (R, operator -, DM, S, -) |
|
|
186 |
|
|
187 #define MDM_OP(R, OP, M, DM, OPEQ) \ |
|
|
188 R \ |
|
|
189 OP (const M& m, const DM& dm) \ |
|
|
190 { \ |
|
|
191 R r; \ |
|
|
192 \ |
|
|
193 int m_nr = m.rows (); \ |
|
|
194 int m_nc = m.cols (); \ |
|
|
195 \ |
|
|
196 int dm_nr = dm.rows (); \ |
|
|
197 int dm_nc = dm.cols (); \ |
|
|
198 \ |
|
|
199 if (m_nr != dm_nr || m_nc != dm_nc) \ |
|
|
200 gripe_nonconformant (#OP, m_nr, m_nc, dm_nr, dm_nc); \ |
|
|
201 else \ |
|
|
202 { \ |
|
|
203 r.resize (m_nr, m_nc); \ |
|
|
204 \ |
|
|
205 if (m_nr > 0 && m_nc > 0) \ |
|
|
206 { \ |
|
|
207 r = m; \ |
|
|
208 \ |
|
|
209 int len = dm.length (); \ |
|
|
210 \ |
|
|
211 for (int i = 0; i < len; i++) \ |
|
|
212 r.elem (i, i) OPEQ dm.elem (i, i); \ |
|
|
213 } \ |
|
|
214 } \ |
|
|
215 \ |
|
|
216 return r; \ |
|
|
217 } |
|
|
218 |
|
|
219 #define MDM_MULTIPLY_OP(R, M, DM) \ |
|
|
220 R \ |
|
|
221 operator * (const M& m, const DM& dm) \ |
|
|
222 { \ |
|
|
223 R r; \ |
|
|
224 \ |
|
|
225 int m_nr = m.rows (); \ |
|
|
226 int m_nc = m.cols (); \ |
|
|
227 \ |
|
|
228 int dm_nr = dm.rows (); \ |
|
|
229 int dm_nc = dm.cols (); \ |
|
|
230 \ |
|
|
231 if (m_nc != dm_nr) \ |
|
|
232 gripe_nonconformant ("operator *", m_nr, m_nc, dm_nr, dm_nc); \ |
|
|
233 else \ |
|
|
234 { \ |
|
|
235 r.resize (m_nr, dm_nc, 0.0); \ |
|
|
236 \ |
|
|
237 if (m_nr > 0 && m_nc > 0 && dm_nc == 0) \ |
|
|
238 { \ |
|
|
239 for (int j = 0; j < dm.length (); j++) \ |
|
|
240 { \ |
|
|
241 if (dm.elem (j, j) == 1.0) \ |
|
|
242 { \ |
|
|
243 for (int i = 0; i < m_nr; i++) \ |
|
|
244 r.elem (i, j) = m.elem (i, j); \ |
|
|
245 } \ |
|
|
246 else if (dm.elem (j, j) != 0.0) \ |
|
|
247 { \ |
|
|
248 for (int i = 0; i < m_nr; i++) \ |
|
|
249 r.elem (i, j) = dm.elem (j, j) * m.elem (i, j); \ |
|
|
250 } \ |
|
|
251 } \ |
|
|
252 } \ |
|
|
253 } \ |
|
|
254 \ |
|
|
255 return r; \ |
|
|
256 } |
|
|
257 |
|
|
258 #define MDM_OPS(R, M, DM) \ |
|
|
259 MDM_OP (R, operator +, M, DM, +=) \ |
|
|
260 MDM_OP (R, operator -, M, DM, -=) \ |
|
|
261 MDM_MULTIPLY_OP (R, M, DM) |
|
|
262 |
|
|
263 // XXX FIXME XXX -- DM - M will not give the correct result. |
|
|
264 |
|
|
265 #define DMM_OP(R, OP, DM, M, OPEQ) \ |
|
|
266 R \ |
|
|
267 OP (const DM& dm, const M& m) \ |
|
|
268 { \ |
|
|
269 R r; \ |
|
|
270 \ |
|
|
271 int dm_nr = dm.rows (); \ |
|
|
272 int dm_nc = dm.cols (); \ |
|
|
273 \ |
|
|
274 int m_nr = m.rows (); \ |
|
|
275 int m_nc = m.cols (); \ |
|
|
276 \ |
|
|
277 if (dm_nr != m_nr || dm_nc != m_nc) \ |
|
|
278 gripe_nonconformant (#OP, dm_nr, dm_nc, m_nr, m_nc); \ |
|
|
279 else \ |
|
|
280 { \ |
|
|
281 if (m_nr > 0 && m_nc > 0) \ |
|
|
282 { \ |
|
|
283 r = m; \ |
|
|
284 \ |
|
|
285 int len = dm.length (); \ |
|
|
286 \ |
|
|
287 for (int i = 0; i < len; i++) \ |
|
|
288 r.elem (i, i) OPEQ dm.elem (i, i); \ |
|
|
289 } \ |
|
|
290 else \ |
|
|
291 r.resize (m_nr, m_nc); \ |
|
|
292 } \ |
|
|
293 \ |
|
|
294 return r; \ |
|
|
295 } |
|
|
296 |
|
|
297 #define DMM_MULTIPLY_OP(R, DM, M) \ |
|
|
298 R \ |
|
|
299 operator * (const DM& dm, const M& m) \ |
|
|
300 { \ |
|
|
301 R r; \ |
|
|
302 \ |
|
|
303 int dm_nr = dm.rows (); \ |
|
|
304 int dm_nc = dm.cols (); \ |
|
|
305 \ |
|
|
306 int m_nr = m.rows (); \ |
|
|
307 int m_nc = m.cols (); \ |
|
|
308 \ |
|
|
309 if (dm_nc != m_nr) \ |
|
|
310 gripe_nonconformant ("operator *", dm_nr, dm_nc, m_nr, m_nc); \ |
|
|
311 else \ |
|
|
312 { \ |
|
|
313 r.resize (dm_nr, m_nc, 0.0); \ |
|
|
314 \ |
|
|
315 if (dm_nr > 0 && dm_nc > 0 && m_nc > 0) \ |
|
|
316 { \ |
|
|
317 for (int i = 0; i < dm.length (); i++) \ |
|
|
318 { \ |
|
|
319 if (dm.elem (i, i) == 1.0) \ |
|
|
320 { \ |
|
|
321 for (int j = 0; j < m_nc; j++) \ |
|
|
322 r.elem (i, j) = m.elem (i, j); \ |
|
|
323 } \ |
|
|
324 else if (dm.elem (i, i) != 0.0) \ |
|
|
325 { \ |
|
|
326 for (int j = 0; j < m_nc; j++) \ |
|
|
327 r.elem (i, j) = dm.elem (i, i) * m.elem (i, j); \ |
|
|
328 } \ |
|
|
329 } \ |
|
|
330 } \ |
|
|
331 } \ |
|
|
332 \ |
|
|
333 return r; \ |
|
|
334 } |
|
|
335 |
|
|
336 #define DMM_OPS(R, DM, M) \ |
|
|
337 DMM_OP (R, operator +, DM, M, +=) \ |
|
|
338 DMM_OP (R, operator -, DM, M, -=) \ |
|
|
339 DMM_MULTIPLY_OP(R, DM, M) |
|
|
340 |
|
|
341 #define MM_OP(R, OP, M1, M2, F) \ |
|
|
342 R \ |
|
|
343 OP (const M1& m1, const M2& m2) \ |
|
|
344 { \ |
|
|
345 R r; \ |
|
|
346 \ |
|
|
347 int m1_nr = m1.rows (); \ |
|
|
348 int m1_nc = m1.cols (); \ |
|
|
349 \ |
|
|
350 int m2_nr = m2.rows (); \ |
|
|
351 int m2_nc = m2.cols (); \ |
|
|
352 \ |
|
|
353 if (m1_nr != m2_nr || m1_nc != m2_nc) \ |
|
|
354 gripe_nonconformant (#OP, m1_nr, m1_nc, m2_nr, m2_nc); \ |
|
|
355 else \ |
|
|
356 { \ |
|
|
357 r.resize (m1_nr, m1_nc); \ |
|
|
358 \ |
|
|
359 if (m1_nr > 0 && m1_nc > 0) \ |
|
|
360 F ## _vv (r.fortran_vec (), m1.data (), m2.data (), m1_nr * m1_nc); \ |
|
|
361 } \ |
|
|
362 \ |
|
|
363 return r; \ |
|
|
364 } |
|
|
365 |
|
|
366 #define DMDM_OP(R, OP, DM1, DM2, F) \ |
|
|
367 R \ |
|
|
368 OP (const DM1& dm1, const DM2& dm2) \ |
|
|
369 { \ |
|
|
370 R r; \ |
|
|
371 \ |
|
|
372 int dm1_nr = dm1.rows (); \ |
|
|
373 int dm1_nc = dm1.cols (); \ |
|
|
374 \ |
|
|
375 int dm2_nr = dm2.rows (); \ |
|
|
376 int dm2_nc = dm2.cols (); \ |
|
|
377 \ |
|
|
378 if (dm1_nr != dm2_nr || dm1_nc != dm2_nc) \ |
|
|
379 gripe_nonconformant (#OP, dm1_nr, dm1_nc, dm2_nr, dm2_nc); \ |
|
|
380 else \ |
|
|
381 { \ |
|
|
382 r.resize (dm1_nr, dm1_nc); \ |
|
|
383 \ |
|
|
384 if (dm1_nr > 0 && dm1_nc > 0) \ |
|
|
385 F ## _vv (r.fortran_vec (), dm1.data (), dm2.data (), \ |
|
|
386 dm1_nr * dm2_nc); \ |
|
|
387 } \ |
|
|
388 \ |
|
|
389 return r; \ |
|
|
390 } |
|
|
391 |
|
|
392 #define DMDM_OPS(R, DM1, DM2) \ |
|
|
393 DMDM_OP (R, operator +, DM1, DM2, add) \ |
|
|
394 DMDM_OP (R, operator -, DM1, DM2, subtract) \ |
|
|
395 DMDM_OP (R, product, DM1, DM2, multiply) |
|
|
396 |
|
|
397 #endif |
|
|
398 |
|
|
399 /* |
|
|
400 ;;; Local Variables: *** |
|
|
401 ;;; mode: C++ *** |
|
|
402 ;;; End: *** |
|
|
403 */ |
