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