|
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> |
|
|
33 |
|
4588
|
34 #include "Array-util.h" |
|
4513
|
35 #include "dNDArray.h" |
|
4511
|
36 #include "mx-base.h" |
|
4513
|
37 #include "lo-error.h" |
|
4511
|
38 #include "lo-ieee.h" |
|
4634
|
39 #include "lo-mappers.h" |
|
4511
|
40 |
|
4543
|
41 NDArray::NDArray (const boolNDArray& a) |
|
|
42 : MArrayN<double> (a.dims ()) |
|
|
43 { |
|
|
44 for (int i = 0; i < a.length (); i++) |
|
|
45 elem (i) = a.elem (i); |
|
|
46 } |
|
|
47 |
|
|
48 NDArray::NDArray (const charNDArray& a) |
|
|
49 : MArrayN<double> (a.dims ()) |
|
|
50 { |
|
|
51 for (int i = 0; i < a.length (); i++) |
|
|
52 elem (i) = a.elem (i); |
|
|
53 } |
|
|
54 |
|
|
55 // unary operations |
|
|
56 |
|
|
57 boolNDArray |
|
|
58 NDArray::operator ! (void) const |
|
|
59 { |
|
|
60 boolNDArray b (dims ()); |
|
|
61 |
|
|
62 for (int i = 0; i < length (); i++) |
|
|
63 b.elem (i) = ! elem (i); |
|
|
64 |
|
|
65 return b; |
|
|
66 } |
|
|
67 |
|
4634
|
68 bool |
|
|
69 NDArray::any_element_is_negative (bool neg_zero) const |
|
|
70 { |
|
|
71 int nel = nelem (); |
|
|
72 |
|
|
73 if (neg_zero) |
|
|
74 { |
|
|
75 for (int i = 0; i < nel; i++) |
|
|
76 if (lo_ieee_signbit (elem (i))) |
|
|
77 return true; |
|
|
78 } |
|
|
79 else |
|
|
80 { |
|
|
81 for (int i = 0; i < nel; i++) |
|
|
82 if (elem (i) < 0) |
|
|
83 return true; |
|
|
84 } |
|
|
85 |
|
|
86 return false; |
|
|
87 } |
|
|
88 |
|
|
89 |
|
|
90 bool |
|
|
91 NDArray::any_element_is_inf_or_nan (void) const |
|
|
92 { |
|
|
93 int nel = nelem (); |
|
|
94 |
|
|
95 for (int i = 0; i < nel; i++) |
|
|
96 { |
|
|
97 double val = elem (i); |
|
|
98 if (xisinf (val) || xisnan (val)) |
|
|
99 return true; |
|
|
100 } |
|
|
101 |
|
|
102 return false; |
|
|
103 } |
|
|
104 |
|
|
105 bool |
|
|
106 NDArray::all_elements_are_int_or_inf_or_nan (void) const |
|
|
107 { |
|
|
108 int nel = nelem (); |
|
|
109 |
|
|
110 for (int i = 0; i < nel; i++) |
|
|
111 { |
|
|
112 double val = elem (i); |
|
|
113 if (xisnan (val) || D_NINT (val) == val) |
|
|
114 continue; |
|
|
115 else |
|
|
116 return false; |
|
|
117 } |
|
|
118 |
|
|
119 return true; |
|
|
120 } |
|
|
121 |
|
|
122 // Return nonzero if any element of M is not an integer. Also extract |
|
|
123 // the largest and smallest values and return them in MAX_VAL and MIN_VAL. |
|
|
124 |
|
|
125 bool |
|
|
126 NDArray::all_integers (double& max_val, double& min_val) const |
|
|
127 { |
|
|
128 int nel = nelem (); |
|
|
129 |
|
|
130 if (nel > 0) |
|
|
131 { |
|
|
132 max_val = elem (0); |
|
|
133 min_val = elem (0); |
|
|
134 } |
|
|
135 else |
|
|
136 return false; |
|
|
137 |
|
|
138 for (int i = 0; i < nel; i++) |
|
|
139 { |
|
|
140 double val = elem (i); |
|
|
141 |
|
|
142 if (val > max_val) |
|
|
143 max_val = val; |
|
|
144 |
|
|
145 if (val < min_val) |
|
|
146 min_val = val; |
|
|
147 |
|
|
148 if (D_NINT (val) != val) |
|
|
149 return false; |
|
|
150 } |
|
|
151 |
|
|
152 return true; |
|
|
153 } |
|
|
154 |
|
|
155 bool |
|
|
156 NDArray::too_large_for_float (void) const |
|
|
157 { |
|
|
158 int nel = nelem (); |
|
|
159 |
|
|
160 for (int i = 0; i < nel; i++) |
|
|
161 { |
|
|
162 double val = elem (i); |
|
|
163 |
|
|
164 if (val > FLT_MAX || val < FLT_MIN) |
|
|
165 return true; |
|
|
166 } |
|
|
167 |
|
|
168 return false; |
|
|
169 } |
|
|
170 |
|
4513
|
171 // XXX FIXME XXX -- this is not quite the right thing. |
|
|
172 |
|
4556
|
173 boolNDArray |
|
4513
|
174 NDArray::all (int dim) const |
|
|
175 { |
|
4569
|
176 MX_ND_ANY_ALL_REDUCTION (MX_ND_ALL_EVAL (MX_ND_ALL_EXPR), true); |
|
4513
|
177 } |
|
|
178 |
|
4556
|
179 boolNDArray |
|
4513
|
180 NDArray::any (int dim) const |
|
|
181 { |
|
4569
|
182 MX_ND_ANY_ALL_REDUCTION (MX_ND_ANY_EVAL (MX_ND_ANY_EXPR), false); |
|
|
183 } |
|
|
184 |
|
4584
|
185 NDArray |
|
4569
|
186 NDArray::cumprod (int dim) const |
|
|
187 { |
|
4584
|
188 MX_ND_CUMULATIVE_OP (NDArray, double, 1, *); |
|
4569
|
189 } |
|
|
190 |
|
4584
|
191 NDArray |
|
4569
|
192 NDArray::cumsum (int dim) const |
|
|
193 { |
|
4584
|
194 MX_ND_CUMULATIVE_OP (NDArray, double, 0, +); |
|
4513
|
195 } |
|
|
196 |
|
4569
|
197 NDArray |
|
|
198 NDArray::prod (int dim) const |
|
|
199 { |
|
|
200 MX_ND_REAL_OP_REDUCTION (*= elem (iter_idx), 1); |
|
|
201 } |
|
|
202 |
|
|
203 NDArray |
|
|
204 NDArray::sumsq (int dim) const |
|
|
205 { |
|
|
206 MX_ND_REAL_OP_REDUCTION (+= std::pow (elem (iter_idx), 2), 0); |
|
|
207 } |
|
|
208 |
|
|
209 NDArray |
|
|
210 NDArray::sum (int dim) const |
|
|
211 { |
|
|
212 MX_ND_REAL_OP_REDUCTION (+= elem (iter_idx), 0); |
|
|
213 } |
|
|
214 |
|
4634
|
215 NDArray |
|
|
216 real (const ComplexNDArray& a) |
|
|
217 { |
|
|
218 int a_len = a.length (); |
|
|
219 NDArray retval; |
|
|
220 if (a_len > 0) |
|
|
221 retval = NDArray (mx_inline_real_dup (a.data (), a_len), a.dims ()); |
|
|
222 return retval; |
|
|
223 } |
|
|
224 |
|
|
225 NDArray |
|
|
226 imag (const ComplexNDArray& a) |
|
|
227 { |
|
|
228 int a_len = a.length (); |
|
|
229 NDArray retval; |
|
|
230 if (a_len > 0) |
|
|
231 retval = NDArray (mx_inline_imag_dup (a.data (), a_len), a.dims ()); |
|
|
232 return retval; |
|
|
233 } |
|
|
234 |
|
|
235 NDArray |
|
4569
|
236 NDArray::abs (void) const |
|
|
237 { |
|
4634
|
238 NDArray retval (dims ()); |
|
4569
|
239 |
|
4634
|
240 int nel = nelem (); |
|
|
241 |
|
|
242 for (int i = 0; i < nel; i++) |
|
|
243 retval(i) = fabs (elem (i)); |
|
4569
|
244 |
|
|
245 return retval; |
|
|
246 } |
|
|
247 |
|
4532
|
248 Matrix |
|
|
249 NDArray::matrix_value (void) const |
|
|
250 { |
|
|
251 Matrix retval; |
|
|
252 |
|
|
253 int nd = ndims (); |
|
|
254 |
|
|
255 switch (nd) |
|
|
256 { |
|
|
257 case 1: |
|
|
258 retval = Matrix (Array2<double> (*this, dimensions(0), 1)); |
|
|
259 break; |
|
|
260 |
|
|
261 case 2: |
|
|
262 retval = Matrix (Array2<double> (*this, dimensions(0), dimensions(1))); |
|
|
263 break; |
|
|
264 |
|
|
265 default: |
|
|
266 (*current_liboctave_error_handler) |
|
|
267 ("invalid converstion of NDArray to Matrix"); |
|
|
268 break; |
|
|
269 } |
|
|
270 |
|
|
271 return retval; |
|
|
272 } |
|
|
273 |
|
|
274 void |
|
|
275 NDArray::increment_index (Array<int>& ra_idx, |
|
|
276 const dim_vector& dimensions, |
|
|
277 int start_dimension) |
|
|
278 { |
|
|
279 ::increment_index (ra_idx, dimensions, start_dimension); |
|
|
280 } |
|
|
281 |
|
4556
|
282 int |
|
|
283 NDArray::compute_index (Array<int>& ra_idx, |
|
|
284 const dim_vector& dimensions) |
|
|
285 { |
|
|
286 return ::compute_index (ra_idx, dimensions); |
|
|
287 } |
|
|
288 |
|
4543
|
289 NDS_CMP_OPS(NDArray, , double, ) |
|
|
290 NDS_BOOL_OPS(NDArray, double, 0.0) |
|
|
291 |
|
|
292 SND_CMP_OPS(double, , NDArray, ) |
|
|
293 SND_BOOL_OPS(double, NDArray, 0.0) |
|
|
294 |
|
|
295 NDND_CMP_OPS(NDArray, , NDArray, ) |
|
|
296 NDND_BOOL_OPS(NDArray, NDArray, 0.0) |
|
|
297 |
|
4513
|
298 /* |
|
|
299 ;;; Local Variables: *** |
|
|
300 ;;; mode: C++ *** |
|
|
301 ;;; End: *** |
|
|
302 */ |
