|
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> |
|
|
33 |
|
4588
|
34 #include "Array-util.h" |
|
4514
|
35 #include "CNDArray.h" |
|
|
36 #include "mx-base.h" |
|
4773
|
37 #include "f77-fcn.h" |
|
4514
|
38 #include "lo-ieee.h" |
|
4687
|
39 #include "lo-mappers.h" |
|
4514
|
40 |
|
4773
|
41 #if defined (HAVE_FFTW3) |
|
|
42 # include "oct-fftw.h" |
|
|
43 #else |
|
|
44 extern "C" |
|
|
45 { |
|
|
46 // Note that the original complex fft routines were not written for |
|
|
47 // double complex arguments. They have been modified by adding an |
|
|
48 // implicit double precision (a-h,o-z) statement at the beginning of |
|
|
49 // each subroutine. |
|
|
50 |
|
|
51 F77_RET_T |
|
|
52 F77_FUNC (cffti, CFFTI) (const int&, Complex*); |
|
|
53 |
|
|
54 F77_RET_T |
|
|
55 F77_FUNC (cfftf, CFFTF) (const int&, Complex*, Complex*); |
|
|
56 |
|
|
57 F77_RET_T |
|
|
58 F77_FUNC (cfftb, CFFTB) (const int&, Complex*, Complex*); |
|
|
59 } |
|
|
60 #endif |
|
|
61 |
|
4543
|
62 // XXX FIXME XXX -- could we use a templated mixed-type copy function |
|
|
63 // here? |
|
|
64 |
|
|
65 ComplexNDArray::ComplexNDArray (const NDArray& a) |
|
|
66 : MArrayN<Complex> (a.dims ()) |
|
|
67 { |
|
|
68 for (int i = 0; i < a.length (); i++) |
|
|
69 elem (i) = a.elem (i); |
|
|
70 } |
|
|
71 |
|
|
72 ComplexNDArray::ComplexNDArray (const boolNDArray& a) |
|
|
73 : MArrayN<Complex> (a.dims ()) |
|
|
74 { |
|
|
75 for (int i = 0; i < a.length (); i++) |
|
|
76 elem (i) = a.elem (i); |
|
|
77 } |
|
|
78 |
|
|
79 ComplexNDArray::ComplexNDArray (const charNDArray& a) |
|
|
80 : MArrayN<Complex> (a.dims ()) |
|
|
81 { |
|
|
82 for (int i = 0; i < a.length (); i++) |
|
|
83 elem (i) = a.elem (i); |
|
|
84 } |
|
|
85 |
|
4773
|
86 #if defined (HAVE_FFTW3) |
|
|
87 ComplexNDArray |
|
|
88 ComplexNDArray::fourier (int dim) const |
|
|
89 { |
|
|
90 dim_vector dv = dims (); |
|
|
91 |
|
|
92 if (dim > dv.length () || dim < 0) |
|
|
93 return ComplexNDArray (); |
|
|
94 |
|
|
95 int stride = 1; |
|
|
96 int n = dv(dim); |
|
|
97 |
|
|
98 for (int i = 0; i < dim; i++) |
|
|
99 stride *= dv(i); |
|
|
100 |
|
|
101 int howmany = numel () / dv (dim); |
|
|
102 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
|
103 int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride); |
|
|
104 int dist = (stride == 1 ? n : 1); |
|
|
105 |
|
|
106 const Complex *in (fortran_vec ()); |
|
|
107 ComplexNDArray retval (dv); |
|
|
108 Complex *out (retval.fortran_vec ()); |
|
|
109 |
|
|
110 // Need to be careful here about the distance between fft's |
|
|
111 for (int k = 0; k < nloop; k++) |
|
|
112 octave_fftw::fft (in + k * stride * n, out + k * stride * n, |
|
|
113 n, howmany, stride, dist); |
|
|
114 |
|
|
115 return retval; |
|
|
116 } |
|
|
117 |
|
|
118 ComplexNDArray |
|
|
119 ComplexNDArray::ifourier (const int dim) const |
|
|
120 { |
|
|
121 dim_vector dv = dims (); |
|
|
122 |
|
|
123 if (dim > dv.length () || dim < 0) |
|
|
124 return ComplexNDArray (); |
|
|
125 |
|
|
126 int stride = 1; |
|
|
127 int n = dv(dim); |
|
|
128 |
|
|
129 for (int i = 0; i < dim; i++) |
|
|
130 stride *= dv(i); |
|
|
131 |
|
|
132 int howmany = numel () / dv (dim); |
|
|
133 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
|
134 int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride); |
|
|
135 int dist = (stride == 1 ? n : 1); |
|
|
136 |
|
|
137 const Complex *in (fortran_vec ()); |
|
|
138 ComplexNDArray retval (dv); |
|
|
139 Complex *out (retval.fortran_vec ()); |
|
|
140 |
|
|
141 // Need to be careful here about the distance between fft's |
|
|
142 for (int k = 0; k < nloop; k++) |
|
|
143 octave_fftw::ifft (in + k * stride * n, out + k * stride * n, |
|
|
144 n, howmany, stride, dist); |
|
|
145 |
|
|
146 return retval; |
|
|
147 } |
|
|
148 |
|
|
149 ComplexNDArray |
|
|
150 ComplexNDArray::fourier2d (void) const |
|
|
151 { |
|
|
152 dim_vector dv = dims(); |
|
|
153 if (dv.length () < 2) |
|
|
154 return ComplexNDArray (); |
|
|
155 |
|
|
156 dim_vector dv2(dv(0), dv(1)); |
|
|
157 const Complex *in = fortran_vec (); |
|
|
158 ComplexNDArray retval (dv); |
|
|
159 Complex *out = retval.fortran_vec (); |
|
|
160 int howmany = numel() / dv(0) / dv(1); |
|
|
161 int dist = dv(0) * dv(1); |
|
|
162 |
|
|
163 for (int i=0; i < howmany; i++) |
|
|
164 octave_fftw::fftNd (in + i*dist, out + i*dist, 2, dv2); |
|
|
165 |
|
|
166 return retval; |
|
|
167 } |
|
|
168 |
|
|
169 ComplexNDArray |
|
|
170 ComplexNDArray::ifourier2d (void) const |
|
|
171 { |
|
|
172 dim_vector dv = dims(); |
|
|
173 if (dv.length () < 2) |
|
|
174 return ComplexNDArray (); |
|
|
175 |
|
|
176 dim_vector dv2(dv(0), dv(1)); |
|
|
177 const Complex *in = fortran_vec (); |
|
|
178 ComplexNDArray retval (dv); |
|
|
179 Complex *out = retval.fortran_vec (); |
|
|
180 int howmany = numel() / dv(0) / dv(1); |
|
|
181 int dist = dv(0) * dv(1); |
|
|
182 |
|
|
183 for (int i=0; i < howmany; i++) |
|
|
184 octave_fftw::ifftNd (in + i*dist, out + i*dist, 2, dv2); |
|
|
185 |
|
|
186 return retval; |
|
|
187 } |
|
|
188 |
|
|
189 ComplexNDArray |
|
|
190 ComplexNDArray::fourierNd (void) const |
|
|
191 { |
|
|
192 dim_vector dv = dims (); |
|
|
193 int rank = dv.length (); |
|
|
194 |
|
|
195 const Complex *in (fortran_vec ()); |
|
|
196 ComplexNDArray retval (dv); |
|
|
197 Complex *out (retval.fortran_vec ()); |
|
|
198 |
|
|
199 octave_fftw::fftNd (in, out, rank, dv); |
|
|
200 |
|
|
201 return retval; |
|
|
202 } |
|
|
203 |
|
|
204 ComplexNDArray |
|
|
205 ComplexNDArray::ifourierNd (void) const |
|
|
206 { |
|
|
207 dim_vector dv = dims (); |
|
|
208 int rank = dv.length (); |
|
|
209 |
|
|
210 const Complex *in (fortran_vec ()); |
|
|
211 ComplexNDArray retval (dv); |
|
|
212 Complex *out (retval.fortran_vec ()); |
|
|
213 |
|
|
214 octave_fftw::ifftNd (in, out, rank, dv); |
|
|
215 |
|
|
216 return retval; |
|
|
217 } |
|
|
218 |
|
|
219 #else |
|
|
220 ComplexNDArray |
|
|
221 ComplexNDArray::fourier (int dim) const |
|
|
222 { |
|
|
223 dim_vector dv = dims (); |
|
|
224 |
|
|
225 if (dim > dv.length () || dim < 0) |
|
|
226 return ComplexNDArray (); |
|
|
227 |
|
|
228 ComplexNDArray retval (dv); |
|
|
229 int npts = dv(dim); |
|
|
230 int nn = 4*npts+15; |
|
|
231 Array<Complex> wsave (nn); |
|
|
232 Complex *pwsave = wsave.fortran_vec (); |
|
|
233 |
|
|
234 OCTAVE_LOCAL_BUFFER (Complex, tmp, npts); |
|
|
235 |
|
|
236 int stride = 1; |
|
|
237 |
|
|
238 for (int i = 0; i < dim; i++) |
|
|
239 stride *= dv(i); |
|
|
240 |
|
|
241 int howmany = numel () / npts; |
|
|
242 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
|
243 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
244 int dist = (stride == 1 ? npts : 1); |
|
|
245 |
|
|
246 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
247 |
|
|
248 for (int k = 0; k < nloop; k++) |
|
|
249 { |
|
|
250 for (int j = 0; j < howmany; j++) |
|
|
251 { |
|
|
252 OCTAVE_QUIT; |
|
|
253 |
|
|
254 for (int i = 0; i < npts; i++) |
|
|
255 tmp[i] = elem((i + k*npts)*stride + j*dist); |
|
|
256 |
|
|
257 F77_FUNC (cfftf, CFFTF) (npts, tmp, pwsave); |
|
|
258 |
|
|
259 for (int i = 0; i < npts; i++) |
|
|
260 retval ((i + k*npts)*stride + j*dist) = tmp[i]; |
|
|
261 } |
|
|
262 } |
|
|
263 |
|
|
264 return retval; |
|
|
265 } |
|
|
266 |
|
|
267 ComplexNDArray |
|
|
268 ComplexNDArray::ifourier (int dim) const |
|
|
269 { |
|
|
270 dim_vector dv = dims (); |
|
|
271 |
|
|
272 if (dim > dv.length () || dim < 0) |
|
|
273 return ComplexNDArray (); |
|
|
274 |
|
|
275 ComplexNDArray retval (dv); |
|
|
276 int npts = dv(dim); |
|
|
277 int nn = 4*npts+15; |
|
|
278 Array<Complex> wsave (nn); |
|
|
279 Complex *pwsave = wsave.fortran_vec (); |
|
|
280 |
|
|
281 OCTAVE_LOCAL_BUFFER (Complex, tmp, npts); |
|
|
282 |
|
|
283 int stride = 1; |
|
|
284 |
|
|
285 for (int i = 0; i < dim; i++) |
|
|
286 stride *= dv(i); |
|
|
287 |
|
|
288 int howmany = numel () / npts; |
|
|
289 howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany)); |
|
|
290 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
291 int dist = (stride == 1 ? npts : 1); |
|
|
292 |
|
|
293 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
294 |
|
|
295 for (int k = 0; k < nloop; k++) |
|
|
296 { |
|
|
297 for (int j = 0; j < howmany; j++) |
|
|
298 { |
|
|
299 OCTAVE_QUIT; |
|
|
300 |
|
|
301 for (int i = 0; i < npts; i++) |
|
|
302 tmp[i] = elem((i + k*npts)*stride + j*dist); |
|
|
303 |
|
|
304 F77_FUNC (cfftb, CFFTB) (npts, tmp, pwsave); |
|
|
305 |
|
|
306 for (int i = 0; i < npts; i++) |
|
|
307 retval ((i + k*npts)*stride + j*dist) = tmp[i] / |
|
|
308 static_cast<double> (npts); |
|
|
309 } |
|
|
310 } |
|
|
311 |
|
|
312 return retval; |
|
|
313 } |
|
|
314 |
|
|
315 ComplexNDArray |
|
|
316 ComplexNDArray::fourier2d (void) const |
|
|
317 { |
|
|
318 dim_vector dv = dims (); |
|
|
319 dim_vector dv2 (dv(0), dv(1)); |
|
|
320 int rank = 2; |
|
|
321 ComplexNDArray retval (*this); |
|
|
322 int stride = 1; |
|
|
323 |
|
|
324 for (int i = 0; i < rank; i++) |
|
|
325 { |
|
|
326 int npts = dv2(i); |
|
|
327 int nn = 4*npts+15; |
|
|
328 Array<Complex> wsave (nn); |
|
|
329 Complex *pwsave = wsave.fortran_vec (); |
|
|
330 Array<Complex> row (npts); |
|
|
331 Complex *prow = row.fortran_vec (); |
|
|
332 |
|
|
333 int howmany = numel () / npts; |
|
|
334 howmany = (stride == 1 ? howmany : |
|
|
335 (howmany > stride ? stride : howmany)); |
|
|
336 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
337 int dist = (stride == 1 ? npts : 1); |
|
|
338 |
|
|
339 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
340 |
|
|
341 for (int k = 0; k < nloop; k++) |
|
|
342 { |
|
|
343 for (int j = 0; j < howmany; j++) |
|
|
344 { |
|
|
345 OCTAVE_QUIT; |
|
|
346 |
|
|
347 for (int l = 0; l < npts; l++) |
|
|
348 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
|
349 |
|
|
350 F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave); |
|
|
351 |
|
|
352 for (int l = 0; l < npts; l++) |
|
|
353 retval ((l + k*npts)*stride + j*dist) = prow[l]; |
|
|
354 } |
|
|
355 } |
|
|
356 |
|
|
357 stride *= dv2(i); |
|
|
358 } |
|
|
359 |
|
|
360 return retval; |
|
|
361 } |
|
|
362 |
|
|
363 ComplexNDArray |
|
|
364 ComplexNDArray::ifourier2d (void) const |
|
|
365 { |
|
|
366 dim_vector dv = dims(); |
|
|
367 dim_vector dv2 (dv(0), dv(1)); |
|
|
368 int rank = 2; |
|
|
369 ComplexNDArray retval (*this); |
|
|
370 int stride = 1; |
|
|
371 |
|
|
372 for (int i = 0; i < rank; i++) |
|
|
373 { |
|
|
374 int npts = dv2(i); |
|
|
375 int nn = 4*npts+15; |
|
|
376 Array<Complex> wsave (nn); |
|
|
377 Complex *pwsave = wsave.fortran_vec (); |
|
|
378 Array<Complex> row (npts); |
|
|
379 Complex *prow = row.fortran_vec (); |
|
|
380 |
|
|
381 int howmany = numel () / npts; |
|
|
382 howmany = (stride == 1 ? howmany : |
|
|
383 (howmany > stride ? stride : howmany)); |
|
|
384 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
385 int dist = (stride == 1 ? npts : 1); |
|
|
386 |
|
|
387 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
388 |
|
|
389 for (int k = 0; k < nloop; k++) |
|
|
390 { |
|
|
391 for (int j = 0; j < howmany; j++) |
|
|
392 { |
|
|
393 OCTAVE_QUIT; |
|
|
394 |
|
|
395 for (int l = 0; l < npts; l++) |
|
|
396 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
|
397 |
|
|
398 F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave); |
|
|
399 |
|
|
400 for (int l = 0; l < npts; l++) |
|
|
401 retval ((l + k*npts)*stride + j*dist) = prow[l] / |
|
|
402 static_cast<double> (npts); |
|
|
403 } |
|
|
404 } |
|
|
405 |
|
|
406 stride *= dv2(i); |
|
|
407 } |
|
|
408 |
|
|
409 return retval; |
|
|
410 } |
|
|
411 |
|
|
412 ComplexNDArray |
|
|
413 ComplexNDArray::fourierNd (void) const |
|
|
414 { |
|
|
415 dim_vector dv = dims (); |
|
|
416 int rank = dv.length (); |
|
|
417 ComplexNDArray retval (*this); |
|
|
418 int stride = 1; |
|
|
419 |
|
|
420 for (int i = 0; i < rank; i++) |
|
|
421 { |
|
|
422 int npts = dv(i); |
|
|
423 int nn = 4*npts+15; |
|
|
424 Array<Complex> wsave (nn); |
|
|
425 Complex *pwsave = wsave.fortran_vec (); |
|
|
426 Array<Complex> row (npts); |
|
|
427 Complex *prow = row.fortran_vec (); |
|
|
428 |
|
|
429 int howmany = numel () / npts; |
|
|
430 howmany = (stride == 1 ? howmany : |
|
|
431 (howmany > stride ? stride : howmany)); |
|
|
432 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
433 int dist = (stride == 1 ? npts : 1); |
|
|
434 |
|
|
435 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
436 |
|
|
437 for (int k = 0; k < nloop; k++) |
|
|
438 { |
|
|
439 for (int j = 0; j < howmany; j++) |
|
|
440 { |
|
|
441 OCTAVE_QUIT; |
|
|
442 |
|
|
443 for (int l = 0; l < npts; l++) |
|
|
444 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
|
445 |
|
|
446 F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave); |
|
|
447 |
|
|
448 for (int l = 0; l < npts; l++) |
|
|
449 retval ((l + k*npts)*stride + j*dist) = prow[l]; |
|
|
450 } |
|
|
451 } |
|
|
452 |
|
|
453 stride *= dv(i); |
|
|
454 } |
|
|
455 |
|
|
456 return retval; |
|
|
457 } |
|
|
458 |
|
|
459 ComplexNDArray |
|
|
460 ComplexNDArray::ifourierNd (void) const |
|
|
461 { |
|
|
462 dim_vector dv = dims (); |
|
|
463 int rank = dv.length (); |
|
|
464 ComplexNDArray retval (*this); |
|
|
465 int stride = 1; |
|
|
466 |
|
|
467 for (int i = 0; i < rank; i++) |
|
|
468 { |
|
|
469 int npts = dv(i); |
|
|
470 int nn = 4*npts+15; |
|
|
471 Array<Complex> wsave (nn); |
|
|
472 Complex *pwsave = wsave.fortran_vec (); |
|
|
473 Array<Complex> row (npts); |
|
|
474 Complex *prow = row.fortran_vec (); |
|
|
475 |
|
|
476 int howmany = numel () / npts; |
|
|
477 howmany = (stride == 1 ? howmany : |
|
|
478 (howmany > stride ? stride : howmany)); |
|
|
479 int nloop = (stride == 1 ? 1 : numel () / npts / stride); |
|
|
480 int dist = (stride == 1 ? npts : 1); |
|
|
481 |
|
|
482 F77_FUNC (cffti, CFFTI) (npts, pwsave); |
|
|
483 |
|
|
484 for (int k = 0; k < nloop; k++) |
|
|
485 { |
|
|
486 for (int j = 0; j < howmany; j++) |
|
|
487 { |
|
|
488 OCTAVE_QUIT; |
|
|
489 |
|
|
490 for (int l = 0; l < npts; l++) |
|
|
491 prow[l] = retval ((l + k*npts)*stride + j*dist); |
|
|
492 |
|
|
493 F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave); |
|
|
494 |
|
|
495 for (int l = 0; l < npts; l++) |
|
|
496 retval ((l + k*npts)*stride + j*dist) = prow[l] / |
|
|
497 static_cast<double> (npts); |
|
|
498 } |
|
|
499 } |
|
|
500 |
|
|
501 stride *= dv(i); |
|
|
502 } |
|
|
503 |
|
|
504 return retval; |
|
|
505 } |
|
|
506 |
|
|
507 #endif |
|
|
508 |
|
4543
|
509 // unary operations |
|
|
510 |
|
|
511 boolNDArray |
|
|
512 ComplexNDArray::operator ! (void) const |
|
|
513 { |
|
|
514 boolNDArray b (dims ()); |
|
|
515 |
|
|
516 for (int i = 0; i < length (); i++) |
|
|
517 b.elem (i) = elem (i) != 0.0; |
|
|
518 |
|
|
519 return b; |
|
|
520 } |
|
|
521 |
|
4514
|
522 // XXX FIXME XXX -- this is not quite the right thing. |
|
|
523 |
|
4687
|
524 bool |
|
|
525 ComplexNDArray::any_element_is_inf_or_nan (void) const |
|
|
526 { |
|
|
527 int nel = nelem (); |
|
|
528 |
|
|
529 for (int i = 0; i < nel; i++) |
|
|
530 { |
|
|
531 Complex val = elem (i); |
|
|
532 if (xisinf (val) || xisnan (val)) |
|
|
533 return true; |
|
|
534 } |
|
|
535 return false; |
|
|
536 } |
|
|
537 |
|
|
538 // Return true if no elements have imaginary components. |
|
|
539 |
|
|
540 bool |
|
|
541 ComplexNDArray::all_elements_are_real (void) const |
|
|
542 { |
|
|
543 int nel = nelem (); |
|
|
544 |
|
|
545 for (int i = 0; i < nel; i++) |
|
|
546 { |
|
|
547 double ip = imag (elem (i)); |
|
|
548 |
|
|
549 if (ip != 0.0 || lo_ieee_signbit (ip)) |
|
|
550 return false; |
|
|
551 } |
|
|
552 |
|
|
553 return true; |
|
|
554 } |
|
|
555 |
|
|
556 // Return nonzero if any element of CM has a non-integer real or |
|
|
557 // imaginary part. Also extract the largest and smallest (real or |
|
|
558 // imaginary) values and return them in MAX_VAL and MIN_VAL. |
|
|
559 |
|
|
560 bool |
|
|
561 ComplexNDArray::all_integers (double& max_val, double& min_val) const |
|
|
562 { |
|
|
563 int nel = nelem (); |
|
|
564 |
|
|
565 if (nel > 0) |
|
|
566 { |
|
|
567 Complex val = elem (0); |
|
|
568 |
|
|
569 double r_val = real (val); |
|
|
570 double i_val = imag (val); |
|
|
571 |
|
|
572 max_val = r_val; |
|
|
573 min_val = r_val; |
|
|
574 |
|
|
575 if (i_val > max_val) |
|
|
576 max_val = i_val; |
|
|
577 |
|
|
578 if (i_val < max_val) |
|
|
579 min_val = i_val; |
|
|
580 } |
|
|
581 else |
|
|
582 return false; |
|
|
583 |
|
|
584 for (int i = 0; i < nel; i++) |
|
|
585 { |
|
|
586 Complex val = elem (i); |
|
|
587 |
|
|
588 double r_val = real (val); |
|
|
589 double i_val = imag (val); |
|
|
590 |
|
|
591 if (r_val > max_val) |
|
|
592 max_val = r_val; |
|
|
593 |
|
|
594 if (i_val > max_val) |
|
|
595 max_val = i_val; |
|
|
596 |
|
|
597 if (r_val < min_val) |
|
|
598 min_val = r_val; |
|
|
599 |
|
|
600 if (i_val < min_val) |
|
|
601 min_val = i_val; |
|
|
602 |
|
|
603 if (D_NINT (r_val) != r_val || D_NINT (i_val) != i_val) |
|
|
604 return false; |
|
|
605 } |
|
|
606 |
|
|
607 return true; |
|
|
608 } |
|
|
609 |
|
|
610 bool |
|
|
611 ComplexNDArray::too_large_for_float (void) const |
|
|
612 { |
|
|
613 int nel = nelem (); |
|
|
614 |
|
|
615 for (int i = 0; i < nel; i++) |
|
|
616 { |
|
|
617 Complex val = elem (i); |
|
|
618 |
|
|
619 double r_val = real (val); |
|
|
620 double i_val = imag (val); |
|
|
621 |
|
|
622 if (r_val > FLT_MAX |
|
|
623 || i_val > FLT_MAX |
|
|
624 || r_val < FLT_MIN |
|
|
625 || i_val < FLT_MIN) |
|
|
626 return true; |
|
|
627 } |
|
|
628 |
|
|
629 return false; |
|
|
630 } |
|
|
631 |
|
4556
|
632 boolNDArray |
|
4514
|
633 ComplexNDArray::all (int dim) const |
|
|
634 { |
|
4569
|
635 MX_ND_ANY_ALL_REDUCTION |
|
|
636 (MX_ND_ALL_EVAL (elem (iter_idx) == Complex (0, 0)), true); |
|
4514
|
637 } |
|
|
638 |
|
4556
|
639 boolNDArray |
|
4514
|
640 ComplexNDArray::any (int dim) const |
|
|
641 { |
|
4569
|
642 MX_ND_ANY_ALL_REDUCTION |
|
|
643 (MX_ND_ANY_EVAL (elem (iter_idx) != Complex (0, 0)), false); |
|
|
644 } |
|
|
645 |
|
4584
|
646 ComplexNDArray |
|
4569
|
647 ComplexNDArray::cumprod (int dim) const |
|
|
648 { |
|
4584
|
649 MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (1, 0), *); |
|
4569
|
650 } |
|
|
651 |
|
4584
|
652 ComplexNDArray |
|
4569
|
653 ComplexNDArray::cumsum (int dim) const |
|
|
654 { |
|
4584
|
655 MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (0, 0), +); |
|
4569
|
656 } |
|
|
657 |
|
|
658 ComplexNDArray |
|
|
659 ComplexNDArray::prod (int dim) const |
|
|
660 { |
|
|
661 MX_ND_COMPLEX_OP_REDUCTION (*= elem (iter_idx), Complex (1, 0)); |
|
|
662 } |
|
|
663 |
|
|
664 ComplexNDArray |
|
|
665 ComplexNDArray::sumsq (int dim) const |
|
|
666 { |
|
|
667 MX_ND_COMPLEX_OP_REDUCTION |
|
|
668 (+= imag (elem (iter_idx)) |
|
|
669 ? elem (iter_idx) * conj (elem (iter_idx)) |
|
|
670 : std::pow (elem (iter_idx), 2), Complex (0, 0)); |
|
|
671 } |
|
|
672 |
|
|
673 ComplexNDArray |
|
|
674 ComplexNDArray::sum (int dim) const |
|
|
675 { |
|
|
676 MX_ND_COMPLEX_OP_REDUCTION (+= elem (iter_idx), Complex (0, 0)); |
|
|
677 } |
|
|
678 |
|
4758
|
679 bool |
|
4762
|
680 ComplexNDArray::cat (const ComplexNDArray& ra_arg, int dim, int add_dim) |
|
4758
|
681 { |
|
|
682 MX_ND_CAT; |
|
|
683 } |
|
|
684 |
|
4634
|
685 NDArray |
|
4569
|
686 ComplexNDArray::abs (void) const |
|
|
687 { |
|
4634
|
688 NDArray retval (dims ()); |
|
4569
|
689 |
|
4634
|
690 int nel = nelem (); |
|
|
691 |
|
|
692 for (int i = 0; i < nel; i++) |
|
|
693 retval(i) = ::abs (elem (i)); |
|
4569
|
694 |
|
|
695 return retval; |
|
4514
|
696 } |
|
|
697 |
|
4765
|
698 ComplexNDArray& |
|
|
699 ComplexNDArray::insert (const NDArray& a, int r, int c) |
|
|
700 { |
|
|
701 dim_vector a_dv = a.dims (); |
|
|
702 |
|
|
703 int n = a_dv.length (); |
|
|
704 |
|
|
705 if (n == dimensions.length ()) |
|
|
706 { |
|
|
707 Array<int> a_ra_idx (a_dv.length (), 0); |
|
|
708 |
|
|
709 a_ra_idx.elem (0) = r; |
|
|
710 a_ra_idx.elem (1) = c; |
|
|
711 |
|
|
712 for (int i = 0; i < n; i++) |
|
|
713 { |
|
|
714 if (a_ra_idx (i) < 0 || (a_ra_idx (i) + a_dv (i)) > dimensions (i)) |
|
|
715 { |
|
|
716 (*current_liboctave_error_handler) |
|
|
717 ("Array<T>::insert: range error for insert"); |
|
|
718 return *this; |
|
|
719 } |
|
|
720 } |
|
|
721 |
|
|
722 a_ra_idx.elem (0) = 0; |
|
|
723 a_ra_idx.elem (1) = 0; |
|
|
724 |
|
|
725 int n_elt = a.numel (); |
|
|
726 |
|
|
727 // IS make_unique () NECCESSARY HERE?? |
|
|
728 |
|
|
729 for (int i = 0; i < n_elt; i++) |
|
|
730 { |
|
|
731 Array<int> ra_idx = a_ra_idx; |
|
|
732 |
|
|
733 ra_idx.elem (0) = a_ra_idx (0) + r; |
|
|
734 ra_idx.elem (1) = a_ra_idx (1) + c; |
|
|
735 |
|
|
736 elem (ra_idx) = a.elem (a_ra_idx); |
|
|
737 |
|
|
738 increment_index (a_ra_idx, a_dv); |
|
|
739 } |
|
|
740 } |
|
|
741 else |
|
|
742 (*current_liboctave_error_handler) |
|
|
743 ("Array<T>::insert: invalid indexing operation"); |
|
|
744 |
|
|
745 return *this; |
|
|
746 } |
|
|
747 |
|
|
748 ComplexNDArray& |
|
|
749 ComplexNDArray::insert (const ComplexNDArray& a, int r, int c) |
|
|
750 { |
|
|
751 Array<Complex>::insert (a, r, c); |
|
|
752 return *this; |
|
|
753 } |
|
|
754 |
|
4514
|
755 ComplexMatrix |
|
|
756 ComplexNDArray::matrix_value (void) const |
|
|
757 { |
|
|
758 ComplexMatrix retval; |
|
|
759 |
|
|
760 int nd = ndims (); |
|
|
761 |
|
|
762 switch (nd) |
|
|
763 { |
|
|
764 case 1: |
|
|
765 retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0), 1)); |
|
|
766 break; |
|
|
767 |
|
|
768 case 2: |
|
|
769 retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0), |
|
|
770 dimensions(1))); |
|
|
771 break; |
|
|
772 |
|
|
773 default: |
|
|
774 (*current_liboctave_error_handler) |
|
4770
|
775 ("invalid conversion of ComplexNDArray to ComplexMatrix"); |
|
4514
|
776 break; |
|
|
777 } |
|
|
778 |
|
|
779 return retval; |
|
|
780 } |
|
|
781 |
|
4532
|
782 void |
|
|
783 ComplexNDArray::increment_index (Array<int>& ra_idx, |
|
|
784 const dim_vector& dimensions, |
|
|
785 int start_dimension) |
|
|
786 { |
|
|
787 ::increment_index (ra_idx, dimensions, start_dimension); |
|
|
788 } |
|
|
789 |
|
4556
|
790 int |
|
|
791 ComplexNDArray::compute_index (Array<int>& ra_idx, |
|
|
792 const dim_vector& dimensions) |
|
|
793 { |
|
|
794 return ::compute_index (ra_idx, dimensions); |
|
|
795 } |
|
|
796 |
|
4687
|
797 |
|
|
798 // This contains no information on the array structure !!! |
|
|
799 std::ostream& |
|
|
800 operator << (std::ostream& os, const ComplexNDArray& a) |
|
|
801 { |
|
|
802 int nel = a.nelem (); |
|
|
803 |
|
|
804 for (int i = 0; i < nel; i++) |
|
|
805 { |
|
|
806 os << " "; |
|
|
807 octave_write_complex (os, a.elem (i)); |
|
|
808 os << "\n"; |
|
|
809 } |
|
|
810 return os; |
|
|
811 } |
|
|
812 |
|
|
813 std::istream& |
|
|
814 operator >> (std::istream& is, ComplexNDArray& a) |
|
|
815 { |
|
|
816 int nel = a.nelem (); |
|
|
817 |
|
|
818 if (nel < 1 ) |
|
|
819 is.clear (std::ios::badbit); |
|
|
820 else |
|
|
821 { |
|
|
822 Complex tmp; |
|
|
823 for (int i = 0; i < nel; i++) |
|
|
824 { |
|
|
825 tmp = octave_read_complex (is); |
|
|
826 if (is) |
|
|
827 a.elem (i) = tmp; |
|
|
828 else |
|
|
829 goto done; |
|
|
830 } |
|
|
831 } |
|
|
832 |
|
|
833 done: |
|
|
834 |
|
|
835 return is; |
|
|
836 } |
|
|
837 |
|
4543
|
838 NDS_CMP_OPS(ComplexNDArray, real, Complex, real) |
|
|
839 NDS_BOOL_OPS(ComplexNDArray, Complex, 0.0) |
|
|
840 |
|
|
841 SND_CMP_OPS(Complex, real, ComplexNDArray, real) |
|
|
842 SND_BOOL_OPS(Complex, ComplexNDArray, 0.0) |
|
|
843 |
|
|
844 NDND_CMP_OPS(ComplexNDArray, real, ComplexNDArray, real) |
|
|
845 NDND_BOOL_OPS(ComplexNDArray, ComplexNDArray, 0.0) |
|
|
846 |
|
4514
|
847 /* |
|
|
848 ;;; Local Variables: *** |
|
|
849 ;;; mode: C++ *** |
|
|
850 ;;; End: *** |
|
|
851 */ |
