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