|
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 |
|
5275
|
186 data = new octave_idx_type [len]; |
|
1
|
187 |
|
6457
|
188 // If all elements are ints, we can generate the indexes as integers |
|
|
189 // and save tons of tests. |
|
4732
|
190 |
|
6457
|
191 if (r.all_elements_are_ints ()) |
|
|
192 { |
|
|
193 octave_idx_type b = static_cast<octave_idx_type> (r.base ()); |
|
|
194 octave_idx_type step = static_cast<octave_idx_type> (r.inc ()); |
|
2500
|
195 |
|
6457
|
196 data[0] = b - 1; |
|
|
197 for (octave_idx_type i = 1; i < len; i++) |
|
|
198 data[i] = data[i-1] + step; |
|
4732
|
199 |
|
6457
|
200 init_state (); |
|
1
|
201 } |
|
6457
|
202 else |
|
|
203 (*current_liboctave_error_handler) |
|
|
204 ("expecting integer index, found non integer Range"); |
|
1
|
205 } |
|
|
206 |
|
3928
|
207 IDX_VEC_REP::idx_vector_rep (double d) |
|
4653
|
208 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
209 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
210 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
211 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
212 orig_dims (1, 1) |
|
3928
|
213 { |
|
|
214 if (idx_is_inf_or_nan (d)) |
|
|
215 return; |
|
|
216 else |
|
|
217 { |
|
5275
|
218 data = new octave_idx_type [len]; |
|
3928
|
219 |
|
4732
|
220 bool conversion_error = false; |
|
|
221 |
|
|
222 data[0] = tree_to_mat_idx (d, conversion_error); |
|
|
223 |
|
|
224 if (conversion_error) |
|
|
225 return; |
|
3928
|
226 } |
|
|
227 |
|
|
228 init_state (); |
|
|
229 } |
|
|
230 |
|
5275
|
231 IDX_VEC_REP::idx_vector_rep (octave_idx_type i) |
|
4653
|
232 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
233 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
234 frozen_len (0), colon (0), one_zero (0), initialized (0), |
|
|
235 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
236 orig_dims (1, 1) |
|
3928
|
237 { |
|
5275
|
238 data = new octave_idx_type [len]; |
|
3928
|
239 |
|
|
240 data[0] = tree_to_mat_idx (i); |
|
|
241 |
|
|
242 init_state (); |
|
|
243 } |
|
|
244 |
|
1560
|
245 IDX_VEC_REP::idx_vector_rep (char c) |
|
4653
|
246 : data (0), len (0), num_zeros (0), num_ones (0), |
|
|
247 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
248 frozen_len (0), colon (1), one_zero (0), initialized (0), |
|
|
249 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
250 orig_dims (0, 0) |
|
1560
|
251 { |
|
|
252 assert (c == ':'); |
|
|
253 |
|
|
254 init_state (); |
|
|
255 } |
|
|
256 |
|
2828
|
257 IDX_VEC_REP::idx_vector_rep (bool b) |
|
4653
|
258 : data (0), len (1), num_zeros (0), num_ones (0), |
|
|
259 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
260 frozen_len (0), colon (0), one_zero (1), initialized (0), |
|
|
261 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
262 orig_dims (1, 1) |
|
2828
|
263 { |
|
5275
|
264 data = new octave_idx_type [len]; |
|
2828
|
265 |
|
|
266 data[0] = tree_to_mat_idx (b); |
|
|
267 |
|
|
268 init_state (); |
|
|
269 } |
|
|
270 |
|
4650
|
271 IDX_VEC_REP::idx_vector_rep (const boolNDArray& bnda) |
|
4653
|
272 : data (0), len (bnda.length ()), num_zeros (0), num_ones (0), |
|
|
273 max_val (0), min_val (0), count (1), frozen_at_z_len (0), |
|
|
274 frozen_len (0), colon (0), one_zero (1), initialized (0), |
|
|
275 frozen (0), colon_equiv_checked (0), colon_equiv (0), |
|
|
276 orig_dims (bnda.dims ()) |
|
2828
|
277 { |
|
|
278 if (len == 0) |
|
|
279 { |
|
|
280 initialized = 1; |
|
|
281 return; |
|
|
282 } |
|
|
283 else |
|
|
284 { |
|
5275
|
285 octave_idx_type k = 0; |
|
|
286 data = new octave_idx_type [len]; |
|
2828
|
287 |
|
5275
|
288 for (octave_idx_type i = 0; i < len; i++) |
|
4650
|
289 data[k++] = tree_to_mat_idx (bnda.elem (i)); |
|
2828
|
290 } |
|
|
291 |
|
|
292 init_state (); |
|
|
293 } |
|
|
294 |
|
1560
|
295 IDX_VEC_REP& |
|
|
296 IDX_VEC_REP::operator = (const IDX_VEC_REP& a) |
|
1
|
297 { |
|
|
298 if (this != &a) |
|
|
299 { |
|
|
300 delete [] data; |
|
|
301 len = a.len; |
|
5275
|
302 data = new octave_idx_type [len]; |
|
|
303 for (octave_idx_type i = 0; i < len; i++) |
|
1
|
304 data[i] = a.data[i]; |
|
|
305 |
|
|
306 num_zeros = a.num_zeros; |
|
|
307 num_ones = a.num_ones; |
|
|
308 max_val = a.max_val; |
|
|
309 min_val = a.min_val; |
|
4653
|
310 frozen_at_z_len = a.frozen_at_z_len; |
|
|
311 frozen_len = a.frozen_len; |
|
|
312 colon = a.colon; |
|
|
313 one_zero = a.one_zero; |
|
|
314 initialized = a.initialized; |
|
|
315 frozen = a.frozen; |
|
|
316 colon_equiv_checked = a.colon_equiv_checked; |
|
|
317 colon_equiv = a.colon_equiv; |
|
|
318 orig_dims = a.orig_dims; |
|
1
|
319 } |
|
4653
|
320 |
|
1
|
321 return *this; |
|
|
322 } |
|
|
323 |
|
|
324 void |
|
1560
|
325 IDX_VEC_REP::init_state (void) |
|
1
|
326 { |
|
|
327 num_zeros = 0; |
|
|
328 num_ones = 0; |
|
|
329 |
|
1560
|
330 if (colon) |
|
1
|
331 { |
|
2828
|
332 min_val = 0; |
|
|
333 max_val = 0; |
|
1
|
334 } |
|
|
335 else |
|
|
336 { |
|
|
337 min_val = max_val = data[0]; |
|
|
338 |
|
5275
|
339 octave_idx_type i = 0; |
|
1
|
340 do |
|
|
341 { |
|
1560
|
342 if (data[i] == -1) |
|
|
343 num_zeros++; |
|
|
344 else if (data[i] == 0) |
|
|
345 num_ones++; |
|
|
346 |
|
1
|
347 if (data[i] > max_val) |
|
|
348 max_val = data[i]; |
|
|
349 |
|
|
350 if (data[i] < min_val) |
|
|
351 min_val = data[i]; |
|
|
352 } |
|
|
353 while (++i < len); |
|
|
354 } |
|
1560
|
355 |
|
|
356 initialized = 1; |
|
|
357 } |
|
|
358 |
|
|
359 void |
|
5275
|
360 IDX_VEC_REP::maybe_convert_one_zero_to_idx (octave_idx_type z_len) |
|
1560
|
361 { |
|
3680
|
362 if (one_zero && (z_len == len || z_len == 0)) |
|
1560
|
363 { |
|
|
364 if (num_ones == 0) |
|
|
365 { |
|
|
366 len = 0; |
|
|
367 max_val = 0; |
|
|
368 min_val = 0; |
|
|
369 delete [] data; |
|
|
370 data = 0; |
|
|
371 } |
|
|
372 else |
|
|
373 { |
|
|
374 assert (num_ones + num_zeros == len); |
|
|
375 |
|
5275
|
376 octave_idx_type *new_data = new octave_idx_type [num_ones]; |
|
|
377 octave_idx_type k = 0; |
|
|
378 for (octave_idx_type i = 0; i < len; i++) |
|
1560
|
379 if (data[i] == 0) |
|
1650
|
380 new_data[k++] = i; |
|
1560
|
381 |
|
|
382 delete [] data; |
|
|
383 len = num_ones; |
|
|
384 data = new_data; |
|
|
385 |
|
|
386 min_val = max_val = data[0]; |
|
|
387 |
|
5275
|
388 octave_idx_type i = 0; |
|
1560
|
389 do |
|
|
390 { |
|
|
391 if (data[i] > max_val) |
|
|
392 max_val = data[i]; |
|
|
393 |
|
|
394 if (data[i] < min_val) |
|
|
395 min_val = data[i]; |
|
|
396 } |
|
|
397 while (++i < len); |
|
|
398 } |
|
|
399 } |
|
1
|
400 } |
|
|
401 |
|
5275
|
402 octave_idx_type |
|
|
403 IDX_VEC_REP::checkelem (octave_idx_type n) const |
|
227
|
404 { |
|
|
405 if (n < 0 || n >= len) |
|
|
406 { |
|
1560
|
407 (*current_liboctave_error_handler) ("idx-vector: index out of range"); |
|
227
|
408 return 0; |
|
|
409 } |
|
|
410 |
|
|
411 return elem (n); |
|
|
412 } |
|
|
413 |
|
1552
|
414 static inline int |
|
3262
|
415 intcmp (const void *ii, const void *jj) |
|
1552
|
416 { |
|
5275
|
417 return (*(static_cast<const octave_idx_type *> (ii)) - *(static_cast<const octave_idx_type *> (jj))); |
|
1552
|
418 } |
|
|
419 |
|
1560
|
420 static inline void |
|
5275
|
421 sort_data (octave_idx_type *d, octave_idx_type l) |
|
1560
|
422 { |
|
5275
|
423 qsort (d, l, sizeof (octave_idx_type), intcmp); |
|
1560
|
424 } |
|
|
425 |
|
5275
|
426 static inline octave_idx_type |
|
|
427 make_uniq (octave_idx_type *d, octave_idx_type l) |
|
1560
|
428 { |
|
3125
|
429 if (l < 2) |
|
|
430 return l; |
|
|
431 |
|
5275
|
432 octave_idx_type k = 0; |
|
|
433 for (octave_idx_type ii = 1; ii < l; ii++) |
|
1560
|
434 { |
|
1650
|
435 if (d[ii] != d[k]) |
|
1560
|
436 { |
|
|
437 k++; |
|
1650
|
438 d[k] = d[ii]; |
|
1560
|
439 } |
|
|
440 } |
|
|
441 return k+1; |
|
|
442 } |
|
|
443 |
|
5275
|
444 static inline octave_idx_type * |
|
|
445 copy_data (const octave_idx_type *d, octave_idx_type l) |
|
209
|
446 { |
|
5275
|
447 octave_idx_type *new_data = new octave_idx_type [l]; |
|
1560
|
448 |
|
5275
|
449 for (octave_idx_type ii = 0; ii < l; ii++) |
|
1650
|
450 new_data[ii] = d[ii]; |
|
1560
|
451 |
|
|
452 return new_data; |
|
|
453 } |
|
|
454 |
|
|
455 int |
|
5275
|
456 IDX_VEC_REP::is_colon_equiv (octave_idx_type n, int sort_uniq) |
|
1560
|
457 { |
|
|
458 if (! colon_equiv_checked) |
|
|
459 { |
|
|
460 if (colon) |
|
|
461 { |
|
|
462 colon_equiv = 1; |
|
|
463 } |
|
5275
|
464 else if (static_cast<octave_idx_type> (len) > 1) |
|
1560
|
465 { |
|
3472
|
466 if (one_zero) |
|
|
467 { |
|
|
468 colon_equiv = (len == n && ones_count () == n); |
|
|
469 } |
|
|
470 else if (sort_uniq) |
|
2356
|
471 { |
|
5275
|
472 octave_idx_type *tmp_data = copy_data (data, len); |
|
2966
|
473 |
|
2356
|
474 sort_data (tmp_data, len); |
|
|
475 |
|
5275
|
476 octave_idx_type tmp_len = make_uniq (tmp_data, len); |
|
2966
|
477 |
|
|
478 colon_equiv = (tmp_len == n |
|
|
479 && tmp_data[0] == 0 |
|
|
480 && tmp_data[tmp_len-1] == tmp_len - 1); |
|
1560
|
481 |
|
2966
|
482 delete [] tmp_data; |
|
|
483 } |
|
|
484 else |
|
|
485 { |
|
|
486 if (len == n) |
|
|
487 { |
|
|
488 colon_equiv = 1; |
|
1560
|
489 |
|
5275
|
490 for (octave_idx_type ii = 0; ii < n; ii++) |
|
2966
|
491 if (data[ii] != ii) |
|
|
492 { |
|
|
493 colon_equiv = 0; |
|
|
494 break; |
|
|
495 } |
|
|
496 } |
|
|
497 } |
|
1560
|
498 } |
|
|
499 else |
|
2966
|
500 colon_equiv = (len == n && (n == 0 || (n == 1 && data[0] == 0))); |
|
1560
|
501 |
|
|
502 colon_equiv_checked = 1; |
|
|
503 } |
|
|
504 |
|
|
505 return colon_equiv; |
|
209
|
506 } |
|
|
507 |
|
417
|
508 void |
|
3079
|
509 IDX_VEC_REP::sort (bool uniq) |
|
|
510 { |
|
3125
|
511 if (len > 1) |
|
|
512 { |
|
|
513 sort_data (data, len); |
|
3079
|
514 |
|
3125
|
515 if (uniq) |
|
|
516 len = make_uniq (data, len); |
|
|
517 } |
|
3079
|
518 } |
|
|
519 |
|
|
520 void |
|
5275
|
521 IDX_VEC_REP::shorten (octave_idx_type n) |
|
434
|
522 { |
|
|
523 if (n > 0 && n <= len) |
|
|
524 len = n; |
|
|
525 else |
|
1560
|
526 (*current_liboctave_error_handler) |
|
|
527 ("idx_vector::shorten: internal error!"); |
|
434
|
528 } |
|
|
529 |
|
3504
|
530 std::ostream& |
|
|
531 IDX_VEC_REP::print (std::ostream& os) const |
|
1560
|
532 { |
|
5275
|
533 for (octave_idx_type ii = 0; ii < len; ii++) |
|
1650
|
534 os << data[ii] << "\n"; |
|
1560
|
535 return os; |
|
|
536 } |
|
|
537 |
|
5275
|
538 octave_idx_type |
|
5781
|
539 IDX_VEC_REP::freeze (octave_idx_type z_len, const char *tag, bool resize_ok) |
|
1
|
540 { |
|
1560
|
541 if (frozen) |
|
3680
|
542 return frozen_len; |
|
1560
|
543 |
|
|
544 frozen_len = -1; |
|
|
545 |
|
|
546 if (colon) |
|
|
547 frozen_len = z_len; |
|
|
548 else |
|
|
549 { |
|
|
550 if (len == 0) |
|
|
551 frozen_len = 0; |
|
|
552 else |
|
|
553 { |
|
2828
|
554 maybe_convert_one_zero_to_idx (z_len); |
|
1560
|
555 |
|
1650
|
556 max_val = max (); |
|
|
557 min_val = min (); |
|
1560
|
558 |
|
|
559 if (min_val < 0) |
|
|
560 { |
|
|
561 if (tag) |
|
|
562 (*current_liboctave_error_handler) |
|
|
563 ("invalid %s index = %d", tag, min_val+1); |
|
|
564 else |
|
|
565 (*current_liboctave_error_handler) |
|
|
566 ("invalid index = %d", min_val+1); |
|
|
567 |
|
|
568 initialized = 0; |
|
|
569 } |
|
|
570 else if (! resize_ok && max_val >= z_len) |
|
|
571 { |
|
|
572 if (tag) |
|
|
573 (*current_liboctave_error_handler) |
|
|
574 ("invalid %s index = %d", tag, max_val+1); |
|
|
575 else |
|
|
576 (*current_liboctave_error_handler) |
|
|
577 ("invalid index = %d", max_val+1); |
|
|
578 |
|
|
579 initialized = 0; |
|
|
580 } |
|
|
581 else |
|
4461
|
582 { |
|
5781
|
583 if (max_val >= z_len) |
|
4461
|
584 { |
|
|
585 if (tag) |
|
5781
|
586 (*current_liboctave_warning_with_id_handler) |
|
|
587 ("Octave:resize-on-range-error", |
|
|
588 "resizing object with %s index = %d out of bounds", |
|
4461
|
589 tag, max_val+1); |
|
|
590 else |
|
5781
|
591 (*current_liboctave_warning_with_id_handler) |
|
|
592 ("Octave:resize-on-range-error", |
|
|
593 "resizing object with index = %d out of bounds", |
|
4461
|
594 max_val+1); |
|
|
595 } |
|
|
596 |
|
|
597 frozen_len = length (z_len); |
|
|
598 } |
|
1560
|
599 } |
|
|
600 } |
|
|
601 |
|
|
602 frozen = 1; |
|
3680
|
603 |
|
|
604 frozen_at_z_len = z_len ? z_len : len; |
|
1560
|
605 |
|
|
606 return frozen_len; |
|
1
|
607 } |
|
|
608 |
|
|
609 /* |
|
|
610 ;;; Local Variables: *** |
|
|
611 ;;; mode: C++ *** |
|
|
612 ;;; End: *** |
|
|
613 */ |
