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