|
2376
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
2376
|
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. |
|
2376
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
3503
|
28 #include <iostream> |
|
2376
|
29 |
|
3933
|
30 #include "Cell.h" |
|
4358
|
31 #include "defun.h" |
|
2376
|
32 #include "error.h" |
|
4358
|
33 #include "gripes.h" |
|
2979
|
34 #include "oct-lvalue.h" |
|
3932
|
35 #include "ov-list.h" |
|
2376
|
36 #include "ov-struct.h" |
|
|
37 #include "unwind-prot.h" |
|
6811
|
38 #include "utils.h" |
|
2948
|
39 #include "variables.h" |
|
2376
|
40 |
|
4750
|
41 #include "Array-util.h" |
|
|
42 |
|
4687
|
43 #include "byte-swap.h" |
|
|
44 #include "ls-oct-ascii.h" |
|
|
45 #include "ls-oct-binary.h" |
|
|
46 #include "ls-hdf5.h" |
|
|
47 #include "ls-utils.h" |
|
5759
|
48 #include "pr-output.h" |
|
4687
|
49 |
|
3219
|
50 DEFINE_OCTAVE_ALLOCATOR(octave_struct); |
|
2376
|
51 |
|
4612
|
52 DEFINE_OV_TYPEID_FUNCTIONS_AND_DATA(octave_struct, "struct", "struct"); |
|
2376
|
53 |
|
4513
|
54 Cell |
|
3933
|
55 octave_struct::dotref (const octave_value_list& idx) |
|
2962
|
56 { |
|
4513
|
57 Cell retval; |
|
3933
|
58 |
|
|
59 assert (idx.length () == 1); |
|
2962
|
60 |
|
3933
|
61 std::string nm = idx(0).string_value (); |
|
|
62 |
|
4219
|
63 Octave_map::const_iterator p = map.seek (nm); |
|
2376
|
64 |
|
4219
|
65 if (p != map.end ()) |
|
3933
|
66 retval = map.contents (p); |
|
|
67 else |
|
2376
|
68 error ("structure has no member `%s'", nm.c_str ()); |
|
|
69 |
|
|
70 return retval; |
|
|
71 } |
|
|
72 |
|
4513
|
73 #if 0 |
|
3933
|
74 static void |
|
|
75 gripe_invalid_index (void) |
|
|
76 { |
|
|
77 error ("invalid index for structure array"); |
|
|
78 } |
|
4513
|
79 #endif |
|
3933
|
80 |
|
|
81 static void |
|
|
82 gripe_invalid_index_for_assignment (void) |
|
|
83 { |
|
|
84 error ("invalid index for structure array assignment"); |
|
|
85 } |
|
|
86 |
|
|
87 static void |
|
|
88 gripe_invalid_index_type (const std::string& nm, char t) |
|
|
89 { |
|
|
90 error ("%s cannot be indexed with %c", nm.c_str (), t); |
|
|
91 } |
|
|
92 |
|
|
93 static void |
|
|
94 gripe_failed_assignment (void) |
|
|
95 { |
|
|
96 error ("assignment to structure element failed"); |
|
|
97 } |
|
|
98 |
|
4994
|
99 octave_value_list |
|
4247
|
100 octave_struct::subsref (const std::string& type, |
|
4994
|
101 const std::list<octave_value_list>& idx, |
|
|
102 int nargout) |
|
3933
|
103 { |
|
4994
|
104 octave_value_list retval; |
|
3933
|
105 |
|
|
106 int skip = 1; |
|
|
107 |
|
|
108 switch (type[0]) |
|
|
109 { |
|
|
110 case '(': |
|
|
111 { |
|
|
112 if (type.length () > 1 && type[1] == '.') |
|
|
113 { |
|
4219
|
114 std::list<octave_value_list>::const_iterator p = idx.begin (); |
|
|
115 octave_value_list key_idx = *++p; |
|
3933
|
116 |
|
4513
|
117 Cell tmp = dotref (key_idx); |
|
3933
|
118 |
|
|
119 if (! error_state) |
|
|
120 { |
|
4513
|
121 Cell t = tmp.index (idx.front ()); |
|
3933
|
122 |
|
4994
|
123 retval(0) = (t.length () == 1) ? t(0) : octave_value (t, true); |
|
3933
|
124 |
|
4513
|
125 // We handled two index elements, so tell |
|
|
126 // next_subsref to skip both of them. |
|
3933
|
127 |
|
4513
|
128 skip++; |
|
3933
|
129 } |
|
|
130 } |
|
|
131 else |
|
4994
|
132 retval(0) = map.index (idx.front ()); |
|
3933
|
133 } |
|
|
134 break; |
|
|
135 |
|
|
136 case '.': |
|
|
137 { |
|
5592
|
138 if (map.numel() > 0) |
|
|
139 { |
|
|
140 Cell t = dotref (idx.front ()); |
|
3933
|
141 |
|
5592
|
142 retval(0) = (t.length () == 1) ? t(0) : octave_value (t, true); |
|
|
143 } |
|
3933
|
144 } |
|
|
145 break; |
|
|
146 |
|
|
147 case '{': |
|
|
148 gripe_invalid_index_type (type_name (), type[0]); |
|
|
149 break; |
|
|
150 |
|
|
151 default: |
|
|
152 panic_impossible (); |
|
|
153 } |
|
|
154 |
|
5775
|
155 // FIXME -- perhaps there should be an |
|
4994
|
156 // octave_value_list::next_subsref member function? See also |
|
|
157 // octave_user_function::subsref. |
|
|
158 |
|
|
159 if (idx.size () > 1) |
|
5028
|
160 retval = retval(0).next_subsref (nargout, type, idx, skip); |
|
3933
|
161 |
|
|
162 return retval; |
|
|
163 } |
|
|
164 |
|
|
165 octave_value |
|
4513
|
166 octave_struct::numeric_conv (const Cell& val, |
|
3933
|
167 const std::string& type) |
|
|
168 { |
|
|
169 octave_value retval; |
|
|
170 |
|
|
171 if (val.length () == 1) |
|
|
172 { |
|
|
173 retval = val(0); |
|
|
174 |
|
|
175 if (type.length () > 0 && type[0] == '.' && ! retval.is_map ()) |
|
|
176 retval = Octave_map (); |
|
|
177 } |
|
|
178 else |
|
|
179 gripe_invalid_index_for_assignment (); |
|
|
180 |
|
|
181 return retval; |
|
|
182 } |
|
|
183 |
|
|
184 octave_value |
|
4247
|
185 octave_struct::subsasgn (const std::string& type, |
|
4219
|
186 const std::list<octave_value_list>& idx, |
|
3933
|
187 const octave_value& rhs) |
|
2376
|
188 { |
|
3933
|
189 octave_value retval; |
|
|
190 |
|
|
191 int n = type.length (); |
|
|
192 |
|
|
193 octave_value t_rhs = rhs; |
|
|
194 |
|
|
195 if (n > 1 && ! (type.length () == 2 && type[0] == '(' && type[1] == '.')) |
|
|
196 { |
|
|
197 switch (type[0]) |
|
|
198 { |
|
|
199 case '(': |
|
|
200 { |
|
|
201 if (type.length () > 1 && type[1] == '.') |
|
|
202 { |
|
4219
|
203 std::list<octave_value_list>::const_iterator p = idx.begin (); |
|
|
204 octave_value_list t_idx = *p; |
|
3933
|
205 |
|
4513
|
206 octave_value_list key_idx = *++p; |
|
|
207 |
|
|
208 assert (key_idx.length () == 1); |
|
3933
|
209 |
|
4513
|
210 std::string key = key_idx(0).string_value (); |
|
3933
|
211 |
|
4513
|
212 octave_value u; |
|
3933
|
213 |
|
4513
|
214 if (! map.contains (key)) |
|
|
215 u = octave_value::empty_conv (type.substr (2), rhs); |
|
|
216 else |
|
|
217 { |
|
4675
|
218 Cell map_val = map.contents (key); |
|
3933
|
219 |
|
4513
|
220 Cell map_elt = map_val.index (idx.front (), true); |
|
3933
|
221 |
|
4513
|
222 u = numeric_conv (map_elt, type.substr (2)); |
|
|
223 } |
|
3933
|
224 |
|
4513
|
225 if (! error_state) |
|
|
226 { |
|
|
227 std::list<octave_value_list> next_idx (idx); |
|
3933
|
228 |
|
4513
|
229 // We handled two index elements, so subsasgn to |
|
|
230 // needs to skip both of them. |
|
3933
|
231 |
|
4513
|
232 next_idx.erase (next_idx.begin ()); |
|
|
233 next_idx.erase (next_idx.begin ()); |
|
4059
|
234 |
|
4513
|
235 u.make_unique (); |
|
|
236 |
|
|
237 t_rhs = u.subsasgn (type.substr (2), next_idx, rhs); |
|
3933
|
238 } |
|
|
239 } |
|
|
240 else |
|
|
241 gripe_invalid_index_for_assignment (); |
|
|
242 } |
|
|
243 break; |
|
|
244 |
|
|
245 case '.': |
|
|
246 { |
|
|
247 octave_value_list key_idx = idx.front (); |
|
|
248 |
|
|
249 assert (key_idx.length () == 1); |
|
|
250 |
|
|
251 std::string key = key_idx(0).string_value (); |
|
|
252 |
|
|
253 octave_value u; |
|
|
254 |
|
|
255 if (! map.contains (key)) |
|
|
256 u = octave_value::empty_conv (type.substr (1), rhs); |
|
|
257 else |
|
|
258 { |
|
4675
|
259 Cell map_val = map.contents (key); |
|
3933
|
260 |
|
|
261 u = numeric_conv (map_val, type.substr (1)); |
|
|
262 } |
|
|
263 |
|
|
264 if (! error_state) |
|
|
265 { |
|
4219
|
266 std::list<octave_value_list> next_idx (idx); |
|
3933
|
267 |
|
4219
|
268 next_idx.erase (next_idx.begin ()); |
|
3933
|
269 |
|
4059
|
270 u.make_unique (); |
|
|
271 |
|
3933
|
272 t_rhs = u.subsasgn (type.substr (1), next_idx, rhs); |
|
|
273 } |
|
|
274 } |
|
|
275 break; |
|
|
276 |
|
|
277 case '{': |
|
|
278 gripe_invalid_index_type (type_name (), type[0]); |
|
|
279 break; |
|
|
280 |
|
|
281 default: |
|
|
282 panic_impossible (); |
|
|
283 } |
|
|
284 } |
|
|
285 |
|
|
286 if (! error_state) |
|
|
287 { |
|
|
288 switch (type[0]) |
|
|
289 { |
|
|
290 case '(': |
|
|
291 { |
|
|
292 if (n > 1 && type[1] == '.') |
|
|
293 { |
|
4219
|
294 std::list<octave_value_list>::const_iterator p = idx.begin (); |
|
|
295 octave_value_list key_idx = *++p; |
|
3933
|
296 |
|
|
297 assert (key_idx.length () == 1); |
|
|
298 |
|
|
299 std::string key = key_idx(0).string_value (); |
|
|
300 |
|
|
301 if (! error_state) |
|
|
302 { |
|
4513
|
303 map.assign (idx.front (), key, t_rhs); |
|
3933
|
304 |
|
4513
|
305 if (! error_state) |
|
5759
|
306 { |
|
|
307 count++; |
|
|
308 retval = octave_value (this); |
|
|
309 } |
|
3933
|
310 else |
|
4513
|
311 gripe_failed_assignment (); |
|
3933
|
312 } |
|
|
313 else |
|
|
314 gripe_failed_assignment (); |
|
|
315 } |
|
|
316 else |
|
4197
|
317 { |
|
5592
|
318 if (t_rhs.is_map()) |
|
4197
|
319 { |
|
5592
|
320 Octave_map rhs_map = t_rhs.map_value (); |
|
4197
|
321 |
|
|
322 if (! error_state) |
|
5592
|
323 { |
|
|
324 map.assign (idx.front (), rhs_map); |
|
|
325 |
|
|
326 if (! error_state) |
|
5759
|
327 { |
|
|
328 count++; |
|
|
329 retval = octave_value (this); |
|
|
330 } |
|
5592
|
331 else |
|
|
332 gripe_failed_assignment (); |
|
|
333 } |
|
4197
|
334 else |
|
5592
|
335 error ("invalid structure assignment"); |
|
4197
|
336 } |
|
4513
|
337 else |
|
5592
|
338 { |
|
|
339 if (t_rhs.is_empty()) |
|
|
340 { |
|
|
341 map.maybe_delete_elements (idx.front()); |
|
|
342 |
|
|
343 if (! error_state) |
|
5759
|
344 { |
|
|
345 count++; |
|
|
346 retval = octave_value (this); |
|
|
347 } |
|
5592
|
348 else |
|
|
349 gripe_failed_assignment (); |
|
|
350 } |
|
|
351 else |
|
|
352 error ("invalid structure assignment"); |
|
|
353 } |
|
4197
|
354 } |
|
3933
|
355 } |
|
|
356 break; |
|
|
357 |
|
|
358 case '.': |
|
|
359 { |
|
|
360 octave_value_list key_idx = idx.front (); |
|
|
361 |
|
|
362 assert (key_idx.length () == 1); |
|
|
363 |
|
|
364 std::string key = key_idx(0).string_value (); |
|
|
365 |
|
|
366 map.assign (key, t_rhs); |
|
|
367 |
|
|
368 if (! error_state) |
|
5759
|
369 { |
|
|
370 count++; |
|
|
371 retval = octave_value (this); |
|
|
372 } |
|
3933
|
373 else |
|
|
374 gripe_failed_assignment (); |
|
|
375 } |
|
|
376 break; |
|
|
377 |
|
|
378 case '{': |
|
|
379 gripe_invalid_index_type (type_name (), type[0]); |
|
|
380 break; |
|
|
381 |
|
|
382 default: |
|
|
383 panic_impossible (); |
|
|
384 } |
|
|
385 } |
|
|
386 else |
|
|
387 gripe_failed_assignment (); |
|
|
388 |
|
|
389 return retval; |
|
2376
|
390 } |
|
|
391 |
|
4791
|
392 size_t |
|
|
393 octave_struct::byte_size (void) const |
|
|
394 { |
|
|
395 // Neglect the size of the fieldnames. |
|
|
396 |
|
|
397 size_t retval = 0; |
|
|
398 |
|
|
399 for (Octave_map::const_iterator p = map.begin (); p != map.end (); p++) |
|
|
400 { |
|
|
401 std::string key = map.key (p); |
|
|
402 |
|
|
403 octave_value val = octave_value (map.contents (p)); |
|
|
404 |
|
|
405 retval += val.byte_size (); |
|
|
406 } |
|
|
407 |
|
|
408 return retval; |
|
|
409 } |
|
|
410 |
|
2376
|
411 void |
|
3523
|
412 octave_struct::print (std::ostream& os, bool) const |
|
2901
|
413 { |
|
|
414 print_raw (os); |
|
|
415 } |
|
|
416 |
|
|
417 void |
|
3523
|
418 octave_struct::print_raw (std::ostream& os, bool) const |
|
2376
|
419 { |
|
2985
|
420 unwind_protect::begin_frame ("octave_struct_print"); |
|
2376
|
421 |
|
|
422 unwind_protect_int (Vstruct_levels_to_print); |
|
|
423 |
|
3961
|
424 if (Vstruct_levels_to_print >= 0) |
|
2376
|
425 { |
|
5598
|
426 bool print_keys_only = (Vstruct_levels_to_print == 0 |
|
|
427 || map.numel () == 0); |
|
3961
|
428 |
|
|
429 Vstruct_levels_to_print--; |
|
|
430 |
|
2901
|
431 indent (os); |
|
|
432 os << "{"; |
|
|
433 newline (os); |
|
2376
|
434 |
|
2901
|
435 increment_indent_level (); |
|
2376
|
436 |
|
5598
|
437 octave_idx_type n = map.numel (); |
|
3932
|
438 |
|
5598
|
439 if (n == 0 || (n > 1 && print_keys_only)) |
|
4604
|
440 { |
|
|
441 indent (os); |
|
|
442 dim_vector dv = dims (); |
|
|
443 os << dv.str () << " struct array containing the fields:"; |
|
|
444 newline (os); |
|
|
445 newline (os); |
|
|
446 |
|
|
447 increment_indent_level (); |
|
|
448 } |
|
|
449 |
|
5880
|
450 string_vector key_list = map.keys (); |
|
|
451 |
|
|
452 for (octave_idx_type i = 0; i < key_list.length (); i++) |
|
2376
|
453 { |
|
5880
|
454 std::string key = key_list[i]; |
|
|
455 |
|
|
456 Cell val = map.contents (key); |
|
2376
|
457 |
|
4499
|
458 octave_value tmp = (n == 1) ? val(0) : octave_value (val, true); |
|
3961
|
459 |
|
|
460 if (print_keys_only) |
|
3932
|
461 { |
|
3961
|
462 indent (os); |
|
4604
|
463 os << key; |
|
|
464 if (n == 1) |
|
|
465 { |
|
|
466 dim_vector dv = tmp.dims (); |
|
|
467 os << ": " << dv.str () << " " << tmp.type_name (); |
|
|
468 } |
|
3961
|
469 newline (os); |
|
3932
|
470 } |
|
3961
|
471 else |
|
4121
|
472 tmp.print_with_name (os, key); |
|
2376
|
473 } |
|
|
474 |
|
5598
|
475 if (n == 0 || (n > 1 && print_keys_only)) |
|
4604
|
476 decrement_indent_level (); |
|
|
477 |
|
2901
|
478 decrement_indent_level (); |
|
2376
|
479 |
|
2901
|
480 indent (os); |
|
|
481 os << "}"; |
|
|
482 newline (os); |
|
2376
|
483 } |
|
|
484 else |
|
2901
|
485 { |
|
3961
|
486 indent (os); |
|
|
487 os << "<structure>"; |
|
2901
|
488 newline (os); |
|
|
489 } |
|
2376
|
490 |
|
2985
|
491 unwind_protect::run_frame ("octave_struct_print"); |
|
2376
|
492 } |
|
|
493 |
|
2901
|
494 bool |
|
3523
|
495 octave_struct::print_name_tag (std::ostream& os, const std::string& name) const |
|
2901
|
496 { |
|
3961
|
497 bool retval = false; |
|
|
498 |
|
2901
|
499 indent (os); |
|
3961
|
500 |
|
|
501 if (Vstruct_levels_to_print < 0) |
|
|
502 os << name << " = "; |
|
|
503 else |
|
|
504 { |
|
|
505 os << name << " ="; |
|
|
506 newline (os); |
|
|
507 retval = true; |
|
|
508 } |
|
|
509 |
|
|
510 return retval; |
|
2901
|
511 } |
|
|
512 |
|
4744
|
513 static bool |
|
|
514 scalar (const dim_vector& dims) |
|
|
515 { |
|
|
516 return dims.length () == 2 && dims (0) == 1 && dims (1) == 1; |
|
|
517 } |
|
|
518 |
|
|
519 /* |
|
|
520 %!shared x |
|
|
521 %! x(1).a=1; x(2).a=2; x(1).b=3; x(2).b=3; |
|
|
522 %!assert(struct('a',1,'b',3),x(1)) |
|
5592
|
523 %!assert(isempty(x([]))) |
|
|
524 %!assert(isempty(struct('a',{},'b',{}))) |
|
4744
|
525 %!assert(struct('a',{1,2},'b',{3,3}),x) |
|
|
526 %!assert(struct('a',{1,2},'b',3),x) |
|
|
527 %!assert(struct('a',{1,2},'b',{3}),x) |
|
|
528 %!assert(struct('b',3,'a',{1,2}),x) |
|
|
529 %!assert(struct('b',{3},'a',{1,2}),x) |
|
|
530 %!test x=struct([]); |
|
|
531 %!assert(size(x),[0,0]); |
|
|
532 %!assert(isstruct(x)); |
|
|
533 %!assert(isempty(fieldnames(x))); |
|
|
534 %!fail("struct('a',{1,2},'b',{1,2,3})","dimensions of parameter 2 do not match those of parameter 4") |
|
5582
|
535 %!fail("struct(1,2,3,4)","struct expects alternating \"field\", VALUE pairs"); |
|
|
536 %!fail("struct('1',2,'3')","struct expects alternating \"field\", VALUE pairs"); |
|
4744
|
537 */ |
|
|
538 |
|
|
539 DEFUN (struct, args, , |
|
|
540 "-*- texinfo -*-\n\ |
|
|
541 @deftypefn {Built-in Function} {} struct (\"field\", @var{value}, \"field\", @var{value}, @dots{})\n\ |
|
|
542 \n\ |
|
|
543 Create a structure and initialize its value.\n\ |
|
|
544 \n\ |
|
|
545 If the values are cell arrays, create a structure array and initialize\n\ |
|
|
546 its values. The dimensions of each cell array of values must match.\n\ |
|
|
547 Singleton cells and non-cell values are repeated so that they fill\n\ |
|
|
548 the entire array. If the cells are empty, create an empty structure\n\ |
|
4911
|
549 array with the specified field names.\n\ |
|
|
550 @end deftypefn") |
|
4744
|
551 { |
|
|
552 octave_value_list retval; |
|
|
553 |
|
|
554 int nargin = args.length (); |
|
|
555 |
|
5444
|
556 // struct ([]) returns an empty struct. |
|
|
557 |
|
|
558 // struct (empty_matrix) returns an empty struct with the same |
|
|
559 // dimensions as the empty matrix. |
|
|
560 |
|
|
561 // Note that struct () creates a 1x1 struct with no fields for |
|
|
562 // compatibility with Matlab. |
|
4744
|
563 |
|
|
564 if (nargin == 1 && args(0).is_empty () && args(0).is_real_matrix ()) |
|
5444
|
565 return octave_value (Octave_map (args(0).dims ())); |
|
4744
|
566 |
|
|
567 // Check for "field", VALUE pairs. |
|
|
568 |
|
|
569 for (int i = 0; i < nargin; i += 2) |
|
|
570 { |
|
|
571 if (! args(i).is_string () || i + 1 >= nargin) |
|
|
572 { |
|
|
573 error ("struct expects alternating \"field\", VALUE pairs"); |
|
|
574 return retval; |
|
|
575 } |
|
|
576 } |
|
|
577 |
|
|
578 // Check that the dimensions of the values correspond. |
|
|
579 |
|
|
580 dim_vector dims (1, 1); |
|
|
581 |
|
|
582 int first_dimensioned_value = 0; |
|
|
583 |
|
|
584 for (int i = 1; i < nargin; i += 2) |
|
|
585 { |
|
|
586 if (args(i).is_cell ()) |
|
|
587 { |
|
|
588 dim_vector argdims (args(i).dims ()); |
|
|
589 |
|
|
590 if (! scalar (argdims)) |
|
|
591 { |
|
|
592 if (! first_dimensioned_value) |
|
|
593 { |
|
|
594 dims = argdims; |
|
|
595 first_dimensioned_value = i + 1; |
|
|
596 } |
|
|
597 else if (dims != argdims) |
|
|
598 { |
|
|
599 error ("struct: dimensions of parameter %d do not match those of parameter %d", |
|
|
600 first_dimensioned_value, i+1); |
|
|
601 return retval; |
|
|
602 } |
|
|
603 } |
|
|
604 } |
|
|
605 } |
|
|
606 |
|
|
607 // Create the return value. |
|
|
608 |
|
|
609 Octave_map map (dims); |
|
|
610 |
|
|
611 for (int i = 0; i < nargin; i+= 2) |
|
|
612 { |
|
|
613 // Get key. |
|
|
614 |
|
|
615 std::string key (args(i).string_value ()); |
|
|
616 |
|
|
617 if (error_state) |
|
|
618 return retval; |
|
|
619 |
|
6811
|
620 if (! valid_identifier (key)) |
|
|
621 { |
|
|
622 error ("struct: invalid structure field name `%s'", key.c_str ()); |
|
|
623 return retval; |
|
|
624 } |
|
|
625 |
|
4744
|
626 // Value may be v, { v }, or { v1, v2, ... } |
|
|
627 // In the first two cases, we need to create a cell array of |
|
|
628 // the appropriate dimensions filled with v. In the last case, |
|
|
629 // the cell array has already been determined to be of the |
|
|
630 // correct dimensions. |
|
|
631 |
|
|
632 if (args(i+1).is_cell ()) |
|
|
633 { |
|
|
634 const Cell c (args(i+1).cell_value ()); |
|
|
635 |
|
|
636 if (error_state) |
|
|
637 return retval; |
|
|
638 |
|
|
639 if (scalar (c.dims ())) |
|
|
640 map.assign (key, Cell (dims, c(0))); |
|
|
641 else |
|
|
642 map.assign (key, c); |
|
|
643 } |
|
|
644 else |
|
|
645 map.assign (key, Cell (dims, args(i+1))); |
|
|
646 |
|
|
647 if (error_state) |
|
|
648 return retval; |
|
|
649 } |
|
|
650 |
|
|
651 return octave_value (map); |
|
|
652 } |
|
|
653 |
|
4358
|
654 DEFUN (isstruct, args, , |
|
|
655 "-*- texinfo -*-\n\ |
|
|
656 @deftypefn {Built-in Function} {} isstruct (@var{expr})\n\ |
|
|
657 Return 1 if the value of the expression @var{expr} is a structure.\n\ |
|
|
658 @end deftypefn") |
|
|
659 { |
|
|
660 octave_value retval; |
|
|
661 |
|
|
662 if (args.length () == 1) |
|
|
663 retval = args(0).is_map (); |
|
|
664 else |
|
5823
|
665 print_usage (); |
|
4358
|
666 |
|
|
667 return retval; |
|
|
668 } |
|
|
669 |
|
|
670 DEFUN (fieldnames, args, , |
|
|
671 "-*- texinfo -*-\n\ |
|
|
672 @deftypefn {Built-in Function} {} fieldnames (@var{struct})\n\ |
|
|
673 Return a cell array of strings naming the elements of the structure\n\ |
|
|
674 @var{struct}. It is an error to call @code{fieldnames} with an\n\ |
|
|
675 argument that is not a structure.\n\ |
|
|
676 @end deftypefn") |
|
|
677 { |
|
|
678 octave_value retval; |
|
|
679 |
|
|
680 int nargin = args.length (); |
|
|
681 |
|
|
682 if (nargin == 1) |
|
|
683 { |
|
|
684 if (args(0).is_map ()) |
|
|
685 { |
|
|
686 Octave_map m = args(0).map_value (); |
|
4744
|
687 string_vector keys = m.keys (); |
|
|
688 if (keys.length () == 0) |
|
|
689 retval = Cell (0, 1); |
|
|
690 else |
|
|
691 retval = Cell (m.keys ()); |
|
4358
|
692 } |
|
|
693 else |
|
|
694 gripe_wrong_type_arg ("fieldnames", args(0)); |
|
|
695 } |
|
|
696 else |
|
5823
|
697 print_usage (); |
|
4358
|
698 |
|
|
699 return retval; |
|
|
700 } |
|
|
701 |
|
|
702 DEFUN (isfield, args, , |
|
|
703 "-*- texinfo -*-\n\ |
|
|
704 @deftypefn {Built-in Function} {} isfield (@var{expr}, @var{name})\n\ |
|
|
705 Return true if the expression @var{expr} is a structure and it includes an\n\ |
|
|
706 element named @var{name}. The first argument must be a structure and\n\ |
|
|
707 the second must be a string.\n\ |
|
|
708 @end deftypefn") |
|
|
709 { |
|
|
710 octave_value retval; |
|
|
711 |
|
|
712 int nargin = args.length (); |
|
|
713 |
|
|
714 if (nargin == 2) |
|
|
715 { |
|
|
716 retval = false; |
|
|
717 |
|
5775
|
718 // FIXME -- should this work for all types that can do |
|
4358
|
719 // structure reference operations? |
|
|
720 |
|
|
721 if (args(0).is_map () && args(1).is_string ()) |
|
|
722 { |
|
|
723 std::string key = args(1).string_value (); |
|
|
724 |
|
|
725 Octave_map m = args(0).map_value (); |
|
|
726 |
|
|
727 retval = m.contains (key) != 0; |
|
|
728 } |
|
|
729 } |
|
|
730 else |
|
5823
|
731 print_usage (); |
|
4358
|
732 |
|
|
733 return retval; |
|
|
734 } |
|
|
735 |
|
4750
|
736 // Check that the dimensions of the input arguments are correct. |
|
|
737 |
|
|
738 static bool |
|
|
739 cell2struct_check_args (const dim_vector& c_dv, const dim_vector& f_dv, |
|
|
740 bool is_cell, int dim) |
|
|
741 { |
|
4751
|
742 bool retval = true; |
|
4750
|
743 |
|
|
744 if (dim >= 0 && dim < c_dv.length ()) |
|
|
745 { |
|
|
746 if (is_cell) |
|
|
747 { |
|
4752
|
748 if (f_dv.numel () != c_dv(dim)) |
|
4750
|
749 { |
|
4751
|
750 error ("cell2struct: numel (FIELD) != size (CELL, DIM)"); |
|
4750
|
751 |
|
|
752 retval = false; |
|
|
753 } |
|
|
754 } |
|
|
755 else |
|
|
756 { |
|
|
757 if (f_dv.length () > 2) |
|
|
758 { |
|
4751
|
759 error ("cell2struct: field array must be a 2-d matrix"); |
|
4750
|
760 |
|
|
761 retval = false; |
|
|
762 } |
|
|
763 else if (f_dv(0) != c_dv(dim)) |
|
|
764 { |
|
4751
|
765 error ("cell2struct: size (FIELD, 1) != length (C, DIM)"); |
|
4750
|
766 |
|
|
767 retval = false; |
|
|
768 } |
|
|
769 } |
|
|
770 } |
|
|
771 else |
|
|
772 { |
|
|
773 error ("cell2struct: DIM out of range"); |
|
|
774 |
|
|
775 retval = false; |
|
|
776 } |
|
|
777 |
|
|
778 return retval; |
|
|
779 } |
|
|
780 |
|
|
781 static void |
|
5275
|
782 cell2struct_construct_idx (Array<octave_idx_type>& ra_idx1, |
|
|
783 const Array<octave_idx_type>& ra_idx2, |
|
|
784 octave_idx_type dim, octave_idx_type fill_value) |
|
4750
|
785 { |
|
5275
|
786 octave_idx_type iidx = 0; |
|
4750
|
787 |
|
5275
|
788 for (octave_idx_type idx = 0; idx < ra_idx1.length (); idx++) |
|
4750
|
789 { |
|
|
790 if (idx == dim) |
|
|
791 ra_idx1.elem (idx) = fill_value; |
|
|
792 else |
|
|
793 ra_idx1.elem (idx) = ra_idx2(iidx++); |
|
|
794 } |
|
|
795 } |
|
|
796 |
|
|
797 DEFUN (cell2struct, args, , |
|
|
798 "-*- texinfo -*-\n\ |
|
4817
|
799 @deftypefn {Built-in Function} {} cell2struct (@var{cell}, @var{fields}, @var{dim})\n\ |
|
|
800 Convert @var{cell} to a structure. The number of fields in @var{fields}\n\ |
|
|
801 must match the number of elements in @var{cell} along dimension @var{dim},\n\ |
|
|
802 that is @code{numel (@var{fields}) == size (@var{cell}, @var{dim})}.\n\ |
|
4750
|
803 \n\ |
|
|
804 @example\n\ |
|
|
805 @group\n\ |
|
6519
|
806 A = cell2struct (@{'Peter', 'Hannah', 'Robert'; 185, 170, 168@},\n\ |
|
|
807 @{'Name','Height'@}, 1);\n\ |
|
4750
|
808 A(1)\n\ |
|
|
809 @result{} ans =\n\ |
|
4780
|
810 @{\n\ |
|
|
811 Height = 185\n\ |
|
|
812 Name = Peter\n\ |
|
|
813 @}\n\ |
|
4750
|
814 \n\ |
|
|
815 @end group\n\ |
|
|
816 @end example\n\ |
|
|
817 @end deftypefn") |
|
|
818 { |
|
|
819 octave_value retval; |
|
|
820 |
|
4751
|
821 if (args.length () == 3) |
|
4750
|
822 { |
|
4751
|
823 Cell c = args(0).cell_value (); |
|
4750
|
824 |
|
4751
|
825 if (! error_state) |
|
4750
|
826 { |
|
4751
|
827 octave_value field = args(1); |
|
4750
|
828 |
|
4751
|
829 // Field is either cell or character matrix. |
|
4750
|
830 |
|
5775
|
831 // FIXME -- this could be simplified if we had |
|
4752
|
832 // cellstr and iscellstr functions available. |
|
|
833 |
|
4751
|
834 bool field_is_cell = field.is_cell (); |
|
4750
|
835 |
|
4751
|
836 Cell field_cell; |
|
|
837 charMatrix field_char; |
|
4750
|
838 |
|
|
839 if (field_is_cell) |
|
4751
|
840 field_cell = field.cell_value (); |
|
|
841 else |
|
|
842 field_char = field.char_matrix_value (); |
|
|
843 |
|
|
844 if (! error_state) |
|
4750
|
845 { |
|
4751
|
846 // Retrieve the dimension value. |
|
|
847 |
|
5775
|
848 // FIXME -- int_value () should print out the |
|
4751
|
849 // conversions it does to be Matlab compatible. |
|
|
850 |
|
5275
|
851 octave_idx_type dim = args(2).int_value () - 1; |
|
4751
|
852 |
|
|
853 if (! error_state) |
|
|
854 { |
|
|
855 dim_vector c_dv = c.dims (); |
|
|
856 dim_vector field_dv = field.dims (); |
|
|
857 |
|
|
858 if (cell2struct_check_args (c_dv, field_dv, field_is_cell, |
|
|
859 dim)) |
|
|
860 { |
|
5275
|
861 octave_idx_type c_dv_length = c_dv.length (); |
|
4751
|
862 |
|
|
863 // Dimension vector for the Cell arrays to be |
|
|
864 // put into the structure. |
|
|
865 |
|
|
866 dim_vector value_dv; |
|
|
867 |
|
|
868 // Initialize c_value_dv. |
|
4750
|
869 |
|
4751
|
870 if (c_dv_length == 2) |
|
|
871 value_dv = dim_vector (1, 1); |
|
|
872 else |
|
|
873 value_dv.resize (c_dv_length - 1); |
|
|
874 |
|
5275
|
875 octave_idx_type idx_tmp = 0; |
|
4751
|
876 |
|
5275
|
877 for (octave_idx_type i = 0; i < c_dv_length; i++) |
|
4751
|
878 { |
|
|
879 if (i != dim) |
|
|
880 value_dv.elem (idx_tmp++) = c_dv.elem (i); |
|
|
881 } |
|
|
882 |
|
|
883 // All initializing is done, we can start moving |
|
|
884 // values. |
|
|
885 |
|
|
886 Octave_map map; |
|
|
887 |
|
|
888 // If field is a cell array then we use all |
|
|
889 // elements in array, on the other hand when |
|
|
890 // field is a character array the number of |
|
|
891 // elements is equals the number of rows. |
|
|
892 |
|
5275
|
893 octave_idx_type field_numel |
|
4751
|
894 = field_is_cell ? field_dv.numel (): field_dv(0); |
|
|
895 |
|
|
896 // For matlab compatibility. |
|
|
897 |
|
|
898 if (field_numel == 0) |
|
|
899 map.reshape (dim_vector (0, 1)); |
|
4750
|
900 |
|
5275
|
901 for (octave_idx_type i = 0; i < field_numel; i++) |
|
4751
|
902 { |
|
|
903 // Construct cell array which goes into the |
|
|
904 // structure together with the appropriate |
|
|
905 // field name. |
|
|
906 |
|
|
907 Cell c_value (value_dv); |
|
|
908 |
|
5275
|
909 Array<octave_idx_type> value_idx (value_dv.length (), 0); |
|
|
910 Array<octave_idx_type> c_idx (c_dv_length, 0); |
|
4751
|
911 |
|
5275
|
912 for (octave_idx_type j = 0; j < value_dv.numel (); j++) |
|
4751
|
913 { |
|
|
914 // Need to do this to construct the |
|
|
915 // appropriate idx for getting elements |
|
|
916 // from the original cell array. |
|
|
917 |
|
|
918 cell2struct_construct_idx (c_idx, value_idx, |
|
|
919 dim, i); |
|
|
920 |
|
|
921 c_value.elem (value_idx) = c.elem (c_idx); |
|
|
922 |
|
|
923 increment_index (value_idx, value_dv); |
|
|
924 } |
|
|
925 |
|
|
926 std::string field_str; |
|
4750
|
927 |
|
4751
|
928 if (field_is_cell) |
|
|
929 { |
|
|
930 // Matlab retrieves the field values |
|
|
931 // column by column. |
|
|
932 |
|
|
933 octave_value field_tmp = field_cell.elem (i); |
|
|
934 |
|
|
935 field_str = field_tmp.string_value (); |
|
|
936 |
|
|
937 if (error_state) |
|
|
938 { |
|
|
939 error ("cell2struct: fields have to be of type string"); |
|
|
940 break; |
|
|
941 } |
|
|
942 } |
|
|
943 else |
|
|
944 { |
|
|
945 field_str = field_char.row_as_string (i); |
|
|
946 |
|
|
947 if (error_state) |
|
|
948 return retval; |
|
|
949 } |
|
|
950 |
|
6811
|
951 if (! valid_identifier (field_str)) |
|
|
952 { |
|
|
953 error ("cell2struct: invalid field name `%s'", |
|
|
954 field_str.c_str ()); |
|
|
955 break; |
|
|
956 } |
|
|
957 |
|
4751
|
958 map.reshape (value_dv); |
|
|
959 |
|
|
960 map.assign (field_str, c_value); |
|
|
961 } |
|
|
962 |
|
|
963 if (! error_state) |
|
|
964 retval = map; |
|
|
965 } |
|
4750
|
966 } |
|
4751
|
967 else |
|
|
968 error ("cell2struct: expecting third argument to be an integer"); |
|
4750
|
969 } |
|
|
970 else |
|
4751
|
971 error ("cell2struct: expecting second argument to be a cell or character array"); |
|
4750
|
972 } |
|
4751
|
973 else |
|
|
974 error ("cell2struct: expecting first argument to be a cell array"); |
|
4750
|
975 } |
|
4751
|
976 else |
|
5823
|
977 print_usage (); |
|
4750
|
978 |
|
|
979 return retval; |
|
|
980 } |
|
|
981 |
|
4817
|
982 // So we can call Fcellstr directly. |
|
|
983 extern octave_value_list Fcellstr (const octave_value_list& args, int); |
|
|
984 |
|
|
985 DEFUN (rmfield, args, , |
|
|
986 "-*- texinfo -*-\n\ |
|
|
987 @deftypefn {Built-in Function} {} rmfield (@var{s}, @var{f})\n\ |
|
|
988 Remove field @var{f} from the structure @var{s}. If @var{f} is a\n\ |
|
|
989 cell array of character strings or a character array, remove the\n\ |
|
|
990 named fields.\n\ |
|
5642
|
991 @seealso{cellstr, iscellstr, setfield}\n\ |
|
|
992 @end deftypefn") |
|
4817
|
993 { |
|
|
994 octave_value retval; |
|
|
995 |
|
|
996 int nargin = args.length (); |
|
|
997 |
|
|
998 if (nargin == 2) |
|
|
999 { |
|
|
1000 Octave_map m = args(0).map_value (); |
|
|
1001 |
|
|
1002 octave_value_list fval = Fcellstr (args(1), 1); |
|
|
1003 |
|
|
1004 if (! error_state) |
|
|
1005 { |
|
|
1006 Cell fcell = fval(0).cell_value (); |
|
|
1007 |
|
|
1008 for (int i = 0; i < fcell.numel (); i++) |
|
|
1009 { |
|
|
1010 std::string key = fcell(i).string_value (); |
|
|
1011 |
|
|
1012 if (m.contains (key)) |
|
|
1013 m.del (key); |
|
|
1014 else |
|
|
1015 { |
|
|
1016 error ("rmfield: structure does not contain field %s", |
|
|
1017 key.c_str ()); |
|
|
1018 |
|
|
1019 break; |
|
|
1020 } |
|
|
1021 } |
|
|
1022 |
|
|
1023 if (! error_state) |
|
|
1024 retval = m; |
|
|
1025 } |
|
|
1026 } |
|
|
1027 else |
|
5823
|
1028 print_usage (); |
|
4817
|
1029 |
|
|
1030 return retval; |
|
|
1031 } |
|
|
1032 |
|
|
1033 bool |
|
5958
|
1034 octave_struct::save_ascii (std::ostream& os, bool& infnan_warned) |
|
4817
|
1035 { |
|
|
1036 Octave_map m = map_value (); |
|
6639
|
1037 os << "# length: " << m.nfields () << "\n"; |
|
4817
|
1038 |
|
|
1039 Octave_map::iterator i = m.begin (); |
|
|
1040 while (i != m.end ()) |
|
|
1041 { |
|
5341
|
1042 octave_value val = map.contents (i); |
|
4817
|
1043 |
|
5958
|
1044 bool b = save_ascii_data (os, val, m.key (i), infnan_warned, false, 0); |
|
4817
|
1045 |
|
|
1046 if (! b) |
|
|
1047 return os; |
|
|
1048 |
|
|
1049 i++; |
|
|
1050 } |
|
|
1051 |
|
|
1052 return true; |
|
|
1053 } |
|
|
1054 |
|
|
1055 bool |
|
|
1056 octave_struct::load_ascii (std::istream& is) |
|
|
1057 { |
|
5275
|
1058 octave_idx_type len = 0; |
|
4817
|
1059 bool success = true; |
|
|
1060 |
|
|
1061 if (extract_keyword (is, "length", len) && len >= 0) |
|
|
1062 { |
|
|
1063 if (len > 0) |
|
|
1064 { |
|
|
1065 Octave_map m (map); |
|
|
1066 |
|
5275
|
1067 for (octave_idx_type j = 0; j < len; j++) |
|
4817
|
1068 { |
|
|
1069 octave_value t2; |
|
|
1070 bool dummy; |
|
|
1071 |
|
|
1072 // recurse to read cell elements |
|
|
1073 std::string nm |
|
5756
|
1074 = read_ascii_data (is, std::string (), dummy, t2, j); |
|
4817
|
1075 |
|
|
1076 if (!is) |
|
|
1077 break; |
|
|
1078 |
|
6293
|
1079 Cell tcell = t2.is_cell () ? t2.cell_value () : Cell (t2); |
|
5433
|
1080 |
|
6293
|
1081 if (error_state) |
|
|
1082 { |
|
|
1083 error ("load: internal error loading struct elements"); |
|
|
1084 return false; |
|
|
1085 } |
|
5433
|
1086 |
|
6293
|
1087 m.assign (nm, tcell); |
|
4817
|
1088 } |
|
|
1089 |
|
|
1090 if (is) |
|
|
1091 map = m; |
|
|
1092 else |
|
|
1093 { |
|
|
1094 error ("load: failed to load structure"); |
|
|
1095 success = false; |
|
|
1096 } |
|
|
1097 } |
|
|
1098 else if (len == 0 ) |
|
6292
|
1099 map = Octave_map (dim_vector (1, 1)); |
|
4817
|
1100 else |
|
|
1101 panic_impossible (); |
|
|
1102 } |
|
|
1103 else { |
|
|
1104 error ("load: failed to extract number of elements in structure"); |
|
|
1105 success = false; |
|
|
1106 } |
|
|
1107 |
|
|
1108 return success; |
|
|
1109 } |
|
|
1110 |
|
|
1111 bool |
|
|
1112 octave_struct::save_binary (std::ostream& os, bool& save_as_floats) |
|
|
1113 { |
|
|
1114 Octave_map m = map_value (); |
|
|
1115 |
|
6639
|
1116 int32_t len = m.nfields (); |
|
5760
|
1117 os.write (reinterpret_cast<char *> (&len), 4); |
|
4817
|
1118 |
|
|
1119 Octave_map::iterator i = m.begin (); |
|
|
1120 while (i != m.end ()) |
|
|
1121 { |
|
5341
|
1122 octave_value val = map.contents (i); |
|
4817
|
1123 |
|
5341
|
1124 bool b = save_binary_data (os, val, m.key (i), "", 0, save_as_floats); |
|
4817
|
1125 |
|
|
1126 if (! b) |
|
|
1127 return os; |
|
|
1128 |
|
|
1129 i++; |
|
|
1130 } |
|
|
1131 |
|
|
1132 return true; |
|
|
1133 } |
|
|
1134 |
|
|
1135 bool |
|
|
1136 octave_struct::load_binary (std::istream& is, bool swap, |
|
5760
|
1137 oct_mach_info::float_format fmt) |
|
4817
|
1138 { |
|
|
1139 bool success = true; |
|
5828
|
1140 int32_t len; |
|
5760
|
1141 if (! is.read (reinterpret_cast<char *> (&len), 4)) |
|
4817
|
1142 return false; |
|
|
1143 if (swap) |
|
4944
|
1144 swap_bytes<4> (&len); |
|
4817
|
1145 |
|
|
1146 if (len > 0) |
|
|
1147 { |
|
|
1148 Octave_map m (map); |
|
|
1149 |
|
5275
|
1150 for (octave_idx_type j = 0; j < len; j++) |
|
4817
|
1151 { |
|
|
1152 octave_value t2; |
|
|
1153 bool dummy; |
|
|
1154 std::string doc; |
|
|
1155 |
|
|
1156 // recurse to read cell elements |
|
|
1157 std::string nm = read_binary_data (is, swap, fmt, std::string (), |
|
|
1158 dummy, t2, doc); |
|
|
1159 |
|
|
1160 if (!is) |
|
|
1161 break; |
|
|
1162 |
|
6293
|
1163 Cell tcell = t2.is_cell () ? t2.cell_value () : Cell (t2); |
|
5433
|
1164 |
|
6293
|
1165 if (error_state) |
|
|
1166 { |
|
|
1167 error ("load: internal error loading struct elements"); |
|
|
1168 return false; |
|
|
1169 } |
|
5433
|
1170 |
|
6293
|
1171 m.assign (nm, tcell); |
|
4817
|
1172 } |
|
|
1173 |
|
|
1174 if (is) |
|
|
1175 map = m; |
|
|
1176 else |
|
|
1177 { |
|
|
1178 error ("load: failed to load structure"); |
|
|
1179 success = false; |
|
|
1180 } |
|
|
1181 } |
|
|
1182 else if (len == 0 ) |
|
6292
|
1183 map = Octave_map (dim_vector (1, 1)); |
|
4817
|
1184 else |
|
|
1185 panic_impossible (); |
|
|
1186 |
|
|
1187 return success; |
|
|
1188 } |
|
|
1189 |
|
|
1190 #if defined (HAVE_HDF5) |
|
|
1191 |
|
|
1192 bool |
|
|
1193 octave_struct::save_hdf5 (hid_t loc_id, const char *name, bool save_as_floats) |
|
|
1194 { |
|
|
1195 hid_t data_hid = -1; |
|
|
1196 |
|
|
1197 data_hid = H5Gcreate (loc_id, name, 0); |
|
|
1198 if (data_hid < 0) return false; |
|
|
1199 |
|
|
1200 // recursively add each element of the structure to this group |
|
|
1201 Octave_map m = map_value (); |
|
|
1202 Octave_map::iterator i = m.begin (); |
|
|
1203 while (i != m.end ()) |
|
|
1204 { |
|
5341
|
1205 octave_value val = map.contents (i); |
|
4817
|
1206 |
|
5341
|
1207 bool retval2 = add_hdf5_data (data_hid, val, m.key (i), "", false, |
|
4817
|
1208 save_as_floats); |
|
|
1209 |
|
|
1210 if (! retval2) |
|
|
1211 break; |
|
|
1212 |
|
|
1213 i++; |
|
|
1214 } |
|
|
1215 |
|
|
1216 H5Gclose (data_hid); |
|
4837
|
1217 |
|
4817
|
1218 return true; |
|
|
1219 } |
|
|
1220 |
|
|
1221 bool |
|
|
1222 octave_struct::load_hdf5 (hid_t loc_id, const char *name, |
|
|
1223 bool have_h5giterate_bug) |
|
|
1224 { |
|
|
1225 bool retval = false; |
|
|
1226 |
|
|
1227 hdf5_callback_data dsub; |
|
|
1228 |
|
|
1229 herr_t retval2 = 0; |
|
6292
|
1230 Octave_map m (dim_vector (1, 1)); |
|
4817
|
1231 int current_item = 0; |
|
|
1232 #ifdef HAVE_H5GGET_NUM_OBJS |
|
|
1233 hsize_t num_obj = 0; |
|
5060
|
1234 hid_t group_id = H5Gopen (loc_id, name); |
|
|
1235 H5Gget_num_objs (group_id, &num_obj); |
|
|
1236 H5Gclose (group_id); |
|
4817
|
1237 |
|
|
1238 while (current_item < static_cast<int> (num_obj) |
|
|
1239 && (retval2 = H5Giterate (loc_id, name, ¤t_item, |
|
|
1240 hdf5_read_next_data, &dsub)) > 0) |
|
|
1241 #else |
|
|
1242 while ((retval2 = H5Giterate (loc_id, name, ¤t_item, |
|
|
1243 hdf5_read_next_data, &dsub)) > 0) |
|
|
1244 #endif |
|
|
1245 { |
|
5342
|
1246 octave_value t2 = dsub.tc; |
|
|
1247 |
|
6293
|
1248 Cell tcell = t2.is_cell () ? t2.cell_value () : Cell (t2); |
|
5433
|
1249 |
|
6293
|
1250 if (error_state) |
|
|
1251 { |
|
|
1252 error ("load: internal error loading struct elements"); |
|
|
1253 return false; |
|
|
1254 } |
|
5433
|
1255 |
|
6293
|
1256 m.assign (dsub.name, tcell); |
|
5336
|
1257 |
|
4817
|
1258 if (have_h5giterate_bug) |
|
|
1259 current_item++; // H5Giterate returned the last index processed |
|
|
1260 } |
|
|
1261 |
|
|
1262 if (retval2 >= 0) |
|
|
1263 { |
|
|
1264 map = m; |
|
|
1265 retval = true; |
|
|
1266 } |
|
|
1267 |
|
|
1268 return retval; |
|
|
1269 } |
|
|
1270 |
|
4687
|
1271 #endif |
|
|
1272 |
|
5900
|
1273 mxArray * |
|
|
1274 octave_struct::as_mxArray (void) const |
|
|
1275 { |
|
|
1276 int nf = nfields (); |
|
|
1277 string_vector kv = map_keys (); |
|
6065
|
1278 |
|
|
1279 OCTAVE_LOCAL_BUFFER (const char *, f, nf); |
|
|
1280 |
|
5900
|
1281 for (int i = 0; i < nf; i++) |
|
6065
|
1282 f[i] = kv[i].c_str (); |
|
5900
|
1283 |
|
|
1284 mxArray *retval = new mxArray (dims (), nf, f); |
|
|
1285 |
|
|
1286 mxArray **elts = static_cast<mxArray **> (retval->get_data ()); |
|
|
1287 |
|
6686
|
1288 mwSize nel = numel (); |
|
5900
|
1289 |
|
6686
|
1290 mwSize ntot = nf * nel; |
|
5900
|
1291 |
|
|
1292 for (int i = 0; i < nf; i++) |
|
|
1293 { |
|
|
1294 Cell c = map.contents (kv[i]); |
|
|
1295 |
|
|
1296 const octave_value *p = c.data (); |
|
|
1297 |
|
6686
|
1298 mwIndex k = 0; |
|
|
1299 for (mwIndex j = i; j < ntot; j += nf) |
|
5900
|
1300 elts[j] = new mxArray (p[k++]); |
|
|
1301 } |
|
|
1302 |
|
|
1303 return retval; |
|
|
1304 } |
|
|
1305 |
|
2376
|
1306 /* |
|
|
1307 ;;; Local Variables: *** |
|
|
1308 ;;; mode: C++ *** |
|
|
1309 ;;; End: *** |
|
|
1310 */ |
