|
1
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
1
|
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 |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
1
|
20 |
|
|
21 */ |
|
|
22 |
|
4192
|
23 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
1297
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
240
|
27 #ifdef HAVE_CONFIG_H |
|
1192
|
28 #include <config.h> |
|
1
|
29 #endif |
|
|
30 |
|
1343
|
31 #include <cstdlib> |
|
|
32 |
|
3503
|
33 #include <iostream> |
|
164
|
34 |
|
1352
|
35 #include "Range.h" |
|
4650
|
36 #include "boolNDArray.h" |
|
1560
|
37 #include "dColVector.h" |
|
4650
|
38 #include "dNDArray.h" |
|
1352
|
39 |
|
1
|
40 #include "idx-vector.h" |
|
1560
|
41 #include "lo-error.h" |
|
2500
|
42 #include "lo-mappers.h" |
|
1
|
43 |
|
1560
|
44 #define IDX_VEC_REP idx_vector::idx_vector_rep |
|
|
45 |
|
|
46 IDX_VEC_REP::idx_vector_rep (const IDX_VEC_REP& a) |
|
4653
|
47 : data (0), len (a.len), num_zeros (a.num_zeros), num_ones (a.num_ones), |
|
|
48 max_val (a.max_val), min_val (a.min_val), |
|
|
49 frozen_at_z_len (a.frozen_at_z_len), frozen_len (a.frozen_len), |
|
|
50 colon (a.colon), one_zero (a.one_zero), initialized (a.initialized), |
|
|
51 frozen (a.frozen), colon_equiv_checked (a.colon_equiv_checked), |
|
|
52 colon_equiv (a.colon_equiv), orig_dims (a.orig_dims) |
|
1
|
53 { |
|
|
54 if (len > 0) |
|
|
55 { |
|
|
56 data = new int [len]; |
|
|
57 for (int i = 0; i < len; i++) |
|
|
58 data[i] = a.data[i]; |
|
|
59 } |
|
|
60 } |
|
|
61 |
|
|
62 static inline int |
|
|
63 tree_to_mat_idx (double x) |
|
|
64 { |
|
3928
|
65 return (x > 0) |
|
|
66 ? (static_cast<int> (x + 0.5) - 1) |
|
|
67 : (static_cast<int> (x - 0.5) - 1); |
|
|
68 } |
|
|
69 |
|
|
70 static inline int |
|
|
71 tree_to_mat_idx (int i) |
|
|
72 { |
|
|
73 return i - 1; |
|
2500
|
74 } |
|
|
75 |
|
|
76 static inline bool |
|
|
77 idx_is_inf_or_nan (double x) |
|
|
78 { |
|
|
79 bool retval = false; |
|
|
80 |
|
|
81 if (xisnan (x)) |
|
|
82 { |
|
|
83 (*current_liboctave_error_handler) ("NaN invalid as index"); |
|
|
84 retval = true; |
|
|
85 } |
|
|
86 else if (xisinf (x)) |
|
|
87 { |
|
|
88 (*current_liboctave_error_handler) ("Inf invalid as index"); |
|
|
89 retval = true; |
|
|
90 } |
|
|
91 |
|
|
92 return retval; |
|
1
|
93 } |
|
|
94 |
|
1560
|
95 IDX_VEC_REP::idx_vector_rep (const ColumnVector& v) |
|
4653
|
96 : data (0), len (v.length ()), num_zeros (0), num_ones (0), max_val (0), |
|
|
97 min_val (0), count (1), frozen_at_z_len (0), frozen_len (0), |
|
|
98 colon (0), one_zero (0), initialized (0), frozen (0), |
|
|
99 colon_equiv_checked (0), colon_equiv (0), orig_dims (len, 1) |
|
1
|
100 { |
|
1560
|
101 if (len == 0) |
|
1
|
102 { |
|
191
|
103 initialized = 1; |
|
1
|
104 return; |
|
|
105 } |
|
1560
|
106 else |
|
1
|
107 { |
|
|
108 data = new int [len]; |
|
2500
|
109 |
|
1
|
110 for (int i = 0; i < len; i++) |
|
2500
|
111 { |
|
|
112 double d = v.elem (i); |
|
|
113 |
|
|
114 if (idx_is_inf_or_nan (d)) |
|
|
115 return; |
|
|
116 else |
|
|
117 data[i] = tree_to_mat_idx (d); |
|
|
118 } |
|
1
|
119 } |
|
1560
|
120 |
|
|
121 init_state (); |
|
|
122 } |
|
|
123 |
|
4650
|
124 IDX_VEC_REP::idx_vector_rep (const NDArray& nda) |
|
4653
|
125 : data (0), len (nda.length ()), num_zeros (0), num_ones (0), |
|
|
126 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
127 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
128 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
129 orig_dims (nda.dims ()) |
|
1560
|
130 { |
|
|
131 if (len == 0) |
|
1
|
132 { |
|
1560
|
133 initialized = 1; |
|
|
134 return; |
|
1
|
135 } |
|
|
136 else |
|
|
137 { |
|
1560
|
138 int k = 0; |
|
|
139 data = new int [len]; |
|
2500
|
140 |
|
4650
|
141 for (int i = 0; i < len; i++) |
|
|
142 { |
|
|
143 double d = nda.elem (i); |
|
2500
|
144 |
|
4650
|
145 if (idx_is_inf_or_nan (d)) |
|
|
146 return; |
|
|
147 else |
|
|
148 data[k++] = tree_to_mat_idx (d); |
|
|
149 } |
|
1
|
150 } |
|
|
151 |
|
1560
|
152 init_state (); |
|
1
|
153 } |
|
|
154 |
|
1560
|
155 IDX_VEC_REP::idx_vector_rep (const Range& r) |
|
4653
|
156 : data (0), len (r.nelem ()), num_zeros (0), num_ones (0), |
|
|
157 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
158 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
159 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
160 orig_dims (1, len) |
|
1
|
161 { |
|
191
|
162 if (len < 0) |
|
|
163 { |
|
1560
|
164 (*current_liboctave_error_handler) ("invalid range used as index"); |
|
191
|
165 return; |
|
|
166 } |
|
|
167 else if (len == 0) |
|
|
168 { |
|
|
169 initialized = 1; |
|
|
170 return; |
|
|
171 } |
|
1
|
172 |
|
|
173 double b = r.base (); |
|
|
174 double step = r.inc (); |
|
|
175 |
|
|
176 data = new int [len]; |
|
|
177 |
|
|
178 for (int i = 0; i < len; i++) |
|
|
179 { |
|
|
180 double val = b + i * step; |
|
2500
|
181 |
|
|
182 if (idx_is_inf_or_nan (val)) |
|
|
183 return; |
|
|
184 else |
|
|
185 data[i] = tree_to_mat_idx (val); |
|
1
|
186 } |
|
|
187 |
|
|
188 init_state (); |
|
|
189 } |
|
|
190 |
|
3928
|
191 IDX_VEC_REP::idx_vector_rep (double d) |
|
4653
|
192 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
193 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
194 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
195 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
196 orig_dims (1, 1) |
|
3928
|
197 { |
|
|
198 if (idx_is_inf_or_nan (d)) |
|
|
199 return; |
|
|
200 else |
|
|
201 { |
|
|
202 data = new int [len]; |
|
|
203 |
|
|
204 data[0] = tree_to_mat_idx (d); |
|
|
205 } |
|
|
206 |
|
|
207 init_state (); |
|
|
208 } |
|
|
209 |
|
|
210 IDX_VEC_REP::idx_vector_rep (int i) |
|
4653
|
211 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
212 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
213 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
214 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
215 orig_dims (1, 1) |
|
3928
|
216 { |
|
|
217 data = new int [len]; |
|
|
218 |
|
|
219 data[0] = tree_to_mat_idx (i); |
|
|
220 |
|
|
221 init_state (); |
|
|
222 } |
|
|
223 |
|
1560
|
224 IDX_VEC_REP::idx_vector_rep (char c) |
|
4653
|
225 : data (0), len (0), num_zeros (0), num_ones (0), |
|
|
226 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
227 frozen_len (0), colon (1), one_zero (0), initialized (0), |
|
|
228 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
229 orig_dims (0, 0) |
|
1560
|
230 { |
|
|
231 assert (c == ':'); |
|
|
232 |
|
|
233 init_state (); |
|
|
234 } |
|
|
235 |
|
2828
|
236 IDX_VEC_REP::idx_vector_rep (bool b) |
|
4653
|
237 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
238 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
239 frozen_len (0), colon (0), one_zero (1), initialized (0), |
|
|
240 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
241 orig_dims (1, 1) |
|
2828
|
242 { |
|
|
243 data = new int [len]; |
|
|
244 |
|
|
245 data[0] = tree_to_mat_idx (b); |
|
|
246 |
|
|
247 init_state (); |
|
|
248 } |
|
|
249 |
|
4650
|
250 IDX_VEC_REP::idx_vector_rep (const boolNDArray& bnda) |
|
4653
|
251 : data (0), len (bnda.length ()), num_zeros (0), num_ones (0), |
|
|
252 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
253 frozen_len (0), colon (0), one_zero (1), initialized (0), |
|
|
254 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
255 orig_dims (bnda.dims ()) |
|
2828
|
256 { |
|
|
257 if (len == 0) |
|
|
258 { |
|
|
259 initialized = 1; |
|
|
260 return; |
|
|
261 } |
|
|
262 else |
|
|
263 { |
|
|
264 int k = 0; |
|
|
265 data = new int [len]; |
|
|
266 |
|
4650
|
267 for (int i = 0; i < len; i++) |
|
|
268 data[k++] = tree_to_mat_idx (bnda.elem (i)); |
|
2828
|
269 } |
|
|
270 |
|
|
271 init_state (); |
|
|
272 } |
|
|
273 |
|
1560
|
274 IDX_VEC_REP& |
|
|
275 IDX_VEC_REP::operator = (const IDX_VEC_REP& a) |
|
1
|
276 { |
|
|
277 if (this != &a) |
|
|
278 { |
|
|
279 delete [] data; |
|
|
280 len = a.len; |
|
|
281 data = new int [len]; |
|
|
282 for (int i = 0; i < len; i++) |
|
|
283 data[i] = a.data[i]; |
|
|
284 |
|
|
285 num_zeros = a.num_zeros; |
|
|
286 num_ones = a.num_ones; |
|
|
287 max_val = a.max_val; |
|
|
288 min_val = a.min_val; |
|
4653
|
289 frozen_at_z_len = a.frozen_at_z_len; |
|
|
290 frozen_len = a.frozen_len; |
|
|
291 colon = a.colon; |
|
|
292 one_zero = a.one_zero; |
|
|
293 initialized = a.initialized; |
|
|
294 frozen = a.frozen; |
|
|
295 colon_equiv_checked = a.colon_equiv_checked; |
|
|
296 colon_equiv = a.colon_equiv; |
|
|
297 orig_dims = a.orig_dims; |
|
1
|
298 } |
|
4653
|
299 |
|
1
|
300 return *this; |
|
|
301 } |
|
|
302 |
|
|
303 void |
|
1560
|
304 IDX_VEC_REP::init_state (void) |
|
1
|
305 { |
|
|
306 num_zeros = 0; |
|
|
307 num_ones = 0; |
|
|
308 |
|
1560
|
309 if (colon) |
|
1
|
310 { |
|
2828
|
311 min_val = 0; |
|
|
312 max_val = 0; |
|
1
|
313 } |
|
|
314 else |
|
|
315 { |
|
|
316 min_val = max_val = data[0]; |
|
|
317 |
|
1321
|
318 int i = 0; |
|
1
|
319 do |
|
|
320 { |
|
1560
|
321 if (data[i] == -1) |
|
|
322 num_zeros++; |
|
|
323 else if (data[i] == 0) |
|
|
324 num_ones++; |
|
|
325 |
|
1
|
326 if (data[i] > max_val) |
|
|
327 max_val = data[i]; |
|
|
328 |
|
|
329 if (data[i] < min_val) |
|
|
330 min_val = data[i]; |
|
|
331 } |
|
|
332 while (++i < len); |
|
|
333 } |
|
1560
|
334 |
|
|
335 initialized = 1; |
|
|
336 } |
|
|
337 |
|
|
338 void |
|
2828
|
339 IDX_VEC_REP::maybe_convert_one_zero_to_idx (int z_len) |
|
1560
|
340 { |
|
3680
|
341 if (one_zero && (z_len == len || z_len == 0)) |
|
1560
|
342 { |
|
|
343 if (num_ones == 0) |
|
|
344 { |
|
|
345 len = 0; |
|
|
346 max_val = 0; |
|
|
347 min_val = 0; |
|
|
348 delete [] data; |
|
|
349 data = 0; |
|
|
350 } |
|
|
351 else |
|
|
352 { |
|
|
353 assert (num_ones + num_zeros == len); |
|
|
354 |
|
|
355 int *new_data = new int [num_ones]; |
|
1650
|
356 int k = 0; |
|
1560
|
357 for (int i = 0; i < len; i++) |
|
|
358 if (data[i] == 0) |
|
1650
|
359 new_data[k++] = i; |
|
1560
|
360 |
|
|
361 delete [] data; |
|
|
362 len = num_ones; |
|
|
363 data = new_data; |
|
|
364 |
|
|
365 min_val = max_val = data[0]; |
|
|
366 |
|
|
367 int i = 0; |
|
|
368 do |
|
|
369 { |
|
|
370 if (data[i] > max_val) |
|
|
371 max_val = data[i]; |
|
|
372 |
|
|
373 if (data[i] < min_val) |
|
|
374 min_val = data[i]; |
|
|
375 } |
|
|
376 while (++i < len); |
|
|
377 } |
|
|
378 } |
|
1
|
379 } |
|
|
380 |
|
227
|
381 int |
|
1560
|
382 IDX_VEC_REP::checkelem (int n) const |
|
227
|
383 { |
|
|
384 if (n < 0 || n >= len) |
|
|
385 { |
|
1560
|
386 (*current_liboctave_error_handler) ("idx-vector: index out of range"); |
|
227
|
387 return 0; |
|
|
388 } |
|
|
389 |
|
|
390 return elem (n); |
|
|
391 } |
|
|
392 |
|
1552
|
393 static inline int |
|
3262
|
394 intcmp (const void *ii, const void *jj) |
|
1552
|
395 { |
|
3262
|
396 return (*(static_cast<const int *> (ii)) - *(static_cast<const int *> (jj))); |
|
1552
|
397 } |
|
|
398 |
|
1560
|
399 static inline void |
|
1650
|
400 sort_data (int *d, int l) |
|
1560
|
401 { |
|
2800
|
402 qsort (d, l, sizeof (int), intcmp); |
|
1560
|
403 } |
|
|
404 |
|
|
405 static inline int |
|
1650
|
406 make_uniq (int *d, int l) |
|
1560
|
407 { |
|
3125
|
408 if (l < 2) |
|
|
409 return l; |
|
|
410 |
|
1560
|
411 int k = 0; |
|
1759
|
412 for (int ii = 1; ii < l; ii++) |
|
1560
|
413 { |
|
1650
|
414 if (d[ii] != d[k]) |
|
1560
|
415 { |
|
|
416 k++; |
|
1650
|
417 d[k] = d[ii]; |
|
1560
|
418 } |
|
|
419 } |
|
|
420 return k+1; |
|
|
421 } |
|
|
422 |
|
|
423 static inline int * |
|
1650
|
424 copy_data (const int *d, int l) |
|
209
|
425 { |
|
1650
|
426 int *new_data = new int [l]; |
|
1560
|
427 |
|
1650
|
428 for (int ii = 0; ii < l; ii++) |
|
|
429 new_data[ii] = d[ii]; |
|
1560
|
430 |
|
|
431 return new_data; |
|
|
432 } |
|
|
433 |
|
|
434 int |
|
2356
|
435 IDX_VEC_REP::is_colon_equiv (int n, int sort_uniq) |
|
1560
|
436 { |
|
|
437 if (! colon_equiv_checked) |
|
|
438 { |
|
|
439 if (colon) |
|
|
440 { |
|
|
441 colon_equiv = 1; |
|
|
442 } |
|
3472
|
443 else if (len > 1) |
|
1560
|
444 { |
|
3472
|
445 if (one_zero) |
|
|
446 { |
|
|
447 colon_equiv = (len == n && ones_count () == n); |
|
|
448 } |
|
|
449 else if (sort_uniq) |
|
2356
|
450 { |
|
2966
|
451 int *tmp_data = copy_data (data, len); |
|
|
452 |
|
2356
|
453 sort_data (tmp_data, len); |
|
|
454 |
|
2966
|
455 int tmp_len = make_uniq (tmp_data, len); |
|
|
456 |
|
|
457 colon_equiv = (tmp_len == n |
|
|
458 && tmp_data[0] == 0 |
|
|
459 && tmp_data[tmp_len-1] == tmp_len - 1); |
|
1560
|
460 |
|
2966
|
461 delete [] tmp_data; |
|
|
462 } |
|
|
463 else |
|
|
464 { |
|
|
465 if (len == n) |
|
|
466 { |
|
|
467 colon_equiv = 1; |
|
1560
|
468 |
|
2966
|
469 for (int ii = 0; ii < n; ii++) |
|
|
470 if (data[ii] != ii) |
|
|
471 { |
|
|
472 colon_equiv = 0; |
|
|
473 break; |
|
|
474 } |
|
|
475 } |
|
|
476 } |
|
1560
|
477 } |
|
|
478 else |
|
2966
|
479 colon_equiv = (len == n && (n == 0 || (n == 1 && data[0] == 0))); |
|
1560
|
480 |
|
|
481 colon_equiv_checked = 1; |
|
|
482 } |
|
|
483 |
|
|
484 return colon_equiv; |
|
209
|
485 } |
|
|
486 |
|
417
|
487 void |
|
3079
|
488 IDX_VEC_REP::sort (bool uniq) |
|
|
489 { |
|
3125
|
490 if (len > 1) |
|
|
491 { |
|
|
492 sort_data (data, len); |
|
3079
|
493 |
|
3125
|
494 if (uniq) |
|
|
495 len = make_uniq (data, len); |
|
|
496 } |
|
3079
|
497 } |
|
|
498 |
|
|
499 void |
|
1560
|
500 IDX_VEC_REP::shorten (int n) |
|
434
|
501 { |
|
|
502 if (n > 0 && n <= len) |
|
|
503 len = n; |
|
|
504 else |
|
1560
|
505 (*current_liboctave_error_handler) |
|
|
506 ("idx_vector::shorten: internal error!"); |
|
434
|
507 } |
|
|
508 |
|
3504
|
509 std::ostream& |
|
|
510 IDX_VEC_REP::print (std::ostream& os) const |
|
1560
|
511 { |
|
1650
|
512 for (int ii = 0; ii < len; ii++) |
|
|
513 os << data[ii] << "\n"; |
|
1560
|
514 return os; |
|
|
515 } |
|
|
516 |
|
|
517 int |
|
4461
|
518 IDX_VEC_REP::freeze (int z_len, const char *tag, bool resize_ok, |
|
|
519 bool warn_resize) |
|
1
|
520 { |
|
1560
|
521 if (frozen) |
|
3680
|
522 return frozen_len; |
|
1560
|
523 |
|
|
524 frozen_len = -1; |
|
|
525 |
|
|
526 if (colon) |
|
|
527 frozen_len = z_len; |
|
|
528 else |
|
|
529 { |
|
|
530 if (len == 0) |
|
|
531 frozen_len = 0; |
|
|
532 else |
|
|
533 { |
|
2828
|
534 maybe_convert_one_zero_to_idx (z_len); |
|
1560
|
535 |
|
1650
|
536 max_val = max (); |
|
|
537 min_val = min (); |
|
1560
|
538 |
|
|
539 if (min_val < 0) |
|
|
540 { |
|
|
541 if (tag) |
|
|
542 (*current_liboctave_error_handler) |
|
|
543 ("invalid %s index = %d", tag, min_val+1); |
|
|
544 else |
|
|
545 (*current_liboctave_error_handler) |
|
|
546 ("invalid index = %d", min_val+1); |
|
|
547 |
|
|
548 initialized = 0; |
|
|
549 } |
|
|
550 else if (! resize_ok && max_val >= z_len) |
|
|
551 { |
|
|
552 if (tag) |
|
|
553 (*current_liboctave_error_handler) |
|
|
554 ("invalid %s index = %d", tag, max_val+1); |
|
|
555 else |
|
|
556 (*current_liboctave_error_handler) |
|
|
557 ("invalid index = %d", max_val+1); |
|
|
558 |
|
|
559 initialized = 0; |
|
|
560 } |
|
|
561 else |
|
4461
|
562 { |
|
|
563 if (warn_resize && max_val >= z_len) |
|
|
564 { |
|
|
565 if (tag) |
|
|
566 (*current_liboctave_error_handler) |
|
|
567 ("resizing object with %s index = %d out of bounds", |
|
|
568 tag, max_val+1); |
|
|
569 else |
|
|
570 (*current_liboctave_error_handler) |
|
|
571 ("resizing object with index = %d out of bounds", |
|
|
572 max_val+1); |
|
|
573 } |
|
|
574 |
|
|
575 frozen_len = length (z_len); |
|
|
576 } |
|
1560
|
577 } |
|
|
578 } |
|
|
579 |
|
|
580 frozen = 1; |
|
3680
|
581 |
|
|
582 frozen_at_z_len = z_len ? z_len : len; |
|
1560
|
583 |
|
|
584 return frozen_len; |
|
1
|
585 } |
|
|
586 |
|
|
587 /* |
|
|
588 ;;; Local Variables: *** |
|
|
589 ;;; mode: C++ *** |
|
|
590 ;;; End: *** |
|
|
591 */ |
