|
1993
|
1 // Template array classes |
|
237
|
2 /* |
|
|
3 |
|
2847
|
4 Copyright (C) 1996, 1997 John W. Eaton |
|
237
|
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 |
|
1315
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
237
|
21 |
|
|
22 */ |
|
|
23 |
|
4192
|
24 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
1296
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
237
|
28 #ifdef HAVE_CONFIG_H |
|
1192
|
29 #include <config.h> |
|
237
|
30 #endif |
|
|
31 |
|
1367
|
32 #include <cassert> |
|
4518
|
33 #include <climits> |
|
449
|
34 |
|
3503
|
35 #include <iostream> |
|
1560
|
36 |
|
237
|
37 #include "Array.h" |
|
4517
|
38 #include "Array-flags.h" |
|
|
39 #include "Range.h" |
|
1560
|
40 #include "idx-vector.h" |
|
|
41 #include "lo-error.h" |
|
|
42 |
|
1360
|
43 // One dimensional array class. Handles the reference counting for |
|
|
44 // all the derived classes. |
|
237
|
45 |
|
|
46 template <class T> |
|
1619
|
47 Array<T>::~Array (void) |
|
|
48 { |
|
|
49 if (--rep->count <= 0) |
|
|
50 delete rep; |
|
|
51 |
|
|
52 delete [] idx; |
|
4513
|
53 } |
|
|
54 |
|
|
55 // A guess (should be quite conservative). |
|
|
56 #define MALLOC_OVERHEAD 1024 |
|
|
57 |
|
|
58 template <class T> |
|
|
59 int |
|
|
60 Array<T>::get_size (int r, int c) |
|
|
61 { |
|
|
62 // XXX KLUGE XXX |
|
|
63 |
|
|
64 // If an allocation of an array with r * c elements of type T |
|
|
65 // would cause an overflow in the allocator when computing the |
|
|
66 // size of the allocation, then return a value which, although |
|
|
67 // not equivalent to the actual request, should be too large for |
|
|
68 // most current hardware, but not so large to cause the |
|
|
69 // allocator to barf on computing retval * sizeof (T). |
|
|
70 |
|
|
71 static int nl; |
|
|
72 static double dl |
|
|
73 = frexp (static_cast<double> |
|
|
74 (INT_MAX - MALLOC_OVERHEAD) / sizeof (T), &nl); |
|
|
75 |
|
|
76 // This value should be an integer. If we return this value and |
|
|
77 // things work the way we expect, we should be paying a visit to |
|
|
78 // new_handler in no time flat. |
|
|
79 static int max_items = static_cast<int> (ldexp (dl, nl)); |
|
|
80 |
|
|
81 int nr, nc; |
|
|
82 double dr = frexp (static_cast<double> (r), &nr); |
|
|
83 double dc = frexp (static_cast<double> (c), &nc); |
|
|
84 |
|
|
85 int nt = nr + nc; |
|
|
86 double dt = dr * dc; |
|
|
87 |
|
|
88 if (dt <= 0.5) |
|
|
89 { |
|
|
90 nt--; |
|
|
91 dt *= 2; |
|
|
92 |
|
|
93 if (dt <= 0.5) |
|
|
94 nt--; |
|
|
95 } |
|
|
96 |
|
|
97 return (nt < nl || (nt == nl && dt < dl)) ? r * c : max_items; |
|
237
|
98 } |
|
|
99 |
|
|
100 template <class T> |
|
4513
|
101 int |
|
|
102 Array<T>::get_size (int r, int c, int p) |
|
237
|
103 { |
|
4513
|
104 // XXX KLUGE XXX |
|
|
105 |
|
|
106 // If an allocation of an array with r * c * p elements of type T |
|
|
107 // would cause an overflow in the allocator when computing the |
|
|
108 // size of the allocation, then return a value which, although |
|
|
109 // not equivalent to the actual request, should be too large for |
|
|
110 // most current hardware, but not so large to cause the |
|
|
111 // allocator to barf on computing retval * sizeof (T). |
|
|
112 |
|
|
113 static int nl; |
|
|
114 static double dl |
|
|
115 = frexp (static_cast<double> |
|
|
116 (INT_MAX - MALLOC_OVERHEAD) / sizeof (T), &nl); |
|
|
117 |
|
|
118 // This value should be an integer. If we return this value and |
|
|
119 // things work the way we expect, we should be paying a visit to |
|
|
120 // new_handler in no time flat. |
|
|
121 static int max_items = static_cast<int> (ldexp (dl, nl)); |
|
|
122 |
|
|
123 int nr, nc, np; |
|
|
124 double dr = frexp (static_cast<double> (r), &nr); |
|
|
125 double dc = frexp (static_cast<double> (c), &nc); |
|
|
126 double dp = frexp (static_cast<double> (p), &np); |
|
|
127 |
|
|
128 int nt = nr + nc + np; |
|
|
129 double dt = dr * dc * dp; |
|
|
130 |
|
|
131 if (dt <= 0.5) |
|
659
|
132 { |
|
4513
|
133 nt--; |
|
|
134 dt *= 2; |
|
237
|
135 |
|
4513
|
136 if (dt <= 0.5) |
|
|
137 nt--; |
|
659
|
138 } |
|
1619
|
139 |
|
4513
|
140 return (nt < nl || (nt == nl && dt < dl)) ? r * c * p : max_items; |
|
237
|
141 } |
|
|
142 |
|
|
143 template <class T> |
|
4513
|
144 int |
|
|
145 Array<T>::get_size (const dim_vector& ra_idx) |
|
237
|
146 { |
|
4513
|
147 // XXX KLUGE XXX |
|
|
148 |
|
|
149 // If an allocation of an array with r * c elements of type T |
|
|
150 // would cause an overflow in the allocator when computing the |
|
|
151 // size of the allocation, then return a value which, although |
|
|
152 // not equivalent to the actual request, should be too large for |
|
|
153 // most current hardware, but not so large to cause the |
|
|
154 // allocator to barf on computing retval * sizeof (T). |
|
|
155 |
|
|
156 static int nl; |
|
|
157 static double dl |
|
|
158 = frexp (static_cast<double> |
|
|
159 (INT_MAX - MALLOC_OVERHEAD) / sizeof (T), &nl); |
|
|
160 |
|
|
161 // This value should be an integer. If we return this value and |
|
|
162 // things work the way we expect, we should be paying a visit to |
|
|
163 // new_handler in no time flat. |
|
|
164 |
|
|
165 static int max_items = static_cast<int> (ldexp (dl, nl)); |
|
|
166 |
|
|
167 int retval = max_items; |
|
|
168 |
|
|
169 int n = ra_idx.length (); |
|
|
170 |
|
|
171 int nt = 0; |
|
|
172 double dt = 1; |
|
|
173 |
|
|
174 for (int i = 0; i < n; i++) |
|
237
|
175 { |
|
4513
|
176 int nra_idx; |
|
|
177 double dra_idx = frexp (static_cast<double> (ra_idx(i)), &nra_idx); |
|
|
178 |
|
|
179 nt += nra_idx; |
|
|
180 dt *= dra_idx; |
|
237
|
181 } |
|
|
182 |
|
4513
|
183 if (dt <= 0.5) |
|
|
184 { |
|
|
185 nt--; |
|
|
186 dt *= 2; |
|
237
|
187 |
|
4513
|
188 if (dt <= 0.5) |
|
|
189 nt--; |
|
237
|
190 } |
|
|
191 |
|
4513
|
192 if (nt < nl || (nt == nl && dt < dl)) |
|
|
193 { |
|
|
194 retval = 1; |
|
|
195 |
|
|
196 for (int i = 0; i < n; i++) |
|
|
197 retval *= ra_idx(i); |
|
|
198 } |
|
|
199 |
|
|
200 return retval; |
|
237
|
201 } |
|
|
202 |
|
4513
|
203 #undef MALLOC_OVERHEAD |
|
|
204 |
|
237
|
205 template <class T> |
|
4513
|
206 int |
|
|
207 Array<T>::compute_index (const Array<int>& ra_idx) const |
|
237
|
208 { |
|
4513
|
209 int retval = -1; |
|
|
210 |
|
|
211 int n = dimensions.length (); |
|
|
212 |
|
|
213 if (n > 0 && n == ra_idx.length ()) |
|
237
|
214 { |
|
4513
|
215 retval = ra_idx(--n); |
|
237
|
216 |
|
4513
|
217 while (--n >= 0) |
|
|
218 { |
|
|
219 retval *= dimensions(n); |
|
|
220 retval += ra_idx(n); |
|
|
221 } |
|
|
222 } |
|
|
223 else |
|
|
224 (*current_liboctave_error_handler) |
|
|
225 ("Array<T>::compute_index: invalid ra_idxing operation"); |
|
237
|
226 |
|
4513
|
227 return retval; |
|
237
|
228 } |
|
|
229 |
|
2049
|
230 template <class T> |
|
|
231 T |
|
2109
|
232 Array<T>::range_error (const char *fcn, int n) const |
|
2049
|
233 { |
|
2109
|
234 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
|
2049
|
235 return T (); |
|
|
236 } |
|
|
237 |
|
|
238 template <class T> |
|
|
239 T& |
|
2109
|
240 Array<T>::range_error (const char *fcn, int n) |
|
2049
|
241 { |
|
2109
|
242 (*current_liboctave_error_handler) ("%s (%d): range error", fcn, n); |
|
2049
|
243 static T foo; |
|
|
244 return foo; |
|
|
245 } |
|
|
246 |
|
3933
|
247 template <class T> |
|
4513
|
248 T |
|
|
249 Array<T>::range_error (const char *fcn, int i, int j) const |
|
|
250 { |
|
|
251 (*current_liboctave_error_handler) |
|
|
252 ("%s (%d, %d): range error", fcn, i, j); |
|
|
253 return T (); |
|
|
254 } |
|
|
255 |
|
|
256 template <class T> |
|
|
257 T& |
|
|
258 Array<T>::range_error (const char *fcn, int i, int j) |
|
|
259 { |
|
|
260 (*current_liboctave_error_handler) |
|
|
261 ("%s (%d, %d): range error", fcn, i, j); |
|
|
262 static T foo; |
|
|
263 return foo; |
|
|
264 } |
|
|
265 |
|
|
266 template <class T> |
|
|
267 T |
|
|
268 Array<T>::range_error (const char *fcn, int i, int j, int k) const |
|
|
269 { |
|
|
270 (*current_liboctave_error_handler) |
|
|
271 ("%s (%d, %d, %d): range error", fcn, i, j, k); |
|
|
272 return T (); |
|
|
273 } |
|
|
274 |
|
|
275 template <class T> |
|
|
276 T& |
|
|
277 Array<T>::range_error (const char *fcn, int i, int j, int k) |
|
|
278 { |
|
|
279 (*current_liboctave_error_handler) |
|
|
280 ("%s (%d, %d, %d): range error", fcn, i, j, k); |
|
|
281 static T foo; |
|
|
282 return foo; |
|
|
283 } |
|
|
284 |
|
|
285 template <class T> |
|
|
286 T |
|
|
287 Array<T>::range_error (const char *fcn, const Array<int>& ra_idx) const |
|
|
288 { |
|
|
289 // XXX FIXME XXX -- report index values too! |
|
|
290 |
|
|
291 (*current_liboctave_error_handler) ("range error in Array"); |
|
|
292 |
|
|
293 return T (); |
|
|
294 } |
|
|
295 |
|
|
296 template <class T> |
|
|
297 T& |
|
|
298 Array<T>::range_error (const char *fcn, const Array<int>& ra_idx) |
|
|
299 { |
|
|
300 // XXX FIXME XXX -- report index values too! |
|
|
301 |
|
|
302 (*current_liboctave_error_handler) ("range error in Array"); |
|
|
303 |
|
|
304 static T foo; |
|
|
305 return foo; |
|
|
306 } |
|
|
307 |
|
|
308 template <class T> |
|
|
309 void |
|
|
310 Array<T>::resize_no_fill (int n) |
|
|
311 { |
|
|
312 if (n < 0) |
|
|
313 { |
|
|
314 (*current_liboctave_error_handler) |
|
|
315 ("can't resize to negative dimension"); |
|
|
316 return; |
|
|
317 } |
|
|
318 |
|
|
319 if (n == length ()) |
|
|
320 return; |
|
|
321 |
|
|
322 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
323 const T *old_data = data (); |
|
|
324 int old_len = length (); |
|
|
325 |
|
|
326 rep = new typename Array<T>::ArrayRep (n); |
|
|
327 |
|
|
328 dimensions = dim_vector (n); |
|
|
329 |
|
|
330 if (old_data && old_len > 0) |
|
|
331 { |
|
|
332 int min_len = old_len < n ? old_len : n; |
|
|
333 |
|
|
334 for (int i = 0; i < min_len; i++) |
|
|
335 xelem (i) = old_data[i]; |
|
|
336 } |
|
|
337 |
|
|
338 if (--old_rep->count <= 0) |
|
|
339 delete old_rep; |
|
|
340 } |
|
|
341 |
|
|
342 template <class T> |
|
|
343 void |
|
|
344 Array<T>::resize_no_fill (const dim_vector& dims) |
|
|
345 { |
|
|
346 int n = dims.length (); |
|
|
347 |
|
|
348 for (int i = 0; i < n; i++) |
|
|
349 { |
|
|
350 if (dims(i) < 0) |
|
|
351 { |
|
|
352 (*current_liboctave_error_handler) |
|
|
353 ("can't resize to negative dimension"); |
|
|
354 return; |
|
|
355 } |
|
|
356 } |
|
|
357 |
|
|
358 bool no_change = true; |
|
|
359 |
|
|
360 for (int i = 0; i < n; i++) |
|
|
361 { |
|
|
362 if (dims(i) != dimensions(i)) |
|
|
363 { |
|
|
364 no_change = false; |
|
|
365 break; |
|
|
366 } |
|
|
367 } |
|
|
368 |
|
|
369 if (no_change) |
|
|
370 return; |
|
|
371 |
|
|
372 int old_len = length (); |
|
|
373 |
|
|
374 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
375 const T *old_data = data (); |
|
|
376 |
|
|
377 rep = new typename Array<T>::ArrayRep (get_size (dims)); |
|
|
378 |
|
|
379 dim_vector old_dimensions = dimensions; |
|
|
380 |
|
|
381 dimensions = dims; |
|
|
382 |
|
|
383 Array<int> ra_idx (dimensions.length (), 0); |
|
|
384 |
|
|
385 for (int i = 0; i < old_len; i++) |
|
|
386 { |
|
|
387 if (index_in_bounds (ra_idx, dimensions)) |
|
|
388 xelem (ra_idx) = old_data[i]; |
|
|
389 |
|
|
390 increment_index (ra_idx, dimensions); |
|
|
391 } |
|
|
392 |
|
|
393 if (--old_rep->count <= 0) |
|
|
394 delete old_rep; |
|
|
395 } |
|
|
396 |
|
|
397 template <class T> |
|
|
398 void |
|
|
399 Array<T>::resize_no_fill (int r, int c) |
|
|
400 { |
|
|
401 if (r < 0 || c < 0) |
|
|
402 { |
|
|
403 (*current_liboctave_error_handler) |
|
|
404 ("can't resize to negative dimension"); |
|
|
405 return; |
|
|
406 } |
|
|
407 |
|
|
408 if (r == dim1 () && c == dim2 ()) |
|
|
409 return; |
|
|
410 |
|
|
411 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; |
|
|
412 const T *old_data = data (); |
|
|
413 |
|
|
414 int old_d1 = dim1 (); |
|
|
415 int old_d2 = dim2 (); |
|
|
416 int old_len = length (); |
|
|
417 |
|
|
418 rep = new typename Array<T>::ArrayRep (get_size (r, c)); |
|
|
419 |
|
|
420 dimensions = dim_vector (r, c); |
|
|
421 |
|
|
422 if (old_data && old_len > 0) |
|
|
423 { |
|
|
424 int min_r = old_d1 < r ? old_d1 : r; |
|
|
425 int min_c = old_d2 < c ? old_d2 : c; |
|
|
426 |
|
|
427 for (int j = 0; j < min_c; j++) |
|
|
428 for (int i = 0; i < min_r; i++) |
|
|
429 xelem (i, j) = old_data[old_d1*j+i]; |
|
|
430 } |
|
|
431 |
|
|
432 if (--old_rep->count <= 0) |
|
|
433 delete old_rep; |
|
|
434 } |
|
|
435 |
|
|
436 template <class T> |
|
|
437 void |
|
|
438 Array<T>::resize_no_fill (int r, int c, int p) |
|
|
439 { |
|
|
440 if (r < 0 || c < 0 || p < 0) |
|
|
441 { |
|
|
442 (*current_liboctave_error_handler) |
|
|
443 ("can't resize to negative dimension"); |
|
|
444 return; |
|
|
445 } |
|
|
446 |
|
|
447 if (r == dim1 () && c == dim2 () && p == dim3 ()) |
|
|
448 return; |
|
|
449 |
|
|
450 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
451 const T *old_data = data (); |
|
|
452 |
|
|
453 int old_d1 = dim1 (); |
|
|
454 int old_d2 = dim2 (); |
|
|
455 int old_d3 = dim3 (); |
|
|
456 int old_len = length (); |
|
|
457 |
|
|
458 int ts = get_size (get_size (r, c), p); |
|
|
459 |
|
|
460 rep = new typename Array<T>::ArrayRep (ts); |
|
|
461 |
|
|
462 dimensions = dim_vector (r, c, p); |
|
|
463 |
|
|
464 if (old_data && old_len > 0) |
|
|
465 { |
|
|
466 int min_r = old_d1 < r ? old_d1 : r; |
|
|
467 int min_c = old_d2 < c ? old_d2 : c; |
|
|
468 int min_p = old_d3 < p ? old_d3 : p; |
|
|
469 |
|
|
470 for (int k = 0; k < min_p; k++) |
|
|
471 for (int j = 0; j < min_c; j++) |
|
|
472 for (int i = 0; i < min_r; i++) |
|
|
473 xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i]; |
|
|
474 } |
|
|
475 |
|
|
476 if (--old_rep->count <= 0) |
|
|
477 delete old_rep; |
|
|
478 } |
|
|
479 |
|
|
480 template <class T> |
|
|
481 void |
|
|
482 Array<T>::resize_and_fill (int n, const T& val) |
|
|
483 { |
|
|
484 if (n < 0) |
|
|
485 { |
|
|
486 (*current_liboctave_error_handler) |
|
|
487 ("can't resize to negative dimension"); |
|
|
488 return; |
|
|
489 } |
|
|
490 |
|
|
491 if (n == length ()) |
|
|
492 return; |
|
|
493 |
|
|
494 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
495 const T *old_data = data (); |
|
|
496 int old_len = length (); |
|
|
497 |
|
|
498 rep = new typename Array<T>::ArrayRep (n); |
|
|
499 |
|
|
500 dimensions = dim_vector (n); |
|
|
501 |
|
|
502 int min_len = old_len < n ? old_len : n; |
|
|
503 |
|
|
504 if (old_data && old_len > 0) |
|
|
505 { |
|
|
506 for (int i = 0; i < min_len; i++) |
|
|
507 xelem (i) = old_data[i]; |
|
|
508 } |
|
|
509 |
|
|
510 for (int i = old_len; i < n; i++) |
|
|
511 xelem (i) = val; |
|
|
512 |
|
|
513 if (--old_rep->count <= 0) |
|
|
514 delete old_rep; |
|
|
515 } |
|
|
516 |
|
|
517 template <class T> |
|
|
518 void |
|
|
519 Array<T>::resize_and_fill (int r, int c, const T& val) |
|
|
520 { |
|
|
521 if (r < 0 || c < 0) |
|
|
522 { |
|
|
523 (*current_liboctave_error_handler) |
|
|
524 ("can't resize to negative dimension"); |
|
|
525 return; |
|
|
526 } |
|
|
527 |
|
|
528 if (r == dim1 () && c == dim2 ()) |
|
|
529 return; |
|
|
530 |
|
|
531 typename Array<T>::ArrayRep *old_rep = Array<T>::rep; |
|
|
532 const T *old_data = data (); |
|
|
533 |
|
|
534 int old_d1 = dim1 (); |
|
|
535 int old_d2 = dim2 (); |
|
|
536 int old_len = length (); |
|
|
537 |
|
|
538 rep = new typename Array<T>::ArrayRep (get_size (r, c)); |
|
|
539 |
|
|
540 dimensions = dim_vector (r, c); |
|
|
541 |
|
|
542 int min_r = old_d1 < r ? old_d1 : r; |
|
|
543 int min_c = old_d2 < c ? old_d2 : c; |
|
|
544 |
|
|
545 if (old_data && old_len > 0) |
|
|
546 { |
|
|
547 for (int j = 0; j < min_c; j++) |
|
|
548 for (int i = 0; i < min_r; i++) |
|
|
549 xelem (i, j) = old_data[old_d1*j+i]; |
|
|
550 } |
|
|
551 |
|
|
552 for (int j = 0; j < min_c; j++) |
|
|
553 for (int i = min_r; i < r; i++) |
|
|
554 xelem (i, j) = val; |
|
|
555 |
|
|
556 for (int j = min_c; j < c; j++) |
|
|
557 for (int i = 0; i < r; i++) |
|
|
558 xelem (i, j) = val; |
|
|
559 |
|
|
560 if (--old_rep->count <= 0) |
|
|
561 delete old_rep; |
|
|
562 } |
|
|
563 |
|
|
564 template <class T> |
|
|
565 void |
|
|
566 Array<T>::resize_and_fill (int r, int c, int p, const T& val) |
|
|
567 { |
|
|
568 if (r < 0 || c < 0 || p < 0) |
|
|
569 { |
|
|
570 (*current_liboctave_error_handler) |
|
|
571 ("can't resize to negative dimension"); |
|
|
572 return; |
|
|
573 } |
|
|
574 |
|
|
575 if (r == dim1 () && c == dim2 () && p == dim3 ()) |
|
|
576 return; |
|
|
577 |
|
|
578 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
579 const T *old_data = data (); |
|
|
580 |
|
|
581 int old_d1 = dim1 (); |
|
|
582 int old_d2 = dim2 (); |
|
|
583 int old_d3 = dim3 (); |
|
|
584 |
|
|
585 int old_len = length (); |
|
|
586 |
|
|
587 int ts = get_size (get_size (r, c), p); |
|
|
588 |
|
|
589 rep = new typename Array<T>::ArrayRep (ts); |
|
|
590 |
|
|
591 dimensions = dim_vector (r, c, p); |
|
|
592 |
|
|
593 int min_r = old_d1 < r ? old_d1 : r; |
|
|
594 int min_c = old_d2 < c ? old_d2 : c; |
|
|
595 int min_p = old_d3 < p ? old_d3 : p; |
|
|
596 |
|
|
597 if (old_data && old_len > 0) |
|
|
598 for (int k = 0; k < min_p; k++) |
|
|
599 for (int j = 0; j < min_c; j++) |
|
|
600 for (int i = 0; i < min_r; i++) |
|
|
601 xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i]; |
|
|
602 |
|
|
603 // XXX FIXME XXX -- if the copy constructor is expensive, this may |
|
|
604 // win. Otherwise, it may make more sense to just copy the value |
|
|
605 // everywhere when making the new ArrayRep. |
|
|
606 |
|
|
607 for (int k = 0; k < min_p; k++) |
|
|
608 for (int j = min_c; j < c; j++) |
|
|
609 for (int i = 0; i < min_r; i++) |
|
|
610 xelem (i, j, k) = val; |
|
|
611 |
|
|
612 for (int k = 0; k < min_p; k++) |
|
|
613 for (int j = 0; j < c; j++) |
|
|
614 for (int i = min_r; i < r; i++) |
|
|
615 xelem (i, j, k) = val; |
|
|
616 |
|
|
617 for (int k = min_p; k < p; k++) |
|
|
618 for (int j = 0; j < c; j++) |
|
|
619 for (int i = 0; i < r; i++) |
|
|
620 xelem (i, j, k) = val; |
|
|
621 |
|
|
622 if (--old_rep->count <= 0) |
|
|
623 delete old_rep; |
|
|
624 } |
|
|
625 |
|
|
626 template <class T> |
|
|
627 void |
|
|
628 Array<T>::resize_and_fill (const dim_vector& dims, const T& val) |
|
|
629 { |
|
|
630 int n = dims.length (); |
|
|
631 |
|
|
632 for (int i = 0; i < n; i++) |
|
|
633 { |
|
|
634 if (dims(i) < 0) |
|
|
635 { |
|
|
636 (*current_liboctave_error_handler) |
|
|
637 ("can't resize to negative dimension"); |
|
|
638 return; |
|
|
639 } |
|
|
640 } |
|
|
641 |
|
|
642 bool no_change = true; |
|
|
643 |
|
|
644 for (int i = 0; i < n; i++) |
|
|
645 { |
|
|
646 if (dims(i) != dimensions(i)) |
|
|
647 { |
|
|
648 no_change = false; |
|
|
649 break; |
|
|
650 } |
|
|
651 } |
|
|
652 |
|
|
653 if (no_change) |
|
|
654 return; |
|
|
655 |
|
|
656 typename Array<T>::ArrayRep *old_rep = rep; |
|
|
657 const T *old_data = data (); |
|
|
658 |
|
|
659 int old_len = length (); |
|
|
660 |
|
|
661 int len = get_size (dims); |
|
|
662 |
|
|
663 rep = new typename Array<T>::ArrayRep (len); |
|
|
664 |
|
|
665 dim_vector old_dimensions = dimensions; |
|
|
666 |
|
|
667 dimensions = dims; |
|
|
668 |
|
|
669 Array<int> ra_idx (dimensions.length (), 0); |
|
|
670 |
|
|
671 // XXX FIXME XXX -- it is much simpler to fill the whole array |
|
|
672 // first, but probably slower for large arrays, or if the assignment |
|
|
673 // operator for the type T is expensive. OTOH, the logic for |
|
|
674 // deciding whether an element needs the copied value or the filled |
|
|
675 // value might be more expensive. |
|
|
676 |
|
|
677 for (int i = 0; i < len; i++) |
|
|
678 rep->elem (i) = val; |
|
|
679 |
|
|
680 for (int i = 0; i < old_len; i++) |
|
|
681 { |
|
|
682 if (index_in_bounds (ra_idx, dimensions)) |
|
|
683 xelem (ra_idx) = old_data[i]; |
|
|
684 |
|
|
685 increment_index (ra_idx, dimensions); |
|
|
686 } |
|
|
687 |
|
|
688 if (--old_rep->count <= 0) |
|
|
689 delete old_rep; |
|
|
690 } |
|
|
691 |
|
|
692 template <class T> |
|
|
693 Array<T>& |
|
|
694 Array<T>::insert (const Array<T>& a, int r, int c) |
|
|
695 { |
|
|
696 int a_rows = a.rows (); |
|
|
697 int a_cols = a.cols (); |
|
|
698 |
|
|
699 if (r < 0 || r + a_rows > rows () || c < 0 || c + a_cols > cols ()) |
|
|
700 { |
|
|
701 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
702 return *this; |
|
|
703 } |
|
|
704 |
|
|
705 for (int j = 0; j < a_cols; j++) |
|
|
706 for (int i = 0; i < a_rows; i++) |
|
|
707 elem (r+i, c+j) = a.elem (i, j); |
|
|
708 |
|
|
709 return *this; |
|
|
710 } |
|
|
711 |
|
|
712 template <class T> |
|
|
713 Array<T>& |
|
|
714 Array<T>::insert (const Array<T>& a, const Array<int>& ra_idx) |
|
|
715 { |
|
|
716 int n = ra_idx.length (); |
|
|
717 |
|
|
718 if (n == dimensions.length ()) |
|
|
719 { |
|
|
720 dim_vector a_dims = a.dims (); |
|
|
721 |
|
|
722 for (int i = 0; i < n; i++) |
|
|
723 { |
|
|
724 if (ra_idx(i) < 0 || ra_idx(i) + a_dims(i) > dimensions(i)) |
|
|
725 { |
|
|
726 (*current_liboctave_error_handler) |
|
|
727 ("Array<T>::insert: range error for insert"); |
|
|
728 return *this; |
|
|
729 } |
|
|
730 } |
|
|
731 |
|
|
732 #if 0 |
|
|
733 // XXX FIXME XXX -- need to copy elements |
|
|
734 |
|
|
735 for (int j = 0; j < a_cols; j++) |
|
|
736 for (int i = 0; i < a_rows; i++) |
|
|
737 elem (r+i, c+j) = a.elem (i, j); |
|
|
738 #endif |
|
|
739 |
|
|
740 } |
|
|
741 else |
|
|
742 (*current_liboctave_error_handler) |
|
|
743 ("Array<T>::insert: invalid indexing operation"); |
|
|
744 |
|
|
745 return *this; |
|
|
746 } |
|
|
747 |
|
|
748 template <class T> |
|
|
749 Array<T> |
|
|
750 Array<T>::transpose (void) const |
|
|
751 { |
|
|
752 int nr = dim1 (); |
|
|
753 int nc = dim2 (); |
|
|
754 |
|
|
755 if (nr > 1 && nc > 1) |
|
|
756 { |
|
|
757 Array<T> result (dim_vector (nc, nr)); |
|
|
758 |
|
|
759 for (int j = 0; j < nc; j++) |
|
|
760 for (int i = 0; i < nr; i++) |
|
|
761 result.xelem (j, i) = xelem (i, j); |
|
|
762 |
|
|
763 return result; |
|
|
764 } |
|
|
765 else |
|
|
766 { |
|
|
767 // Fast transpose for vectors and empty matrices |
|
|
768 return Array<T> (*this, dim_vector (nc, nr)); |
|
|
769 } |
|
|
770 } |
|
|
771 |
|
|
772 template <class T> |
|
|
773 T * |
|
|
774 Array<T>::fortran_vec (void) |
|
|
775 { |
|
|
776 if (rep->count > 1) |
|
|
777 { |
|
|
778 --rep->count; |
|
|
779 rep = new typename Array<T>::ArrayRep (*rep); |
|
|
780 } |
|
|
781 return rep->data; |
|
|
782 } |
|
|
783 |
|
|
784 template <class T> |
|
3933
|
785 void |
|
4517
|
786 Array<T>::maybe_delete_dims (void) |
|
|
787 { |
|
|
788 int ndims = dimensions.length (); |
|
|
789 |
|
|
790 dim_vector new_dims (1, 1); |
|
|
791 |
|
|
792 bool delete_dims = true; |
|
|
793 |
|
|
794 for (int i = ndims - 1; i >= 0; i--) |
|
|
795 { |
|
|
796 if (delete_dims) |
|
|
797 { |
|
|
798 if (dimensions(i) != 1) |
|
|
799 { |
|
|
800 delete_dims = false; |
|
|
801 |
|
|
802 new_dims = dim_vector (i + 1, dimensions(i)); |
|
|
803 } |
|
|
804 } |
|
|
805 else |
|
|
806 new_dims(i) = dimensions(i); |
|
|
807 } |
|
|
808 |
|
|
809 if (ndims != new_dims.length ()) |
|
|
810 dimensions = new_dims; |
|
|
811 } |
|
|
812 |
|
|
813 template <class T> |
|
|
814 void |
|
|
815 Array<T>::clear_index (void) |
|
|
816 { |
|
|
817 delete [] idx; |
|
|
818 idx = 0; |
|
|
819 idx_count = 0; |
|
|
820 } |
|
|
821 |
|
|
822 template <class T> |
|
|
823 void |
|
|
824 Array<T>::set_index (const idx_vector& idx_arg) |
|
|
825 { |
|
|
826 int nd = ndims (); |
|
|
827 |
|
|
828 if (! idx && nd > 0) |
|
|
829 idx = new idx_vector [nd]; |
|
|
830 |
|
|
831 if (idx_count < nd) |
|
|
832 { |
|
|
833 idx[idx_count++] = idx_arg; |
|
|
834 } |
|
|
835 else |
|
|
836 { |
|
|
837 idx_vector *new_idx = new idx_vector [idx_count+1]; |
|
|
838 |
|
|
839 for (int i = 0; i < idx_count; i++) |
|
|
840 new_idx[i] = idx[i]; |
|
|
841 |
|
|
842 new_idx[idx_count++] = idx_arg; |
|
|
843 |
|
|
844 delete [] idx; |
|
|
845 |
|
|
846 idx = new_idx; |
|
|
847 } |
|
|
848 } |
|
|
849 |
|
|
850 template <class T> |
|
|
851 void |
|
|
852 Array<T>::maybe_delete_elements (idx_vector& idx_arg) |
|
|
853 { |
|
|
854 switch (ndims ()) |
|
|
855 { |
|
|
856 case 1: |
|
|
857 maybe_delete_elements_1 (idx_arg); |
|
|
858 break; |
|
|
859 |
|
|
860 case 2: |
|
|
861 maybe_delete_elements_2 (idx_arg); |
|
|
862 break; |
|
|
863 |
|
|
864 default: |
|
|
865 (*current_liboctave_error_handler) |
|
|
866 ("Array<T>::maybe_delete_elements: invalid operation"); |
|
|
867 break; |
|
|
868 } |
|
|
869 } |
|
|
870 |
|
|
871 template <class T> |
|
|
872 void |
|
|
873 Array<T>::maybe_delete_elements_1 (idx_vector& idx_arg) |
|
|
874 { |
|
|
875 int len = length (); |
|
|
876 |
|
|
877 if (len == 0) |
|
|
878 return; |
|
|
879 |
|
|
880 if (idx_arg.is_colon_equiv (len, 1)) |
|
|
881 resize_no_fill (0); |
|
|
882 else |
|
|
883 { |
|
|
884 int num_to_delete = idx_arg.length (len); |
|
|
885 |
|
|
886 if (num_to_delete != 0) |
|
|
887 { |
|
|
888 int new_len = len; |
|
|
889 |
|
|
890 int iidx = 0; |
|
|
891 |
|
|
892 for (int i = 0; i < len; i++) |
|
|
893 if (i == idx_arg.elem (iidx)) |
|
|
894 { |
|
|
895 iidx++; |
|
|
896 new_len--; |
|
|
897 |
|
|
898 if (iidx == num_to_delete) |
|
|
899 break; |
|
|
900 } |
|
|
901 |
|
|
902 if (new_len > 0) |
|
|
903 { |
|
|
904 T *new_data = new T [new_len]; |
|
|
905 |
|
|
906 int ii = 0; |
|
|
907 iidx = 0; |
|
|
908 for (int i = 0; i < len; i++) |
|
|
909 { |
|
|
910 if (iidx < num_to_delete && i == idx_arg.elem (iidx)) |
|
|
911 iidx++; |
|
|
912 else |
|
|
913 { |
|
|
914 new_data[ii] = elem (i); |
|
|
915 ii++; |
|
|
916 } |
|
|
917 } |
|
|
918 |
|
|
919 if (--rep->count <= 0) |
|
|
920 delete rep; |
|
|
921 |
|
|
922 rep = new typename Array<T>::ArrayRep (new_data, new_len); |
|
|
923 |
|
|
924 dimensions.resize (1); |
|
|
925 dimensions(0) = new_len; |
|
|
926 } |
|
|
927 else |
|
|
928 (*current_liboctave_error_handler) |
|
|
929 ("A(idx) = []: index out of range"); |
|
|
930 } |
|
|
931 } |
|
|
932 } |
|
|
933 |
|
|
934 template <class T> |
|
|
935 void |
|
|
936 Array<T>::maybe_delete_elements_2 (idx_vector& idx_arg) |
|
|
937 { |
|
|
938 int nr = dim1 (); |
|
|
939 int nc = dim2 (); |
|
|
940 |
|
|
941 if (nr == 0 && nc == 0) |
|
|
942 return; |
|
|
943 |
|
|
944 int n; |
|
|
945 if (nr == 1) |
|
|
946 n = nc; |
|
|
947 else if (nc == 1) |
|
|
948 n = nr; |
|
|
949 else |
|
|
950 { |
|
|
951 (*current_liboctave_error_handler) |
|
|
952 ("A(idx) = []: expecting A to be row or column vector or scalar"); |
|
|
953 |
|
|
954 return; |
|
|
955 } |
|
|
956 |
|
|
957 if (idx_arg.is_colon_equiv (n, 1)) |
|
|
958 { |
|
|
959 // Either A(:) = [] or A(idx) = [] with idx enumerating all |
|
|
960 // elements, so we delete all elements and return [](0x0). To |
|
|
961 // preserve the orientation of the vector, you have to use |
|
|
962 // A(idx,:) = [] (delete rows) or A(:,idx) (delete columns). |
|
|
963 |
|
|
964 resize_no_fill (0, 0); |
|
|
965 return; |
|
|
966 } |
|
|
967 |
|
|
968 idx_arg.sort (true); |
|
|
969 |
|
|
970 int num_to_delete = idx_arg.length (n); |
|
|
971 |
|
|
972 if (num_to_delete != 0) |
|
|
973 { |
|
|
974 int new_n = n; |
|
|
975 |
|
|
976 int iidx = 0; |
|
|
977 |
|
|
978 for (int i = 0; i < n; i++) |
|
|
979 if (i == idx_arg.elem (iidx)) |
|
|
980 { |
|
|
981 iidx++; |
|
|
982 new_n--; |
|
|
983 |
|
|
984 if (iidx == num_to_delete) |
|
|
985 break; |
|
|
986 } |
|
|
987 |
|
|
988 if (new_n > 0) |
|
|
989 { |
|
|
990 T *new_data = new T [new_n]; |
|
|
991 |
|
|
992 int ii = 0; |
|
|
993 iidx = 0; |
|
|
994 for (int i = 0; i < n; i++) |
|
|
995 { |
|
|
996 if (iidx < num_to_delete && i == idx_arg.elem (iidx)) |
|
|
997 iidx++; |
|
|
998 else |
|
|
999 { |
|
|
1000 if (nr == 1) |
|
|
1001 new_data[ii] = elem (0, i); |
|
|
1002 else |
|
|
1003 new_data[ii] = elem (i, 0); |
|
|
1004 |
|
|
1005 ii++; |
|
|
1006 } |
|
|
1007 } |
|
|
1008 |
|
|
1009 if (--(Array<T>::rep)->count <= 0) |
|
|
1010 delete Array<T>::rep; |
|
|
1011 |
|
|
1012 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, new_n); |
|
|
1013 |
|
|
1014 dimensions.resize (2); |
|
|
1015 |
|
|
1016 if (nr == 1) |
|
|
1017 { |
|
|
1018 dimensions(0) = 1; |
|
|
1019 dimensions(1) = new_n; |
|
|
1020 } |
|
|
1021 else |
|
|
1022 { |
|
|
1023 dimensions(0) = new_n; |
|
|
1024 dimensions(1) = 1; |
|
|
1025 } |
|
|
1026 } |
|
|
1027 else |
|
|
1028 (*current_liboctave_error_handler) |
|
|
1029 ("A(idx) = []: index out of range"); |
|
|
1030 } |
|
|
1031 } |
|
|
1032 |
|
|
1033 template <class T> |
|
|
1034 void |
|
|
1035 Array<T>::maybe_delete_elements (idx_vector& idx_i, idx_vector& idx_j) |
|
|
1036 { |
|
|
1037 int nr = dim1 (); |
|
|
1038 int nc = dim2 (); |
|
|
1039 |
|
|
1040 if (nr == 0 && nc == 0) |
|
|
1041 return; |
|
|
1042 |
|
|
1043 if (idx_i.is_colon ()) |
|
|
1044 { |
|
|
1045 if (idx_j.is_colon ()) |
|
|
1046 { |
|
|
1047 // A(:,:) -- We are deleting columns and rows, so the result |
|
|
1048 // is [](0x0). |
|
|
1049 |
|
|
1050 resize_no_fill (0, 0); |
|
|
1051 return; |
|
|
1052 } |
|
|
1053 |
|
|
1054 if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1055 { |
|
|
1056 // A(:,j) -- We are deleting columns by enumerating them, |
|
|
1057 // If we enumerate all of them, we should have zero columns |
|
|
1058 // with the same number of rows that we started with. |
|
|
1059 |
|
|
1060 resize_no_fill (nr, 0); |
|
|
1061 return; |
|
|
1062 } |
|
|
1063 } |
|
|
1064 |
|
|
1065 if (idx_j.is_colon () && idx_i.is_colon_equiv (nr, 1)) |
|
|
1066 { |
|
|
1067 // A(i,:) -- We are deleting rows by enumerating them. If we |
|
|
1068 // enumerate all of them, we should have zero rows with the |
|
|
1069 // same number of columns that we started with. |
|
|
1070 |
|
|
1071 resize_no_fill (0, nc); |
|
|
1072 return; |
|
|
1073 } |
|
|
1074 |
|
|
1075 if (idx_i.is_colon_equiv (nr, 1)) |
|
|
1076 { |
|
|
1077 if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1078 resize_no_fill (0, 0); |
|
|
1079 else |
|
|
1080 { |
|
|
1081 idx_j.sort (true); |
|
|
1082 |
|
|
1083 int num_to_delete = idx_j.length (nc); |
|
|
1084 |
|
|
1085 if (num_to_delete != 0) |
|
|
1086 { |
|
|
1087 if (nr == 1 && num_to_delete == nc) |
|
|
1088 resize_no_fill (0, 0); |
|
|
1089 else |
|
|
1090 { |
|
|
1091 int new_nc = nc; |
|
|
1092 |
|
|
1093 int iidx = 0; |
|
|
1094 |
|
|
1095 for (int j = 0; j < nc; j++) |
|
|
1096 if (j == idx_j.elem (iidx)) |
|
|
1097 { |
|
|
1098 iidx++; |
|
|
1099 new_nc--; |
|
|
1100 |
|
|
1101 if (iidx == num_to_delete) |
|
|
1102 break; |
|
|
1103 } |
|
|
1104 |
|
|
1105 if (new_nc > 0) |
|
|
1106 { |
|
|
1107 T *new_data = new T [nr * new_nc]; |
|
|
1108 |
|
|
1109 int jj = 0; |
|
|
1110 iidx = 0; |
|
|
1111 for (int j = 0; j < nc; j++) |
|
|
1112 { |
|
|
1113 if (iidx < num_to_delete && j == idx_j.elem (iidx)) |
|
|
1114 iidx++; |
|
|
1115 else |
|
|
1116 { |
|
|
1117 for (int i = 0; i < nr; i++) |
|
|
1118 new_data[nr*jj+i] = elem (i, j); |
|
|
1119 jj++; |
|
|
1120 } |
|
|
1121 } |
|
|
1122 |
|
|
1123 if (--(Array<T>::rep)->count <= 0) |
|
|
1124 delete Array<T>::rep; |
|
|
1125 |
|
|
1126 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, nr * new_nc); |
|
|
1127 |
|
|
1128 dimensions.resize (2); |
|
|
1129 dimensions(1) = new_nc; |
|
|
1130 } |
|
|
1131 else |
|
|
1132 (*current_liboctave_error_handler) |
|
|
1133 ("A(idx) = []: index out of range"); |
|
|
1134 } |
|
|
1135 } |
|
|
1136 } |
|
|
1137 } |
|
|
1138 else if (idx_j.is_colon_equiv (nc, 1)) |
|
|
1139 { |
|
|
1140 if (idx_i.is_colon_equiv (nr, 1)) |
|
|
1141 resize_no_fill (0, 0); |
|
|
1142 else |
|
|
1143 { |
|
|
1144 idx_i.sort (true); |
|
|
1145 |
|
|
1146 int num_to_delete = idx_i.length (nr); |
|
|
1147 |
|
|
1148 if (num_to_delete != 0) |
|
|
1149 { |
|
|
1150 if (nc == 1 && num_to_delete == nr) |
|
|
1151 resize_no_fill (0, 0); |
|
|
1152 else |
|
|
1153 { |
|
|
1154 int new_nr = nr; |
|
|
1155 |
|
|
1156 int iidx = 0; |
|
|
1157 |
|
|
1158 for (int i = 0; i < nr; i++) |
|
|
1159 if (i == idx_i.elem (iidx)) |
|
|
1160 { |
|
|
1161 iidx++; |
|
|
1162 new_nr--; |
|
|
1163 |
|
|
1164 if (iidx == num_to_delete) |
|
|
1165 break; |
|
|
1166 } |
|
|
1167 |
|
|
1168 if (new_nr > 0) |
|
|
1169 { |
|
|
1170 T *new_data = new T [new_nr * nc]; |
|
|
1171 |
|
|
1172 int ii = 0; |
|
|
1173 iidx = 0; |
|
|
1174 for (int i = 0; i < nr; i++) |
|
|
1175 { |
|
|
1176 if (iidx < num_to_delete && i == idx_i.elem (iidx)) |
|
|
1177 iidx++; |
|
|
1178 else |
|
|
1179 { |
|
|
1180 for (int j = 0; j < nc; j++) |
|
|
1181 new_data[new_nr*j+ii] = elem (i, j); |
|
|
1182 ii++; |
|
|
1183 } |
|
|
1184 } |
|
|
1185 |
|
|
1186 if (--(Array<T>::rep)->count <= 0) |
|
|
1187 delete Array<T>::rep; |
|
|
1188 |
|
|
1189 Array<T>::rep = new typename Array<T>::ArrayRep (new_data, new_nr * nc); |
|
|
1190 |
|
|
1191 dimensions.resize (2); |
|
|
1192 dimensions(0) = new_nr; |
|
|
1193 } |
|
|
1194 else |
|
|
1195 (*current_liboctave_error_handler) |
|
|
1196 ("A(idx) = []: index out of range"); |
|
|
1197 } |
|
|
1198 } |
|
|
1199 } |
|
|
1200 } |
|
|
1201 } |
|
|
1202 |
|
|
1203 template <class T> |
|
|
1204 void |
|
|
1205 Array<T>::maybe_delete_elements (idx_vector&, idx_vector&, idx_vector&) |
|
|
1206 { |
|
|
1207 assert (0); |
|
|
1208 } |
|
|
1209 |
|
|
1210 template <class T> |
|
|
1211 void |
|
|
1212 Array<T>::maybe_delete_elements (Array<idx_vector>& idx, const T& rfv) |
|
|
1213 { |
|
|
1214 int n_idx = idx.length (); |
|
|
1215 |
|
|
1216 dim_vector lhs_dims = dims (); |
|
|
1217 |
|
|
1218 dim_vector idx_is_colon; |
|
|
1219 idx_is_colon.resize (n_idx); |
|
|
1220 |
|
|
1221 dim_vector idx_is_colon_equiv; |
|
|
1222 idx_is_colon_equiv.resize (n_idx); |
|
|
1223 |
|
|
1224 // Initialization of colon arrays. |
|
|
1225 |
|
|
1226 for (int i = 0; i < n_idx; i++) |
|
|
1227 { |
|
|
1228 idx_is_colon_equiv(i) = idx(i).is_colon_equiv (lhs_dims(i), 1); |
|
|
1229 |
|
|
1230 idx_is_colon(i) = idx(i).is_colon (); |
|
|
1231 } |
|
|
1232 |
|
|
1233 if (all_ones (idx_is_colon) || all_ones (idx_is_colon_equiv)) |
|
|
1234 { |
|
|
1235 // A(:,:,:) -- we are deleting elements in all dimensions, so |
|
|
1236 // the result is [](0x0x0). |
|
|
1237 |
|
|
1238 dim_vector zeros; |
|
|
1239 zeros.resize (n_idx); |
|
|
1240 |
|
|
1241 for (int i = 0; i < n_idx; i++) |
|
|
1242 zeros(i) = 0; |
|
|
1243 |
|
|
1244 resize (zeros, rfv); |
|
|
1245 } |
|
|
1246 |
|
|
1247 else if (num_ones (idx_is_colon) == n_idx - 1 |
|
|
1248 && num_ones (idx_is_colon_equiv) == n_idx) |
|
|
1249 { |
|
|
1250 // A(:,:,j) -- we are deleting elements in one dimension by |
|
|
1251 // enumerating them. |
|
|
1252 // |
|
|
1253 // If we enumerate all of the elements, we should have zero |
|
|
1254 // elements in that dimension with the same number of elements |
|
|
1255 // in the other dimensions that we started with. |
|
|
1256 |
|
|
1257 dim_vector temp_dims; |
|
|
1258 temp_dims.resize (n_idx); |
|
|
1259 |
|
|
1260 for (int i = 0; i < n_idx; i++) |
|
|
1261 { |
|
|
1262 if (idx_is_colon (i)) |
|
|
1263 temp_dims (i) = lhs_dims (i); |
|
|
1264 else |
|
|
1265 temp_dims (i) = 0; |
|
|
1266 } |
|
|
1267 |
|
|
1268 resize (temp_dims); |
|
|
1269 } |
|
|
1270 else if (num_ones (idx_is_colon) == n_idx - 1) |
|
|
1271 { |
|
|
1272 // We have colons in all indices except for one. |
|
|
1273 // This index tells us which slice to delete |
|
|
1274 |
|
|
1275 int non_col = 0; |
|
|
1276 |
|
|
1277 // Find the non-colon column. |
|
|
1278 |
|
|
1279 for (int i = 0; i < n_idx; i++) |
|
|
1280 { |
|
|
1281 if (! idx_is_colon (i)) |
|
|
1282 non_col = i; |
|
|
1283 } |
|
|
1284 |
|
|
1285 // The length of the non-colon dimension. |
|
|
1286 |
|
|
1287 int non_col_dim = lhs_dims (non_col); |
|
|
1288 |
|
|
1289 idx(non_col).sort (true); |
|
|
1290 |
|
|
1291 int num_to_delete = idx(non_col).length (lhs_dims (non_col)); |
|
|
1292 |
|
|
1293 if (num_to_delete > 0) |
|
|
1294 { |
|
|
1295 int temp = num_ones(lhs_dims); |
|
|
1296 |
|
|
1297 if (non_col_dim == 1) |
|
|
1298 temp--; |
|
|
1299 |
|
|
1300 if (temp == n_idx - 1 && num_to_delete == non_col_dim) |
|
|
1301 { |
|
|
1302 // We have A with (1x1x4), where A(1,:,1:4) |
|
|
1303 // Delete all (0x0x0) |
|
|
1304 |
|
|
1305 dim_vector zero_dims (n_idx, 0); |
|
|
1306 |
|
|
1307 resize (zero_dims, rfv); |
|
|
1308 } |
|
|
1309 else |
|
|
1310 { |
|
|
1311 // New length of non-colon dimension |
|
|
1312 // (calculated in the next for loop) |
|
|
1313 |
|
|
1314 int new_dim = non_col_dim; |
|
|
1315 |
|
|
1316 int iidx = 0; |
|
|
1317 |
|
|
1318 for (int j = 0; j < non_col_dim; j++) |
|
|
1319 if (j == idx(non_col).elem (iidx)) |
|
|
1320 { |
|
|
1321 iidx++; |
|
|
1322 |
|
|
1323 new_dim--; |
|
|
1324 |
|
|
1325 if (iidx == num_to_delete) |
|
|
1326 break; |
|
|
1327 } |
|
|
1328 |
|
|
1329 // Creating the new nd array after deletions. |
|
|
1330 |
|
|
1331 if (new_dim > 0) |
|
|
1332 { |
|
|
1333 // Calculate number of elements in new array. |
|
|
1334 |
|
|
1335 int num_new_elem=1; |
|
|
1336 |
|
|
1337 for (int i = 0; i < n_idx; i++) |
|
|
1338 { |
|
|
1339 if (i == non_col) |
|
|
1340 num_new_elem *= new_dim; |
|
|
1341 |
|
|
1342 else |
|
|
1343 num_new_elem *= lhs_dims(i); |
|
|
1344 } |
|
|
1345 |
|
|
1346 T *new_data = new T [num_new_elem]; |
|
|
1347 |
|
|
1348 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
1349 |
|
|
1350 dim_vector lhs_inc; |
|
|
1351 lhs_inc.resize (lhs_dims.length ()); |
|
|
1352 |
|
|
1353 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
1354 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
1355 |
|
|
1356 dim_vector new_lhs_dim = lhs_dims; |
|
|
1357 |
|
|
1358 new_lhs_dim(non_col) = new_dim; |
|
|
1359 |
|
|
1360 int num_elem = 1; |
|
|
1361 |
|
|
1362 int numidx = 0; |
|
|
1363 |
|
|
1364 int n = length (); |
|
|
1365 |
|
|
1366 for (int i =0; i < lhs_dims.length (); i++) |
|
|
1367 if (i != non_col) |
|
|
1368 num_elem *= lhs_dims (i); |
|
|
1369 |
|
|
1370 num_elem *= idx(non_col).capacity (); |
|
|
1371 |
|
|
1372 for (int i = 0; i < n; i++) |
|
|
1373 { |
|
|
1374 if (numidx < num_elem |
|
|
1375 && is_in (result_idx(non_col), idx(non_col))) |
|
|
1376 numidx++; |
|
|
1377 |
|
|
1378 else |
|
|
1379 { |
|
|
1380 Array<int> temp_result_idx = result_idx; |
|
|
1381 |
|
|
1382 int num_lgt |
|
|
1383 = how_many_lgt (result_idx(non_col), idx(non_col)); |
|
|
1384 |
|
|
1385 temp_result_idx(non_col) -= num_lgt; |
|
|
1386 |
|
|
1387 int kidx |
|
|
1388 = ::compute_index (temp_result_idx, new_lhs_dim); |
|
|
1389 |
|
|
1390 new_data[kidx] = elem (result_idx); |
|
|
1391 } |
|
|
1392 |
|
|
1393 increment_index (result_idx, lhs_dims); |
|
|
1394 } |
|
|
1395 |
|
|
1396 if (--rep->count <= 0) |
|
|
1397 delete rep; |
|
|
1398 |
|
|
1399 rep = new typename Array<T>::ArrayRep (new_data, |
|
|
1400 num_new_elem); |
|
|
1401 |
|
|
1402 dimensions = new_lhs_dim; |
|
|
1403 } |
|
|
1404 } |
|
|
1405 } |
|
|
1406 } |
|
|
1407 else if (num_ones(idx_is_colon) < n_idx) |
|
|
1408 { |
|
|
1409 (*current_liboctave_error_handler) |
|
|
1410 ("A null assignment can have only one non-colon index."); |
|
|
1411 } |
|
|
1412 } |
|
|
1413 |
|
|
1414 template <class T> |
|
|
1415 Array<T> |
|
|
1416 Array<T>::value (void) |
|
|
1417 { |
|
|
1418 Array<T> retval; |
|
|
1419 |
|
|
1420 int n_idx = index_count (); |
|
|
1421 |
|
|
1422 if (n_idx == 2) |
|
|
1423 { |
|
|
1424 idx_vector *tmp = get_idx (); |
|
|
1425 |
|
|
1426 idx_vector idx_i = tmp[0]; |
|
|
1427 idx_vector idx_j = tmp[1]; |
|
|
1428 |
|
|
1429 retval = index (idx_i, idx_j); |
|
|
1430 } |
|
|
1431 else if (n_idx == 1) |
|
|
1432 { |
|
|
1433 retval = index (idx[0]); |
|
|
1434 } |
|
|
1435 else |
|
|
1436 (*current_liboctave_error_handler) |
|
|
1437 ("Array<T>::value: invalid number of indices specified"); |
|
|
1438 |
|
|
1439 clear_index (); |
|
|
1440 |
|
|
1441 return retval; |
|
|
1442 } |
|
|
1443 |
|
|
1444 template <class T> |
|
|
1445 Array<T> |
|
|
1446 Array<T>::index (idx_vector& idx_arg, int resize_ok, const T& rfv) const |
|
|
1447 { |
|
|
1448 Array<T> retval; |
|
|
1449 |
|
|
1450 switch (ndims ()) |
|
|
1451 { |
|
|
1452 case 1: |
|
|
1453 retval = index1 (idx_arg, resize_ok, rfv); |
|
|
1454 break; |
|
|
1455 |
|
|
1456 case 2: |
|
|
1457 retval = index2 (idx_arg, resize_ok, rfv); |
|
|
1458 break; |
|
|
1459 |
|
|
1460 default: |
|
|
1461 { |
|
|
1462 Array<idx_vector> tmp (1, idx_arg); |
|
|
1463 |
|
|
1464 retval = index (tmp, resize_ok, rfv); |
|
|
1465 } |
|
|
1466 break; |
|
|
1467 } |
|
|
1468 |
|
|
1469 return retval; |
|
|
1470 } |
|
|
1471 |
|
|
1472 template <class T> |
|
|
1473 Array<T> |
|
|
1474 Array<T>::index1 (idx_vector& idx_arg, int resize_ok, const T& rfv) const |
|
|
1475 { |
|
|
1476 Array<T> retval; |
|
|
1477 |
|
|
1478 int len = length (); |
|
|
1479 |
|
|
1480 int n = idx_arg.freeze (len, "vector", resize_ok); |
|
|
1481 |
|
|
1482 if (idx_arg) |
|
|
1483 { |
|
|
1484 if (idx_arg.is_colon_equiv (len)) |
|
|
1485 { |
|
|
1486 retval = *this; |
|
|
1487 } |
|
|
1488 else if (n == 0) |
|
|
1489 { |
|
|
1490 retval.resize_no_fill (0); |
|
|
1491 } |
|
|
1492 else if (len == 1 && n > 1 |
|
|
1493 && idx_arg.one_zero_only () |
|
|
1494 && idx_arg.ones_count () == n) |
|
|
1495 { |
|
|
1496 retval.resize (n, elem (0)); |
|
|
1497 } |
|
|
1498 else |
|
|
1499 { |
|
|
1500 retval.resize_no_fill (n); |
|
|
1501 |
|
|
1502 for (int i = 0; i < n; i++) |
|
|
1503 { |
|
|
1504 int ii = idx_arg.elem (i); |
|
|
1505 if (ii >= len) |
|
|
1506 retval.elem (i) = rfv; |
|
|
1507 else |
|
|
1508 retval.elem (i) = elem (ii); |
|
|
1509 } |
|
|
1510 } |
|
|
1511 } |
|
|
1512 |
|
|
1513 // idx_vector::freeze() printed an error message for us. |
|
|
1514 |
|
|
1515 return retval; |
|
|
1516 } |
|
|
1517 |
|
|
1518 template <class T> |
|
|
1519 Array<T> |
|
|
1520 Array<T>::index2 (idx_vector& idx_arg, int resize_ok, const T& rfv) const |
|
|
1521 { |
|
|
1522 Array<T> retval; |
|
|
1523 |
|
|
1524 int nr = dim1 (); |
|
|
1525 int nc = dim2 (); |
|
|
1526 |
|
|
1527 int orig_len = nr * nc; |
|
|
1528 |
|
|
1529 int idx_orig_rows = idx_arg.orig_rows (); |
|
|
1530 int idx_orig_columns = idx_arg.orig_columns (); |
|
|
1531 |
|
|
1532 if (idx_arg.is_colon ()) |
|
|
1533 { |
|
|
1534 // Fast magic colon processing. |
|
|
1535 |
|
|
1536 int result_nr = nr * nc; |
|
|
1537 int result_nc = 1; |
|
|
1538 |
|
|
1539 retval = Array<T> (*this, dim_vector (result_nr, result_nc)); |
|
|
1540 } |
|
|
1541 else if (nr == 1 && nc == 1) |
|
|
1542 { |
|
|
1543 Array<T> tmp = Array<T>::index1 (idx_arg, resize_ok); |
|
|
1544 |
|
|
1545 if (tmp.length () != 0) |
|
|
1546 retval = Array<T> (tmp, dim_vector (idx_orig_rows, idx_orig_columns)); |
|
|
1547 else |
|
|
1548 retval = Array<T> (tmp, dim_vector (0, 0)); |
|
|
1549 } |
|
|
1550 else if (nr == 1 || nc == 1) |
|
|
1551 { |
|
|
1552 // If indexing a vector with a matrix, return value has same |
|
|
1553 // shape as the index. Otherwise, it has same orientation as |
|
|
1554 // indexed object. |
|
|
1555 |
|
|
1556 Array<T> tmp = index1 (idx_arg, resize_ok); |
|
|
1557 |
|
|
1558 int len = tmp.length (); |
|
|
1559 |
|
|
1560 if (len == 0) |
|
|
1561 { |
|
|
1562 if (idx_orig_rows == 0 || idx_orig_columns == 0) |
|
|
1563 retval = Array<T> (dim_vector (idx_orig_rows, idx_orig_columns)); |
|
|
1564 else if (nr == 1) |
|
|
1565 retval = Array<T> (dim_vector (1, 0)); |
|
|
1566 else |
|
|
1567 retval = Array<T> (dim_vector (0, 1)); |
|
|
1568 } |
|
|
1569 else |
|
|
1570 { |
|
|
1571 if (idx_orig_rows == 1 || idx_orig_columns == 1) |
|
|
1572 { |
|
|
1573 if (nr == 1) |
|
|
1574 retval = Array<T> (tmp, dim_vector (1, len)); |
|
|
1575 else |
|
|
1576 retval = Array<T> (tmp, dim_vector (len, 1)); |
|
|
1577 } |
|
|
1578 else |
|
|
1579 retval = Array<T> (tmp, dim_vector (idx_orig_rows, idx_orig_columns)); |
|
|
1580 } |
|
|
1581 } |
|
|
1582 else |
|
|
1583 { |
|
|
1584 if (liboctave_wfi_flag |
|
|
1585 && ! (idx_arg.one_zero_only () |
|
|
1586 && idx_orig_rows == nr |
|
|
1587 && idx_orig_columns == nc)) |
|
|
1588 (*current_liboctave_warning_handler) ("single index used for matrix"); |
|
|
1589 |
|
|
1590 // This code is only for indexing matrices. The vector |
|
|
1591 // cases are handled above. |
|
|
1592 |
|
|
1593 idx_arg.freeze (nr * nc, "matrix", resize_ok); |
|
|
1594 |
|
|
1595 if (idx_arg) |
|
|
1596 { |
|
|
1597 int result_nr = idx_orig_rows; |
|
|
1598 int result_nc = idx_orig_columns; |
|
|
1599 |
|
|
1600 if (idx_arg.one_zero_only ()) |
|
|
1601 { |
|
|
1602 result_nr = idx_arg.ones_count (); |
|
|
1603 result_nc = (result_nr > 0 ? 1 : 0); |
|
|
1604 } |
|
|
1605 |
|
|
1606 retval.resize_no_fill (result_nr, result_nc); |
|
|
1607 |
|
|
1608 int k = 0; |
|
|
1609 for (int j = 0; j < result_nc; j++) |
|
|
1610 { |
|
|
1611 for (int i = 0; i < result_nr; i++) |
|
|
1612 { |
|
|
1613 int ii = idx_arg.elem (k++); |
|
|
1614 if (ii >= orig_len) |
|
|
1615 retval.elem (i, j) = rfv; |
|
|
1616 else |
|
|
1617 { |
|
|
1618 int fr = ii % nr; |
|
|
1619 int fc = (ii - fr) / nr; |
|
|
1620 retval.elem (i, j) = elem (fr, fc); |
|
|
1621 } |
|
|
1622 } |
|
|
1623 } |
|
|
1624 } |
|
|
1625 // idx_vector::freeze() printed an error message for us. |
|
|
1626 } |
|
|
1627 |
|
|
1628 return retval; |
|
|
1629 } |
|
|
1630 |
|
|
1631 template <class T> |
|
|
1632 Array<T> |
|
|
1633 Array<T>::index (idx_vector& idx_i, idx_vector& idx_j, int resize_ok, |
|
|
1634 const T& rfv) const |
|
|
1635 { |
|
|
1636 Array<T> retval; |
|
|
1637 |
|
|
1638 int nr = dim1 (); |
|
|
1639 int nc = dim2 (); |
|
|
1640 |
|
|
1641 int n = idx_i.freeze (nr, "row", resize_ok); |
|
|
1642 int m = idx_j.freeze (nc, "column", resize_ok); |
|
|
1643 |
|
|
1644 if (idx_i && idx_j) |
|
|
1645 { |
|
|
1646 if (idx_i.orig_empty () || idx_j.orig_empty () || n == 0 || m == 0) |
|
|
1647 { |
|
|
1648 retval.resize_no_fill (n, m); |
|
|
1649 } |
|
|
1650 else if (idx_i.is_colon_equiv (nr) && idx_j.is_colon_equiv (nc)) |
|
|
1651 { |
|
|
1652 retval = *this; |
|
|
1653 } |
|
|
1654 else |
|
|
1655 { |
|
|
1656 retval.resize_no_fill (n, m); |
|
|
1657 |
|
|
1658 for (int j = 0; j < m; j++) |
|
|
1659 { |
|
|
1660 int jj = idx_j.elem (j); |
|
|
1661 for (int i = 0; i < n; i++) |
|
|
1662 { |
|
|
1663 int ii = idx_i.elem (i); |
|
|
1664 if (ii >= nr || jj >= nc) |
|
|
1665 retval.elem (i, j) = rfv; |
|
|
1666 else |
|
|
1667 retval.elem (i, j) = elem (ii, jj); |
|
|
1668 } |
|
|
1669 } |
|
|
1670 } |
|
|
1671 } |
|
|
1672 |
|
|
1673 // idx_vector::freeze() printed an error message for us. |
|
|
1674 |
|
|
1675 return retval; |
|
|
1676 } |
|
|
1677 |
|
|
1678 #include "ArrayN-inline.h" |
|
|
1679 |
|
|
1680 template <class T> |
|
|
1681 Array<T> |
|
|
1682 Array<T>::index (Array<idx_vector>& ra_idx, int resize_ok, const T& rfv) const |
|
|
1683 { |
|
|
1684 Array<T> retval; |
|
|
1685 |
|
|
1686 int n_idx = ra_idx.length (); |
|
|
1687 |
|
|
1688 int n_dims = dimensions.length (); |
|
|
1689 |
|
|
1690 if (n_idx == n_dims) |
|
|
1691 { |
|
|
1692 dim_vector frozen_lengths = freeze (ra_idx, dimensions, resize_ok); |
|
|
1693 |
|
|
1694 if (frozen_lengths.length () == n_dims) |
|
|
1695 { |
|
|
1696 if (all_ok (ra_idx)) |
|
|
1697 { |
|
|
1698 if (any_orig_empty (ra_idx)) |
|
|
1699 { |
|
|
1700 retval.resize (frozen_lengths); |
|
|
1701 } |
|
|
1702 else if (any_zero_len (frozen_lengths)) |
|
|
1703 { |
|
|
1704 dim_vector new_size = get_zero_len_size (frozen_lengths, |
|
|
1705 dimensions); |
|
|
1706 |
|
|
1707 retval.resize (new_size); |
|
|
1708 } |
|
|
1709 else if (all_colon_equiv (ra_idx, frozen_lengths)) |
|
|
1710 { |
|
|
1711 retval = *this; |
|
|
1712 } |
|
|
1713 else |
|
|
1714 { |
|
|
1715 (*current_liboctave_error_handler) ("not implemented"); |
|
|
1716 #if 0 |
|
|
1717 retval.resize (frozen_lengths); |
|
|
1718 |
|
|
1719 int n = Array<T>::get_size (frozen_lengths); |
|
|
1720 |
|
|
1721 dim_vector result_idx (n_dims, 0); |
|
|
1722 |
|
|
1723 for (int i = 0; i < n; i++) |
|
|
1724 { |
|
|
1725 dim_vector elt_idx = get_elt_idx (result_idx); |
|
|
1726 |
|
|
1727 if (elt_idx > orig_len) |
|
|
1728 retval.elem (result_idx) = rfv; |
|
|
1729 else |
|
|
1730 retval.elem (result_idx) = elem (elt_idx); |
|
|
1731 |
|
|
1732 increment_index (result_idx, frozen_lengths); |
|
|
1733 } |
|
|
1734 #endif |
|
|
1735 } |
|
|
1736 } |
|
|
1737 // idx_vector::freeze() printed an error message for us. |
|
|
1738 } |
|
|
1739 } |
|
|
1740 else if (n_idx == 1) |
|
|
1741 { |
|
|
1742 if (ra_idx(0).is_colon ()) |
|
|
1743 { |
|
|
1744 // Fast magic colon processing. |
|
|
1745 |
|
|
1746 int result_nr = Array<int>::get_size (dimensions); |
|
|
1747 int result_nc = 1; |
|
|
1748 |
|
|
1749 retval = Array<T> (*this, dim_vector (result_nr, result_nc)); |
|
|
1750 } |
|
|
1751 else |
|
|
1752 (*current_liboctave_error_handler) ("not implemented"); |
|
|
1753 } |
|
|
1754 else |
|
|
1755 (*current_liboctave_error_handler) |
|
|
1756 ("invalid number of dimensions for N-dimensional array index"); |
|
|
1757 |
|
|
1758 return retval; |
|
|
1759 } |
|
|
1760 |
|
|
1761 // XXX FIXME XXX -- this is a mess. |
|
|
1762 |
|
|
1763 template <class LT, class RT> |
|
|
1764 int |
|
|
1765 assign (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) |
|
|
1766 { |
|
|
1767 int retval = 0; |
|
|
1768 |
|
|
1769 switch (lhs.ndims ()) |
|
|
1770 { |
|
|
1771 case 0: |
|
|
1772 { |
|
|
1773 if (lhs.index_count () < 3) |
|
|
1774 { |
|
|
1775 // kluge... |
|
|
1776 lhs.resize_no_fill (0, 0); |
|
|
1777 retval = assign2 (lhs, rhs, rfv); |
|
|
1778 } |
|
|
1779 else |
|
|
1780 retval = assignN (lhs, rhs, rfv); |
|
|
1781 } |
|
|
1782 break; |
|
|
1783 |
|
|
1784 case 1: |
|
|
1785 { |
|
|
1786 if (lhs.index_count () > 1) |
|
|
1787 retval = assignN (lhs, rhs, rfv); |
|
|
1788 else |
|
|
1789 retval = assign1 (lhs, rhs, rfv); |
|
|
1790 } |
|
|
1791 break; |
|
|
1792 |
|
|
1793 case 2: |
|
|
1794 { |
|
|
1795 if (lhs.index_count () > 2) |
|
|
1796 retval = assignN (lhs, rhs, rfv); |
|
|
1797 else |
|
|
1798 retval = assign2 (lhs, rhs, rfv); |
|
|
1799 } |
|
|
1800 break; |
|
|
1801 |
|
|
1802 default: |
|
|
1803 retval = assignN (lhs, rhs, rfv); |
|
|
1804 break; |
|
|
1805 } |
|
|
1806 |
|
|
1807 return retval; |
|
|
1808 } |
|
|
1809 |
|
|
1810 template <class LT, class RT> |
|
|
1811 int |
|
|
1812 assign1 (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) |
|
|
1813 { |
|
|
1814 int retval = 1; |
|
|
1815 |
|
|
1816 idx_vector *tmp = lhs.get_idx (); |
|
|
1817 |
|
|
1818 idx_vector lhs_idx = tmp[0]; |
|
|
1819 |
|
|
1820 int lhs_len = lhs.length (); |
|
|
1821 int rhs_len = rhs.length (); |
|
|
1822 |
|
|
1823 int n = lhs_idx.freeze (lhs_len, "vector", true, liboctave_wrore_flag); |
|
|
1824 |
|
|
1825 if (n != 0) |
|
|
1826 { |
|
|
1827 if (rhs_len == n || rhs_len == 1) |
|
|
1828 { |
|
|
1829 int max_idx = lhs_idx.max () + 1; |
|
|
1830 if (max_idx > lhs_len) |
|
|
1831 lhs.resize (max_idx, rfv); |
|
|
1832 } |
|
|
1833 |
|
|
1834 if (rhs_len == n) |
|
|
1835 { |
|
|
1836 for (int i = 0; i < n; i++) |
|
|
1837 { |
|
|
1838 int ii = lhs_idx.elem (i); |
|
|
1839 lhs.elem (ii) = rhs.elem (i); |
|
|
1840 } |
|
|
1841 } |
|
|
1842 else if (rhs_len == 1) |
|
|
1843 { |
|
|
1844 RT scalar = rhs.elem (0); |
|
|
1845 |
|
|
1846 for (int i = 0; i < n; i++) |
|
|
1847 { |
|
|
1848 int ii = lhs_idx.elem (i); |
|
|
1849 lhs.elem (ii) = scalar; |
|
|
1850 } |
|
|
1851 } |
|
|
1852 else |
|
|
1853 { |
|
|
1854 (*current_liboctave_error_handler) |
|
|
1855 ("A(I) = X: X must be a scalar or a vector with same length as I"); |
|
|
1856 |
|
|
1857 retval = 0; |
|
|
1858 } |
|
|
1859 } |
|
|
1860 else if (lhs_idx.is_colon ()) |
|
|
1861 { |
|
|
1862 if (lhs_len == 0) |
|
|
1863 { |
|
|
1864 lhs.resize_no_fill (rhs_len); |
|
|
1865 |
|
|
1866 for (int i = 0; i < rhs_len; i++) |
|
|
1867 lhs.elem (i) = rhs.elem (i); |
|
|
1868 } |
|
|
1869 else |
|
|
1870 (*current_liboctave_error_handler) |
|
|
1871 ("A(:) = X: A must be the same size as X"); |
|
|
1872 } |
|
|
1873 else if (! (rhs_len == 1 || rhs_len == 0)) |
|
|
1874 { |
|
|
1875 (*current_liboctave_error_handler) |
|
|
1876 ("A([]) = X: X must also be an empty matrix or a scalar"); |
|
|
1877 |
|
|
1878 retval = 0; |
|
|
1879 } |
|
|
1880 |
|
|
1881 lhs.clear_index (); |
|
|
1882 |
|
|
1883 return retval; |
|
|
1884 } |
|
|
1885 |
|
|
1886 #define MAYBE_RESIZE_LHS \ |
|
|
1887 do \ |
|
|
1888 { \ |
|
|
1889 int max_row_idx = idx_i_is_colon ? rhs_nr : idx_i.max () + 1; \ |
|
|
1890 int max_col_idx = idx_j_is_colon ? rhs_nc : idx_j.max () + 1; \ |
|
|
1891 \ |
|
|
1892 int new_nr = max_row_idx > lhs_nr ? max_row_idx : lhs_nr; \ |
|
|
1893 int new_nc = max_col_idx > lhs_nc ? max_col_idx : lhs_nc; \ |
|
|
1894 \ |
|
|
1895 lhs.resize_and_fill (new_nr, new_nc, rfv); \ |
|
|
1896 } \ |
|
|
1897 while (0) |
|
|
1898 |
|
|
1899 template <class LT, class RT> |
|
|
1900 int |
|
|
1901 assign2 (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) |
|
|
1902 { |
|
|
1903 int retval = 1; |
|
|
1904 |
|
|
1905 int n_idx = lhs.index_count (); |
|
|
1906 |
|
|
1907 int lhs_nr = lhs.rows (); |
|
|
1908 int lhs_nc = lhs.cols (); |
|
|
1909 |
|
|
1910 int rhs_nr = rhs.rows (); |
|
|
1911 int rhs_nc = rhs.cols (); |
|
|
1912 |
|
|
1913 idx_vector *tmp = lhs.get_idx (); |
|
|
1914 |
|
|
1915 idx_vector idx_i; |
|
|
1916 idx_vector idx_j; |
|
|
1917 |
|
|
1918 if (n_idx > 1) |
|
|
1919 idx_j = tmp[1]; |
|
|
1920 |
|
|
1921 if (n_idx > 0) |
|
|
1922 idx_i = tmp[0]; |
|
|
1923 |
|
|
1924 if (n_idx == 2) |
|
|
1925 { |
|
|
1926 int n = idx_i.freeze (lhs_nr, "row", true, liboctave_wrore_flag); |
|
|
1927 |
|
|
1928 int m = idx_j.freeze (lhs_nc, "column", true, liboctave_wrore_flag); |
|
|
1929 |
|
|
1930 int idx_i_is_colon = idx_i.is_colon (); |
|
|
1931 int idx_j_is_colon = idx_j.is_colon (); |
|
|
1932 |
|
|
1933 if (idx_i_is_colon) |
|
|
1934 n = lhs_nr > 0 ? lhs_nr : rhs_nr; |
|
|
1935 |
|
|
1936 if (idx_j_is_colon) |
|
|
1937 m = lhs_nc > 0 ? lhs_nc : rhs_nc; |
|
|
1938 |
|
|
1939 if (idx_i && idx_j) |
|
|
1940 { |
|
|
1941 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
1942 { |
|
|
1943 lhs.maybe_delete_elements (idx_i, idx_j); |
|
|
1944 } |
|
|
1945 else |
|
|
1946 { |
|
|
1947 if (rhs_nr == 1 && rhs_nc == 1 && n > 0 && m > 0) |
|
|
1948 { |
|
|
1949 MAYBE_RESIZE_LHS; |
|
|
1950 |
|
|
1951 RT scalar = rhs.elem (0, 0); |
|
|
1952 |
|
|
1953 for (int j = 0; j < m; j++) |
|
|
1954 { |
|
|
1955 int jj = idx_j.elem (j); |
|
|
1956 for (int i = 0; i < n; i++) |
|
|
1957 { |
|
|
1958 int ii = idx_i.elem (i); |
|
|
1959 lhs.elem (ii, jj) = scalar; |
|
|
1960 } |
|
|
1961 } |
|
|
1962 } |
|
|
1963 else if (n == rhs_nr && m == rhs_nc) |
|
|
1964 { |
|
|
1965 if (n > 0 && m > 0) |
|
|
1966 { |
|
|
1967 MAYBE_RESIZE_LHS; |
|
|
1968 |
|
|
1969 for (int j = 0; j < m; j++) |
|
|
1970 { |
|
|
1971 int jj = idx_j.elem (j); |
|
|
1972 for (int i = 0; i < n; i++) |
|
|
1973 { |
|
|
1974 int ii = idx_i.elem (i); |
|
|
1975 lhs.elem (ii, jj) = rhs.elem (i, j); |
|
|
1976 } |
|
|
1977 } |
|
|
1978 } |
|
|
1979 } |
|
|
1980 else if (n == 0 && m == 0) |
|
|
1981 { |
|
|
1982 if (! ((rhs_nr == 1 && rhs_nc == 1) |
|
|
1983 || (rhs_nr == 0 && rhs_nc == 0))) |
|
|
1984 { |
|
|
1985 (*current_liboctave_error_handler) |
|
|
1986 ("A([], []) = X: X must be an empty matrix or a scalar"); |
|
|
1987 |
|
|
1988 retval = 0; |
|
|
1989 } |
|
|
1990 } |
|
|
1991 else |
|
|
1992 { |
|
|
1993 (*current_liboctave_error_handler) |
|
|
1994 ("A(I, J) = X: X must be a scalar or the number of elements in I must"); |
|
|
1995 (*current_liboctave_error_handler) |
|
|
1996 ("match the number of rows in X and the number of elements in J must"); |
|
|
1997 (*current_liboctave_error_handler) |
|
|
1998 ("match the number of columns in X"); |
|
|
1999 |
|
|
2000 retval = 0; |
|
|
2001 } |
|
|
2002 } |
|
|
2003 } |
|
|
2004 // idx_vector::freeze() printed an error message for us. |
|
|
2005 } |
|
|
2006 else if (n_idx == 1) |
|
|
2007 { |
|
|
2008 int lhs_is_empty = lhs_nr == 0 || lhs_nc == 0; |
|
|
2009 |
|
|
2010 if (lhs_is_empty || (lhs_nr == 1 && lhs_nc == 1)) |
|
|
2011 { |
|
|
2012 int lhs_len = lhs.length (); |
|
|
2013 |
|
|
2014 int n = idx_i.freeze (lhs_len, 0, true, liboctave_wrore_flag); |
|
|
2015 |
|
|
2016 if (idx_i) |
|
|
2017 { |
|
|
2018 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2019 { |
|
|
2020 if (n != 0 && (lhs_nr != 0 || lhs_nc != 0)) |
|
|
2021 lhs.maybe_delete_elements (idx_i); |
|
|
2022 } |
|
|
2023 else |
|
|
2024 { |
|
|
2025 if (liboctave_wfi_flag) |
|
|
2026 { |
|
|
2027 if (lhs_is_empty |
|
|
2028 && idx_i.is_colon () |
|
|
2029 && ! (rhs_nr == 1 || rhs_nc == 1)) |
|
|
2030 { |
|
|
2031 (*current_liboctave_warning_handler) |
|
|
2032 ("A(:) = X: X is not a vector or scalar"); |
|
|
2033 } |
|
|
2034 else |
|
|
2035 { |
|
|
2036 int idx_nr = idx_i.orig_rows (); |
|
|
2037 int idx_nc = idx_i.orig_columns (); |
|
|
2038 |
|
|
2039 if (! (rhs_nr == idx_nr && rhs_nc == idx_nc)) |
|
|
2040 (*current_liboctave_warning_handler) |
|
|
2041 ("A(I) = X: X does not have same shape as I"); |
|
|
2042 } |
|
|
2043 } |
|
|
2044 |
|
|
2045 if (assign1 ((Array<LT>&) lhs, (Array<RT>&) rhs, rfv)) |
|
|
2046 { |
|
|
2047 int len = lhs.length (); |
|
|
2048 |
|
|
2049 if (len > 0) |
|
|
2050 { |
|
|
2051 // The following behavior is much simplified |
|
|
2052 // over previous versions of Octave. It |
|
|
2053 // seems to be compatible with Matlab. |
|
|
2054 |
|
|
2055 lhs.dimensions = dim_vector (1, lhs.length ()); |
|
|
2056 } |
|
|
2057 else |
|
|
2058 lhs.dimensions = dim_vector (0, 0); |
|
|
2059 } |
|
|
2060 else |
|
|
2061 retval = 0; |
|
|
2062 } |
|
|
2063 } |
|
|
2064 // idx_vector::freeze() printed an error message for us. |
|
|
2065 } |
|
|
2066 else if (lhs_nr == 1) |
|
|
2067 { |
|
|
2068 idx_i.freeze (lhs_nc, "vector", true, liboctave_wrore_flag); |
|
|
2069 |
|
|
2070 if (idx_i) |
|
|
2071 { |
|
|
2072 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2073 lhs.maybe_delete_elements (idx_i); |
|
|
2074 else |
|
|
2075 { |
|
|
2076 if (assign1 ((Array<LT>&) lhs, (Array<RT>&) rhs, rfv)) |
|
|
2077 lhs.dimensions = dim_vector (1, lhs.length ()); |
|
|
2078 else |
|
|
2079 retval = 0; |
|
|
2080 } |
|
|
2081 } |
|
|
2082 // idx_vector::freeze() printed an error message for us. |
|
|
2083 } |
|
|
2084 else if (lhs_nc == 1) |
|
|
2085 { |
|
|
2086 idx_i.freeze (lhs_nr, "vector", true, liboctave_wrore_flag); |
|
|
2087 |
|
|
2088 if (idx_i) |
|
|
2089 { |
|
|
2090 if (rhs_nr == 0 && rhs_nc == 0) |
|
|
2091 lhs.maybe_delete_elements (idx_i); |
|
|
2092 else |
|
|
2093 { |
|
|
2094 if (assign1 ((Array<LT>&) lhs, (Array<RT>&) rhs, rfv)) |
|
|
2095 lhs.dimensions = dim_vector (lhs.length (), 1); |
|
|
2096 else |
|
|
2097 retval = 0; |
|
|
2098 } |
|
|
2099 } |
|
|
2100 // idx_vector::freeze() printed an error message for us. |
|
|
2101 } |
|
|
2102 else |
|
|
2103 { |
|
|
2104 if (liboctave_wfi_flag |
|
|
2105 && ! (idx_i.is_colon () |
|
|
2106 || (idx_i.one_zero_only () |
|
|
2107 && idx_i.orig_rows () == lhs_nr |
|
|
2108 && idx_i.orig_columns () == lhs_nc))) |
|
|
2109 (*current_liboctave_warning_handler) |
|
|
2110 ("single index used for matrix"); |
|
|
2111 |
|
|
2112 int len = idx_i.freeze (lhs_nr * lhs_nc, "matrix"); |
|
|
2113 |
|
|
2114 if (idx_i) |
|
|
2115 { |
|
|
2116 if (len == 0) |
|
|
2117 { |
|
|
2118 if (! ((rhs_nr == 1 && rhs_nc == 1) |
|
|
2119 || (rhs_nr == 0 && rhs_nc == 0))) |
|
|
2120 (*current_liboctave_error_handler) |
|
|
2121 ("A([]) = X: X must be an empty matrix or scalar"); |
|
|
2122 } |
|
|
2123 else if (len == rhs_nr * rhs_nc) |
|
|
2124 { |
|
|
2125 int k = 0; |
|
|
2126 for (int j = 0; j < rhs_nc; j++) |
|
|
2127 { |
|
|
2128 for (int i = 0; i < rhs_nr; i++) |
|
|
2129 { |
|
|
2130 int ii = idx_i.elem (k++); |
|
|
2131 int fr = ii % lhs_nr; |
|
|
2132 int fc = (ii - fr) / lhs_nr; |
|
|
2133 lhs.elem (fr, fc) = rhs.elem (i, j); |
|
|
2134 } |
|
|
2135 } |
|
|
2136 } |
|
|
2137 else if (rhs_nr == 1 && rhs_nc == 1 && len <= lhs_nr * lhs_nc) |
|
|
2138 { |
|
|
2139 RT scalar = rhs.elem (0, 0); |
|
|
2140 |
|
|
2141 for (int i = 0; i < len; i++) |
|
|
2142 { |
|
|
2143 int ii = idx_i.elem (i); |
|
|
2144 int fr = ii % lhs_nr; |
|
|
2145 int fc = (ii - fr) / lhs_nr; |
|
|
2146 lhs.elem (fr, fc) = scalar; |
|
|
2147 } |
|
|
2148 } |
|
|
2149 else |
|
|
2150 { |
|
|
2151 (*current_liboctave_error_handler) |
|
|
2152 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
2153 |
|
|
2154 retval = 0; |
|
|
2155 } |
|
|
2156 } |
|
|
2157 // idx_vector::freeze() printed an error message for us. |
|
|
2158 } |
|
|
2159 } |
|
|
2160 else |
|
|
2161 { |
|
|
2162 (*current_liboctave_error_handler) |
|
|
2163 ("invalid number of indices for matrix expression"); |
|
|
2164 |
|
|
2165 retval = 0; |
|
|
2166 } |
|
|
2167 |
|
|
2168 lhs.clear_index (); |
|
|
2169 |
|
|
2170 return retval; |
|
|
2171 } |
|
|
2172 |
|
|
2173 #define MAYBE_RESIZE_ND_DIMS \ |
|
|
2174 do \ |
|
|
2175 { \ |
|
|
2176 if (n_idx >= lhs_dims.length () && ! rhs_is_empty) \ |
|
|
2177 { \ |
|
|
2178 Array<int> max_idx (n_idx); \ |
|
|
2179 dim_vector new_idx; \ |
|
|
2180 new_idx.resize (n_idx); \ |
|
|
2181 \ |
|
|
2182 for (int i = 0; i < n_idx; i++) \ |
|
|
2183 { \ |
|
|
2184 if (lhs_dims.length () == 0 || i >= lhs_dims.length ()) \ |
|
|
2185 new_idx(i) = idx(i).max () + 1; \ |
|
|
2186 else \ |
|
|
2187 { \ |
|
|
2188 if (i < rhs_dims.length ()) \ |
|
|
2189 max_idx(i) = idx(i).is_colon () ? rhs_dims(i) : idx(i).max () + 1; \ |
|
|
2190 else \ |
|
|
2191 max_idx(i) = idx(i).max () + 1; \ |
|
|
2192 \ |
|
|
2193 new_idx(i) = max_idx(i) > lhs_dims(i) ? max_idx(i) : lhs_dims(i); \ |
|
|
2194 } \ |
|
|
2195 } \ |
|
|
2196 \ |
|
|
2197 lhs.resize (new_idx, rfv); \ |
|
|
2198 lhs_dims = lhs.dims (); \ |
|
|
2199 } \ |
|
|
2200 } \ |
|
|
2201 while (0) |
|
|
2202 |
|
|
2203 template <class LT, class RT> |
|
|
2204 int |
|
|
2205 assignN (Array<LT>& lhs, const Array<RT>& rhs, const LT& rfv) |
|
|
2206 { |
|
|
2207 int retval = 1; |
|
|
2208 |
|
|
2209 int n_idx = lhs.index_count (); |
|
|
2210 |
|
|
2211 dim_vector lhs_dims = lhs.dims (); |
|
|
2212 dim_vector rhs_dims = rhs.dims (); |
|
|
2213 |
|
|
2214 idx_vector *tmp = lhs.get_idx (); |
|
|
2215 |
|
|
2216 Array<idx_vector> idx = conv_to_array (tmp, n_idx); |
|
|
2217 |
|
|
2218 // This needs to be defined before MAYBE_RESIZE_ND_DIMS. |
|
|
2219 |
|
|
2220 bool rhs_is_empty = rhs_dims.length () == 0 ? true : any_zero_len (rhs_dims); |
|
|
2221 |
|
|
2222 // Maybe expand to more dimensions. |
|
|
2223 |
|
|
2224 MAYBE_RESIZE_ND_DIMS; |
|
|
2225 |
|
|
2226 Array<int> idx_is_colon (n_idx, 0); |
|
|
2227 Array<int> idx_is_colon_equiv (n_idx, 0); |
|
|
2228 |
|
|
2229 for (int i = 0; i < n_idx; i++) |
|
|
2230 { |
|
|
2231 idx_is_colon_equiv(i) = idx(i).is_colon_equiv (lhs_dims(i), 1); |
|
|
2232 |
|
|
2233 idx_is_colon(i) = idx(i).is_colon (); |
|
|
2234 } |
|
|
2235 |
|
|
2236 int resize_ok = 1; |
|
|
2237 |
|
|
2238 dim_vector frozen_len; |
|
|
2239 |
|
|
2240 if (n_idx == lhs_dims.length ()) |
|
|
2241 frozen_len = freeze (idx, lhs_dims, resize_ok); |
|
|
2242 |
|
|
2243 bool rhs_is_scalar = is_scalar (rhs_dims); |
|
|
2244 |
|
|
2245 bool idx_is_empty = any_zero_len (frozen_len); |
|
|
2246 |
|
|
2247 if (rhs_is_empty) |
|
|
2248 { |
|
|
2249 lhs.maybe_delete_elements (idx, rfv); |
|
|
2250 } |
|
|
2251 else if (rhs_is_scalar) |
|
|
2252 { |
|
|
2253 if (n_idx == 0) |
|
|
2254 (*current_liboctave_error_handler) |
|
|
2255 ("number of indices is zero."); |
|
|
2256 |
|
|
2257 else if (n_idx < lhs_dims.length ()) |
|
|
2258 { |
|
|
2259 // Number of indices is less than dimensions. |
|
|
2260 |
|
|
2261 if (any_ones (idx_is_colon)|| any_ones (idx_is_colon_equiv)) |
|
|
2262 { |
|
|
2263 (*current_liboctave_error_handler) |
|
|
2264 ("number of indices is less than number of dimensions, one or more indices are colons."); |
|
|
2265 } |
|
|
2266 else |
|
|
2267 { |
|
|
2268 // Fewer indices than dimensions, no colons. |
|
|
2269 |
|
|
2270 bool resize = false; |
|
|
2271 |
|
|
2272 // Subtract one since the last idx do not tell us |
|
|
2273 // anything about dimensionality. |
|
|
2274 |
|
|
2275 for (int i = 0; i < idx.length () - 1; i++) |
|
|
2276 { |
|
|
2277 // Subtract one since idx counts from 0 while dims |
|
|
2278 // count from 1. |
|
|
2279 |
|
|
2280 if (idx(i).elem (0) + 1 > lhs_dims(i)) |
|
|
2281 resize = true; |
|
|
2282 } |
|
|
2283 |
|
|
2284 if (resize) |
|
|
2285 { |
|
|
2286 dim_vector new_dims; |
|
|
2287 new_dims.resize (lhs_dims.length ()); |
|
|
2288 |
|
|
2289 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
2290 { |
|
|
2291 if (i < idx.length () - 1 |
|
|
2292 && idx(i).elem (0) + 1 > lhs_dims(i)) |
|
|
2293 new_dims(i) = idx(i).elem (0)+1; |
|
|
2294 else |
|
|
2295 new_dims(i) = lhs_dims(i); |
|
|
2296 } |
|
|
2297 |
|
|
2298 lhs.resize (new_dims, rfv); |
|
|
2299 |
|
|
2300 lhs_dims = lhs.dims (); |
|
|
2301 } |
|
|
2302 |
|
|
2303 Array<int> one_arg_temp (1, 0); |
|
|
2304 |
|
|
2305 RT scalar = rhs.elem (one_arg_temp); |
|
|
2306 |
|
|
2307 Array<int> int_arr = conv_to_int_array (idx); |
|
|
2308 |
|
|
2309 int numelem = get_scalar_idx (int_arr, lhs_dims); |
|
|
2310 |
|
|
2311 if (numelem > lhs.length () || numelem < 0) |
|
|
2312 (*current_liboctave_error_handler) |
|
|
2313 ("attempt to grow array along ambiguous dimension."); |
|
|
2314 else |
|
|
2315 lhs.Array<LT>::checkelem (numelem) = scalar; |
|
|
2316 } |
|
|
2317 } |
|
|
2318 else |
|
|
2319 { |
|
|
2320 // Scalar to matrix assignment with as many indices as lhs |
|
|
2321 // dimensions. |
|
|
2322 |
|
|
2323 int n = Array<LT>::get_size (frozen_len); |
|
|
2324 |
|
|
2325 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
2326 |
|
|
2327 Array<int> elt_idx; |
|
|
2328 |
|
|
2329 RT scalar = rhs.elem (0); |
|
|
2330 |
|
|
2331 for (int i = 0; i < n; i++) |
|
|
2332 { |
|
|
2333 elt_idx = get_elt_idx (idx, result_idx); |
|
|
2334 |
|
|
2335 dim_vector lhs_inc; |
|
|
2336 lhs_inc.resize (lhs_dims.length ()); |
|
|
2337 |
|
|
2338 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
2339 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
2340 |
|
|
2341 if (index_in_bounds(elt_idx, lhs_inc)) |
|
|
2342 lhs.checkelem (elt_idx) = scalar; |
|
|
2343 else |
|
|
2344 lhs.checkelem (elt_idx) = rfv; |
|
|
2345 |
|
|
2346 increment_index (result_idx, frozen_len); |
|
|
2347 } |
|
|
2348 } |
|
|
2349 } |
|
|
2350 else if (rhs_dims.length () >= 2) |
|
|
2351 { |
|
|
2352 // RHS is matrix or higher dimension. |
|
|
2353 |
|
|
2354 // Subtracting number of dimensions of length 1 will catch |
|
|
2355 // cases where: A(2,1,2)=3 A(:,1,:)=[2,3;4,5] |
|
|
2356 |
|
|
2357 if (rhs_dims.length () != num_ones(idx_is_colon_equiv) - num_ones(lhs_dims)) |
|
|
2358 { |
|
|
2359 (*current_liboctave_error_handler) |
|
|
2360 ("dimensions do not match in matrix assignment."); |
|
|
2361 } |
|
|
2362 else |
|
|
2363 { |
|
|
2364 bool dim_ok(true); |
|
|
2365 |
|
|
2366 int jj = 0; |
|
|
2367 |
|
|
2368 // Check that RHS dimensions are the same length as the |
|
|
2369 // corresponding LHS dimensions. |
|
|
2370 |
|
|
2371 for (int j = 0; j < idx_is_colon.length (); j++) |
|
|
2372 { |
|
|
2373 if (idx_is_colon(j) || idx_is_colon_equiv(j)) |
|
|
2374 { |
|
|
2375 if (rhs_dims(jj) < lhs_dims(j)) |
|
|
2376 { |
|
|
2377 dim_ok = false; |
|
|
2378 |
|
|
2379 break; |
|
|
2380 } |
|
|
2381 |
|
|
2382 jj++; |
|
|
2383 } |
|
|
2384 } |
|
|
2385 |
|
|
2386 if (! dim_ok) |
|
|
2387 (*current_liboctave_error_handler) |
|
|
2388 ("subscripted assignment dimension mismatch."); |
|
|
2389 else |
|
|
2390 { |
|
|
2391 dim_vector new_dims; |
|
|
2392 new_dims.resize (n_idx); |
|
|
2393 |
|
|
2394 bool resize = false; |
|
|
2395 |
|
|
2396 int ii = 0; |
|
|
2397 |
|
|
2398 // Update idx vectors. |
|
|
2399 |
|
|
2400 for (int i = 0; i < n_idx; i++) |
|
|
2401 { |
|
|
2402 if (idx(i).is_colon ()) |
|
|
2403 { |
|
|
2404 // Add appropriate idx_vector to idx(i) since |
|
|
2405 // index with : contains no indexes. |
|
|
2406 |
|
|
2407 frozen_len(i) = lhs_dims(i) > rhs_dims(ii) ? lhs_dims(i) : rhs_dims(ii); |
|
|
2408 |
|
|
2409 new_dims(i) = lhs_dims(i) > rhs_dims(ii) ? lhs_dims(i) : rhs_dims(ii); |
|
|
2410 |
|
|
2411 ii++; |
|
|
2412 |
|
|
2413 Range idxrange (1, frozen_len(i), 1); |
|
|
2414 |
|
|
2415 idx_vector idxv (idxrange); |
|
|
2416 |
|
|
2417 idx(i) = idxv; |
|
|
2418 } |
|
|
2419 else |
|
|
2420 { |
|
|
2421 new_dims(i) = lhs_dims(i) > idx(i).max () + 1 ? lhs_dims(i) : idx(i).max () + 1; |
|
|
2422 |
|
|
2423 if (frozen_len(i) > 1) |
|
|
2424 ii++; |
|
|
2425 } |
|
|
2426 if (new_dims(i) != lhs_dims(i)) |
|
|
2427 resize = true; |
|
|
2428 } |
|
|
2429 |
|
|
2430 // Resize LHS if dimensions have changed. |
|
|
2431 |
|
|
2432 if (resize) |
|
|
2433 { |
|
|
2434 lhs.resize (new_dims, rfv); |
|
|
2435 |
|
|
2436 lhs_dims = lhs.dims (); |
|
|
2437 } |
|
|
2438 |
|
|
2439 // Number of elements which need to be set. |
|
|
2440 |
|
|
2441 int n = Array<LT>::get_size (frozen_len); |
|
|
2442 |
|
|
2443 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
2444 Array<int> elt_idx; |
|
|
2445 |
|
|
2446 Array<int> result_rhs_idx (rhs_dims.length (), 0); |
|
|
2447 |
|
|
2448 dim_vector frozen_rhs; |
|
|
2449 frozen_rhs.resize (rhs_dims.length()); |
|
|
2450 |
|
|
2451 for (int i = 0; i < rhs_dims.length (); i++) |
|
|
2452 frozen_rhs(i) = rhs_dims(i); |
|
|
2453 |
|
|
2454 dim_vector lhs_inc; |
|
|
2455 lhs_inc.resize (lhs_dims.length ()); |
|
|
2456 |
|
|
2457 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
2458 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
2459 |
|
|
2460 for (int i = 0; i < n; i++) |
|
|
2461 { |
|
|
2462 elt_idx = get_elt_idx (idx, result_idx); |
|
|
2463 |
|
|
2464 if (index_in_bounds (elt_idx, lhs_inc)) |
|
|
2465 { |
|
|
2466 int s = compute_index (result_rhs_idx,rhs_dims); |
|
|
2467 |
|
|
2468 lhs.checkelem (elt_idx) = rhs.elem (s); |
|
|
2469 |
|
|
2470 increment_index (result_rhs_idx, frozen_rhs); |
|
|
2471 } |
|
|
2472 else |
|
|
2473 lhs.checkelem (elt_idx) = rfv; |
|
|
2474 |
|
|
2475 increment_index (result_idx, frozen_len); |
|
|
2476 } |
|
|
2477 } |
|
|
2478 } |
|
|
2479 } |
|
|
2480 else if (idx_is_empty) |
|
|
2481 { |
|
|
2482 // Assignment to matrix with at least one empty index. |
|
|
2483 |
|
|
2484 if (! rhs_is_empty || ! rhs_is_scalar) |
|
|
2485 { |
|
|
2486 (*current_liboctave_error_handler) |
|
|
2487 ("A([], []) = X: X must be an empty matrix or a scalar"); |
|
|
2488 |
|
|
2489 retval = 0; |
|
|
2490 } |
|
|
2491 } |
|
|
2492 else if (lhs_dims.length () != rhs_dims.length ()) |
|
|
2493 { |
|
|
2494 (*current_liboctave_error_handler) |
|
|
2495 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
2496 retval = 0; |
|
|
2497 } |
|
|
2498 |
|
|
2499 lhs.clear_index (); |
|
|
2500 |
|
|
2501 return retval; |
|
|
2502 } |
|
|
2503 |
|
|
2504 template <class T> |
|
|
2505 void |
|
3933
|
2506 Array<T>::print_info (std::ostream& os, const std::string& prefix) const |
|
|
2507 { |
|
|
2508 os << prefix << "rep address: " << rep << "\n" |
|
|
2509 << prefix << "rep->len: " << rep->len << "\n" |
|
|
2510 << prefix << "rep->data: " << static_cast<void *> (rep->data) << "\n" |
|
|
2511 << prefix << "rep->count: " << rep->count << "\n"; |
|
4513
|
2512 |
|
|
2513 // 2D info: |
|
|
2514 // |
|
|
2515 // << prefix << "rows: " << rows () << "\n" |
|
|
2516 // << prefix << "cols: " << cols () << "\n"; |
|
3933
|
2517 } |
|
|
2518 |
|
237
|
2519 /* |
|
|
2520 ;;; Local Variables: *** |
|
|
2521 ;;; mode: C++ *** |
|
|
2522 ;;; End: *** |
|
|
2523 */ |
