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