|
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 |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
4588
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
|
28 #include "Array-util.h" |
|
4669
|
29 #include "dim-vector.h" |
|
|
30 #include "lo-error.h" |
|
4588
|
31 |
|
|
32 bool |
|
5275
|
33 index_in_bounds (const Array<octave_idx_type>& ra_idx, const dim_vector& dimensions) |
|
4588
|
34 { |
|
|
35 bool retval = true; |
|
|
36 |
|
|
37 int n = ra_idx.length (); |
|
|
38 |
|
|
39 if (n == dimensions.length ()) |
|
|
40 { |
|
|
41 for (int i = 0; i < n; i++) |
|
|
42 { |
|
4747
|
43 if (ra_idx(i) < 0 || ra_idx(i) >= dimensions(i)) |
|
4588
|
44 { |
|
|
45 retval = false; |
|
|
46 break; |
|
|
47 } |
|
|
48 } |
|
|
49 } |
|
|
50 else |
|
|
51 retval = false; |
|
|
52 |
|
|
53 return retval; |
|
|
54 } |
|
|
55 |
|
|
56 void |
|
5275
|
57 increment_index (Array<octave_idx_type>& ra_idx, const dim_vector& dimensions, |
|
4588
|
58 int start_dimension) |
|
|
59 { |
|
|
60 ra_idx(start_dimension)++; |
|
|
61 |
|
|
62 int n = ra_idx.length () - 1; |
|
6868
|
63 int nda = dimensions.length (); |
|
4588
|
64 |
|
|
65 for (int i = start_dimension; i < n; i++) |
|
|
66 { |
|
6868
|
67 if (ra_idx(i) < (i < nda ? dimensions(i) : 1)) |
|
4588
|
68 break; |
|
|
69 else |
|
|
70 { |
|
|
71 ra_idx(i) = 0; |
|
|
72 ra_idx(i+1)++; |
|
|
73 } |
|
|
74 } |
|
|
75 } |
|
|
76 |
|
5275
|
77 octave_idx_type |
|
|
78 get_scalar_idx (Array<octave_idx_type>& idx, dim_vector& dims) |
|
4588
|
79 { |
|
5275
|
80 octave_idx_type retval (-1); |
|
4588
|
81 |
|
|
82 int n = idx.length (); |
|
|
83 |
|
|
84 if (n > 0) |
|
|
85 { |
|
|
86 retval = idx(--n); |
|
|
87 |
|
|
88 while (--n >= 0) |
|
|
89 { |
|
|
90 retval *= dims (n); |
|
|
91 |
|
|
92 retval += idx(n); |
|
|
93 } |
|
|
94 } |
|
|
95 return retval; |
|
|
96 } |
|
|
97 |
|
5275
|
98 octave_idx_type |
|
|
99 num_ones (const Array<octave_idx_type>& ra_idx) |
|
4588
|
100 { |
|
5275
|
101 octave_idx_type retval = 0; |
|
4635
|
102 |
|
5275
|
103 for (octave_idx_type i = 0; i < ra_idx.length (); i++) |
|
4588
|
104 { |
|
|
105 if (ra_idx (i) == 1) |
|
|
106 retval++; |
|
|
107 } |
|
4635
|
108 |
|
4588
|
109 return retval; |
|
|
110 } |
|
|
111 |
|
|
112 bool |
|
|
113 is_scalar (const dim_vector& dim) |
|
|
114 { |
|
|
115 bool retval = true; |
|
|
116 |
|
|
117 int n = dim.length (); |
|
|
118 |
|
|
119 if (n == 0) |
|
|
120 { |
|
|
121 retval = false; |
|
|
122 } |
|
|
123 else |
|
|
124 { |
|
|
125 for (int i = 0; i < n; i ++) |
|
|
126 { |
|
|
127 if (dim (i) != 1) |
|
|
128 { |
|
|
129 retval = false; |
|
|
130 |
|
|
131 break; |
|
|
132 } |
|
|
133 } |
|
|
134 } |
|
|
135 return retval; |
|
|
136 } |
|
|
137 |
|
|
138 bool |
|
5275
|
139 any_ones (const Array<octave_idx_type>& arr) |
|
4588
|
140 { |
|
|
141 bool retval = false; |
|
|
142 |
|
5275
|
143 for (octave_idx_type i = 0; i < arr.length (); i++) |
|
4588
|
144 { |
|
|
145 if (arr (i) == 1) |
|
|
146 { |
|
|
147 retval = true; |
|
|
148 |
|
|
149 break; |
|
|
150 } |
|
|
151 } |
|
|
152 return retval; |
|
|
153 } |
|
|
154 |
|
5275
|
155 octave_idx_type |
|
|
156 compute_index (const Array<octave_idx_type>& ra_idx, const dim_vector& dims) |
|
4588
|
157 { |
|
5275
|
158 octave_idx_type retval = -1; |
|
4588
|
159 |
|
|
160 int n = dims.length (); |
|
|
161 |
|
|
162 if (n > 0 && n == ra_idx.length ()) |
|
|
163 { |
|
|
164 retval = ra_idx(--n); |
|
|
165 |
|
|
166 while (--n >= 0) |
|
|
167 { |
|
|
168 retval *= dims(n); |
|
|
169 |
|
|
170 retval += ra_idx(n); |
|
|
171 } |
|
|
172 } |
|
|
173 else |
|
|
174 (*current_liboctave_error_handler) |
|
|
175 ("ArrayN<T>::compute_index: invalid ra_idxing operation"); |
|
|
176 |
|
|
177 return retval; |
|
|
178 } |
|
|
179 |
|
5275
|
180 Array<octave_idx_type> |
|
4588
|
181 conv_to_int_array (const Array<idx_vector>& a) |
|
|
182 { |
|
5275
|
183 Array<octave_idx_type> retval (a.length ()); |
|
4588
|
184 |
|
5275
|
185 for (octave_idx_type i = 0; i < a.length (); i++) |
|
4588
|
186 retval (i) = a(i).elem (0); |
|
|
187 |
|
|
188 return retval; |
|
|
189 } |
|
|
190 |
|
|
191 Array<idx_vector> |
|
5275
|
192 conv_to_array (const idx_vector *tmp, const octave_idx_type len) |
|
4588
|
193 { |
|
|
194 Array<idx_vector> retval (len); |
|
|
195 |
|
5275
|
196 for (octave_idx_type i = 0; i < len; i++) |
|
4588
|
197 retval (i) = tmp[i]; |
|
|
198 |
|
|
199 return retval; |
|
|
200 } |
|
|
201 |
|
|
202 dim_vector |
|
|
203 freeze (Array<idx_vector>& ra_idx, const dim_vector& dimensions, int resize_ok) |
|
|
204 { |
|
|
205 dim_vector retval; |
|
|
206 |
|
|
207 int n = ra_idx.length (); |
|
|
208 |
|
|
209 assert (n == dimensions.length ()); |
|
|
210 |
|
|
211 retval.resize (n); |
|
|
212 |
|
5136
|
213 static const char *tag[3] = { "row", "column", 0 }; |
|
|
214 |
|
4588
|
215 for (int i = 0; i < n; i++) |
|
5136
|
216 retval(i) = ra_idx(i).freeze (dimensions(i), tag[i < 2 ? i : 3], |
|
|
217 resize_ok); |
|
4588
|
218 |
|
|
219 return retval; |
|
|
220 } |
|
|
221 |
|
|
222 bool |
|
5519
|
223 vector_equivalent (const dim_vector& dv) |
|
4588
|
224 { |
|
5519
|
225 int n = dv.length (); |
|
4588
|
226 |
|
|
227 bool found_first = false; |
|
|
228 |
|
5519
|
229 for (int i = 0; i < n; i++) |
|
4588
|
230 { |
|
5519
|
231 if (dv(i) != 1) |
|
4588
|
232 { |
|
|
233 if (! found_first) |
|
|
234 found_first = true; |
|
|
235 else |
|
|
236 return false; |
|
|
237 } |
|
|
238 } |
|
|
239 |
|
|
240 return true; |
|
|
241 } |
|
|
242 |
|
|
243 bool |
|
|
244 all_ok (const Array<idx_vector>& ra_idx) |
|
|
245 { |
|
|
246 bool retval = true; |
|
|
247 |
|
5275
|
248 octave_idx_type n = ra_idx.length (); |
|
4588
|
249 |
|
5275
|
250 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
251 { |
|
|
252 if (! ra_idx(i)) |
|
|
253 { |
|
|
254 retval = false; |
|
|
255 break; |
|
|
256 } |
|
|
257 } |
|
|
258 |
|
|
259 return retval; |
|
|
260 } |
|
|
261 |
|
|
262 bool |
|
|
263 any_orig_empty (const Array<idx_vector>& ra_idx) |
|
|
264 { |
|
|
265 bool retval = false; |
|
|
266 |
|
5275
|
267 octave_idx_type n = ra_idx.length (); |
|
4588
|
268 |
|
5275
|
269 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
270 { |
|
|
271 if (ra_idx(i).orig_empty ()) |
|
|
272 { |
|
|
273 retval = true; |
|
|
274 break; |
|
|
275 } |
|
|
276 } |
|
|
277 |
|
|
278 return retval; |
|
|
279 } |
|
|
280 |
|
|
281 bool |
|
|
282 all_colon_equiv (const Array<idx_vector>& ra_idx, |
|
|
283 const dim_vector& frozen_lengths) |
|
|
284 { |
|
|
285 bool retval = true; |
|
|
286 |
|
5275
|
287 octave_idx_type idx_n = ra_idx.length (); |
|
4588
|
288 |
|
|
289 int n = frozen_lengths.length (); |
|
|
290 |
|
|
291 assert (idx_n == n); |
|
|
292 |
|
5275
|
293 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
294 { |
|
|
295 if (! ra_idx(i).is_colon_equiv (frozen_lengths(i))) |
|
|
296 { |
|
|
297 retval = false; |
|
|
298 break; |
|
|
299 } |
|
|
300 } |
|
|
301 |
|
|
302 return retval; |
|
|
303 } |
|
|
304 |
|
|
305 bool |
|
5275
|
306 is_in (octave_idx_type num, const idx_vector& idx) |
|
4588
|
307 { |
|
5275
|
308 octave_idx_type n = idx.capacity (); |
|
4588
|
309 |
|
5275
|
310 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
311 if (idx.elem (i) == num) |
|
|
312 return true; |
|
|
313 |
|
|
314 return false; |
|
|
315 } |
|
|
316 |
|
5275
|
317 octave_idx_type |
|
|
318 how_many_lgt (const octave_idx_type num, idx_vector& idxv) |
|
4588
|
319 { |
|
5275
|
320 octave_idx_type retval = 0; |
|
4588
|
321 |
|
5275
|
322 octave_idx_type n = idxv.capacity (); |
|
4588
|
323 |
|
5275
|
324 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
325 { |
|
|
326 if (num > idxv.elem (i)) |
|
|
327 retval++; |
|
|
328 } |
|
|
329 |
|
|
330 return retval; |
|
|
331 } |
|
|
332 |
|
|
333 bool |
|
5275
|
334 all_ones (const Array<octave_idx_type>& arr) |
|
4588
|
335 { |
|
|
336 bool retval = true; |
|
|
337 |
|
5275
|
338 for (octave_idx_type i = 0; i < arr.length (); i++) |
|
4588
|
339 { |
|
|
340 if (arr(i) != 1) |
|
|
341 { |
|
|
342 retval = false; |
|
|
343 break; |
|
|
344 } |
|
|
345 } |
|
|
346 |
|
|
347 return retval; |
|
|
348 } |
|
|
349 |
|
5275
|
350 Array<octave_idx_type> |
|
|
351 get_elt_idx (const Array<idx_vector>& ra_idx, const Array<octave_idx_type>& result_idx) |
|
4588
|
352 { |
|
5275
|
353 octave_idx_type n = ra_idx.length (); |
|
4588
|
354 |
|
5275
|
355 Array<octave_idx_type> retval (n); |
|
4588
|
356 |
|
5275
|
357 for (octave_idx_type i = 0; i < n; i++) |
|
4588
|
358 retval(i) = ra_idx(i).elem (result_idx(i)); |
|
|
359 |
|
|
360 return retval; |
|
|
361 } |
|
|
362 |
|
5275
|
363 Array<octave_idx_type> |
|
|
364 get_ra_idx (octave_idx_type idx, const dim_vector& dims) |
|
4588
|
365 { |
|
5275
|
366 Array<octave_idx_type> retval; |
|
4588
|
367 |
|
|
368 int n_dims = dims.length (); |
|
|
369 |
|
|
370 retval.resize (n_dims); |
|
|
371 |
|
|
372 for (int i = 0; i < n_dims; i++) |
|
|
373 retval(i) = 0; |
|
|
374 |
|
4747
|
375 assert (idx > 0 || idx < dims.numel ()); |
|
4588
|
376 |
|
5275
|
377 for (octave_idx_type i = 0; i < idx; i++) |
|
4588
|
378 increment_index (retval, dims); |
|
|
379 |
|
5775
|
380 // FIXME -- the solution using increment_index is not |
|
4588
|
381 // efficient. |
|
|
382 |
|
|
383 #if 0 |
|
5275
|
384 octave_idx_type var = 1; |
|
4588
|
385 for (int i = 0; i < n_dims; i++) |
|
|
386 { |
|
|
387 std::cout << "idx: " << idx << ", var: " << var << ", dims(" << i << "): " << dims(i) <<"\n"; |
|
|
388 retval(i) = ((int)floor(((idx) / (double)var))) % dims(i); |
|
|
389 idx -= var * retval(i); |
|
|
390 var = dims(i); |
|
|
391 } |
|
|
392 #endif |
|
|
393 |
|
|
394 return retval; |
|
|
395 } |
|
|
396 |
|
|
397 dim_vector |
|
|
398 short_freeze (Array<idx_vector>& ra_idx, const dim_vector& dimensions, |
|
|
399 int resize_ok) |
|
|
400 { |
|
|
401 dim_vector retval; |
|
|
402 |
|
|
403 int n = ra_idx.length (); |
|
|
404 |
|
|
405 int n_dims = dimensions.length (); |
|
|
406 |
|
|
407 if (n == n_dims) |
|
|
408 { |
|
|
409 retval = freeze (ra_idx, dimensions, resize_ok); |
|
|
410 } |
|
|
411 else if (n < n_dims) |
|
|
412 { |
|
|
413 retval.resize (n); |
|
|
414 |
|
|
415 for (int i = 0; i < n - 1; i++) |
|
|
416 retval(i) = ra_idx(i).freeze (dimensions(i), "dimension", resize_ok); |
|
|
417 |
|
|
418 int size_left = 1; |
|
|
419 |
|
|
420 for (int i = n - 1; i < n_dims; i++) |
|
|
421 size_left *= dimensions(i); |
|
|
422 |
|
|
423 if (ra_idx(n-1).is_colon()) |
|
|
424 { |
|
|
425 retval(n-1) = size_left; |
|
|
426 } |
|
|
427 else |
|
|
428 { |
|
5275
|
429 octave_idx_type last_ra_idx = ra_idx(n-1)(0); |
|
|
430 for (octave_idx_type i = 1; i < ra_idx (n - 1).capacity (); i++) |
|
4887
|
431 last_ra_idx = (last_ra_idx > ra_idx(n-1)(i) ? last_ra_idx : |
|
|
432 ra_idx(n-1)(i)); |
|
4588
|
433 |
|
4887
|
434 if (last_ra_idx < size_left) |
|
4588
|
435 { |
|
4887
|
436 retval(n-1) = ra_idx(n-1).freeze (size_left, |
|
|
437 "dimension", resize_ok); |
|
4588
|
438 } |
|
|
439 else |
|
|
440 { |
|
4887
|
441 // Make it larger than it should be to get an error |
|
|
442 // later. |
|
4588
|
443 |
|
4887
|
444 retval.resize (n_dims+1); |
|
|
445 |
|
|
446 (*current_liboctave_error_handler) |
|
|
447 ("index exceeds N-d array dimensions"); |
|
4588
|
448 } |
|
|
449 } |
|
|
450 } |
|
|
451 |
|
|
452 return retval; |
|
|
453 } |
|
|
454 |
|
4669
|
455 void |
|
|
456 gripe_nonconformant (const char *op, int op1_len, int op2_len) |
|
|
457 { |
|
|
458 (*current_liboctave_error_handler) |
|
|
459 ("%s: nonconformant arguments (op1 len: %d, op2 len: %d)", |
|
|
460 op, op1_len, op2_len); |
|
|
461 } |
|
|
462 |
|
|
463 void |
|
|
464 gripe_nonconformant (const char *op, int op1_nr, int op1_nc, |
|
|
465 int op2_nr, int op2_nc) |
|
|
466 { |
|
|
467 (*current_liboctave_error_handler) |
|
|
468 ("%s: nonconformant arguments (op1 is %dx%d, op2 is %dx%d)", |
|
|
469 op, op1_nr, op1_nc, op2_nr, op2_nc); |
|
|
470 } |
|
|
471 |
|
|
472 void |
|
|
473 gripe_nonconformant (const char *op, dim_vector& op1_dims, |
|
|
474 dim_vector& op2_dims) |
|
|
475 { |
|
|
476 std::string op1_dims_str = op1_dims.str (); |
|
|
477 std::string op2_dims_str = op2_dims.str (); |
|
|
478 |
|
|
479 (*current_liboctave_error_handler) |
|
|
480 ("%s: nonconformant arguments (op1 is %s, op2 is %s)", |
|
|
481 op, op1_dims_str.c_str (), op2_dims_str.c_str ()); |
|
|
482 } |
|
|
483 |
|
4588
|
484 /* |
|
|
485 ;;; Local Variables: *** |
|
|
486 ;;; mode: C++ *** |
|
|
487 ;;; End: *** |
|
|
488 */ |
