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