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