|
3
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
3
|
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 |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
3
|
21 |
|
|
22 */ |
|
|
23 |
|
2828
|
24 #if !defined (octave_mx_inlines_h) |
|
|
25 #define octave_mx_inlines_h 1 |
|
2804
|
26 |
|
|
27 #include <cstddef> |
|
|
28 |
|
5525
|
29 #include "quit.h" |
|
|
30 |
|
1650
|
31 #include "oct-cmplx.h" |
|
461
|
32 |
|
2811
|
33 #define VS_OP_FCN(F, OP) \ |
|
|
34 template <class R, class V, class S> \ |
|
3262
|
35 inline void \ |
|
2811
|
36 F ## _vs (R *r, const V *v, size_t n, S s) \ |
|
|
37 { \ |
|
|
38 for (size_t i = 0; i < n; i++) \ |
|
|
39 r[i] = v[i] OP s; \ |
|
|
40 } |
|
|
41 |
|
3769
|
42 VS_OP_FCN (mx_inline_add, +) |
|
|
43 VS_OP_FCN (mx_inline_subtract, -) |
|
|
44 VS_OP_FCN (mx_inline_multiply, *) |
|
|
45 VS_OP_FCN (mx_inline_divide, /) |
|
3
|
46 |
|
2804
|
47 #define VS_OP(F, OP, R, V, S) \ |
|
|
48 static inline R * \ |
|
|
49 F (const V *v, size_t n, S s) \ |
|
|
50 { \ |
|
|
51 R *r = 0; \ |
|
|
52 if (n > 0) \ |
|
|
53 { \ |
|
|
54 r = new R [n]; \ |
|
2811
|
55 F ## _vs (r, v, n, s); \ |
|
2804
|
56 } \ |
|
|
57 return r; \ |
|
|
58 } |
|
3
|
59 |
|
2804
|
60 #define VS_OPS(R, V, S) \ |
|
3769
|
61 VS_OP (mx_inline_add, +, R, V, S) \ |
|
|
62 VS_OP (mx_inline_subtract, -, R, V, S) \ |
|
|
63 VS_OP (mx_inline_multiply, *, R, V, S) \ |
|
|
64 VS_OP (mx_inline_divide, /, R, V, S) |
|
3
|
65 |
|
2804
|
66 VS_OPS (double, double, double) |
|
|
67 VS_OPS (Complex, double, Complex) |
|
|
68 VS_OPS (Complex, Complex, double) |
|
|
69 VS_OPS (Complex, Complex, Complex) |
|
3
|
70 |
|
2811
|
71 #define SV_OP_FCN(F, OP) \ |
|
|
72 template <class R, class S, class V> \ |
|
3262
|
73 inline void \ |
|
2811
|
74 F ## _sv (R *r, S s, const V *v, size_t n) \ |
|
|
75 { \ |
|
|
76 for (size_t i = 0; i < n; i++) \ |
|
|
77 r[i] = s OP v[i]; \ |
|
|
78 } \ |
|
|
79 |
|
3769
|
80 SV_OP_FCN (mx_inline_add, +) |
|
|
81 SV_OP_FCN (mx_inline_subtract, -) |
|
|
82 SV_OP_FCN (mx_inline_multiply, *) |
|
|
83 SV_OP_FCN (mx_inline_divide, /) |
|
2811
|
84 |
|
2804
|
85 #define SV_OP(F, OP, R, S, V) \ |
|
|
86 static inline R * \ |
|
|
87 F (S s, const V *v, size_t n) \ |
|
|
88 { \ |
|
|
89 R *r = 0; \ |
|
|
90 if (n > 0) \ |
|
|
91 { \ |
|
|
92 r = new R [n]; \ |
|
2811
|
93 F ## _sv (r, s, v, n); \ |
|
2804
|
94 } \ |
|
|
95 return r; \ |
|
|
96 } |
|
3
|
97 |
|
2804
|
98 #define SV_OPS(R, S, V) \ |
|
3769
|
99 SV_OP (mx_inline_add, +, R, S, V) \ |
|
|
100 SV_OP (mx_inline_subtract, -, R, S, V) \ |
|
|
101 SV_OP (mx_inline_multiply, *, R, S, V) \ |
|
|
102 SV_OP (mx_inline_divide, /, R, S, V) |
|
3
|
103 |
|
2804
|
104 SV_OPS (double, double, double) |
|
|
105 SV_OPS (Complex, double, Complex) |
|
|
106 SV_OPS (Complex, Complex, double) |
|
|
107 SV_OPS (Complex, Complex, Complex) |
|
3
|
108 |
|
2811
|
109 #define VV_OP_FCN(F, OP) \ |
|
|
110 template <class R, class T1, class T2> \ |
|
3262
|
111 inline void \ |
|
2811
|
112 F ## _vv (R *r, const T1 *v1, const T2 *v2, size_t n) \ |
|
|
113 { \ |
|
|
114 for (size_t i = 0; i < n; i++) \ |
|
|
115 r[i] = v1[i] OP v2[i]; \ |
|
|
116 } \ |
|
|
117 |
|
3769
|
118 VV_OP_FCN (mx_inline_add, +) |
|
|
119 VV_OP_FCN (mx_inline_subtract, -) |
|
|
120 VV_OP_FCN (mx_inline_multiply, *) |
|
|
121 VV_OP_FCN (mx_inline_divide, /) |
|
2811
|
122 |
|
2804
|
123 #define VV_OP(F, OP, R, T1, T2) \ |
|
|
124 static inline R * \ |
|
|
125 F (const T1 *v1, const T2 *v2, size_t n) \ |
|
|
126 { \ |
|
|
127 R *r = 0; \ |
|
|
128 if (n > 0) \ |
|
|
129 { \ |
|
|
130 r = new R [n]; \ |
|
2811
|
131 F ## _vv (r, v1, v2, n); \ |
|
2804
|
132 } \ |
|
|
133 return r; \ |
|
|
134 } |
|
3
|
135 |
|
2804
|
136 #define VV_OPS(R, T1, T2) \ |
|
3769
|
137 VV_OP (mx_inline_add, +, R, T1, T2) \ |
|
|
138 VV_OP (mx_inline_subtract, -, R, T1, T2) \ |
|
|
139 VV_OP (mx_inline_multiply, *, R, T1, T2) \ |
|
|
140 VV_OP (mx_inline_divide, /, R, T1, T2) |
|
3
|
141 |
|
2804
|
142 VV_OPS (double, double, double) |
|
|
143 VV_OPS (Complex, double, Complex) |
|
|
144 VV_OPS (Complex, Complex, double) |
|
|
145 VV_OPS (Complex, Complex, Complex) |
|
3
|
146 |
|
2804
|
147 #define VS_OP2(F, OP, V, S) \ |
|
|
148 static inline V * \ |
|
|
149 F (V *v, size_t n, S s) \ |
|
|
150 { \ |
|
|
151 for (size_t i = 0; i < n; i++) \ |
|
|
152 v[i] OP s; \ |
|
|
153 return v; \ |
|
|
154 } |
|
3
|
155 |
|
2804
|
156 #define VS_OP2S(V, S) \ |
|
3769
|
157 VS_OP2 (mx_inline_add2, +=, V, S) \ |
|
|
158 VS_OP2 (mx_inline_subtract2, -=, V, S) \ |
|
|
159 VS_OP2 (mx_inline_multiply2, *=, V, S) \ |
|
|
160 VS_OP2 (mx_inline_divide2, /=, V, S) \ |
|
|
161 VS_OP2 (mx_inline_copy, =, V, S) |
|
3
|
162 |
|
2804
|
163 VS_OP2S (double, double) |
|
|
164 VS_OP2S (Complex, double) |
|
|
165 VS_OP2S (Complex, Complex) |
|
3
|
166 |
|
2804
|
167 #define VV_OP2(F, OP, T1, T2) \ |
|
|
168 static inline T1 * \ |
|
|
169 F (T1 *v1, const T2 *v2, size_t n) \ |
|
|
170 { \ |
|
|
171 for (size_t i = 0; i < n; i++) \ |
|
|
172 v1[i] OP v2[i]; \ |
|
|
173 return v1; \ |
|
|
174 } |
|
3
|
175 |
|
2804
|
176 #define VV_OP2S(T1, T2) \ |
|
3769
|
177 VV_OP2 (mx_inline_add2, +=, T1, T2) \ |
|
|
178 VV_OP2 (mx_inline_subtract2, -=, T1, T2) \ |
|
|
179 VV_OP2 (mx_inline_multiply2, *=, T1, T2) \ |
|
|
180 VV_OP2 (mx_inline_divide2, /=, T1, T2) \ |
|
|
181 VV_OP2 (mx_inline_copy, =, T1, T2) |
|
3
|
182 |
|
2804
|
183 VV_OP2S (double, double) |
|
|
184 VV_OP2S (Complex, double) |
|
|
185 VV_OP2S (Complex, Complex) |
|
3
|
186 |
|
2804
|
187 #define OP_EQ_FCN(T1, T2) \ |
|
|
188 static inline bool \ |
|
3769
|
189 mx_inline_equal (const T1 *x, const T2 *y, size_t n) \ |
|
2804
|
190 { \ |
|
|
191 for (size_t i = 0; i < n; i++) \ |
|
|
192 if (x[i] != y[i]) \ |
|
|
193 return false; \ |
|
|
194 return true; \ |
|
|
195 } |
|
3
|
196 |
|
2828
|
197 OP_EQ_FCN (bool, bool) |
|
2804
|
198 OP_EQ_FCN (char, char) |
|
|
199 OP_EQ_FCN (double, double) |
|
|
200 OP_EQ_FCN (Complex, Complex) |
|
3
|
201 |
|
2804
|
202 #define OP_DUP_FCN(OP, F, R, T) \ |
|
|
203 static inline R * \ |
|
|
204 F (const T *x, size_t n) \ |
|
|
205 { \ |
|
|
206 R *r = 0; \ |
|
|
207 if (n > 0) \ |
|
|
208 { \ |
|
|
209 r = new R [n]; \ |
|
|
210 for (size_t i = 0; i < n; i++) \ |
|
|
211 r[i] = OP (x[i]); \ |
|
|
212 } \ |
|
|
213 return r; \ |
|
|
214 } |
|
3
|
215 |
|
3769
|
216 OP_DUP_FCN (, mx_inline_dup, double, double) |
|
|
217 OP_DUP_FCN (, mx_inline_dup, Complex, Complex) |
|
3
|
218 |
|
2804
|
219 // These should really return a bool *. Also, they should probably be |
|
|
220 // in with a collection of other element-by-element boolean ops. |
|
3769
|
221 OP_DUP_FCN (0.0 ==, mx_inline_not, double, double) |
|
|
222 OP_DUP_FCN (0.0 ==, mx_inline_not, double, Complex) |
|
3
|
223 |
|
3769
|
224 OP_DUP_FCN (, mx_inline_make_complex, Complex, double) |
|
2804
|
225 |
|
3769
|
226 OP_DUP_FCN (-, mx_inline_change_sign, double, double) |
|
|
227 OP_DUP_FCN (-, mx_inline_change_sign, Complex, Complex) |
|
3
|
228 |
|
3769
|
229 OP_DUP_FCN (real, mx_inline_real_dup, double, Complex) |
|
|
230 OP_DUP_FCN (imag, mx_inline_imag_dup, double, Complex) |
|
|
231 OP_DUP_FCN (conj, mx_inline_conj_dup, Complex, Complex) |
|
3
|
232 |
|
3864
|
233 // Avoid some code duplication. Maybe we should use templates. |
|
|
234 |
|
4015
|
235 #define MX_CUMULATIVE_OP(RET_TYPE, ELT_TYPE, OP) \ |
|
3864
|
236 \ |
|
5275
|
237 octave_idx_type nr = rows (); \ |
|
|
238 octave_idx_type nc = cols (); \ |
|
3864
|
239 \ |
|
|
240 RET_TYPE retval (nr, nc); \ |
|
|
241 \ |
|
|
242 if (nr > 0 && nc > 0) \ |
|
|
243 { \ |
|
|
244 if ((nr == 1 && dim == -1) || dim == 1) \ |
|
|
245 { \ |
|
5275
|
246 for (octave_idx_type i = 0; i < nr; i++) \ |
|
3864
|
247 { \ |
|
|
248 ELT_TYPE t = elem (i, 0); \ |
|
5275
|
249 for (octave_idx_type j = 0; j < nc; j++) \ |
|
3864
|
250 { \ |
|
|
251 retval.elem (i, j) = t; \ |
|
|
252 if (j < nc - 1) \ |
|
|
253 t OP elem (i, j+1); \ |
|
|
254 } \ |
|
|
255 } \ |
|
|
256 } \ |
|
|
257 else \ |
|
|
258 { \ |
|
5275
|
259 for (octave_idx_type j = 0; j < nc; j++) \ |
|
3864
|
260 { \ |
|
|
261 ELT_TYPE t = elem (0, j); \ |
|
5275
|
262 for (octave_idx_type i = 0; i < nr; i++) \ |
|
3864
|
263 { \ |
|
|
264 retval.elem (i, j) = t; \ |
|
|
265 if (i < nr - 1) \ |
|
|
266 t OP elem (i+1, j); \ |
|
|
267 } \ |
|
|
268 } \ |
|
|
269 } \ |
|
|
270 } \ |
|
|
271 \ |
|
|
272 return retval |
|
|
273 |
|
|
274 #define MX_BASE_REDUCTION_OP(RET_TYPE, ROW_EXPR, COL_EXPR, INIT_VAL, \ |
|
|
275 MT_RESULT) \ |
|
|
276 \ |
|
5275
|
277 octave_idx_type nr = rows (); \ |
|
|
278 octave_idx_type nc = cols (); \ |
|
3864
|
279 \ |
|
|
280 RET_TYPE retval; \ |
|
|
281 \ |
|
|
282 if (nr > 0 && nc > 0) \ |
|
|
283 { \ |
|
|
284 if ((nr == 1 && dim == -1) || dim == 1) \ |
|
|
285 { \ |
|
|
286 retval.resize (nr, 1); \ |
|
5275
|
287 for (octave_idx_type i = 0; i < nr; i++) \ |
|
3864
|
288 { \ |
|
|
289 retval.elem (i, 0) = INIT_VAL; \ |
|
5275
|
290 for (octave_idx_type j = 0; j < nc; j++) \ |
|
3864
|
291 { \ |
|
|
292 ROW_EXPR; \ |
|
|
293 } \ |
|
|
294 } \ |
|
|
295 } \ |
|
|
296 else \ |
|
|
297 { \ |
|
|
298 retval.resize (1, nc); \ |
|
5275
|
299 for (octave_idx_type j = 0; j < nc; j++) \ |
|
3864
|
300 { \ |
|
|
301 retval.elem (0, j) = INIT_VAL; \ |
|
5275
|
302 for (octave_idx_type i = 0; i < nr; i++) \ |
|
3864
|
303 { \ |
|
|
304 COL_EXPR; \ |
|
|
305 } \ |
|
|
306 } \ |
|
|
307 } \ |
|
|
308 } \ |
|
4139
|
309 else if (nc == 0 && (nr == 0 || (nr == 1 && dim == -1))) \ |
|
|
310 retval.resize (1, 1, MT_RESULT); \ |
|
4015
|
311 else if (nr == 0 && (dim == 0 || dim == -1)) \ |
|
|
312 retval.resize (1, nc, MT_RESULT); \ |
|
|
313 else if (nc == 0 && dim == 1) \ |
|
|
314 retval.resize (nr, 1, MT_RESULT); \ |
|
|
315 else \ |
|
4139
|
316 retval.resize (nr > 0, nc > 0); \ |
|
3864
|
317 \ |
|
|
318 return retval |
|
|
319 |
|
|
320 #define MX_REDUCTION_OP_ROW_EXPR(OP) \ |
|
|
321 retval.elem (i, 0) OP elem (i, j) |
|
|
322 |
|
|
323 #define MX_REDUCTION_OP_COL_EXPR(OP) \ |
|
|
324 retval.elem (0, j) OP elem (i, j) |
|
|
325 |
|
|
326 #define MX_REDUCTION_OP(RET_TYPE, OP, INIT_VAL, MT_RESULT) \ |
|
|
327 MX_BASE_REDUCTION_OP (RET_TYPE, \ |
|
|
328 MX_REDUCTION_OP_ROW_EXPR (OP), \ |
|
|
329 MX_REDUCTION_OP_COL_EXPR (OP), \ |
|
|
330 INIT_VAL, MT_RESULT) |
|
4015
|
331 |
|
|
332 #define MX_ANY_ALL_OP_ROW_CODE(TEST_OP, TEST_TRUE_VAL) \ |
|
|
333 if (elem (i, j) TEST_OP 0.0) \ |
|
|
334 { \ |
|
|
335 retval.elem (i, 0) = TEST_TRUE_VAL; \ |
|
|
336 break; \ |
|
|
337 } |
|
|
338 |
|
|
339 #define MX_ANY_ALL_OP_COL_CODE(TEST_OP, TEST_TRUE_VAL) \ |
|
|
340 if (elem (i, j) TEST_OP 0.0) \ |
|
|
341 { \ |
|
|
342 retval.elem (0, j) = TEST_TRUE_VAL; \ |
|
|
343 break; \ |
|
|
344 } |
|
|
345 |
|
|
346 #define MX_ANY_ALL_OP(DIM, INIT_VAL, TEST_OP, TEST_TRUE_VAL) \ |
|
|
347 MX_BASE_REDUCTION_OP (boolMatrix, \ |
|
|
348 MX_ANY_ALL_OP_ROW_CODE (TEST_OP, TEST_TRUE_VAL), \ |
|
|
349 MX_ANY_ALL_OP_COL_CODE (TEST_OP, TEST_TRUE_VAL), \ |
|
|
350 INIT_VAL, INIT_VAL) |
|
|
351 |
|
|
352 #define MX_ALL_OP(DIM) MX_ANY_ALL_OP (DIM, true, ==, false) |
|
|
353 |
|
|
354 #define MX_ANY_OP(DIM) MX_ANY_ALL_OP (DIM, false, !=, true) |
|
|
355 |
|
4563
|
356 #define MX_ND_ALL_EXPR elem (iter_idx) == 0 |
|
4556
|
357 |
|
4563
|
358 #define MX_ND_ANY_EXPR elem (iter_idx) != 0 |
|
4556
|
359 |
|
|
360 #define MX_ND_ALL_EVAL(TEST_EXPR) \ |
|
5520
|
361 if (retval(result_idx) && (TEST_EXPR)) \ |
|
|
362 retval(result_idx) = 0; |
|
4556
|
363 |
|
|
364 #define MX_ND_ANY_EVAL(TEST_EXPR) \ |
|
5520
|
365 if (retval(result_idx) || (TEST_EXPR)) \ |
|
|
366 retval(result_idx) = 1; |
|
4569
|
367 |
|
5520
|
368 #define MX_ND_REDUCTION(EVAL_EXPR, INIT_VAL, RET_TYPE) \ |
|
4556
|
369 \ |
|
4569
|
370 RET_TYPE retval; \ |
|
4556
|
371 \ |
|
4932
|
372 dim_vector dv = this->dims (); \ |
|
5520
|
373 int nd = this->ndims (); \ |
|
4563
|
374 \ |
|
|
375 int empty = true; \ |
|
|
376 \ |
|
5520
|
377 for (int i = 0; i < nd; i++) \ |
|
4563
|
378 { \ |
|
|
379 if (dv(i) > 0) \ |
|
|
380 { \ |
|
|
381 empty = false; \ |
|
|
382 break; \ |
|
|
383 } \ |
|
|
384 } \ |
|
|
385 \ |
|
|
386 if (empty) \ |
|
|
387 { \ |
|
|
388 dim_vector retval_dv (1, 1); \ |
|
5520
|
389 retval.resize (retval_dv, INIT_VAL); \ |
|
4563
|
390 return retval; \ |
|
|
391 } \ |
|
|
392 \ |
|
5520
|
393 /* We need to find first non-singleton dim. */ \ |
|
|
394 \ |
|
|
395 if (dim == -1) \ |
|
4556
|
396 { \ |
|
5520
|
397 dim = 0; \ |
|
|
398 \ |
|
|
399 for (int i = 0; i < nd; i++) \ |
|
4563
|
400 { \ |
|
5520
|
401 if (dv(i) != 1) \ |
|
4563
|
402 { \ |
|
|
403 dim = i; \ |
|
|
404 break; \ |
|
|
405 } \ |
|
|
406 } \ |
|
|
407 } \ |
|
5520
|
408 else if (dim >= nd) \ |
|
4563
|
409 { \ |
|
5520
|
410 dim = nd++; \ |
|
|
411 dv.resize (nd, 1); \ |
|
4563
|
412 } \ |
|
|
413 \ |
|
5523
|
414 /* R = op (A, DIM) \ |
|
4563
|
415 \ |
|
5523
|
416 The strategy here is to access the elements of A along the \ |
|
|
417 dimension specified by DIM. This means that we loop over each \ |
|
5615
|
418 element of R and adjust the index into A as needed. Store the \ |
|
|
419 cummulative product of all dimensions of A in CP_SZ. The last \ |
|
|
420 element of CP_SZ is the total number of elements of A. */ \ |
|
4563
|
421 \ |
|
5615
|
422 Array<octave_idx_type> cp_sz (nd+1, 1); \ |
|
|
423 for (int i = 1; i <= nd; i++) \ |
|
5523
|
424 cp_sz(i) = cp_sz(i-1)*dv(i-1); \ |
|
5520
|
425 \ |
|
5523
|
426 octave_idx_type reset_at = cp_sz(dim); \ |
|
|
427 octave_idx_type base_incr = cp_sz(dim+1); \ |
|
|
428 octave_idx_type incr = cp_sz(dim); \ |
|
|
429 octave_idx_type base = 0; \ |
|
|
430 octave_idx_type next_base = base + base_incr; \ |
|
|
431 octave_idx_type iter_idx = base; \ |
|
|
432 octave_idx_type n_elts = dv(dim); \ |
|
4556
|
433 \ |
|
5520
|
434 dv(dim) = 1; \ |
|
4556
|
435 \ |
|
5520
|
436 retval.resize (dv, INIT_VAL); \ |
|
4556
|
437 \ |
|
5523
|
438 octave_idx_type nel = dv.numel (); \ |
|
4556
|
439 \ |
|
5523
|
440 octave_idx_type k = 1; \ |
|
4563
|
441 \ |
|
5523
|
442 for (octave_idx_type result_idx = 0; result_idx < nel; result_idx++) \ |
|
4556
|
443 { \ |
|
5524
|
444 OCTAVE_QUIT; \ |
|
5523
|
445 \ |
|
|
446 for (octave_idx_type j = 0; j < n_elts; j++) \ |
|
|
447 { \ |
|
5524
|
448 OCTAVE_QUIT; \ |
|
5523
|
449 \ |
|
|
450 EVAL_EXPR; \ |
|
5520
|
451 \ |
|
5523
|
452 iter_idx += incr; \ |
|
|
453 } \ |
|
|
454 \ |
|
|
455 if (k == reset_at) \ |
|
5520
|
456 { \ |
|
5523
|
457 base = next_base; \ |
|
|
458 next_base += base_incr; \ |
|
|
459 iter_idx = base; \ |
|
|
460 k = 1; \ |
|
5520
|
461 } \ |
|
|
462 else \ |
|
4556
|
463 { \ |
|
5523
|
464 base++; \ |
|
|
465 iter_idx = base; \ |
|
|
466 k++; \ |
|
5520
|
467 } \ |
|
4556
|
468 } \ |
|
|
469 \ |
|
4871
|
470 retval.chop_trailing_singletons (); \ |
|
|
471 \ |
|
4556
|
472 return retval |
|
4569
|
473 |
|
|
474 #define MX_ND_REAL_OP_REDUCTION(ASN_EXPR, INIT_VAL) \ |
|
5520
|
475 MX_ND_REDUCTION (retval(result_idx) ASN_EXPR, INIT_VAL, NDArray) |
|
4569
|
476 |
|
|
477 #define MX_ND_COMPLEX_OP_REDUCTION(ASN_EXPR, INIT_VAL) \ |
|
5520
|
478 MX_ND_REDUCTION (retval(result_idx) ASN_EXPR, INIT_VAL, ComplexNDArray) |
|
4569
|
479 |
|
|
480 #define MX_ND_ANY_ALL_REDUCTION(EVAL_EXPR, VAL) \ |
|
5520
|
481 MX_ND_REDUCTION (EVAL_EXPR, VAL, boolNDArray) |
|
4556
|
482 |
|
5523
|
483 #define MX_ND_CUMULATIVE_OP(RET_TYPE, ACC_TYPE, INIT_VAL, OP) \ |
|
|
484 \ |
|
4584
|
485 RET_TYPE retval; \ |
|
|
486 \ |
|
4932
|
487 dim_vector dv = this->dims (); \ |
|
5523
|
488 int nd = this->ndims (); \ |
|
4584
|
489 \ |
|
|
490 int empty = true; \ |
|
|
491 \ |
|
5523
|
492 for (int i = 0; i < nd; i++) \ |
|
4584
|
493 { \ |
|
|
494 if (dv(i) > 0) \ |
|
|
495 { \ |
|
|
496 empty = false; \ |
|
|
497 break; \ |
|
|
498 } \ |
|
|
499 } \ |
|
|
500 \ |
|
|
501 if (empty) \ |
|
|
502 { \ |
|
5523
|
503 dim_vector retval_dv (1, 1); \ |
|
|
504 retval.resize (retval_dv, INIT_VAL); \ |
|
4584
|
505 return retval; \ |
|
|
506 } \ |
|
|
507 \ |
|
5523
|
508 /* We need to find first non-singleton dim. */ \ |
|
|
509 \ |
|
4584
|
510 if (dim == -1) \ |
|
|
511 { \ |
|
5523
|
512 dim = 0; \ |
|
|
513 \ |
|
|
514 for (int i = 0; i < nd; i++) \ |
|
4584
|
515 { \ |
|
5523
|
516 if (dv(i) != 1) \ |
|
4584
|
517 { \ |
|
|
518 dim = i; \ |
|
|
519 break; \ |
|
|
520 } \ |
|
|
521 } \ |
|
|
522 } \ |
|
5523
|
523 else if (dim >= nd) \ |
|
4584
|
524 { \ |
|
5523
|
525 dim = nd++; \ |
|
|
526 dv.resize (nd, 1); \ |
|
4584
|
527 } \ |
|
|
528 \ |
|
5523
|
529 /* R = op (A, DIM) \ |
|
4584
|
530 \ |
|
5523
|
531 The strategy here is to access the elements of A along the \ |
|
|
532 dimension specified by DIM. This means that we loop over each \ |
|
5611
|
533 element of R and adjust the index into A as needed. Store the \ |
|
5614
|
534 cummulative product of all dimensions of A in CP_SZ. The last \ |
|
|
535 element of CP_SZ is the total number of elements of A. */ \ |
|
4584
|
536 \ |
|
5611
|
537 Array<octave_idx_type> cp_sz (nd+1, 1); \ |
|
|
538 for (int i = 1; i <= nd; i++) \ |
|
5523
|
539 cp_sz(i) = cp_sz(i-1)*dv(i-1); \ |
|
4584
|
540 \ |
|
5523
|
541 octave_idx_type reset_at = cp_sz(dim); \ |
|
|
542 octave_idx_type base_incr = cp_sz(dim+1); \ |
|
|
543 octave_idx_type incr = cp_sz(dim); \ |
|
|
544 octave_idx_type base = 0; \ |
|
|
545 octave_idx_type next_base = base + base_incr; \ |
|
|
546 octave_idx_type iter_idx = base; \ |
|
|
547 octave_idx_type n_elts = dv(dim); \ |
|
4584
|
548 \ |
|
5523
|
549 retval.resize (dv, INIT_VAL); \ |
|
|
550 \ |
|
|
551 octave_idx_type nel = dv.numel () / n_elts; \ |
|
|
552 \ |
|
|
553 octave_idx_type k = 1; \ |
|
4584
|
554 \ |
|
5523
|
555 for (octave_idx_type i = 0; i < nel; i++) \ |
|
4584
|
556 { \ |
|
5523
|
557 OCTAVE_QUIT; \ |
|
|
558 \ |
|
|
559 ACC_TYPE prev_val = INIT_VAL; \ |
|
|
560 \ |
|
|
561 for (octave_idx_type j = 0; j < n_elts; j++) \ |
|
4584
|
562 { \ |
|
5523
|
563 OCTAVE_QUIT; \ |
|
4584
|
564 \ |
|
5523
|
565 if (j == 0) \ |
|
|
566 { \ |
|
|
567 retval(iter_idx) = elem (iter_idx); \ |
|
|
568 prev_val = retval(iter_idx); \ |
|
4584
|
569 } \ |
|
|
570 else \ |
|
5523
|
571 { \ |
|
|
572 prev_val = prev_val OP elem (iter_idx); \ |
|
|
573 retval(iter_idx) = prev_val; \ |
|
|
574 } \ |
|
|
575 \ |
|
|
576 iter_idx += incr; \ |
|
4584
|
577 } \ |
|
|
578 \ |
|
5523
|
579 if (k == reset_at) \ |
|
|
580 { \ |
|
|
581 base = next_base; \ |
|
|
582 next_base += base_incr; \ |
|
|
583 iter_idx = base; \ |
|
|
584 k = 1; \ |
|
|
585 } \ |
|
|
586 else \ |
|
|
587 { \ |
|
|
588 base++; \ |
|
|
589 iter_idx = base; \ |
|
|
590 k++; \ |
|
|
591 } \ |
|
|
592 } \ |
|
4584
|
593 \ |
|
5523
|
594 retval.chop_trailing_singletons (); \ |
|
|
595 \ |
|
4584
|
596 return retval |
|
|
597 |
|
2804
|
598 #endif |
|
3
|
599 |
|
|
600 /* |
|
|
601 ;;; Local Variables: *** |
|
|
602 ;;; mode: C++ *** |
|
|
603 ;;; End: *** |
|
|
604 */ |
