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