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