|
3665
|
1 // Template array classes |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 2000 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 |
|
4192
|
24 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
3665
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
|
28 #ifdef HAVE_CONFIG_H |
|
|
29 #include <config.h> |
|
|
30 #endif |
|
|
31 |
|
|
32 #include <cassert> |
|
|
33 |
|
|
34 #include <iostream> |
|
|
35 |
|
|
36 #include "ArrayN.h" |
|
|
37 |
|
|
38 #if defined (HEAVYWEIGHT_INDEXING) |
|
|
39 #include "idx-vector.h" |
|
|
40 #include "ArrayN-idx.h" |
|
|
41 #endif |
|
|
42 |
|
|
43 #include "lo-error.h" |
|
|
44 |
|
|
45 // N-dimensional array class. |
|
|
46 |
|
|
47 template <class T> |
|
|
48 int |
|
4273
|
49 ArrayN<T>::compute_index (const Array<int>& ra_idx) const |
|
3665
|
50 { |
|
|
51 int retval = -1; |
|
|
52 |
|
|
53 int n = dimensions.length (); |
|
|
54 |
|
4273
|
55 if (n > 0 && n == ra_idx.length ()) |
|
3665
|
56 { |
|
4273
|
57 retval = ra_idx(--n); |
|
3665
|
58 |
|
|
59 while (--n >= 0) |
|
|
60 { |
|
|
61 retval *= dimensions(n); |
|
4273
|
62 retval += ra_idx(n); |
|
3665
|
63 } |
|
|
64 } |
|
|
65 else |
|
|
66 (*current_liboctave_error_handler) |
|
4273
|
67 ("ArrayN<T>::compute_index: invalid ra_idxing operation"); |
|
3665
|
68 |
|
|
69 return retval; |
|
|
70 } |
|
|
71 |
|
4142
|
72 // A guess (should be quite conservative). |
|
|
73 #define MALLOC_OVERHEAD 1024 |
|
|
74 |
|
3665
|
75 template <class T> |
|
|
76 int |
|
4273
|
77 ArrayN<T>::get_size (const Array<int>& ra_idx) |
|
3665
|
78 { |
|
|
79 // XXX KLUGE XXX |
|
|
80 |
|
|
81 // If an allocation of an array with r * c elements of type T |
|
|
82 // would cause an overflow in the allocator when computing the |
|
|
83 // size of the allocation, then return a value which, although |
|
|
84 // not equivalent to the actual request, should be too large for |
|
|
85 // most current hardware, but not so large to cause the |
|
|
86 // allocator to barf on computing retval * sizeof (T). |
|
|
87 |
|
|
88 static int nl; |
|
|
89 static double dl |
|
|
90 = frexp (static_cast<double> |
|
|
91 (INT_MAX - MALLOC_OVERHEAD) / sizeof (T), &nl); |
|
|
92 |
|
|
93 // This value should be an integer. If we return this value and |
|
|
94 // things work the way we expect, we should be paying a visit to |
|
|
95 // new_handler in no time flat. |
|
|
96 static int max_items = static_cast<int> (ldexp (dl, nl)); |
|
|
97 |
|
|
98 int retval = max_items; |
|
|
99 |
|
4273
|
100 int n = ra_idx.length (); |
|
3665
|
101 |
|
|
102 int nt = 0; |
|
|
103 double dt = 1; |
|
|
104 |
|
|
105 for (int i = 0; i < n; i++) |
|
|
106 { |
|
4273
|
107 int nra_idx; |
|
|
108 double dra_idx = frexp (static_cast<double> (ra_idx(i)), &nra_idx); |
|
3665
|
109 |
|
4273
|
110 nt += nra_idx; |
|
|
111 dt *= dra_idx; |
|
3665
|
112 } |
|
|
113 |
|
|
114 if (dt <= 0.5) |
|
|
115 { |
|
|
116 nt--; |
|
|
117 dt *= 2; |
|
|
118 |
|
|
119 if (dt <= 0.5) |
|
|
120 nt--; |
|
|
121 } |
|
|
122 |
|
|
123 if (nt < nl || (nt == nl && dt < dl)) |
|
|
124 { |
|
|
125 retval = 1; |
|
|
126 |
|
|
127 for (int i = 0; i < n; i++) |
|
4273
|
128 retval *= ra_idx(i); |
|
3665
|
129 } |
|
|
130 |
|
|
131 return retval; |
|
|
132 } |
|
|
133 |
|
4142
|
134 #undef MALLOC_OVERHEAD |
|
|
135 |
|
3665
|
136 template <class T> |
|
|
137 T |
|
4273
|
138 ArrayN<T>::range_error (const char *fcn, const Array<int>& ra_idx) const |
|
3665
|
139 { |
|
|
140 // XXX FIXME XXX -- report index values too! |
|
|
141 |
|
3928
|
142 (*current_liboctave_error_handler) ("range error in ArrayN"); |
|
3665
|
143 |
|
|
144 return T (); |
|
|
145 } |
|
|
146 |
|
|
147 template <class T> |
|
|
148 T& |
|
4273
|
149 ArrayN<T>::range_error (const char *fcn, const Array<int>& ra_idx) |
|
3665
|
150 { |
|
|
151 // XXX FIXME XXX -- report index values too! |
|
|
152 |
|
3928
|
153 (*current_liboctave_error_handler) ("range error in ArrayN"); |
|
3665
|
154 |
|
|
155 static T foo; |
|
|
156 return foo; |
|
|
157 } |
|
|
158 |
|
|
159 static inline bool |
|
4273
|
160 index_in_bounds (const Array<int>& ra_idx, const Array<int>& dimensions) |
|
3665
|
161 { |
|
|
162 bool retval = true; |
|
|
163 |
|
4273
|
164 int n = ra_idx.length (); |
|
3665
|
165 |
|
|
166 if (n == dimensions.length ()) |
|
|
167 { |
|
|
168 for (int i = 0; i < n; i++) |
|
|
169 { |
|
4273
|
170 if (ra_idx(i) < 0 || ra_idx(i) >= dimensions (i)) |
|
3665
|
171 { |
|
|
172 retval = false; |
|
|
173 break; |
|
|
174 } |
|
|
175 } |
|
|
176 } |
|
|
177 else |
|
|
178 retval = false; |
|
|
179 |
|
|
180 return retval; |
|
|
181 } |
|
|
182 |
|
|
183 static inline void |
|
4474
|
184 increment_index (Array<int>& ra_idx, const Array<int>& dimensions, |
|
|
185 int start_dimension = 0) |
|
3665
|
186 { |
|
4474
|
187 ra_idx(start_dimension)++; |
|
3665
|
188 |
|
4273
|
189 int n = ra_idx.length () - 1; |
|
3665
|
190 |
|
4474
|
191 for (int i = start_dimension; i < n; i++) |
|
3665
|
192 { |
|
4273
|
193 if (ra_idx(i) < dimensions(i)) |
|
4474
|
194 break; |
|
3665
|
195 else |
|
4474
|
196 { |
|
|
197 ra_idx(i) = 0; |
|
|
198 ra_idx(i+1)++; |
|
|
199 } |
|
3665
|
200 } |
|
|
201 } |
|
|
202 |
|
|
203 template <class T> |
|
|
204 void |
|
|
205 ArrayN<T>::resize (const Array<int>& dims) |
|
|
206 { |
|
|
207 int n = dims.length (); |
|
|
208 |
|
|
209 for (int i = 0; i < n; i++) |
|
|
210 { |
|
|
211 if (dims(i) < 0) |
|
|
212 { |
|
|
213 (*current_liboctave_error_handler) |
|
|
214 ("can't resize to negative dimension"); |
|
|
215 return; |
|
|
216 } |
|
|
217 } |
|
|
218 |
|
|
219 bool no_change = true; |
|
|
220 |
|
|
221 for (int i = 0; i < n; i++) |
|
|
222 { |
|
|
223 if (dims(i) != dimensions(i)) |
|
|
224 { |
|
|
225 no_change = false; |
|
|
226 break; |
|
|
227 } |
|
|
228 } |
|
|
229 |
|
|
230 if (no_change) |
|
|
231 return; |
|
|
232 |
|
4473
|
233 int old_len = length (); |
|
|
234 |
|
4323
|
235 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; |
|
3665
|
236 const T *old_data = data (); |
|
|
237 |
|
4323
|
238 Array<T>::rep = new typename Array<T>::ArrayRep (get_size (dims)); |
|
3665
|
239 |
|
|
240 Array<int> old_dimensions = dimensions; |
|
|
241 |
|
|
242 dimensions = dims; |
|
|
243 |
|
4273
|
244 Array<int> ra_idx (dimensions.length (), 0); |
|
3665
|
245 |
|
|
246 for (int i = 0; i < old_len; i++) |
|
|
247 { |
|
4273
|
248 if (index_in_bounds (ra_idx, dimensions)) |
|
|
249 xelem (ra_idx) = old_data[i]; |
|
3665
|
250 |
|
4273
|
251 increment_index (ra_idx, dimensions); |
|
3665
|
252 } |
|
|
253 |
|
|
254 if (--old_rep->count <= 0) |
|
|
255 delete old_rep; |
|
|
256 } |
|
|
257 |
|
|
258 template <class T> |
|
|
259 void |
|
|
260 ArrayN<T>::resize (const Array<int>& dims, const T& val) |
|
|
261 { |
|
|
262 int n = dims.length (); |
|
|
263 |
|
|
264 for (int i = 0; i < n; i++) |
|
|
265 { |
|
|
266 if (dims(i) < 0) |
|
|
267 { |
|
|
268 (*current_liboctave_error_handler) |
|
|
269 ("can't resize to negative dimension"); |
|
|
270 return; |
|
|
271 } |
|
|
272 } |
|
|
273 |
|
|
274 bool no_change = true; |
|
|
275 |
|
|
276 for (int i = 0; i < n; i++) |
|
|
277 { |
|
|
278 if (dims(i) != dimensions(i)) |
|
|
279 { |
|
|
280 no_change = false; |
|
|
281 break; |
|
|
282 } |
|
|
283 } |
|
|
284 |
|
|
285 if (no_change) |
|
|
286 return; |
|
|
287 |
|
4323
|
288 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; |
|
3665
|
289 const T *old_data = data (); |
|
|
290 |
|
4473
|
291 int old_len = length (); |
|
|
292 |
|
3665
|
293 int len = get_size (dims); |
|
|
294 |
|
4323
|
295 Array<T>::rep = new typename Array<T>::ArrayRep (len); |
|
3665
|
296 |
|
|
297 Array<int> old_dimensions = dimensions; |
|
|
298 |
|
|
299 dimensions = dims; |
|
|
300 |
|
4273
|
301 Array<int> ra_idx (dimensions.length (), 0); |
|
3665
|
302 |
|
|
303 for (int i = 0; i < len; i++) |
|
4323
|
304 Array<T>::rep->elem (i) = val; |
|
3665
|
305 |
|
|
306 for (int i = 0; i < old_len; i++) |
|
|
307 { |
|
4273
|
308 if (index_in_bounds (ra_idx, dimensions)) |
|
|
309 xelem (ra_idx) = old_data[i]; |
|
3665
|
310 |
|
4273
|
311 increment_index (ra_idx, dimensions); |
|
3665
|
312 } |
|
|
313 |
|
|
314 if (--old_rep->count <= 0) |
|
|
315 delete old_rep; |
|
|
316 } |
|
|
317 |
|
|
318 template <class T> |
|
|
319 ArrayN<T>& |
|
4273
|
320 ArrayN<T>::insert (const ArrayN<T>& a, const Array<int>& ra_idx) |
|
3665
|
321 { |
|
4273
|
322 int n = ra_idx.length (); |
|
3665
|
323 |
|
|
324 if (n == dimensions.length ()) |
|
|
325 { |
|
|
326 Array<int> a_dims = a.dims (); |
|
|
327 |
|
|
328 for (int i = 0; i < n; i++) |
|
|
329 { |
|
4273
|
330 if (ra_idx(i) < 0 || ra_idx(i) + a_dims(i) > dimensions(i)) |
|
3665
|
331 { |
|
|
332 (*current_liboctave_error_handler) |
|
|
333 ("ArrayN<T>::insert: range error for insert"); |
|
|
334 return *this; |
|
|
335 } |
|
|
336 } |
|
|
337 |
|
|
338 #if 0 |
|
|
339 // XXX FIXME XXX -- need to copy elements |
|
|
340 |
|
|
341 for (int j = 0; j < a_cols; j++) |
|
|
342 for (int i = 0; i < a_rows; i++) |
|
|
343 elem (r+i, c+j) = a.elem (i, j); |
|
|
344 #endif |
|
|
345 |
|
|
346 } |
|
|
347 else |
|
|
348 (*current_liboctave_error_handler) |
|
|
349 ("ArrayN<T>::insert: invalid indexing operation"); |
|
|
350 |
|
|
351 return *this; |
|
|
352 } |
|
|
353 |
|
|
354 template <class T> |
|
|
355 std::ostream& |
|
|
356 operator << (std::ostream& os, const ArrayN<T>& a) |
|
|
357 { |
|
4473
|
358 Array<int> a_dims = a.dimensions; |
|
|
359 |
|
|
360 int n_dims = a_dims.length (); |
|
|
361 |
|
|
362 os << n_dims << "-dimensional array"; |
|
|
363 |
|
|
364 if (n_dims) |
|
|
365 { |
|
|
366 os << " ("; |
|
|
367 |
|
|
368 for (int i = 0; i < n_dims - 1; i++) |
|
|
369 os << a_dims(i) << "x"; |
|
|
370 |
|
|
371 os << a_dims(n_dims-1) << ")"; |
|
|
372 } |
|
|
373 |
|
|
374 os <<"\n\n"; |
|
3665
|
375 |
|
4473
|
376 if (n_dims) |
|
|
377 { |
|
|
378 os << "data:"; |
|
|
379 |
|
|
380 Array<int> ra_idx (n_dims,0); |
|
|
381 |
|
|
382 // Number of times the first 2d-array is to be displayed. |
|
3665
|
383 |
|
4473
|
384 int m = 1; |
|
|
385 for (int i = 2; i < n_dims; i++) |
|
|
386 m *= a_dims(i); |
|
|
387 |
|
|
388 if (m == 1) |
|
|
389 { |
|
|
390 int rows = 0; |
|
|
391 int cols = 0; |
|
|
392 |
|
|
393 switch (n_dims) |
|
|
394 { |
|
|
395 case 2: |
|
|
396 rows = a_dims(0); |
|
|
397 cols = a_dims(1); |
|
3665
|
398 |
|
4473
|
399 for (int j = 0; j < rows; j++) |
|
|
400 { |
|
|
401 ra_idx(0) = j; |
|
|
402 for (int k = 0; k < cols; k++) |
|
|
403 { |
|
|
404 ra_idx(1) = k; |
|
|
405 os << " " << a.elem(ra_idx); |
|
|
406 } |
|
|
407 os << "\n"; |
|
|
408 } |
|
|
409 break; |
|
|
410 |
|
|
411 case 1: |
|
|
412 rows = a_dims(0); |
|
|
413 |
|
|
414 for (int k = 0; k < rows; k++) |
|
|
415 { |
|
|
416 ra_idx(0) = k; |
|
|
417 os << " " << a.elem(ra_idx); |
|
|
418 } |
|
|
419 break; |
|
|
420 |
|
|
421 default: |
|
|
422 (*current_liboctave_error_handler) |
|
|
423 ("std::operator <<: problems with dimensions (= 0)!"); |
|
|
424 } |
|
3665
|
425 |
|
4473
|
426 os << "\n"; |
|
|
427 } |
|
|
428 else |
|
|
429 { |
|
|
430 int rows = a_dims(0); |
|
|
431 int cols = a_dims(1); |
|
|
432 |
|
|
433 for (int i = 0; i < m; i++) |
|
|
434 { |
|
|
435 os << "\n(:,:,"; |
|
|
436 |
|
|
437 for (int j = 2; j < n_dims - 1; j++) |
|
|
438 os << ra_idx(j) + 1 << ","; |
|
|
439 |
|
|
440 os << ra_idx(n_dims - 1) + 1 << ") = \n"; |
|
3665
|
441 |
|
4473
|
442 for (int j = 0; j < rows; j++) |
|
|
443 { |
|
|
444 ra_idx(0) = j; |
|
|
445 |
|
|
446 for (int k = 0; k < cols; k++) |
|
|
447 { |
|
|
448 ra_idx(1) = k; |
|
|
449 os << " " << a.elem(ra_idx); |
|
|
450 } |
|
3665
|
451 |
|
4473
|
452 os << "\n"; |
|
|
453 } |
|
|
454 |
|
|
455 os << "\n"; |
|
|
456 |
|
|
457 if (i != m - 1) |
|
|
458 increment_index (ra_idx, a_dims, 2); |
|
|
459 } |
|
|
460 } |
|
|
461 } |
|
3665
|
462 |
|
|
463 return os; |
|
|
464 } |
|
|
465 |
|
|
466 /* |
|
|
467 ;;; Local Variables: *** |
|
|
468 ;;; mode: C++ *** |
|
|
469 ;;; End: *** |
|
|
470 */ |
