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