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