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