|
4588
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2003 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #ifdef HAVE_CONFIG_H |
|
|
24 #include <config.h> |
|
|
25 #endif |
|
|
26 |
|
|
27 #include "Array-util.h" |
|
|
28 |
|
|
29 bool |
|
|
30 index_in_bounds (const Array<int>& ra_idx, const dim_vector& dimensions) |
|
|
31 { |
|
|
32 bool retval = true; |
|
|
33 |
|
|
34 int n = ra_idx.length (); |
|
|
35 |
|
|
36 if (n == dimensions.length ()) |
|
|
37 { |
|
|
38 for (int i = 0; i < n; i++) |
|
|
39 { |
|
|
40 if (ra_idx(i) < 0 || ra_idx(i) > dimensions (i)) |
|
|
41 { |
|
|
42 retval = false; |
|
|
43 break; |
|
|
44 } |
|
|
45 } |
|
|
46 } |
|
|
47 else |
|
|
48 retval = false; |
|
|
49 |
|
|
50 return retval; |
|
|
51 } |
|
|
52 |
|
|
53 void |
|
|
54 increment_index (Array<int>& ra_idx, const dim_vector& dimensions, |
|
|
55 int start_dimension) |
|
|
56 { |
|
|
57 ra_idx(start_dimension)++; |
|
|
58 |
|
|
59 int n = ra_idx.length () - 1; |
|
|
60 |
|
|
61 for (int i = start_dimension; i < n; i++) |
|
|
62 { |
|
|
63 if (ra_idx(i) < dimensions(i)) |
|
|
64 break; |
|
|
65 else |
|
|
66 { |
|
|
67 ra_idx(i) = 0; |
|
|
68 ra_idx(i+1)++; |
|
|
69 } |
|
|
70 } |
|
|
71 } |
|
|
72 |
|
|
73 int |
|
|
74 get_scalar_idx (Array<int>& idx, dim_vector& dims) |
|
|
75 { |
|
|
76 int retval (-1); |
|
|
77 |
|
|
78 int n = idx.length (); |
|
|
79 |
|
|
80 if (n > 0) |
|
|
81 { |
|
|
82 retval = idx(--n); |
|
|
83 |
|
|
84 while (--n >= 0) |
|
|
85 { |
|
|
86 retval *= dims (n); |
|
|
87 |
|
|
88 retval += idx(n); |
|
|
89 } |
|
|
90 } |
|
|
91 return retval; |
|
|
92 } |
|
|
93 |
|
|
94 int |
|
|
95 num_ones (const Array<int>& ra_idx) |
|
|
96 { |
|
4635
|
97 int retval = 0; |
|
|
98 |
|
4588
|
99 for (int i = 0; i < ra_idx.length (); i++) |
|
|
100 { |
|
|
101 if (ra_idx (i) == 1) |
|
|
102 retval++; |
|
|
103 } |
|
4635
|
104 |
|
4588
|
105 return retval; |
|
|
106 } |
|
|
107 |
|
|
108 bool |
|
|
109 is_scalar (const dim_vector& dim) |
|
|
110 { |
|
|
111 bool retval = true; |
|
|
112 |
|
|
113 int n = dim.length (); |
|
|
114 |
|
|
115 if (n == 0) |
|
|
116 { |
|
|
117 retval = false; |
|
|
118 } |
|
|
119 else |
|
|
120 { |
|
|
121 for (int i = 0; i < n; i ++) |
|
|
122 { |
|
|
123 if (dim (i) != 1) |
|
|
124 { |
|
|
125 retval = false; |
|
|
126 |
|
|
127 break; |
|
|
128 } |
|
|
129 } |
|
|
130 } |
|
|
131 return retval; |
|
|
132 } |
|
|
133 |
|
|
134 bool |
|
|
135 any_ones (const Array<int>& arr) |
|
|
136 { |
|
|
137 bool retval = false; |
|
|
138 |
|
|
139 for (int i = 0; i < arr.length (); i++) |
|
|
140 { |
|
|
141 if (arr (i) == 1) |
|
|
142 { |
|
|
143 retval = true; |
|
|
144 |
|
|
145 break; |
|
|
146 } |
|
|
147 } |
|
|
148 return retval; |
|
|
149 } |
|
|
150 |
|
|
151 int |
|
|
152 compute_index (const Array<int>& ra_idx, const dim_vector& dims) |
|
|
153 { |
|
|
154 int retval = -1; |
|
|
155 |
|
|
156 int n = dims.length (); |
|
|
157 |
|
|
158 if (n > 0 && n == ra_idx.length ()) |
|
|
159 { |
|
|
160 retval = ra_idx(--n); |
|
|
161 |
|
|
162 while (--n >= 0) |
|
|
163 { |
|
|
164 retval *= dims(n); |
|
|
165 |
|
|
166 retval += ra_idx(n); |
|
|
167 } |
|
|
168 } |
|
|
169 else |
|
|
170 (*current_liboctave_error_handler) |
|
|
171 ("ArrayN<T>::compute_index: invalid ra_idxing operation"); |
|
|
172 |
|
|
173 return retval; |
|
|
174 } |
|
|
175 |
|
|
176 Array<int> |
|
|
177 conv_to_int_array (const Array<idx_vector>& a) |
|
|
178 { |
|
|
179 Array<int> retval (a.length ()); |
|
|
180 |
|
|
181 for (int i = 0; i < a.length (); i++) |
|
|
182 retval (i) = a(i).elem (0); |
|
|
183 |
|
|
184 return retval; |
|
|
185 } |
|
|
186 |
|
|
187 Array<idx_vector> |
|
|
188 conv_to_array (const idx_vector *tmp, const int len) |
|
|
189 { |
|
|
190 Array<idx_vector> retval (len); |
|
|
191 |
|
|
192 for (int i = 0; i < len; i++) |
|
|
193 retval (i) = tmp[i]; |
|
|
194 |
|
|
195 return retval; |
|
|
196 } |
|
|
197 |
|
|
198 dim_vector |
|
|
199 freeze (Array<idx_vector>& ra_idx, const dim_vector& dimensions, int resize_ok) |
|
|
200 { |
|
|
201 dim_vector retval; |
|
|
202 |
|
|
203 int n = ra_idx.length (); |
|
|
204 |
|
|
205 assert (n == dimensions.length ()); |
|
|
206 |
|
|
207 retval.resize (n); |
|
|
208 |
|
|
209 for (int i = 0; i < n; i++) |
|
|
210 retval(i) = ra_idx(i).freeze (dimensions(i), "XXX FIXME XXX", resize_ok); |
|
|
211 |
|
|
212 return retval; |
|
|
213 } |
|
|
214 |
|
|
215 bool |
|
|
216 vector_equivalent (const Array<int>& ra_idx) |
|
|
217 { |
|
|
218 int n = ra_idx.length (); |
|
|
219 |
|
|
220 bool found_first = false; |
|
|
221 |
|
|
222 for (int i = 0; i < n; i++) |
|
|
223 { |
|
|
224 if (ra_idx(i) != 1) |
|
|
225 { |
|
|
226 if (! found_first) |
|
|
227 found_first = true; |
|
|
228 else |
|
|
229 return false; |
|
|
230 } |
|
|
231 } |
|
|
232 |
|
|
233 return true; |
|
|
234 } |
|
|
235 |
|
|
236 bool |
|
|
237 equal_arrays (const dim_vector& a, const dim_vector& b) |
|
|
238 { |
|
|
239 bool retval = true; |
|
|
240 |
|
|
241 if (a.length () != b.length ()) |
|
|
242 retval = false; |
|
|
243 else |
|
|
244 { |
|
|
245 for (int i = 0; i < a.length (); i++) |
|
|
246 { |
|
|
247 if (a(i) != b(i)) |
|
|
248 retval = false; |
|
|
249 } |
|
|
250 } |
|
|
251 |
|
|
252 return retval; |
|
|
253 } |
|
|
254 |
|
|
255 bool |
|
|
256 all_ok (const Array<idx_vector>& ra_idx) |
|
|
257 { |
|
|
258 bool retval = true; |
|
|
259 |
|
|
260 int n = ra_idx.length (); |
|
|
261 |
|
|
262 for (int i = 0; i < n; i++) |
|
|
263 { |
|
|
264 if (! ra_idx(i)) |
|
|
265 { |
|
|
266 retval = false; |
|
|
267 break; |
|
|
268 } |
|
|
269 } |
|
|
270 |
|
|
271 return retval; |
|
|
272 } |
|
|
273 |
|
|
274 bool |
|
|
275 any_orig_empty (const Array<idx_vector>& ra_idx) |
|
|
276 { |
|
|
277 bool retval = false; |
|
|
278 |
|
|
279 int n = ra_idx.length (); |
|
|
280 |
|
|
281 for (int i = 0; i < n; i++) |
|
|
282 { |
|
|
283 if (ra_idx(i).orig_empty ()) |
|
|
284 { |
|
|
285 retval = true; |
|
|
286 break; |
|
|
287 } |
|
|
288 } |
|
|
289 |
|
|
290 return retval; |
|
|
291 } |
|
|
292 |
|
|
293 bool |
|
|
294 any_zero_len (const dim_vector& frozen_lengths) |
|
|
295 { |
|
|
296 bool retval = false; |
|
|
297 |
|
|
298 int n = frozen_lengths.length (); |
|
|
299 |
|
|
300 for (int i = 0; i < n; i++) |
|
|
301 { |
|
|
302 if (frozen_lengths(i) == 0) |
|
|
303 { |
|
|
304 retval = true; |
|
|
305 break; |
|
|
306 } |
|
|
307 } |
|
|
308 |
|
|
309 return retval; |
|
|
310 } |
|
|
311 |
|
|
312 dim_vector |
|
4663
|
313 get_zero_len_size (const dim_vector& /* frozen_lengths */, |
|
|
314 const dim_vector& /* dimensions */) |
|
4588
|
315 { |
|
|
316 dim_vector retval; |
|
|
317 assert (0); |
|
|
318 return retval; |
|
|
319 } |
|
|
320 |
|
|
321 bool |
|
|
322 all_colon_equiv (const Array<idx_vector>& ra_idx, |
|
|
323 const dim_vector& frozen_lengths) |
|
|
324 { |
|
|
325 bool retval = true; |
|
|
326 |
|
|
327 int idx_n = ra_idx.length (); |
|
|
328 |
|
|
329 int n = frozen_lengths.length (); |
|
|
330 |
|
|
331 assert (idx_n == n); |
|
|
332 |
|
|
333 for (int i = 0; i < n; i++) |
|
|
334 { |
|
|
335 if (! ra_idx(i).is_colon_equiv (frozen_lengths(i))) |
|
|
336 { |
|
|
337 retval = false; |
|
|
338 break; |
|
|
339 } |
|
|
340 } |
|
|
341 |
|
|
342 return retval; |
|
|
343 } |
|
|
344 |
|
|
345 bool |
|
|
346 is_in (int num, const idx_vector& idx) |
|
|
347 { |
|
|
348 int n = idx.capacity (); |
|
|
349 |
|
|
350 for (int i = 0; i < n; i++) |
|
|
351 if (idx.elem (i) == num) |
|
|
352 return true; |
|
|
353 |
|
|
354 return false; |
|
|
355 } |
|
|
356 |
|
|
357 int |
|
|
358 how_many_lgt (const int num, idx_vector& idxv) |
|
|
359 { |
|
|
360 int retval = 0; |
|
|
361 |
|
|
362 int n = idxv.capacity (); |
|
|
363 |
|
|
364 for (int i = 0; i < n; i++) |
|
|
365 { |
|
|
366 if (num > idxv.elem (i)) |
|
|
367 retval++; |
|
|
368 } |
|
|
369 |
|
|
370 return retval; |
|
|
371 } |
|
|
372 |
|
|
373 bool |
|
|
374 all_ones (const Array<int>& arr) |
|
|
375 { |
|
|
376 bool retval = true; |
|
|
377 |
|
|
378 for (int i = 0; i < arr.length (); i++) |
|
|
379 { |
|
|
380 if (arr(i) != 1) |
|
|
381 { |
|
|
382 retval = false; |
|
|
383 break; |
|
|
384 } |
|
|
385 } |
|
|
386 |
|
|
387 return retval; |
|
|
388 } |
|
|
389 |
|
|
390 Array<int> |
|
|
391 get_elt_idx (const Array<idx_vector>& ra_idx, const Array<int>& result_idx) |
|
|
392 { |
|
|
393 int n = ra_idx.length (); |
|
|
394 |
|
|
395 Array<int> retval (n); |
|
|
396 |
|
|
397 for (int i = 0; i < n; i++) |
|
|
398 retval(i) = ra_idx(i).elem (result_idx(i)); |
|
|
399 |
|
|
400 return retval; |
|
|
401 } |
|
|
402 |
|
|
403 int |
|
|
404 number_of_elements (const dim_vector ra_idx) |
|
|
405 { |
|
|
406 int retval = 1; |
|
|
407 |
|
|
408 int n = ra_idx.length (); |
|
|
409 |
|
|
410 if (n == 0) |
|
|
411 retval = 0; |
|
|
412 |
|
|
413 for (int i = 0; i < n; i++) |
|
|
414 retval *= ra_idx(i); |
|
|
415 |
|
|
416 return retval; |
|
|
417 } |
|
|
418 |
|
|
419 Array<int> |
|
|
420 get_ra_idx (int idx, const dim_vector& dims) |
|
|
421 { |
|
|
422 Array<int> retval; |
|
|
423 |
|
|
424 int n_dims = dims.length (); |
|
|
425 |
|
|
426 retval.resize (n_dims); |
|
|
427 |
|
|
428 for (int i = 0; i < n_dims; i++) |
|
|
429 retval(i) = 0; |
|
|
430 |
|
|
431 assert (idx > 0 || idx < number_of_elements (dims)); |
|
|
432 |
|
|
433 for (int i = 0; i < idx; i++) |
|
|
434 increment_index (retval, dims); |
|
|
435 |
|
|
436 // XXX FIXME XXX -- the solution using increment_index is not |
|
|
437 // efficient. |
|
|
438 |
|
|
439 #if 0 |
|
|
440 int var = 1; |
|
|
441 for (int i = 0; i < n_dims; i++) |
|
|
442 { |
|
|
443 std::cout << "idx: " << idx << ", var: " << var << ", dims(" << i << "): " << dims(i) <<"\n"; |
|
|
444 retval(i) = ((int)floor(((idx) / (double)var))) % dims(i); |
|
|
445 idx -= var * retval(i); |
|
|
446 var = dims(i); |
|
|
447 } |
|
|
448 #endif |
|
|
449 |
|
|
450 return retval; |
|
|
451 } |
|
|
452 |
|
|
453 dim_vector |
|
|
454 short_freeze (Array<idx_vector>& ra_idx, const dim_vector& dimensions, |
|
|
455 int resize_ok) |
|
|
456 { |
|
|
457 dim_vector retval; |
|
|
458 |
|
|
459 int n = ra_idx.length (); |
|
|
460 |
|
|
461 int n_dims = dimensions.length (); |
|
|
462 |
|
|
463 if (n == n_dims) |
|
|
464 { |
|
|
465 retval = freeze (ra_idx, dimensions, resize_ok); |
|
|
466 } |
|
|
467 else if (n < n_dims) |
|
|
468 { |
|
|
469 retval.resize (n); |
|
|
470 |
|
|
471 for (int i = 0; i < n - 1; i++) |
|
|
472 retval(i) = ra_idx(i).freeze (dimensions(i), "dimension", resize_ok); |
|
|
473 |
|
|
474 int size_left = 1; |
|
|
475 |
|
|
476 for (int i = n - 1; i < n_dims; i++) |
|
|
477 size_left *= dimensions(i); |
|
|
478 |
|
|
479 if (ra_idx(n-1).is_colon()) |
|
|
480 { |
|
|
481 retval(n-1) = size_left; |
|
|
482 } |
|
|
483 else |
|
|
484 { |
|
|
485 int last_ra_idx = ra_idx(n-1)(0); |
|
|
486 |
|
|
487 if (last_ra_idx < dimensions(n - 1)) |
|
|
488 { |
|
|
489 retval(n - 1) = ra_idx(n - 1).freeze (dimensions(n-1), |
|
|
490 "dimension", resize_ok); |
|
|
491 } |
|
|
492 else |
|
|
493 { |
|
|
494 if (size_left <= last_ra_idx) |
|
|
495 { |
|
|
496 // Make it larger than it should be to get an error |
|
|
497 // later. |
|
|
498 |
|
|
499 retval.resize(n_dims + 1); |
|
|
500 |
|
|
501 (*current_liboctave_error_handler) |
|
|
502 ("index exceeds N-d array dimensions"); |
|
|
503 } |
|
|
504 else |
|
|
505 { |
|
|
506 retval(n-1) = 1; |
|
|
507 } |
|
|
508 } |
|
|
509 } |
|
|
510 } |
|
|
511 |
|
|
512 return retval; |
|
|
513 } |
|
|
514 |
|
4593
|
515 Array<int> |
|
|
516 calc_permutated_idx (const Array<int>& old_idx, |
|
|
517 const Array<int>& perm_vec, bool inv) |
|
|
518 { |
|
|
519 int n_el = old_idx.length (); |
|
|
520 |
|
|
521 Array<int> retval (n_el); |
|
|
522 |
|
|
523 for (int i = 0; i < n_el; i++) |
|
|
524 { |
|
|
525 if (inv) |
|
|
526 retval(perm_vec(i)-1) = old_idx(i); |
|
|
527 else |
|
|
528 retval(i) = old_idx(perm_vec(i)-1); |
|
|
529 } |
|
|
530 |
|
|
531 return retval; |
|
|
532 } |
|
|
533 |
|
4588
|
534 /* |
|
|
535 ;;; Local Variables: *** |
|
|
536 ;;; mode: C++ *** |
|
|
537 ;;; End: *** |
|
|
538 */ |
