|
2882
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
|
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 |
|
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
20 |
|
|
21 */ |
|
|
22 |
|
4192
|
23 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
2882
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
|
27 #ifdef HAVE_CONFIG_H |
|
|
28 #include <config.h> |
|
|
29 #endif |
|
|
30 |
|
3503
|
31 #include <iostream> |
|
2882
|
32 |
|
4051
|
33 #include "lo-sstream.h" |
|
2882
|
34 #include "lo-utils.h" |
|
|
35 |
|
4513
|
36 #include "Cell.h" |
|
2882
|
37 #include "defun.h" |
|
|
38 #include "error.h" |
|
|
39 #include "ov-list.h" |
|
|
40 #include "unwind-prot.h" |
|
|
41 |
|
4687
|
42 #include "byte-swap.h" |
|
|
43 #include "ls-oct-ascii.h" |
|
|
44 #include "ls-oct-binary.h" |
|
|
45 #include "ls-hdf5.h" |
|
|
46 #include "ls-utils.h" |
|
|
47 |
|
3219
|
48 DEFINE_OCTAVE_ALLOCATOR (octave_list); |
|
2882
|
49 |
|
4612
|
50 DEFINE_OV_TYPEID_FUNCTIONS_AND_DATA (octave_list, "list", "list"); |
|
2882
|
51 |
|
4513
|
52 octave_list::octave_list (const Cell& c) |
|
4591
|
53 : octave_base_value (), data () |
|
4513
|
54 { |
|
|
55 int n = c.length (); |
|
|
56 |
|
4591
|
57 data.resize (dim_vector (1, n)); |
|
4513
|
58 |
|
|
59 for (int i = 0; i < n; i++) |
|
4591
|
60 data(i) = c(i); |
|
4513
|
61 } |
|
|
62 |
|
2882
|
63 octave_value |
|
4247
|
64 octave_list::subsref (const std::string& type, |
|
4219
|
65 const std::list<octave_value_list>& idx) |
|
3933
|
66 { |
|
|
67 octave_value retval; |
|
|
68 |
|
|
69 switch (type[0]) |
|
|
70 { |
|
|
71 case '(': |
|
|
72 { |
|
|
73 octave_value_list tmp_idx = idx.front (); |
|
|
74 |
|
|
75 if (tmp_idx.length () == 1) |
|
|
76 { |
|
|
77 idx_vector i = tmp_idx (0).index_vector (); |
|
|
78 |
|
4842
|
79 Cell tmp = data.index (i); |
|
|
80 |
|
|
81 retval = octave_value (new octave_list (tmp)); |
|
3933
|
82 } |
|
|
83 else |
|
|
84 error ("only one index allowed for lists"); |
|
|
85 } |
|
|
86 break; |
|
|
87 |
|
|
88 case '{': |
|
|
89 { |
|
|
90 octave_value_list tmp_idx = idx.front (); |
|
|
91 |
|
|
92 if (tmp_idx.length () == 1) |
|
|
93 { |
|
|
94 idx_vector i = tmp_idx (0).index_vector (); |
|
|
95 |
|
4591
|
96 Cell tmp = data.index (i); |
|
3933
|
97 |
|
|
98 if (tmp.length () == 1) |
|
|
99 retval = tmp(0); |
|
4842
|
100 else |
|
|
101 retval = octave_value (tmp, true); |
|
3933
|
102 } |
|
|
103 else |
|
|
104 error ("only one index allowed for lists"); |
|
|
105 } |
|
|
106 break; |
|
|
107 |
|
|
108 case '.': |
|
|
109 { |
|
|
110 std::string nm = type_name (); |
|
|
111 error ("%s cannot be indexed with %c", nm.c_str (), type[0]); |
|
|
112 } |
|
|
113 break; |
|
|
114 |
|
|
115 default: |
|
|
116 panic_impossible (); |
|
|
117 } |
|
|
118 |
|
|
119 return retval.next_subsref (type, idx); |
|
|
120 } |
|
|
121 |
|
|
122 octave_value |
|
|
123 octave_list::do_index_op (const octave_value_list& idx, int resize_ok) |
|
2882
|
124 { |
|
|
125 octave_value retval; |
|
|
126 |
|
|
127 if (idx.length () == 1) |
|
|
128 { |
|
3219
|
129 idx_vector i = idx (0).index_vector (); |
|
2882
|
130 |
|
4591
|
131 retval = octave_list (data.index (i, resize_ok)); |
|
2882
|
132 } |
|
|
133 else |
|
|
134 error ("lists may only be indexed by a single scalar"); |
|
|
135 |
|
|
136 return retval; |
|
|
137 } |
|
|
138 |
|
3933
|
139 octave_value |
|
4247
|
140 octave_list::subsasgn (const std::string& type, |
|
4219
|
141 const std::list<octave_value_list>& idx, |
|
3933
|
142 const octave_value& rhs) |
|
|
143 { |
|
|
144 octave_value retval; |
|
|
145 |
|
|
146 int n = type.length (); |
|
|
147 |
|
|
148 octave_value t_rhs = rhs; |
|
|
149 |
|
|
150 if (n > 1) |
|
|
151 { |
|
|
152 switch (type[0]) |
|
|
153 { |
|
|
154 case '(': |
|
|
155 { |
|
|
156 octave_value tmp = do_index_op (idx.front (), true); |
|
|
157 |
|
|
158 if (! tmp.is_defined ()) |
|
|
159 tmp = octave_value::empty_conv (type.substr (1), rhs); |
|
|
160 |
|
|
161 if (! error_state) |
|
|
162 { |
|
4219
|
163 std::list<octave_value_list> next_idx (idx); |
|
3933
|
164 |
|
4219
|
165 next_idx.erase (next_idx.begin ()); |
|
3933
|
166 |
|
|
167 t_rhs = tmp.subsasgn (type.substr (1), next_idx, rhs); |
|
|
168 } |
|
|
169 } |
|
|
170 break; |
|
|
171 |
|
|
172 case '{': |
|
|
173 case '.': |
|
|
174 { |
|
|
175 std::string nm = type_name (); |
|
|
176 error ("%s cannot be indexed with %c", nm.c_str (), type[0]); |
|
|
177 } |
|
|
178 break; |
|
|
179 |
|
|
180 default: |
|
|
181 panic_impossible (); |
|
|
182 } |
|
|
183 } |
|
|
184 |
|
3940
|
185 if (! error_state) |
|
3933
|
186 { |
|
3940
|
187 switch (type[0]) |
|
|
188 { |
|
|
189 case '(': |
|
|
190 { |
|
|
191 octave_value_list i = idx.front (); |
|
3933
|
192 |
|
4769
|
193 int len = i.length (); |
|
|
194 |
|
|
195 for (int k = 0; k < len; k++) |
|
|
196 data.set_index (i(k).index_vector ()); |
|
|
197 |
|
|
198 ::assign (data, Cell (t_rhs), Cell::resize_fill_value ()); |
|
3933
|
199 |
|
3940
|
200 retval = octave_value (this, count + 1); |
|
|
201 } |
|
|
202 break; |
|
3933
|
203 |
|
3940
|
204 case '{': |
|
|
205 case '.': |
|
|
206 { |
|
|
207 std::string nm = type_name (); |
|
|
208 error ("%s cannot be indexed with %c", nm.c_str (), type[0]); |
|
|
209 } |
|
|
210 break; |
|
3933
|
211 |
|
3940
|
212 default: |
|
|
213 panic_impossible (); |
|
|
214 } |
|
3933
|
215 } |
|
|
216 |
|
|
217 return retval; |
|
|
218 } |
|
|
219 |
|
2882
|
220 void |
|
3196
|
221 octave_list::assign (const octave_value_list& idx, const octave_value& rhs) |
|
|
222 { |
|
|
223 if (idx.length () == 1) |
|
|
224 { |
|
3202
|
225 int i = idx(0).int_value (true); |
|
3196
|
226 |
|
|
227 if (! error_state) |
|
|
228 { |
|
4591
|
229 int n = data.length (); |
|
3196
|
230 |
|
4461
|
231 if (i > 0) |
|
|
232 { |
|
|
233 if (Vwarn_resize_on_range_error && i > n) |
|
|
234 warning ("list index = %d out of range", i); |
|
|
235 |
|
4591
|
236 data(i-1) = rhs; |
|
4461
|
237 } |
|
3196
|
238 else |
|
3202
|
239 error ("list index = %d out of range", i); |
|
3196
|
240 } |
|
3202
|
241 else |
|
|
242 error ("list index must be an integer"); |
|
3196
|
243 } |
|
|
244 else |
|
|
245 error ("lists may only be indexed by a single scalar"); |
|
|
246 } |
|
|
247 |
|
4791
|
248 size_t |
|
|
249 octave_list::byte_size (void) const |
|
|
250 { |
|
|
251 size_t retval = 0; |
|
|
252 |
|
|
253 for (int i = 0; i < numel (); i++) |
|
|
254 retval += data(i).byte_size (); |
|
|
255 |
|
|
256 return retval; |
|
|
257 } |
|
|
258 |
|
4591
|
259 octave_value_list |
|
|
260 octave_list::list_value (void) const |
|
|
261 { |
|
|
262 octave_value_list retval; |
|
|
263 |
|
|
264 int n = data.length (); |
|
|
265 |
|
|
266 retval.resize (n); |
|
|
267 |
|
|
268 for (int i = 0; i < n; i++) |
|
|
269 retval(i) = data(i); |
|
|
270 |
|
|
271 return retval; |
|
|
272 } |
|
|
273 |
|
3196
|
274 void |
|
3523
|
275 octave_list::print (std::ostream& os, bool) const |
|
2901
|
276 { |
|
|
277 print_raw (os); |
|
|
278 } |
|
|
279 |
|
|
280 void |
|
3523
|
281 octave_list::print_raw (std::ostream& os, bool) const |
|
2882
|
282 { |
|
2985
|
283 unwind_protect::begin_frame ("octave_list_print"); |
|
2882
|
284 |
|
4591
|
285 int n = data.length (); |
|
2882
|
286 |
|
3196
|
287 if (n > 0) |
|
2882
|
288 { |
|
3196
|
289 indent (os); |
|
|
290 os << "("; |
|
|
291 newline (os); |
|
|
292 |
|
|
293 increment_indent_level (); |
|
2916
|
294 |
|
3196
|
295 for (int i = 0; i < n; i++) |
|
|
296 { |
|
4051
|
297 OSSTREAM buf; |
|
|
298 |
|
|
299 buf << "[" << i+1 << "]" << OSSTREAM_ENDS; |
|
2882
|
300 |
|
4591
|
301 octave_value val = data(i); |
|
2916
|
302 |
|
4051
|
303 val.print_with_name (os, OSSTREAM_STR (buf)); |
|
3196
|
304 |
|
4051
|
305 OSSTREAM_FREEZE (buf); |
|
3196
|
306 } |
|
2882
|
307 |
|
3196
|
308 decrement_indent_level (); |
|
2882
|
309 |
|
3196
|
310 indent (os); |
|
|
311 os << ")"; |
|
|
312 } |
|
|
313 else |
|
|
314 os << "()"; |
|
|
315 |
|
2901
|
316 newline (os); |
|
2882
|
317 |
|
2985
|
318 unwind_protect::run_frame ("octave_list_print"); |
|
2882
|
319 } |
|
|
320 |
|
2901
|
321 bool |
|
3523
|
322 octave_list::print_name_tag (std::ostream& os, const std::string& name) const |
|
2901
|
323 { |
|
|
324 indent (os); |
|
4591
|
325 if (data.length () == 0) |
|
3196
|
326 os << name << " = "; |
|
|
327 else |
|
|
328 { |
|
|
329 os << name << " ="; |
|
|
330 newline (os); |
|
|
331 } |
|
2901
|
332 return false; |
|
|
333 } |
|
|
334 |
|
2993
|
335 DEFUN (list, args, , |
|
3447
|
336 "-*- texinfo -*-\n\ |
|
3448
|
337 @deftypefn {Built-in Function} {} list (@var{a1}, @var{a2}, @dots{})\n\ |
|
3447
|
338 Create a new list with elements given by the arguments @var{a1},\n\ |
|
|
339 @var{a2}, @dots{}.\n\ |
|
|
340 @end deftypefn") |
|
2882
|
341 { |
|
4591
|
342 static bool warned = false; |
|
|
343 |
|
|
344 if (! warned) |
|
|
345 { |
|
|
346 warning ("list objects are deprecated; use cell arrays instead"); |
|
|
347 warned = true; |
|
|
348 } |
|
|
349 |
|
2882
|
350 return octave_value (args); |
|
|
351 } |
|
|
352 |
|
3219
|
353 DEFUN (nth, args, , |
|
3447
|
354 "-*- texinfo -*-\n\ |
|
|
355 @deftypefn {Built-in Function} {} nth (@var{list}, @var{n})\n\ |
|
|
356 Return the @var{n}-th element of @var{list}.\n\ |
|
|
357 @end deftypefn") |
|
3219
|
358 { |
|
|
359 octave_value retval; |
|
|
360 |
|
|
361 if (args.length () == 2) |
|
|
362 { |
|
|
363 octave_value_list lst = args(0).list_value (); |
|
|
364 |
|
|
365 if (! error_state) |
|
|
366 { |
|
|
367 int n = args(1).int_value (true); |
|
|
368 |
|
|
369 if (! error_state) |
|
|
370 { |
|
|
371 if (n > 0 && n <= lst.length ()) |
|
|
372 retval = lst(n-1); |
|
|
373 else |
|
|
374 error ("nth: index = %d out of range", n); |
|
|
375 } |
|
|
376 else |
|
|
377 error ("nth: second argument must be an integer"); |
|
|
378 } |
|
|
379 else |
|
|
380 error ("nth: first argument must be a list"); |
|
|
381 } |
|
|
382 else |
|
|
383 print_usage ("nth"); |
|
|
384 |
|
|
385 return retval; |
|
|
386 } |
|
|
387 |
|
2882
|
388 DEFUN (append, args, , |
|
3447
|
389 "-*- texinfo -*-\n\ |
|
|
390 @deftypefn {Built-in Function} {} append (@var{list}, @var{a1}, @var{a2}, @dots{})\n\ |
|
|
391 Return a new list created by appending @var{a1}, @var{a1}, @dots{}, to\n\ |
|
|
392 @var{list}. If any of the arguments to be appended is a list, its\n\ |
|
|
393 elements are appended individually. For example,\n\ |
|
2882
|
394 \n\ |
|
3447
|
395 @example\n\ |
|
|
396 x = list (1, 2);\n\ |
|
|
397 y = list (3, 4);\n\ |
|
|
398 append (x, y);\n\ |
|
|
399 @end example\n\ |
|
3219
|
400 \n\ |
|
3447
|
401 @noindent\n\ |
|
|
402 results in the list containing the four elements @samp{(1 2 3 4)}, not\n\ |
|
|
403 a list containing the three elements @samp{(1 2 (3 4))}.\n\ |
|
|
404 @end deftypefn") |
|
2882
|
405 { |
|
|
406 octave_value retval; |
|
|
407 |
|
|
408 int nargin = args.length (); |
|
|
409 |
|
|
410 if (nargin > 1) |
|
|
411 { |
|
|
412 octave_value_list tmp = args(0).list_value (); |
|
|
413 |
|
|
414 if (! error_state) |
|
|
415 { |
|
|
416 for (int i = 1; i < nargin; i++) |
|
3219
|
417 { |
|
|
418 octave_value ov = args(i); |
|
|
419 |
|
|
420 if (ov.is_list ()) |
|
|
421 tmp.append (ov.list_value ()); |
|
|
422 else |
|
|
423 tmp.append (ov); |
|
|
424 } |
|
2882
|
425 |
|
4233
|
426 retval = octave_value (tmp); |
|
2882
|
427 } |
|
|
428 } |
|
|
429 else |
|
|
430 print_usage ("append"); |
|
|
431 |
|
|
432 return retval; |
|
|
433 } |
|
|
434 |
|
|
435 DEFUN (reverse, args, , |
|
3447
|
436 "-*- texinfo -*-\n\ |
|
|
437 @deftypefn {Built-in Function} {} reverse (@var{list})\n\ |
|
|
438 Return a new list created by reversing the elements of @var{list}.\n\ |
|
|
439 @end deftypefn") |
|
2882
|
440 { |
|
|
441 octave_value retval; |
|
|
442 |
|
|
443 int nargin = args.length (); |
|
|
444 |
|
|
445 if (nargin == 1) |
|
|
446 { |
|
|
447 octave_value_list tmp = args(0).list_value (); |
|
|
448 |
|
|
449 if (! error_state) |
|
4233
|
450 retval = octave_value (tmp.reverse ()); |
|
2882
|
451 } |
|
|
452 else |
|
|
453 print_usage ("reverse"); |
|
|
454 |
|
|
455 return retval; |
|
|
456 } |
|
|
457 |
|
3196
|
458 DEFUN (splice, args, , |
|
3447
|
459 "-*- texinfo -*-\n\ |
|
|
460 @deftypefn {Built-in Function} {} splice (@var{list_1}, @var{offset}, @var{length}, @var{list_2})\n\ |
|
|
461 Replace @var{length} elements of @var{list_1} beginning at\n\ |
|
|
462 @var{offset} with the contents of @var{list_2} (if any). If\n\ |
|
|
463 @var{length} is omitted, all elements from @var{offset} to the end of\n\ |
|
|
464 @var{list_1} are replaced. As a special case, if @var{offset} is one\n\ |
|
|
465 greater than the length of @var{list_1} and @var{length} is 0, splice\n\ |
|
3448
|
466 is equivalent to @code{append (@var{list_1}, @var{list_2})}.\n\ |
|
3447
|
467 @end deftypefn") |
|
3196
|
468 { |
|
|
469 octave_value retval; |
|
|
470 |
|
|
471 int nargin = args.length (); |
|
|
472 |
|
|
473 if (nargin > 1 && nargin < 5) |
|
|
474 { |
|
|
475 octave_value_list list_1 = args(0).list_value (); |
|
|
476 |
|
|
477 if (! error_state) |
|
|
478 { |
|
3202
|
479 int offset = args(1).int_value (true); |
|
3196
|
480 |
|
|
481 if (! error_state) |
|
|
482 { |
|
3202
|
483 offset--; |
|
|
484 |
|
|
485 int length = 0; |
|
|
486 |
|
|
487 octave_value_list list_2; |
|
3196
|
488 |
|
3202
|
489 if (nargin < 3) |
|
|
490 length = list_1.length () - offset; |
|
|
491 else |
|
|
492 { |
|
|
493 length = args(2).int_value (true); |
|
3196
|
494 |
|
3202
|
495 if (! error_state) |
|
3196
|
496 { |
|
3202
|
497 if (nargin == 4) |
|
|
498 { |
|
|
499 list_2 = args(3).list_value (); |
|
3196
|
500 |
|
3202
|
501 if (error_state) |
|
|
502 error ("splice: fourth argument must be a list"); |
|
3196
|
503 } |
|
|
504 } |
|
3202
|
505 else |
|
|
506 error ("splice: LENGTH must be an integer"); |
|
|
507 } |
|
3196
|
508 |
|
3202
|
509 if (! error_state) |
|
4233
|
510 retval = octave_value (list_1.splice (offset, length, list_2)); |
|
3196
|
511 } |
|
|
512 else |
|
|
513 error ("splice: OFFSET must be an integer"); |
|
|
514 } |
|
|
515 else |
|
|
516 error ("splice: first argument must be a list"); |
|
|
517 } |
|
|
518 else |
|
|
519 print_usage ("splice"); |
|
|
520 |
|
|
521 return retval; |
|
|
522 } |
|
|
523 |
|
4687
|
524 bool |
|
|
525 octave_list::save_ascii (std::ostream& os, bool& infnan_warned, |
|
|
526 bool strip_nan_and_inf) |
|
|
527 { |
|
|
528 octave_value_list lst = list_value (); |
|
|
529 os << "# length: " << lst.length () << "\n"; |
|
|
530 |
|
|
531 for (int i = 0; i < lst.length (); ++i) |
|
|
532 { |
|
|
533 // should we use lst.name_tags () to label the elements? |
|
|
534 char s[20]; |
|
|
535 sprintf (s, "_%d", i); |
|
|
536 bool b = save_ascii_data (os, lst (i), s, infnan_warned, |
|
|
537 strip_nan_and_inf, 0, 0); |
|
|
538 |
|
|
539 if (! b) |
|
|
540 return false; |
|
|
541 } |
|
|
542 |
|
|
543 return true; |
|
|
544 } |
|
|
545 |
|
|
546 bool |
|
|
547 octave_list::load_ascii (std::istream& is) |
|
|
548 { |
|
|
549 int len = 0; |
|
|
550 bool success = true; |
|
|
551 |
|
|
552 if (extract_keyword (is, "length", len) && len >= 0) |
|
|
553 { |
|
|
554 if (len > 0) |
|
|
555 { |
|
|
556 octave_value_list lst; |
|
|
557 |
|
|
558 for (int j = 0; j < len; j++) |
|
|
559 { |
|
|
560 octave_value t2; |
|
|
561 bool dummy; |
|
|
562 |
|
|
563 // recurse to read list elements |
|
|
564 std::string nm |
|
|
565 = read_ascii_data (is, std::string (), dummy, t2, count); |
|
|
566 |
|
|
567 if (!is) |
|
|
568 break; |
|
|
569 |
|
|
570 lst.append (t2); |
|
|
571 } |
|
|
572 |
|
|
573 if (is) |
|
|
574 data = lst; |
|
|
575 else |
|
|
576 { |
|
|
577 error ("load: failed to load list"); |
|
|
578 success = false; |
|
|
579 } |
|
|
580 } |
|
|
581 else if (len == 0 ) |
|
|
582 data = Cell (0, 0); |
|
|
583 else |
|
|
584 panic_impossible (); |
|
|
585 } |
|
|
586 else { |
|
|
587 error ("load: failed to extract number of elements in list"); |
|
|
588 success = false; |
|
|
589 } |
|
|
590 |
|
|
591 return success; |
|
|
592 } |
|
|
593 |
|
|
594 bool |
|
|
595 octave_list::save_binary (std::ostream& os, bool& save_as_floats) |
|
|
596 { |
|
|
597 octave_value_list lst = list_value (); |
|
|
598 |
|
|
599 FOUR_BYTE_INT len = lst.length(); |
|
|
600 os.write (X_CAST (char *, &len), 4); |
|
|
601 |
|
|
602 for (int i = 0; i < lst.length (); i++) |
|
|
603 { |
|
|
604 // should we use lst.name_tags () to label the elements? |
|
|
605 char s[20]; |
|
|
606 sprintf (s, "_%d", i); |
|
|
607 |
|
|
608 // Recurse to print sub-value. |
|
|
609 bool b = save_binary_data (os, lst(i), s, "", 0, save_as_floats); |
|
|
610 |
|
|
611 if (! b) |
|
|
612 return false; |
|
|
613 } |
|
|
614 |
|
|
615 return true; |
|
|
616 } |
|
|
617 |
|
|
618 bool |
|
|
619 octave_list::load_binary (std::istream& is, bool swap, |
|
|
620 oct_mach_info::float_format fmt) |
|
|
621 { |
|
|
622 FOUR_BYTE_INT len; |
|
|
623 if (! is.read (X_CAST (char *, &len), 4)) |
|
|
624 return false; |
|
|
625 if (swap) |
|
4944
|
626 swap_bytes<4> (&len); |
|
4687
|
627 |
|
|
628 if (len > 0) |
|
|
629 { |
|
|
630 octave_value_list lst; |
|
|
631 |
|
|
632 for (int i = 0; i < len; i++) |
|
|
633 { |
|
|
634 octave_value t2; |
|
|
635 bool dummy; |
|
|
636 std::string doc; |
|
|
637 |
|
|
638 // recurse to read list elements |
|
|
639 std::string nm = read_binary_data (is, swap, fmt, std::string (), |
|
|
640 dummy, t2, doc); |
|
|
641 |
|
|
642 if (!is) |
|
|
643 return false; |
|
|
644 |
|
|
645 lst.append(t2); |
|
|
646 } |
|
|
647 |
|
|
648 if (is) |
|
|
649 data = lst; |
|
|
650 else |
|
|
651 { |
|
|
652 error ("load: failed to load list"); |
|
|
653 return false; |
|
|
654 } |
|
|
655 |
|
|
656 } |
|
|
657 else if (len == 0 ) |
|
|
658 data = Cell (0, 0); |
|
|
659 else |
|
|
660 return false; |
|
|
661 |
|
|
662 return true; |
|
|
663 } |
|
|
664 |
|
|
665 #if defined (HAVE_HDF5) |
|
4944
|
666 |
|
4687
|
667 bool |
|
|
668 octave_list::save_hdf5 (hid_t loc_id, const char *name, bool save_as_floats) |
|
|
669 { |
|
|
670 hid_t data_hid = -1; |
|
|
671 |
|
|
672 data_hid = H5Gcreate (loc_id, name, 0); |
|
|
673 if (data_hid < 0) return false; |
|
|
674 |
|
|
675 // recursively add each element of the list to this group |
|
|
676 octave_value_list lst = list_value (); |
|
|
677 |
|
|
678 for (int i = 0; i < lst.length (); ++i) |
|
|
679 { |
|
|
680 // should we use lst.name_tags () to label the elements? |
|
|
681 char s[20]; |
|
|
682 sprintf (s, "_%d", i); |
|
|
683 bool retval2 = add_hdf5_data (data_hid, lst (i), s, "", |
|
|
684 false, save_as_floats); |
|
|
685 if (! retval2) |
|
|
686 break; |
|
|
687 } |
|
|
688 |
|
|
689 H5Gclose (data_hid); |
|
4837
|
690 |
|
4687
|
691 return true; |
|
|
692 } |
|
|
693 |
|
|
694 bool |
|
|
695 octave_list::load_hdf5 (hid_t loc_id, const char *name, |
|
|
696 bool have_h5giterate_bug) |
|
|
697 { |
|
|
698 bool retval = false; |
|
|
699 |
|
|
700 hdf5_callback_data dsub; |
|
|
701 |
|
4696
|
702 herr_t retval2 = -1; |
|
4687
|
703 octave_value_list lst; |
|
|
704 int current_item = 0; |
|
4696
|
705 #ifdef HAVE_H5GGET_NUM_OBJS |
|
|
706 hsize_t num_obj = 0; |
|
|
707 H5Gget_num_objs (loc_id, &num_obj); |
|
|
708 |
|
|
709 while (current_item < static_cast<int> (num_obj) |
|
|
710 && (retval2 = H5Giterate (loc_id, name, ¤t_item, |
|
|
711 hdf5_read_next_data, &dsub)) > 0) |
|
|
712 #else |
|
4687
|
713 while ((retval2 = H5Giterate (loc_id, name, ¤t_item, |
|
|
714 hdf5_read_next_data, &dsub)) > 0) |
|
4696
|
715 #endif |
|
4687
|
716 { |
|
|
717 lst.append (dsub.tc); |
|
|
718 |
|
|
719 if (have_h5giterate_bug) |
|
|
720 current_item++; // H5Giterate returned the last index processed |
|
|
721 } |
|
|
722 |
|
|
723 if (retval2 >= 0) |
|
|
724 { |
|
|
725 data = lst; |
|
|
726 retval = true; |
|
|
727 } |
|
|
728 |
|
|
729 return retval; |
|
|
730 } |
|
4944
|
731 |
|
4687
|
732 #endif |
|
|
733 |
|
2882
|
734 /* |
|
|
735 ;;; Local Variables: *** |
|
|
736 ;;; mode: C++ *** |
|
|
737 ;;; End: *** |
|
|
738 */ |
