|
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 |
|
|
24 #include "Array-flags.h" |
|
|
25 #include "idx-vector.h" |
|
|
26 #include "lo-error.h" |
|
|
27 |
|
|
28 template <class T> |
|
|
29 void |
|
4493
|
30 ArrayN<T>::maybe_delete_elements (Array<idx_vector>& idx, const T& rfv) |
|
3665
|
31 { |
|
4496
|
32 int n_idx = idx.length (); |
|
|
33 |
|
|
34 Array<int> lhs_dims = dims (); |
|
|
35 |
|
|
36 Array<int> idx_is_colon (n_idx, 0); |
|
|
37 Array<int> idx_is_colon_equiv (n_idx, 0); |
|
|
38 |
|
|
39 // Initialization of colon arrays. |
|
|
40 |
|
|
41 for (int i = 0; i < n_idx; i++) |
|
|
42 { |
|
|
43 idx_is_colon_equiv(i) = idx(i).is_colon_equiv (lhs_dims(i), 1); |
|
|
44 |
|
|
45 idx_is_colon(i) = idx(i).is_colon (); |
|
|
46 } |
|
|
47 |
|
|
48 if (all_ones (idx_is_colon) || all_ones (idx_is_colon_equiv)) |
|
|
49 { |
|
|
50 // A(:,:,:) -- we are deleting elements in all dimensions, so |
|
|
51 // the result is [](0x0x0). |
|
|
52 |
|
|
53 Array<int> zeros (n_idx, 0); |
|
|
54 |
|
|
55 resize (zeros, rfv); |
|
|
56 } |
|
|
57 |
|
|
58 else if (num_ones (idx_is_colon) == n_idx - 1 |
|
|
59 && num_ones (idx_is_colon_equiv) == n_idx) |
|
|
60 { |
|
|
61 // A(:,:,j) -- we are deleting elements in one dimension by |
|
|
62 // enumerating them. |
|
|
63 // |
|
|
64 // If we enumerate all of the elements, we should have zero |
|
|
65 // elements in that dimension with the same number of elements |
|
|
66 // in the other dimensions that we started with. |
|
|
67 |
|
|
68 Array<int> temp_dims (n_idx,0); |
|
|
69 |
|
|
70 for (int i = 0; i < n_idx; i++) |
|
|
71 { |
|
|
72 if (idx_is_colon (i)) |
|
|
73 temp_dims (i) = lhs_dims (i); |
|
|
74 |
|
|
75 else |
|
|
76 temp_dims (i) = 0; |
|
|
77 } |
|
|
78 resize (temp_dims); |
|
|
79 } |
|
|
80 else if (num_ones (idx_is_colon) == n_idx - 1) |
|
|
81 { |
|
|
82 // We have colons in all indices except for one. |
|
|
83 // This index tells us which slice to delete |
|
|
84 |
|
|
85 int non_col = 0; |
|
|
86 |
|
|
87 // Find the non-colon column. |
|
|
88 |
|
|
89 for (int i = 0; i < n_idx; i++) |
|
|
90 { |
|
|
91 if (! idx_is_colon (i)) |
|
|
92 non_col = i; |
|
|
93 } |
|
|
94 |
|
|
95 // The length of the non-colon dimension. |
|
|
96 |
|
|
97 int non_col_dim = lhs_dims (non_col); |
|
|
98 |
|
|
99 idx(non_col).sort (true); |
|
|
100 |
|
|
101 int num_to_delete = idx(non_col).length (lhs_dims (non_col)); |
|
|
102 |
|
|
103 if (num_to_delete > 0) |
|
|
104 { |
|
|
105 int temp = num_ones(lhs_dims); |
|
|
106 |
|
|
107 if (non_col_dim == 1) |
|
|
108 temp--; |
|
|
109 |
|
|
110 if (temp == n_idx - 1 && num_to_delete == non_col_dim) |
|
|
111 { |
|
|
112 // We have A with (1x1x4), where A(1,:,1:4) |
|
|
113 // Delete all (0x0x0) |
|
|
114 |
|
|
115 Array<int> zero_dims (n_idx, 0); |
|
|
116 |
|
|
117 resize (zero_dims, rfv); |
|
|
118 } |
|
|
119 else |
|
|
120 { |
|
|
121 // New length of non-colon dimension |
|
|
122 // (calculated in the next for loop) |
|
|
123 |
|
|
124 int new_dim = non_col_dim; |
|
|
125 |
|
|
126 int iidx = 0; |
|
|
127 |
|
|
128 for (int j = 0; j < non_col_dim; j++) |
|
|
129 if (j == idx(non_col).elem (iidx)) |
|
|
130 { |
|
|
131 iidx++; |
|
|
132 |
|
|
133 new_dim--; |
|
|
134 |
|
|
135 if (iidx == num_to_delete) |
|
|
136 break; |
|
|
137 } |
|
|
138 |
|
|
139 // Creating the new nd array after deletions. |
|
|
140 |
|
|
141 if (new_dim > 0) |
|
|
142 { |
|
|
143 // Calculate number of elements in new array. |
|
|
144 |
|
|
145 int num_new_elem=1; |
|
|
146 |
|
|
147 for (int i = 0; i < n_idx; i++) |
|
|
148 { |
|
|
149 if (i == non_col) |
|
|
150 num_new_elem *= new_dim; |
|
|
151 |
|
|
152 else |
|
|
153 num_new_elem *= lhs_dims(i); |
|
|
154 } |
|
|
155 |
|
|
156 T *new_data = new T [num_new_elem]; |
|
|
157 |
|
|
158 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
159 Array<int> elt_idx; |
|
|
160 |
|
|
161 Array<int> lhs_inc (lhs_dims.length ()); |
|
|
162 |
|
|
163 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
164 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
165 |
|
|
166 Array<int> new_lhs_dim = lhs_dims; |
|
|
167 |
|
|
168 new_lhs_dim(non_col) = new_dim; |
|
|
169 |
|
|
170 int num_elem = 1; |
|
|
171 |
|
|
172 int numidx = 0; |
|
|
173 |
|
|
174 int n = length (); |
|
|
175 |
|
|
176 for (int i =0; i < lhs_dims.length (); i++) |
|
|
177 if (i != non_col) |
|
|
178 num_elem *= lhs_dims (i); |
|
|
179 |
|
|
180 num_elem *= idx(non_col).capacity (); |
|
|
181 |
|
|
182 for (int i = 0; i < n; i++) |
|
|
183 { |
|
|
184 if (numidx < num_elem |
|
|
185 && is_in (result_idx(non_col), idx(non_col))) |
|
|
186 numidx++; |
|
|
187 |
|
|
188 else |
|
|
189 { |
|
|
190 Array<int> temp_result_idx = result_idx; |
|
|
191 |
|
|
192 int num_lgt |
|
|
193 = how_many_lgt (result_idx(non_col), idx(non_col)); |
|
|
194 |
|
|
195 temp_result_idx(non_col) -= num_lgt; |
|
|
196 |
|
|
197 int kidx |
|
|
198 = ::compute_index (temp_result_idx, new_lhs_dim); |
|
|
199 |
|
|
200 new_data[kidx] = elem (result_idx); |
|
|
201 } |
|
|
202 |
|
|
203 increment_index (result_idx, lhs_dims); |
|
|
204 } |
|
|
205 |
|
|
206 if (--(Array<T>::rep)->count <= 0) |
|
|
207 delete Array<T>::rep; |
|
|
208 |
|
|
209 Array<T>::rep = |
|
|
210 new typename Array<T>::ArrayRep (new_data, num_new_elem); |
|
|
211 |
|
|
212 dimensions = new_lhs_dim; |
|
|
213 |
|
|
214 set_max_indices (new_lhs_dim.length ()); |
|
|
215 } |
|
|
216 } |
|
|
217 } |
|
|
218 } |
|
|
219 else if (num_ones(idx_is_colon) < n_idx) |
|
|
220 { |
|
|
221 (*current_liboctave_error_handler) |
|
|
222 ("A null assignment can have only one non-colon index."); |
|
|
223 } |
|
3665
|
224 } |
|
|
225 |
|
|
226 template <class T> |
|
|
227 ArrayN<T> |
|
|
228 ArrayN<T>::value (void) |
|
|
229 { |
|
|
230 ArrayN<T> retval; |
|
|
231 |
|
|
232 int n_idx = index_count (); |
|
|
233 |
|
|
234 if (n_idx > 1) |
|
|
235 { |
|
4273
|
236 Array<idx_vector> ra_idx (n_idx); |
|
3665
|
237 |
|
|
238 idx_vector *tmp = get_idx (); |
|
|
239 |
|
|
240 for (int i = 0; i < n_idx; i++) |
|
4273
|
241 ra_idx(i) = tmp[i]; |
|
3665
|
242 |
|
4273
|
243 return index (ra_idx); |
|
3665
|
244 } |
|
|
245 else if (n_idx == 1) |
|
|
246 { |
|
|
247 idx_vector *tmp = get_idx (); |
|
|
248 |
|
4273
|
249 idx_vector ra_idx = tmp[0]; |
|
3665
|
250 |
|
4273
|
251 return index (ra_idx); |
|
3665
|
252 } |
|
|
253 else |
|
|
254 (*current_liboctave_error_handler) |
|
|
255 ("invalid number of indices for array expression"); |
|
|
256 |
|
|
257 clear_index (); |
|
|
258 |
|
|
259 return retval; |
|
|
260 } |
|
|
261 |
|
|
262 template <class T> |
|
|
263 ArrayN<T> |
|
4461
|
264 ArrayN<T>::index (idx_vector& ra_idx, int resize_ok, const T& rfv) const |
|
3665
|
265 { |
|
|
266 ArrayN<T> retval; |
|
|
267 assert (0); |
|
|
268 return retval; |
|
|
269 } |
|
|
270 |
|
3775
|
271 static inline Array<int> |
|
4273
|
272 freeze (Array<idx_vector>& ra_idx, const Array<int>& dimensions, int resize_ok) |
|
3665
|
273 { |
|
|
274 Array<int> retval; |
|
|
275 |
|
4273
|
276 int n = ra_idx.length (); |
|
3665
|
277 |
|
|
278 assert (n == dimensions.length ()); |
|
|
279 |
|
|
280 retval.resize (n); |
|
|
281 |
|
|
282 for (int i = 0; i < n; i++) |
|
4273
|
283 retval(i) = ra_idx(i).freeze (dimensions(i), "XXX FIXME XXX", resize_ok); |
|
3665
|
284 |
|
|
285 return retval; |
|
|
286 } |
|
|
287 |
|
3775
|
288 static inline bool |
|
4504
|
289 vector_equivalent (const Array<int>& ra_idx) |
|
|
290 { |
|
|
291 int n = ra_idx.length (); |
|
|
292 |
|
|
293 bool found_first = false; |
|
|
294 |
|
|
295 for (int i = 0; i < n; i++) |
|
|
296 { |
|
|
297 if (ra_idx(i) != 1) |
|
|
298 { |
|
|
299 if (! found_first) |
|
|
300 found_first = true; |
|
|
301 else |
|
|
302 return false; |
|
|
303 } |
|
|
304 } |
|
|
305 |
|
|
306 return true; |
|
|
307 } |
|
|
308 |
|
|
309 static inline bool |
|
|
310 equal_arrays (const Array<int> a, const Array<int> b) |
|
|
311 { |
|
|
312 bool retval = true; |
|
|
313 |
|
|
314 if (a.length () != b.length ()) |
|
|
315 retval = false; |
|
|
316 else |
|
|
317 { |
|
|
318 for (int i = 0; i < a.length (); i++) |
|
|
319 { |
|
|
320 if (a(i) != b(i)) |
|
|
321 retval = false; |
|
|
322 } |
|
|
323 } |
|
|
324 |
|
|
325 return retval; |
|
|
326 } |
|
|
327 |
|
|
328 static inline bool |
|
4273
|
329 all_ok (const Array<idx_vector>& ra_idx) |
|
3665
|
330 { |
|
|
331 bool retval = true; |
|
|
332 |
|
4273
|
333 int n = ra_idx.length (); |
|
3665
|
334 |
|
|
335 for (int i = 0; i < n; i++) |
|
|
336 { |
|
4273
|
337 if (! ra_idx(i)) |
|
3665
|
338 { |
|
|
339 retval = false; |
|
|
340 break; |
|
|
341 } |
|
|
342 } |
|
|
343 |
|
|
344 return retval; |
|
|
345 } |
|
|
346 |
|
3775
|
347 static inline bool |
|
4273
|
348 any_orig_empty (const Array<idx_vector>& ra_idx) |
|
3665
|
349 { |
|
|
350 bool retval = false; |
|
|
351 |
|
4273
|
352 int n = ra_idx.length (); |
|
3665
|
353 |
|
|
354 for (int i = 0; i < n; i++) |
|
|
355 { |
|
4273
|
356 if (ra_idx(i).orig_empty ()) |
|
3665
|
357 { |
|
|
358 retval = true; |
|
|
359 break; |
|
|
360 } |
|
|
361 } |
|
|
362 |
|
|
363 return retval; |
|
|
364 } |
|
|
365 |
|
3775
|
366 static inline bool |
|
3665
|
367 any_zero_len (const Array<int>& frozen_lengths) |
|
|
368 { |
|
|
369 bool retval = false; |
|
|
370 |
|
|
371 int n = frozen_lengths.length (); |
|
|
372 |
|
|
373 for (int i = 0; i < n; i++) |
|
|
374 { |
|
|
375 if (frozen_lengths(i) == 0) |
|
|
376 { |
|
|
377 retval = true; |
|
|
378 break; |
|
|
379 } |
|
|
380 } |
|
|
381 |
|
|
382 return retval; |
|
|
383 } |
|
|
384 |
|
3775
|
385 static inline Array<int> |
|
3665
|
386 get_zero_len_size (const Array<int>& frozen_lengths, |
|
|
387 const Array<int>& dimensions) |
|
|
388 { |
|
|
389 Array<int> retval; |
|
|
390 assert (0); |
|
|
391 return retval; |
|
|
392 } |
|
|
393 |
|
3775
|
394 static inline bool |
|
4273
|
395 all_colon_equiv (const Array<idx_vector>& ra_idx, |
|
3665
|
396 const Array<int>& frozen_lengths) |
|
|
397 { |
|
|
398 bool retval = true; |
|
|
399 |
|
4273
|
400 int idx_n = ra_idx.length (); |
|
3665
|
401 |
|
|
402 int n = frozen_lengths.length (); |
|
|
403 |
|
|
404 assert (idx_n == n); |
|
|
405 |
|
|
406 for (int i = 0; i < n; i++) |
|
|
407 { |
|
4273
|
408 if (! ra_idx(i).is_colon_equiv (frozen_lengths(i))) |
|
3665
|
409 { |
|
|
410 retval = false; |
|
|
411 break; |
|
|
412 } |
|
|
413 } |
|
|
414 |
|
|
415 return retval; |
|
|
416 } |
|
|
417 |
|
4496
|
418 static inline bool |
|
|
419 is_in (int num, const idx_vector& idx) |
|
|
420 { |
|
|
421 int n = idx.capacity (); |
|
|
422 |
|
|
423 for (int i = 0; i < n; i++) |
|
|
424 if (idx.elem (i) == num) |
|
|
425 return true; |
|
|
426 |
|
|
427 return false; |
|
|
428 } |
|
|
429 |
|
|
430 static inline int |
|
|
431 how_many_lgt (const int num, idx_vector& idxv) |
|
|
432 { |
|
|
433 int retval = 0; |
|
|
434 |
|
|
435 int n = idxv.capacity (); |
|
|
436 |
|
|
437 for (int i = 0; i < n; i++) |
|
|
438 if (num > idxv.elem (i)) |
|
|
439 retval++; |
|
|
440 |
|
|
441 return retval; |
|
|
442 } |
|
|
443 |
|
|
444 static inline bool |
|
|
445 all_ones (const Array<int> arr) |
|
|
446 { |
|
|
447 bool retval = true; |
|
|
448 |
|
|
449 for (int i = 0; i < arr.length (); i++) |
|
|
450 { |
|
|
451 if (arr(i) != 1) |
|
|
452 { |
|
|
453 retval = false; |
|
|
454 break; |
|
|
455 } |
|
|
456 } |
|
|
457 |
|
|
458 return retval; |
|
|
459 } |
|
|
460 |
|
3665
|
461 static Array<int> |
|
4273
|
462 get_elt_idx (const Array<idx_vector>& ra_idx, const Array<int>& result_idx) |
|
3665
|
463 { |
|
4273
|
464 int n = ra_idx.length (); |
|
3665
|
465 |
|
|
466 Array<int> retval (n); |
|
|
467 |
|
|
468 for (int i = 0; i < n; i++) |
|
4504
|
469 retval(i) = ra_idx(i).elem (result_idx(i)); |
|
3665
|
470 |
|
|
471 return retval; |
|
|
472 } |
|
|
473 |
|
|
474 template <class T> |
|
|
475 ArrayN<T> |
|
4461
|
476 ArrayN<T>::index (Array<idx_vector>& ra_idx, int resize_ok, const T& rfv) const |
|
3665
|
477 { |
|
|
478 ArrayN<T> retval; |
|
|
479 |
|
|
480 int n_dims = dimensions.length (); |
|
|
481 |
|
4273
|
482 Array<int> frozen_lengths = freeze (ra_idx, dimensions, resize_ok); |
|
3665
|
483 |
|
|
484 if (frozen_lengths.length () == n_dims) |
|
|
485 { |
|
4273
|
486 if (all_ok (ra_idx)) |
|
3665
|
487 { |
|
4273
|
488 if (any_orig_empty (ra_idx)) |
|
3665
|
489 { |
|
|
490 retval.resize (frozen_lengths); |
|
|
491 } |
|
|
492 else if (any_zero_len (frozen_lengths)) |
|
|
493 { |
|
|
494 Array<int> new_size = get_zero_len_size (frozen_lengths, |
|
|
495 dimensions); |
|
|
496 |
|
|
497 retval.resize (new_size); |
|
|
498 } |
|
4273
|
499 else if (all_colon_equiv (ra_idx, frozen_lengths)) |
|
3665
|
500 { |
|
|
501 retval = *this; |
|
|
502 } |
|
|
503 else |
|
|
504 { |
|
|
505 #if 0 |
|
|
506 retval.resize (frozen_lengths); |
|
|
507 |
|
|
508 int n = Array<T>::get_size (frozen_lengths); |
|
|
509 |
|
|
510 Array<int> result_idx (n_dims, 0); |
|
|
511 |
|
|
512 for (int i = 0; i < n; i++) |
|
|
513 { |
|
|
514 Array<int> elt_idx = get_elt_idx (result_idx); |
|
|
515 |
|
3933
|
516 if (elt_idx > orig_len) |
|
4461
|
517 retval.elem (result_idx) = rfv; |
|
3933
|
518 else |
|
|
519 retval.elem (result_idx) = elem (elt_idx); |
|
3665
|
520 |
|
|
521 increment_index (result_idx, frozen_lengths); |
|
|
522 } |
|
|
523 #endif |
|
|
524 } |
|
|
525 } |
|
|
526 // idx_vector::freeze() printed an error message for us. |
|
|
527 } |
|
|
528 else |
|
|
529 (*current_liboctave_error_handler) |
|
|
530 ("invalid number of dimensions for N-dimensional array index"); |
|
|
531 |
|
|
532 return retval; |
|
|
533 } |
|
|
534 |
|
4493
|
535 #define MAYBE_RESIZE_ND_DIMS \ |
|
|
536 do \ |
|
|
537 { \ |
|
|
538 if (n_idx >= lhs_dims.length () && ! rhs_is_empty) \ |
|
|
539 { \ |
|
|
540 Array<int> max_idx (n_idx); \ |
|
|
541 Array<int> new_idx (n_idx); \ |
|
|
542 \ |
|
|
543 for (int i = 0; i < n_idx; i++) \ |
|
|
544 { \ |
|
|
545 if (lhs_dims.length () == 0 || i >= lhs_dims.length ()) \ |
|
|
546 new_idx(i) = idx(i).max () + 1; \ |
|
|
547 else \ |
|
|
548 { \ |
|
|
549 if (i < rhs_dims.length ()) \ |
|
|
550 max_idx(i) = idx(i).is_colon () ? rhs_dims(i) : idx(i).max () + 1; \ |
|
|
551 else \ |
|
|
552 max_idx(i) = idx(i).max () + 1; \ |
|
|
553 \ |
|
|
554 new_idx(i) = max_idx(i) > lhs_dims(i) ? max_idx(i) : lhs_dims(i); \ |
|
|
555 } \ |
|
|
556 } \ |
|
|
557 \ |
|
|
558 lhs.resize (new_idx, rfv); \ |
|
|
559 lhs_dims = lhs.dims (); \ |
|
|
560 } \ |
|
|
561 } \ |
|
|
562 while (0) |
|
|
563 |
|
3665
|
564 template <class LT, class RT> |
|
|
565 int |
|
4493
|
566 assign (ArrayN<LT>& lhs, const ArrayN<RT>& rhs, const LT& rfv) |
|
3665
|
567 { |
|
4493
|
568 int retval = 1; |
|
|
569 |
|
|
570 int n_idx = lhs.index_count (); |
|
|
571 |
|
|
572 Array<int> lhs_dims = lhs.dims (); |
|
|
573 Array<int> rhs_dims = rhs.dims (); |
|
|
574 |
|
|
575 idx_vector *tmp = lhs.get_idx (); |
|
|
576 |
|
|
577 Array<idx_vector> idx = conv_to_array (tmp, n_idx); |
|
|
578 |
|
|
579 // This needs to be defined before MAYBE_RESIZE_ND_DIMS. |
|
|
580 |
|
|
581 bool rhs_is_empty = rhs_dims.length () == 0 ? true : any_zero_len (rhs_dims); |
|
|
582 |
|
|
583 // Maybe expand to more dimensions. |
|
|
584 |
|
|
585 MAYBE_RESIZE_ND_DIMS; |
|
|
586 |
|
|
587 Array<int> idx_is_colon (n_idx, 0); |
|
|
588 Array<int> idx_is_colon_equiv (n_idx, 0); |
|
|
589 |
|
|
590 for (int i = 0; i < n_idx; i++) |
|
|
591 { |
|
|
592 idx_is_colon_equiv(i) = idx(i).is_colon_equiv (lhs_dims(i), 1); |
|
|
593 |
|
|
594 idx_is_colon(i) = idx(i).is_colon (); |
|
|
595 } |
|
|
596 |
|
|
597 int resize_ok = 1; |
|
|
598 |
|
|
599 Array<int> frozen_len; |
|
|
600 |
|
|
601 if (n_idx == lhs_dims.length ()) |
|
|
602 frozen_len = freeze (idx, lhs_dims, resize_ok); |
|
|
603 |
|
|
604 bool rhs_is_scalar = is_scalar (rhs_dims); |
|
|
605 |
|
|
606 bool idx_is_empty = any_zero_len (frozen_len); |
|
|
607 |
|
|
608 if (rhs_is_empty) |
|
|
609 { |
|
|
610 lhs.maybe_delete_elements (idx, rfv); |
|
|
611 } |
|
|
612 else if (rhs_is_scalar) |
|
|
613 { |
|
|
614 if (n_idx == 0) |
|
|
615 (*current_liboctave_error_handler) |
|
|
616 ("number of indices is zero."); |
|
|
617 |
|
|
618 else if (n_idx < lhs_dims.length ()) |
|
|
619 { |
|
|
620 // Number of indices is less than dimensions. |
|
|
621 |
|
|
622 if (any_ones (idx_is_colon)|| any_ones (idx_is_colon_equiv)) |
|
|
623 { |
|
|
624 (*current_liboctave_error_handler) |
|
|
625 ("number of indices is less than number of dimensions, one or more indices are colons."); |
|
|
626 } |
|
|
627 else |
|
|
628 { |
|
|
629 // Fewer indices than dimensions, no colons. |
|
|
630 |
|
|
631 bool resize = false; |
|
|
632 |
|
|
633 // Subtract one since the last idx do not tell us |
|
|
634 // anything about dimensionality. |
|
|
635 |
|
|
636 for (int i = 0; i < idx.length () - 1; i++) |
|
|
637 { |
|
|
638 // Subtract one since idx counts from 0 while dims |
|
|
639 // count from 1. |
|
|
640 |
|
|
641 if (idx(i).elem (0) + 1 > lhs_dims(i)) |
|
|
642 resize = true; |
|
|
643 } |
|
|
644 |
|
|
645 if (resize) |
|
|
646 { |
|
|
647 Array<int> new_dims (lhs_dims.length ()); |
|
|
648 |
|
|
649 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
650 { |
|
|
651 if (i < idx.length () - 1 |
|
|
652 && idx(i).elem (0) + 1 > lhs_dims(i)) |
|
|
653 new_dims(i) = idx(i).elem (0)+1; |
|
|
654 else |
|
|
655 new_dims(i) = lhs_dims(i); |
|
|
656 } |
|
|
657 |
|
|
658 lhs.resize (new_dims, rfv); |
|
|
659 |
|
|
660 lhs_dims = lhs.dims (); |
|
|
661 } |
|
|
662 |
|
|
663 Array<int> one_arg_temp (1, 0); |
|
|
664 |
|
|
665 RT scalar = rhs.elem (one_arg_temp); |
|
|
666 |
|
|
667 Array<int> int_arr = conv_to_int_array (idx); |
|
|
668 |
|
|
669 int numelem = get_scalar_idx (int_arr, lhs_dims); |
|
|
670 |
|
|
671 if (numelem > lhs.length () || numelem < 0) |
|
|
672 (*current_liboctave_error_handler) |
|
|
673 ("attempt to grow array along ambiguous dimension."); |
|
|
674 else |
|
|
675 lhs.Array<LT>::checkelem (numelem) = scalar; |
|
|
676 } |
|
|
677 } |
|
|
678 else |
|
|
679 { |
|
|
680 // Scalar to matrix assignment with as many indices as lhs |
|
|
681 // dimensions. |
|
|
682 |
|
|
683 int n = ArrayN<LT>::get_size (frozen_len); |
|
|
684 |
|
|
685 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
686 |
|
|
687 Array<int> elt_idx; |
|
|
688 |
|
|
689 Array<int> one_arg_temp(1,0); |
|
|
690 RT scalar = rhs.elem (one_arg_temp); |
|
|
691 |
|
|
692 for (int i = 0; i < n; i++) |
|
|
693 { |
|
|
694 elt_idx = get_elt_idx (idx, result_idx); |
|
|
695 |
|
|
696 Array<int> lhs_inc(lhs_dims.length()); |
|
|
697 |
|
|
698 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
699 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
700 |
|
|
701 if (index_in_bounds(elt_idx, lhs_inc)) |
|
|
702 lhs.checkelem (elt_idx) = scalar; |
|
|
703 else |
|
|
704 lhs.checkelem (elt_idx) = rfv; |
|
|
705 |
|
|
706 increment_index (result_idx, frozen_len); |
|
|
707 } |
|
|
708 } |
|
|
709 } |
|
|
710 else if (rhs_dims.length () >= 2) |
|
|
711 { |
|
|
712 // RHS is matrix or higher dimension. |
|
|
713 |
|
|
714 // Subtracting number of dimensions of length 1 will catch |
|
|
715 // cases where: A(2,1,2)=3 A(:,1,:)=[2,3;4,5] |
|
|
716 |
|
|
717 if (rhs_dims.length () != num_ones(idx_is_colon_equiv) - num_ones(lhs_dims)) |
|
|
718 { |
|
|
719 (*current_liboctave_error_handler) |
|
|
720 ("dimensions do not match in matrix assignment."); |
|
|
721 } |
|
|
722 else |
|
|
723 { |
|
|
724 bool dim_ok(true); |
|
|
725 |
|
|
726 int jj = 0; |
|
|
727 |
|
|
728 // Check that RHS dimensions are the same length as the |
|
|
729 // corresponding LHS dimensions. |
|
|
730 |
|
|
731 for (int j = 0; j < idx_is_colon.length (); j++) |
|
|
732 { |
|
|
733 if (idx_is_colon(j) || idx_is_colon_equiv(j)) |
|
|
734 { |
|
|
735 if (rhs_dims(jj) < lhs_dims(j)) |
|
|
736 { |
|
|
737 dim_ok = false; |
|
|
738 |
|
|
739 break; |
|
|
740 } |
|
|
741 |
|
|
742 jj++; |
|
|
743 } |
|
|
744 } |
|
|
745 |
|
|
746 if (! dim_ok) |
|
|
747 (*current_liboctave_error_handler) |
|
|
748 ("subscripted assignment dimension mismatch."); |
|
|
749 else |
|
|
750 { |
|
|
751 Array<int> new_dims (n_idx); |
|
|
752 |
|
|
753 bool resize = false; |
|
|
754 |
|
|
755 int ii = 0; |
|
|
756 |
|
|
757 // Update idx vectors. |
|
|
758 |
|
|
759 for (int i = 0; i < n_idx; i++) |
|
|
760 { |
|
|
761 if (idx(i).is_colon ()) |
|
|
762 { |
|
|
763 // Add appropriate idx_vector to idx(i) since |
|
|
764 // index with : contains no indexes. |
|
|
765 |
|
|
766 frozen_len(i) = lhs_dims(i) > rhs_dims(ii) ? lhs_dims(i) : rhs_dims(ii); |
|
|
767 |
|
|
768 new_dims(i) = lhs_dims(i) > rhs_dims(ii) ? lhs_dims(i) : rhs_dims(ii); |
|
|
769 |
|
|
770 ii++; |
|
|
771 |
|
|
772 Range idxrange (1, frozen_len(i), 1); |
|
|
773 |
|
|
774 idx_vector idxv (idxrange); |
|
|
775 |
|
|
776 idx(i) = idxv; |
|
|
777 } |
|
|
778 else |
|
|
779 { |
|
|
780 new_dims(i) = lhs_dims(i) > idx(i).max () + 1 ? lhs_dims(i) : idx(i).max () + 1; |
|
|
781 |
|
|
782 if (frozen_len(i) > 1) |
|
|
783 ii++; |
|
|
784 } |
|
|
785 if (new_dims(i) != lhs_dims(i)) |
|
|
786 resize = true; |
|
|
787 } |
|
|
788 |
|
|
789 // Resize LHS if dimensions have changed. |
|
|
790 |
|
|
791 if (resize) |
|
|
792 { |
|
|
793 lhs.resize (new_dims, rfv); |
|
|
794 |
|
|
795 lhs_dims = lhs.dims (); |
|
|
796 } |
|
|
797 |
|
|
798 // Number of elements which need to be set. |
|
|
799 |
|
|
800 int n = ArrayN<LT>::get_size (frozen_len); |
|
|
801 |
|
|
802 Array<int> result_idx (lhs_dims.length (), 0); |
|
|
803 Array<int> elt_idx; |
|
|
804 |
|
|
805 Array<int> result_rhs_idx (rhs_dims.length (), 0); |
|
|
806 Array<int> frozen_rhs (rhs_dims.length(), 0); |
|
|
807 |
|
|
808 for (int i = 0; i < rhs_dims.length (); i++) |
|
|
809 frozen_rhs(i) = rhs_dims(i); |
|
|
810 |
|
|
811 Array<int> lhs_inc (lhs_dims.length ()); |
|
|
812 |
|
|
813 for (int i = 0; i < lhs_dims.length (); i++) |
|
|
814 lhs_inc(i) = lhs_dims(i) + 1; |
|
|
815 |
|
|
816 for (int i = 0; i < n; i++) |
|
|
817 { |
|
|
818 elt_idx = get_elt_idx (idx, result_idx); |
|
|
819 |
|
|
820 if (index_in_bounds (elt_idx, lhs_inc)) |
|
|
821 { |
|
|
822 int s = compute_index (result_rhs_idx,rhs_dims); |
|
|
823 |
|
|
824 lhs.checkelem (elt_idx) = rhs.Array<RT>::elem (s); |
|
|
825 |
|
|
826 increment_index (result_rhs_idx, frozen_rhs); |
|
|
827 } |
|
|
828 else |
|
|
829 lhs.checkelem (elt_idx) = rfv; |
|
|
830 |
|
|
831 increment_index (result_idx, frozen_len); |
|
|
832 } |
|
|
833 } |
|
|
834 } |
|
|
835 } |
|
|
836 else if (idx_is_empty) |
|
|
837 { |
|
|
838 // Assignment to matrix with at least one empty index. |
|
|
839 |
|
|
840 if (! rhs_is_empty || ! rhs_is_scalar) |
|
|
841 { |
|
|
842 (*current_liboctave_error_handler) |
|
|
843 ("A([], []) = X: X must be an empty matrix or a scalar"); |
|
|
844 |
|
|
845 retval = 0; |
|
|
846 } |
|
|
847 } |
|
|
848 else if (lhs_dims.length () != rhs_dims.length ()) |
|
|
849 { |
|
|
850 (*current_liboctave_error_handler) |
|
|
851 ("A(I) = X: X must be a scalar or a matrix with the same size as I"); |
|
|
852 retval = 0; |
|
|
853 } |
|
|
854 |
|
|
855 return retval; |
|
3665
|
856 } |
|
|
857 |
|
4493
|
858 static inline int |
|
|
859 get_scalar_idx (Array<int>& idx, Array<int>& dims) |
|
|
860 { |
|
|
861 int retval (-1); |
|
|
862 |
|
|
863 int n = idx.length (); |
|
|
864 |
|
|
865 if (n > 0) |
|
|
866 { |
|
|
867 retval = idx(--n); |
|
|
868 |
|
|
869 while (--n >= 0) |
|
|
870 { |
|
|
871 retval *= dims (n); |
|
|
872 |
|
|
873 retval += idx(n); |
|
|
874 } |
|
|
875 } |
|
|
876 return retval; |
|
|
877 } |
|
|
878 |
|
|
879 static inline int |
|
|
880 num_ones (const Array<int> ra_idx) |
|
|
881 { |
|
|
882 int retval (0); |
|
|
883 for (int i = 0; i < ra_idx.length (); i++) |
|
|
884 { |
|
|
885 if (ra_idx (i) == 1) |
|
|
886 retval++; |
|
|
887 } |
|
|
888 return retval; |
|
|
889 } |
|
|
890 |
|
|
891 static inline bool |
|
|
892 is_scalar (const Array<int>& dim) |
|
|
893 { |
|
|
894 bool retval = true; |
|
|
895 |
|
|
896 int n = dim.length (); |
|
|
897 |
|
|
898 if (n == 0) |
|
|
899 { |
|
|
900 retval = false; |
|
|
901 } |
|
|
902 else |
|
|
903 { |
|
|
904 for (int i = 0; i < n; i ++) |
|
|
905 { |
|
|
906 if (dim (i) != 1) |
|
|
907 { |
|
|
908 retval = false; |
|
|
909 |
|
|
910 break; |
|
|
911 } |
|
|
912 } |
|
|
913 } |
|
|
914 return retval; |
|
|
915 } |
|
|
916 |
|
|
917 static inline bool |
|
|
918 any_ones (const Array<int> arr) |
|
|
919 { |
|
|
920 bool retval = false; |
|
|
921 |
|
|
922 for (int i = 0; i < arr.length (); i++) |
|
|
923 { |
|
|
924 if (arr (i) == 1) |
|
|
925 { |
|
|
926 retval = true; |
|
|
927 |
|
|
928 break; |
|
|
929 } |
|
|
930 } |
|
|
931 return retval; |
|
|
932 } |
|
|
933 |
|
|
934 static inline int |
|
|
935 compute_index (const Array<int>& ra_idx, const Array<int>& dims) |
|
|
936 { |
|
|
937 int retval = -1; |
|
|
938 |
|
|
939 int n = dims.length (); |
|
|
940 |
|
|
941 if (n > 0 && n == ra_idx.length ()) |
|
|
942 { |
|
|
943 retval = ra_idx(--n); |
|
|
944 |
|
|
945 while (--n >= 0) |
|
|
946 { |
|
|
947 retval *= dims(n); |
|
|
948 |
|
|
949 retval += ra_idx(n); |
|
|
950 } |
|
|
951 } |
|
|
952 else |
|
|
953 (*current_liboctave_error_handler) |
|
|
954 ("ArrayN<T>::compute_index: invalid ra_idxing operation"); |
|
|
955 |
|
|
956 return retval; |
|
|
957 } |
|
|
958 |
|
|
959 static inline Array<int> |
|
|
960 conv_to_int_array (const Array<idx_vector>& a) |
|
|
961 { |
|
|
962 Array<int> retval (a.length ()); |
|
|
963 |
|
|
964 for (int i = 0; i < a.length (); i++) |
|
|
965 retval (i) = a(i).elem (0); |
|
|
966 |
|
|
967 return retval; |
|
|
968 } |
|
|
969 |
|
|
970 static inline Array<idx_vector> |
|
|
971 conv_to_array (const idx_vector *tmp, const int len) |
|
|
972 { |
|
|
973 Array<idx_vector> retval (len); |
|
|
974 |
|
|
975 for (int i = 0; i < len; i++) |
|
|
976 retval (i) = tmp[i]; |
|
|
977 |
|
|
978 return retval; |
|
|
979 } |
|
3665
|
980 /* |
|
|
981 ;;; Local Variables: *** |
|
|
982 ;;; mode: C++ *** |
|
|
983 ;;; End: *** |
|
|
984 */ |
