4514
|
1 // N-D Array manipulations. |
|
2 /* |
|
3 |
|
4 Copyright (C) 1996, 1997 John W. Eaton |
|
5 |
|
6 This file is part of Octave. |
|
7 |
|
8 Octave is free software; you can redistribute it and/or modify it |
|
9 under the terms of the GNU General Public License as published by the |
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
11 later version. |
|
12 |
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
16 for more details. |
|
17 |
|
18 You should have received a copy of the GNU General Public License |
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
21 |
|
22 */ |
|
23 |
|
24 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
25 #pragma implementation |
|
26 #endif |
|
27 |
|
28 #ifdef HAVE_CONFIG_H |
|
29 #include <config.h> |
|
30 #endif |
|
31 |
4687
|
32 #include <cfloat> |
4780
|
33 #include <vector> |
4687
|
34 |
4588
|
35 #include "Array-util.h" |
4514
|
36 #include "CNDArray.h" |
|
37 #include "mx-base.h" |
4773
|
38 #include "f77-fcn.h" |
4514
|
39 #include "lo-ieee.h" |
4687
|
40 #include "lo-mappers.h" |
4514
|
41 |
4773
|
42 #if defined (HAVE_FFTW3) |
4780
|
43 #include "oct-fftw.h" |
4773
|
44 #else |
|
45 extern "C" |
|
46 { |
|
47 // Note that the original complex fft routines were not written for |
|
48 // double complex arguments. They have been modified by adding an |
|
49 // implicit double precision (a-h,o-z) statement at the beginning of |
|
50 // each subroutine. |
|
51 |
|
52 F77_RET_T |
|
53 F77_FUNC (cffti, CFFTI) (const int&, Complex*); |
|
54 |
|
55 F77_RET_T |
|
56 F77_FUNC (cfftf, CFFTF) (const int&, Complex*, Complex*); |
|
57 |
|
58 F77_RET_T |
|
59 F77_FUNC (cfftb, CFFTB) (const int&, Complex*, Complex*); |
|
60 } |
|
61 #endif |
|
62 |
|
63 #if defined (HAVE_FFTW3) |
|
64 ComplexNDArray |
|
65 ComplexNDArray::fourier (int dim) const |
|
66 { |
|
67 dim_vector dv = dims (); |
|
68 |
|
69 if (dim > dv.length () || dim < 0) |
|
70 return ComplexNDArray (); |
|
71 |
|
72 int stride = 1; |
|
73 int n = dv(dim); |
|
74 |
|
75 for (int i = 0; i < dim; i++) |
|
76 stride *= dv(i); |
|
77 |
|
78 int howmany = numel () / dv (dim); |
|
79 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
80 int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride); |
|
81 int dist = (stride == 1 ? n : 1); |
|
82 |
|
83 const Complex *in (fortran_vec ()); |
|
84 ComplexNDArray retval (dv); |
|
85 Complex *out (retval.fortran_vec ()); |
|
86 |
|
87 // Need to be careful here about the distance between fft's |
|
88 for (int k = 0; k < nloop; k++) |
|
89 octave_fftw::fft (in + k * stride * n, out + k * stride * n, |
|
90 n, howmany, stride, dist); |
|
91 |
|
92 return retval; |
|
93 } |
|
94 |
|
95 ComplexNDArray |
4816
|
96 ComplexNDArray::ifourier (int dim) const |
4773
|
97 { |
|
98 dim_vector dv = dims (); |
|
99 |
|
100 if (dim > dv.length () || dim < 0) |
|
101 return ComplexNDArray (); |
|
102 |
|
103 int stride = 1; |
|
104 int n = dv(dim); |
|
105 |
|
106 for (int i = 0; i < dim; i++) |
|
107 stride *= dv(i); |
|
108 |
|
109 int howmany = numel () / dv (dim); |
|
110 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
111 int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride); |
|
112 int dist = (stride == 1 ? n : 1); |
|
113 |
|
114 const Complex *in (fortran_vec ()); |
|
115 ComplexNDArray retval (dv); |
|
116 Complex *out (retval.fortran_vec ()); |
|
117 |
|
118 // Need to be careful here about the distance between fft's |
|
119 for (int k = 0; k < nloop; k++) |
|
120 octave_fftw::ifft (in + k * stride * n, out + k * stride * n, |
|
121 n, howmany, stride, dist); |
|
122 |
|
123 return retval; |
|
124 } |
|
125 |
|
126 ComplexNDArray |
|
127 ComplexNDArray::fourier2d (void) const |
|
128 { |
|
129 dim_vector dv = dims(); |
|
130 if (dv.length () < 2) |
|
131 return ComplexNDArray (); |
|
132 |
|
133 dim_vector dv2(dv(0), dv(1)); |
|
134 const Complex *in = fortran_vec (); |
|
135 ComplexNDArray retval (dv); |
|
136 Complex *out = retval.fortran_vec (); |
|
137 int howmany = numel() / dv(0) / dv(1); |
|
138 int dist = dv(0) * dv(1); |
|
139 |
|
140 for (int i=0; i < howmany; i++) |
|
141 octave_fftw::fftNd (in + i*dist, out + i*dist, 2, dv2); |
|
142 |
|
143 return retval; |
|
144 } |
|
145 |
|
146 ComplexNDArray |
|
147 ComplexNDArray::ifourier2d (void) const |
|
148 { |
|
149 dim_vector dv = dims(); |
|
150 if (dv.length () < 2) |
|
151 return ComplexNDArray (); |
|
152 |
|
153 dim_vector dv2(dv(0), dv(1)); |
|
154 const Complex *in = fortran_vec (); |
|
155 ComplexNDArray retval (dv); |
|
156 Complex *out = retval.fortran_vec (); |
|
157 int howmany = numel() / dv(0) / dv(1); |
|
158 int dist = dv(0) * dv(1); |
|
159 |
|
160 for (int i=0; i < howmany; i++) |
|
161 octave_fftw::ifftNd (in + i*dist, out + i*dist, 2, dv2); |
|
162 |
|
163 return retval; |
|
164 } |
|
165 |
|
166 ComplexNDArray |
|
167 ComplexNDArray::fourierNd (void) const |
|
168 { |
|
169 dim_vector dv = dims (); |
|
170 int rank = dv.length (); |
|
171 |
|
172 const Complex *in (fortran_vec ()); |
|
173 ComplexNDArray retval (dv); |
|
174 Complex *out (retval.fortran_vec ()); |
|
175 |
|
176 octave_fftw::fftNd (in, out, rank, dv); |
|
177 |
|
178 return retval; |
|
179 } |
|
180 |
|
181 ComplexNDArray |
|
182 ComplexNDArray::ifourierNd (void) const |
|
183 { |
|
184 dim_vector dv = dims (); |
|
185 int rank = dv.length (); |
|
186 |
|
187 const Complex *in (fortran_vec ()); |
|
188 ComplexNDArray retval (dv); |
|
189 Complex *out (retval.fortran_vec ()); |
|
190 |
|
191 octave_fftw::ifftNd (in, out, rank, dv); |
|
192 |
|
193 return retval; |
|
194 } |
|
195 |
|
196 #else |
|
197 ComplexNDArray |
|
198 ComplexNDArray::fourier (int dim) const |
|
199 { |
|
200 dim_vector dv = dims (); |
|
201 |
|
202 if (dim > dv.length () || dim < 0) |
|
203 return ComplexNDArray (); |
|
204 |
|
205 ComplexNDArray retval (dv); |
|
206 int npts = dv(dim); |
|
207 int nn = 4*npts+15; |
|
208 Array<Complex> wsave (nn); |
|
209 Complex *pwsave = wsave.fortran_vec (); |
|
210 |
|
211 OCTAVE_LOCAL_BUFFER (Complex, tmp, npts); |
|
212 |
|
213 int stride = 1; |
|
214 |
|
215 for (int i = 0; i < dim; i++) |
|
216 stride *= dv(i); |
|
217 |
|
218 int howmany = numel () / npts; |
|
219 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
220 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
221 int dist = (stride == 1 ? npts : 1); |
|
222 |
|
223 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
224 |
|
225 for (int k = 0; k < nloop; k++) |
|
226 { |
|
227 for (int j = 0; j < howmany; j++) |
|
228 { |
|
229 OCTAVE_QUIT; |
|
230 |
|
231 for (int i = 0; i < npts; i++) |
|
232 tmp[i] = elem((i + k*npts)*stride + j*dist); |
|
233 |
|
234 F77_FUNC (cfftf, CFFTF) (npts, tmp, pwsave); |
|
235 |
|
236 for (int i = 0; i < npts; i++) |
|
237 retval ((i + k*npts)*stride + j*dist) = tmp[i]; |
|
238 } |
|
239 } |
|
240 |
|
241 return retval; |
|
242 } |
|
243 |
|
244 ComplexNDArray |
|
245 ComplexNDArray::ifourier (int dim) const |
|
246 { |
|
247 dim_vector dv = dims (); |
|
248 |
|
249 if (dim > dv.length () || dim < 0) |
|
250 return ComplexNDArray (); |
|
251 |
|
252 ComplexNDArray retval (dv); |
|
253 int npts = dv(dim); |
|
254 int nn = 4*npts+15; |
|
255 Array<Complex> wsave (nn); |
|
256 Complex *pwsave = wsave.fortran_vec (); |
|
257 |
|
258 OCTAVE_LOCAL_BUFFER (Complex, tmp, npts); |
|
259 |
|
260 int stride = 1; |
|
261 |
|
262 for (int i = 0; i < dim; i++) |
|
263 stride *= dv(i); |
|
264 |
|
265 int howmany = numel () / npts; |
|
266 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
267 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
268 int dist = (stride == 1 ? npts : 1); |
|
269 |
|
270 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
271 |
|
272 for (int k = 0; k < nloop; k++) |
|
273 { |
|
274 for (int j = 0; j < howmany; j++) |
|
275 { |
|
276 OCTAVE_QUIT; |
|
277 |
|
278 for (int i = 0; i < npts; i++) |
|
279 tmp[i] = elem((i + k*npts)*stride + j*dist); |
|
280 |
|
281 F77_FUNC (cfftb, CFFTB) (npts, tmp, pwsave); |
|
282 |
|
283 for (int i = 0; i < npts; i++) |
|
284 retval ((i + k*npts)*stride + j*dist) = tmp[i] / |
|
285 static_cast<double> (npts); |
|
286 } |
|
287 } |
|
288 |
|
289 return retval; |
|
290 } |
|
291 |
|
292 ComplexNDArray |
|
293 ComplexNDArray::fourier2d (void) const |
|
294 { |
|
295 dim_vector dv = dims (); |
|
296 dim_vector dv2 (dv(0), dv(1)); |
|
297 int rank = 2; |
|
298 ComplexNDArray retval (*this); |
|
299 int stride = 1; |
|
300 |
|
301 for (int i = 0; i < rank; i++) |
|
302 { |
|
303 int npts = dv2(i); |
|
304 int nn = 4*npts+15; |
|
305 Array<Complex> wsave (nn); |
|
306 Complex *pwsave = wsave.fortran_vec (); |
|
307 Array<Complex> row (npts); |
|
308 Complex *prow = row.fortran_vec (); |
|
309 |
|
310 int howmany = numel () / npts; |
|
311 howmany = (stride == 1 ? howmany : |
|
312 (howmany > stride ? stride : howmany)); |
|
313 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
314 int dist = (stride == 1 ? npts : 1); |
|
315 |
|
316 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
317 |
|
318 for (int k = 0; k < nloop; k++) |
|
319 { |
|
320 for (int j = 0; j < howmany; j++) |
|
321 { |
|
322 OCTAVE_QUIT; |
|
323 |
|
324 for (int l = 0; l < npts; l++) |
|
325 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
326 |
|
327 F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave); |
|
328 |
|
329 for (int l = 0; l < npts; l++) |
|
330 retval ((l + k*npts)*stride + j*dist) = prow[l]; |
|
331 } |
|
332 } |
|
333 |
|
334 stride *= dv2(i); |
|
335 } |
|
336 |
|
337 return retval; |
|
338 } |
|
339 |
|
340 ComplexNDArray |
|
341 ComplexNDArray::ifourier2d (void) const |
|
342 { |
|
343 dim_vector dv = dims(); |
|
344 dim_vector dv2 (dv(0), dv(1)); |
|
345 int rank = 2; |
|
346 ComplexNDArray retval (*this); |
|
347 int stride = 1; |
|
348 |
|
349 for (int i = 0; i < rank; i++) |
|
350 { |
|
351 int npts = dv2(i); |
|
352 int nn = 4*npts+15; |
|
353 Array<Complex> wsave (nn); |
|
354 Complex *pwsave = wsave.fortran_vec (); |
|
355 Array<Complex> row (npts); |
|
356 Complex *prow = row.fortran_vec (); |
|
357 |
|
358 int howmany = numel () / npts; |
|
359 howmany = (stride == 1 ? howmany : |
|
360 (howmany > stride ? stride : howmany)); |
|
361 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
362 int dist = (stride == 1 ? npts : 1); |
|
363 |
|
364 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
365 |
|
366 for (int k = 0; k < nloop; k++) |
|
367 { |
|
368 for (int j = 0; j < howmany; j++) |
|
369 { |
|
370 OCTAVE_QUIT; |
|
371 |
|
372 for (int l = 0; l < npts; l++) |
|
373 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
374 |
|
375 F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave); |
|
376 |
|
377 for (int l = 0; l < npts; l++) |
|
378 retval ((l + k*npts)*stride + j*dist) = prow[l] / |
|
379 static_cast<double> (npts); |
|
380 } |
|
381 } |
|
382 |
|
383 stride *= dv2(i); |
|
384 } |
|
385 |
|
386 return retval; |
|
387 } |
|
388 |
|
389 ComplexNDArray |
|
390 ComplexNDArray::fourierNd (void) const |
|
391 { |
|
392 dim_vector dv = dims (); |
|
393 int rank = dv.length (); |
|
394 ComplexNDArray retval (*this); |
|
395 int stride = 1; |
|
396 |
|
397 for (int i = 0; i < rank; i++) |
|
398 { |
|
399 int npts = dv(i); |
|
400 int nn = 4*npts+15; |
|
401 Array<Complex> wsave (nn); |
|
402 Complex *pwsave = wsave.fortran_vec (); |
|
403 Array<Complex> row (npts); |
|
404 Complex *prow = row.fortran_vec (); |
|
405 |
|
406 int howmany = numel () / npts; |
|
407 howmany = (stride == 1 ? howmany : |
|
408 (howmany > stride ? stride : howmany)); |
|
409 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
410 int dist = (stride == 1 ? npts : 1); |
|
411 |
|
412 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
413 |
|
414 for (int k = 0; k < nloop; k++) |
|
415 { |
|
416 for (int j = 0; j < howmany; j++) |
|
417 { |
|
418 OCTAVE_QUIT; |
|
419 |
|
420 for (int l = 0; l < npts; l++) |
|
421 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
422 |
|
423 F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave); |
|
424 |
|
425 for (int l = 0; l < npts; l++) |
|
426 retval ((l + k*npts)*stride + j*dist) = prow[l]; |
|
427 } |
|
428 } |
|
429 |
|
430 stride *= dv(i); |
|
431 } |
|
432 |
|
433 return retval; |
|
434 } |
|
435 |
|
436 ComplexNDArray |
|
437 ComplexNDArray::ifourierNd (void) const |
|
438 { |
|
439 dim_vector dv = dims (); |
|
440 int rank = dv.length (); |
|
441 ComplexNDArray retval (*this); |
|
442 int stride = 1; |
|
443 |
|
444 for (int i = 0; i < rank; i++) |
|
445 { |
|
446 int npts = dv(i); |
|
447 int nn = 4*npts+15; |
|
448 Array<Complex> wsave (nn); |
|
449 Complex *pwsave = wsave.fortran_vec (); |
|
450 Array<Complex> row (npts); |
|
451 Complex *prow = row.fortran_vec (); |
|
452 |
|
453 int howmany = numel () / npts; |
|
454 howmany = (stride == 1 ? howmany : |
|
455 (howmany > stride ? stride : howmany)); |
|
456 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
457 int dist = (stride == 1 ? npts : 1); |
|
458 |
|
459 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
460 |
|
461 for (int k = 0; k < nloop; k++) |
|
462 { |
|
463 for (int j = 0; j < howmany; j++) |
|
464 { |
|
465 OCTAVE_QUIT; |
|
466 |
|
467 for (int l = 0; l < npts; l++) |
|
468 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
469 |
|
470 F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave); |
|
471 |
|
472 for (int l = 0; l < npts; l++) |
|
473 retval ((l + k*npts)*stride + j*dist) = prow[l] / |
|
474 static_cast<double> (npts); |
|
475 } |
|
476 } |
|
477 |
|
478 stride *= dv(i); |
|
479 } |
|
480 |
|
481 return retval; |
|
482 } |
|
483 |
|
484 #endif |
|
485 |
4543
|
486 // unary operations |
|
487 |
|
488 boolNDArray |
|
489 ComplexNDArray::operator ! (void) const |
|
490 { |
|
491 boolNDArray b (dims ()); |
|
492 |
|
493 for (int i = 0; i < length (); i++) |
|
494 b.elem (i) = elem (i) != 0.0; |
|
495 |
|
496 return b; |
|
497 } |
|
498 |
4514
|
499 // XXX FIXME XXX -- this is not quite the right thing. |
|
500 |
4687
|
501 bool |
|
502 ComplexNDArray::any_element_is_inf_or_nan (void) const |
|
503 { |
|
504 int nel = nelem (); |
|
505 |
|
506 for (int i = 0; i < nel; i++) |
|
507 { |
|
508 Complex val = elem (i); |
|
509 if (xisinf (val) || xisnan (val)) |
|
510 return true; |
|
511 } |
|
512 return false; |
|
513 } |
|
514 |
|
515 // Return true if no elements have imaginary components. |
|
516 |
|
517 bool |
|
518 ComplexNDArray::all_elements_are_real (void) const |
|
519 { |
|
520 int nel = nelem (); |
|
521 |
|
522 for (int i = 0; i < nel; i++) |
|
523 { |
|
524 double ip = imag (elem (i)); |
|
525 |
|
526 if (ip != 0.0 || lo_ieee_signbit (ip)) |
|
527 return false; |
|
528 } |
|
529 |
|
530 return true; |
|
531 } |
|
532 |
|
533 // Return nonzero if any element of CM has a non-integer real or |
|
534 // imaginary part. Also extract the largest and smallest (real or |
|
535 // imaginary) values and return them in MAX_VAL and MIN_VAL. |
|
536 |
|
537 bool |
|
538 ComplexNDArray::all_integers (double& max_val, double& min_val) const |
|
539 { |
|
540 int nel = nelem (); |
|
541 |
|
542 if (nel > 0) |
|
543 { |
|
544 Complex val = elem (0); |
|
545 |
|
546 double r_val = real (val); |
|
547 double i_val = imag (val); |
|
548 |
|
549 max_val = r_val; |
|
550 min_val = r_val; |
|
551 |
|
552 if (i_val > max_val) |
|
553 max_val = i_val; |
|
554 |
|
555 if (i_val < max_val) |
|
556 min_val = i_val; |
|
557 } |
|
558 else |
|
559 return false; |
|
560 |
|
561 for (int i = 0; i < nel; i++) |
|
562 { |
|
563 Complex val = elem (i); |
|
564 |
|
565 double r_val = real (val); |
|
566 double i_val = imag (val); |
|
567 |
|
568 if (r_val > max_val) |
|
569 max_val = r_val; |
|
570 |
|
571 if (i_val > max_val) |
|
572 max_val = i_val; |
|
573 |
|
574 if (r_val < min_val) |
|
575 min_val = r_val; |
|
576 |
|
577 if (i_val < min_val) |
|
578 min_val = i_val; |
|
579 |
|
580 if (D_NINT (r_val) != r_val || D_NINT (i_val) != i_val) |
|
581 return false; |
|
582 } |
|
583 |
|
584 return true; |
|
585 } |
|
586 |
|
587 bool |
|
588 ComplexNDArray::too_large_for_float (void) const |
|
589 { |
|
590 int nel = nelem (); |
|
591 |
|
592 for (int i = 0; i < nel; i++) |
|
593 { |
|
594 Complex val = elem (i); |
|
595 |
|
596 double r_val = real (val); |
|
597 double i_val = imag (val); |
|
598 |
|
599 if (r_val > FLT_MAX |
|
600 || i_val > FLT_MAX |
|
601 || r_val < FLT_MIN |
|
602 || i_val < FLT_MIN) |
|
603 return true; |
|
604 } |
|
605 |
|
606 return false; |
|
607 } |
|
608 |
4556
|
609 boolNDArray |
4514
|
610 ComplexNDArray::all (int dim) const |
|
611 { |
4569
|
612 MX_ND_ANY_ALL_REDUCTION |
|
613 (MX_ND_ALL_EVAL (elem (iter_idx) == Complex (0, 0)), true); |
4514
|
614 } |
|
615 |
4556
|
616 boolNDArray |
4514
|
617 ComplexNDArray::any (int dim) const |
|
618 { |
4569
|
619 MX_ND_ANY_ALL_REDUCTION |
|
620 (MX_ND_ANY_EVAL (elem (iter_idx) != Complex (0, 0)), false); |
|
621 } |
|
622 |
4584
|
623 ComplexNDArray |
4569
|
624 ComplexNDArray::cumprod (int dim) const |
|
625 { |
4584
|
626 MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (1, 0), *); |
4569
|
627 } |
|
628 |
4584
|
629 ComplexNDArray |
4569
|
630 ComplexNDArray::cumsum (int dim) const |
|
631 { |
4584
|
632 MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (0, 0), +); |
4569
|
633 } |
|
634 |
|
635 ComplexNDArray |
|
636 ComplexNDArray::prod (int dim) const |
|
637 { |
|
638 MX_ND_COMPLEX_OP_REDUCTION (*= elem (iter_idx), Complex (1, 0)); |
|
639 } |
|
640 |
|
641 ComplexNDArray |
|
642 ComplexNDArray::sumsq (int dim) const |
|
643 { |
|
644 MX_ND_COMPLEX_OP_REDUCTION |
|
645 (+= imag (elem (iter_idx)) |
|
646 ? elem (iter_idx) * conj (elem (iter_idx)) |
|
647 : std::pow (elem (iter_idx), 2), Complex (0, 0)); |
|
648 } |
|
649 |
|
650 ComplexNDArray |
|
651 ComplexNDArray::sum (int dim) const |
|
652 { |
|
653 MX_ND_COMPLEX_OP_REDUCTION (+= elem (iter_idx), Complex (0, 0)); |
|
654 } |
|
655 |
4806
|
656 int |
|
657 ComplexNDArray::cat (const ComplexNDArray& ra_arg, int dim, int iidx, int move) |
4758
|
658 { |
4806
|
659 return ::cat_ra(*this, ra_arg, dim, iidx, move); |
4758
|
660 } |
|
661 |
4844
|
662 static const Complex Complex_NaN_result (octave_NaN, octave_NaN); |
|
663 |
|
664 ComplexNDArray |
|
665 ComplexNDArray::max (int dim) const |
|
666 { |
|
667 ArrayN<int> dummy_idx; |
|
668 return max (dummy_idx, dim); |
|
669 } |
|
670 |
|
671 ComplexNDArray |
|
672 ComplexNDArray::max (ArrayN<int>& idx_arg, int dim) const |
|
673 { |
|
674 dim_vector dv = dims (); |
|
675 dim_vector dr = dims (); |
|
676 |
|
677 if (dv.numel () == 0 || dim > dv.length () || dim < 0) |
|
678 return ComplexNDArray (); |
|
679 |
|
680 dr(dim) = 1; |
|
681 |
|
682 ComplexNDArray result (dr); |
|
683 idx_arg.resize (dr); |
|
684 |
|
685 int x_stride = 1; |
|
686 int x_len = dv(dim); |
|
687 for (int i = 0; i < dim; i++) |
|
688 x_stride *= dv(i); |
|
689 |
|
690 for (int i = 0; i < dr.numel (); i++) |
|
691 { |
|
692 int x_offset; |
|
693 if (x_stride == 1) |
|
694 x_offset = i * x_len; |
|
695 else |
|
696 { |
|
697 int x_offset2 = 0; |
|
698 x_offset = i; |
|
699 while (x_offset >= x_stride) |
|
700 { |
|
701 x_offset -= x_stride; |
|
702 x_offset2++; |
|
703 } |
|
704 x_offset += x_offset2 * x_stride * x_len; |
|
705 } |
|
706 |
|
707 int idx_j; |
|
708 |
|
709 Complex tmp_max; |
|
710 |
|
711 double abs_max = octave_NaN; |
|
712 |
|
713 for (idx_j = 0; idx_j < x_len; idx_j++) |
|
714 { |
|
715 tmp_max = elem (idx_j * x_stride + x_offset); |
|
716 |
|
717 if (! octave_is_NaN_or_NA (tmp_max)) |
|
718 { |
|
719 abs_max = ::abs(tmp_max); |
|
720 break; |
|
721 } |
|
722 } |
|
723 |
|
724 for (int j = idx_j+1; j < x_len; j++) |
|
725 { |
|
726 Complex tmp = elem (j * x_stride + x_offset); |
|
727 |
|
728 if (octave_is_NaN_or_NA (tmp)) |
|
729 continue; |
|
730 |
|
731 double abs_tmp = ::abs (tmp); |
|
732 |
|
733 if (abs_tmp > abs_max) |
|
734 { |
|
735 idx_j = j; |
|
736 tmp_max = tmp; |
|
737 abs_max = abs_tmp; |
|
738 } |
|
739 } |
|
740 |
|
741 if (octave_is_NaN_or_NA (tmp_max)) |
|
742 { |
|
743 result.elem (i) = Complex_NaN_result; |
|
744 idx_arg.elem (i) = 0; |
|
745 } |
|
746 else |
|
747 { |
|
748 result.elem (i) = tmp_max; |
|
749 idx_arg.elem (i) = idx_j; |
|
750 } |
|
751 } |
|
752 |
|
753 return result; |
|
754 } |
|
755 |
|
756 ComplexNDArray |
|
757 ComplexNDArray::min (int dim) const |
|
758 { |
|
759 ArrayN<int> dummy_idx; |
|
760 return min (dummy_idx, dim); |
|
761 } |
|
762 |
|
763 ComplexNDArray |
|
764 ComplexNDArray::min (ArrayN<int>& idx_arg, int dim) const |
|
765 { |
|
766 dim_vector dv = dims (); |
|
767 dim_vector dr = dims (); |
|
768 |
|
769 if (dv.numel () == 0 || dim > dv.length () || dim < 0) |
|
770 return ComplexNDArray (); |
|
771 |
|
772 dr(dim) = 1; |
|
773 |
|
774 ComplexNDArray result (dr); |
|
775 idx_arg.resize (dr); |
|
776 |
|
777 int x_stride = 1; |
|
778 int x_len = dv(dim); |
|
779 for (int i = 0; i < dim; i++) |
|
780 x_stride *= dv(i); |
|
781 |
|
782 for (int i = 0; i < dr.numel (); i++) |
|
783 { |
|
784 int x_offset; |
|
785 if (x_stride == 1) |
|
786 x_offset = i * x_len; |
|
787 else |
|
788 { |
|
789 int x_offset2 = 0; |
|
790 x_offset = i; |
|
791 while (x_offset >= x_stride) |
|
792 { |
|
793 x_offset -= x_stride; |
|
794 x_offset2++; |
|
795 } |
|
796 x_offset += x_offset2 * x_stride * x_len; |
|
797 } |
|
798 |
|
799 int idx_j; |
|
800 |
|
801 Complex tmp_min; |
|
802 |
|
803 double abs_min = octave_NaN; |
|
804 |
|
805 for (idx_j = 0; idx_j < x_len; idx_j++) |
|
806 { |
|
807 tmp_min = elem (idx_j * x_stride + x_offset); |
|
808 |
|
809 if (! octave_is_NaN_or_NA (tmp_min)) |
|
810 { |
|
811 abs_min = ::abs(tmp_min); |
|
812 break; |
|
813 } |
|
814 } |
|
815 |
|
816 for (int j = idx_j+1; j < x_len; j++) |
|
817 { |
|
818 Complex tmp = elem (j * x_stride + x_offset); |
|
819 |
|
820 if (octave_is_NaN_or_NA (tmp)) |
|
821 continue; |
|
822 |
|
823 double abs_tmp = ::abs (tmp); |
|
824 |
|
825 if (abs_tmp < abs_min) |
|
826 { |
|
827 idx_j = j; |
|
828 tmp_min = tmp; |
|
829 abs_min = abs_tmp; |
|
830 } |
|
831 } |
|
832 |
|
833 if (octave_is_NaN_or_NA (tmp_min)) |
|
834 { |
|
835 result.elem (i) = Complex_NaN_result; |
|
836 idx_arg.elem (i) = 0; |
|
837 } |
|
838 else |
|
839 { |
|
840 result.elem (i) = tmp_min; |
|
841 idx_arg.elem (i) = idx_j; |
|
842 } |
|
843 } |
|
844 |
|
845 return result; |
|
846 } |
|
847 |
4634
|
848 NDArray |
4569
|
849 ComplexNDArray::abs (void) const |
|
850 { |
4634
|
851 NDArray retval (dims ()); |
4569
|
852 |
4634
|
853 int nel = nelem (); |
|
854 |
|
855 for (int i = 0; i < nel; i++) |
|
856 retval(i) = ::abs (elem (i)); |
4569
|
857 |
|
858 return retval; |
4514
|
859 } |
|
860 |
4765
|
861 ComplexNDArray& |
|
862 ComplexNDArray::insert (const NDArray& a, int r, int c) |
|
863 { |
|
864 dim_vector a_dv = a.dims (); |
|
865 |
|
866 int n = a_dv.length (); |
|
867 |
|
868 if (n == dimensions.length ()) |
|
869 { |
|
870 Array<int> a_ra_idx (a_dv.length (), 0); |
|
871 |
|
872 a_ra_idx.elem (0) = r; |
|
873 a_ra_idx.elem (1) = c; |
|
874 |
|
875 for (int i = 0; i < n; i++) |
|
876 { |
|
877 if (a_ra_idx (i) < 0 || (a_ra_idx (i) + a_dv (i)) > dimensions (i)) |
|
878 { |
|
879 (*current_liboctave_error_handler) |
|
880 ("Array<T>::insert: range error for insert"); |
|
881 return *this; |
|
882 } |
|
883 } |
|
884 |
|
885 a_ra_idx.elem (0) = 0; |
|
886 a_ra_idx.elem (1) = 0; |
|
887 |
|
888 int n_elt = a.numel (); |
|
889 |
|
890 // IS make_unique () NECCESSARY HERE?? |
|
891 |
|
892 for (int i = 0; i < n_elt; i++) |
|
893 { |
|
894 Array<int> ra_idx = a_ra_idx; |
|
895 |
|
896 ra_idx.elem (0) = a_ra_idx (0) + r; |
|
897 ra_idx.elem (1) = a_ra_idx (1) + c; |
|
898 |
|
899 elem (ra_idx) = a.elem (a_ra_idx); |
|
900 |
|
901 increment_index (a_ra_idx, a_dv); |
|
902 } |
|
903 } |
|
904 else |
|
905 (*current_liboctave_error_handler) |
|
906 ("Array<T>::insert: invalid indexing operation"); |
|
907 |
|
908 return *this; |
|
909 } |
|
910 |
|
911 ComplexNDArray& |
|
912 ComplexNDArray::insert (const ComplexNDArray& a, int r, int c) |
|
913 { |
|
914 Array<Complex>::insert (a, r, c); |
|
915 return *this; |
|
916 } |
|
917 |
4514
|
918 ComplexMatrix |
|
919 ComplexNDArray::matrix_value (void) const |
|
920 { |
|
921 ComplexMatrix retval; |
|
922 |
|
923 int nd = ndims (); |
|
924 |
|
925 switch (nd) |
|
926 { |
|
927 case 1: |
|
928 retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0), 1)); |
|
929 break; |
|
930 |
|
931 case 2: |
|
932 retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0), |
|
933 dimensions(1))); |
|
934 break; |
|
935 |
|
936 default: |
|
937 (*current_liboctave_error_handler) |
4770
|
938 ("invalid conversion of ComplexNDArray to ComplexMatrix"); |
4514
|
939 break; |
|
940 } |
|
941 |
|
942 return retval; |
|
943 } |
|
944 |
4532
|
945 void |
|
946 ComplexNDArray::increment_index (Array<int>& ra_idx, |
|
947 const dim_vector& dimensions, |
|
948 int start_dimension) |
|
949 { |
|
950 ::increment_index (ra_idx, dimensions, start_dimension); |
|
951 } |
|
952 |
4556
|
953 int |
|
954 ComplexNDArray::compute_index (Array<int>& ra_idx, |
|
955 const dim_vector& dimensions) |
|
956 { |
|
957 return ::compute_index (ra_idx, dimensions); |
|
958 } |
|
959 |
4687
|
960 |
|
961 // This contains no information on the array structure !!! |
|
962 std::ostream& |
|
963 operator << (std::ostream& os, const ComplexNDArray& a) |
|
964 { |
|
965 int nel = a.nelem (); |
|
966 |
|
967 for (int i = 0; i < nel; i++) |
|
968 { |
|
969 os << " "; |
|
970 octave_write_complex (os, a.elem (i)); |
|
971 os << "\n"; |
|
972 } |
|
973 return os; |
|
974 } |
|
975 |
|
976 std::istream& |
|
977 operator >> (std::istream& is, ComplexNDArray& a) |
|
978 { |
|
979 int nel = a.nelem (); |
|
980 |
|
981 if (nel < 1 ) |
|
982 is.clear (std::ios::badbit); |
|
983 else |
|
984 { |
|
985 Complex tmp; |
|
986 for (int i = 0; i < nel; i++) |
|
987 { |
|
988 tmp = octave_read_complex (is); |
|
989 if (is) |
|
990 a.elem (i) = tmp; |
|
991 else |
|
992 goto done; |
|
993 } |
|
994 } |
|
995 |
|
996 done: |
|
997 |
|
998 return is; |
|
999 } |
|
1000 |
4844
|
1001 // XXX FIXME XXX -- it would be nice to share code among the min/max |
|
1002 // functions below. |
|
1003 |
|
1004 #define EMPTY_RETURN_CHECK(T) \ |
|
1005 if (nel == 0) \ |
|
1006 return T (dv); |
|
1007 |
|
1008 ComplexNDArray |
|
1009 min (const Complex& c, const ComplexNDArray& m) |
|
1010 { |
|
1011 dim_vector dv = m.dims (); |
|
1012 int nel = dv.numel (); |
|
1013 |
|
1014 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1015 |
|
1016 ComplexNDArray result (dv); |
|
1017 |
|
1018 for (int i = 0; i < nel; i++) |
|
1019 { |
|
1020 OCTAVE_QUIT; |
|
1021 result (i) = xmin (c, m (i)); |
|
1022 } |
|
1023 |
|
1024 return result; |
|
1025 } |
|
1026 |
|
1027 ComplexNDArray |
|
1028 min (const ComplexNDArray& m, const Complex& c) |
|
1029 { |
|
1030 dim_vector dv = m.dims (); |
|
1031 int nel = dv.numel (); |
|
1032 |
|
1033 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1034 |
|
1035 ComplexNDArray result (dv); |
|
1036 |
|
1037 for (int i = 0; i < nel; i++) |
|
1038 { |
|
1039 OCTAVE_QUIT; |
|
1040 result (i) = xmin (c, m (i)); |
|
1041 } |
|
1042 |
|
1043 return result; |
|
1044 } |
|
1045 |
|
1046 ComplexNDArray |
|
1047 min (const ComplexNDArray& a, const ComplexNDArray& b) |
|
1048 { |
|
1049 dim_vector dv = a.dims (); |
|
1050 int nel = dv.numel (); |
|
1051 |
|
1052 if (dv != b.dims ()) |
|
1053 { |
|
1054 (*current_liboctave_error_handler) |
|
1055 ("two-arg min expecting args of same size"); |
|
1056 return ComplexNDArray (); |
|
1057 } |
|
1058 |
|
1059 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1060 |
|
1061 ComplexNDArray result (dv); |
|
1062 |
|
1063 for (int i = 0; i < nel; i++) |
|
1064 { |
|
1065 OCTAVE_QUIT; |
|
1066 result (i) = xmin (a (i), b (i)); |
|
1067 } |
|
1068 |
|
1069 return result; |
|
1070 } |
|
1071 |
|
1072 ComplexNDArray |
|
1073 max (const Complex& c, const ComplexNDArray& m) |
|
1074 { |
|
1075 dim_vector dv = m.dims (); |
|
1076 int nel = dv.numel (); |
|
1077 |
|
1078 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1079 |
|
1080 ComplexNDArray result (dv); |
|
1081 |
|
1082 for (int i = 0; i < nel; i++) |
|
1083 { |
|
1084 OCTAVE_QUIT; |
|
1085 result (i) = xmax (c, m (i)); |
|
1086 } |
|
1087 |
|
1088 return result; |
|
1089 } |
|
1090 |
|
1091 ComplexNDArray |
|
1092 max (const ComplexNDArray& m, const Complex& c) |
|
1093 { |
|
1094 dim_vector dv = m.dims (); |
|
1095 int nel = dv.numel (); |
|
1096 |
|
1097 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1098 |
|
1099 ComplexNDArray result (dv); |
|
1100 |
|
1101 for (int i = 0; i < nel; i++) |
|
1102 { |
|
1103 OCTAVE_QUIT; |
|
1104 result (i) = xmax (c, m (i)); |
|
1105 } |
|
1106 |
|
1107 return result; |
|
1108 } |
|
1109 |
|
1110 ComplexNDArray |
|
1111 max (const ComplexNDArray& a, const ComplexNDArray& b) |
|
1112 { |
|
1113 dim_vector dv = a.dims (); |
|
1114 int nel = dv.numel (); |
|
1115 |
|
1116 if (dv != b.dims ()) |
|
1117 { |
|
1118 (*current_liboctave_error_handler) |
|
1119 ("two-arg max expecting args of same size"); |
|
1120 return ComplexNDArray (); |
|
1121 } |
|
1122 |
|
1123 EMPTY_RETURN_CHECK (ComplexNDArray); |
|
1124 |
|
1125 ComplexNDArray result (dv); |
|
1126 |
|
1127 for (int i = 0; i < nel; i++) |
|
1128 { |
|
1129 OCTAVE_QUIT; |
|
1130 result (i) = xmax (a (i), b (i)); |
|
1131 } |
|
1132 |
|
1133 return result; |
|
1134 } |
|
1135 |
4543
|
1136 NDS_CMP_OPS(ComplexNDArray, real, Complex, real) |
|
1137 NDS_BOOL_OPS(ComplexNDArray, Complex, 0.0) |
|
1138 |
|
1139 SND_CMP_OPS(Complex, real, ComplexNDArray, real) |
|
1140 SND_BOOL_OPS(Complex, ComplexNDArray, 0.0) |
|
1141 |
|
1142 NDND_CMP_OPS(ComplexNDArray, real, ComplexNDArray, real) |
|
1143 NDND_BOOL_OPS(ComplexNDArray, ComplexNDArray, 0.0) |
|
1144 |
4514
|
1145 /* |
|
1146 ;;; Local Variables: *** |
|
1147 ;;; mode: C++ *** |
|
1148 ;;; End: *** |
|
1149 */ |