|
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 |
|
|
23 #if defined (__GNUG__) |
|
|
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" |
|
2376
|
34 #include "error.h" |
|
2979
|
35 #include "oct-lvalue.h" |
|
3932
|
36 #include "ov-list.h" |
|
2376
|
37 #include "ov-struct.h" |
|
|
38 #include "unwind-prot.h" |
|
2948
|
39 #include "variables.h" |
|
2376
|
40 |
|
3219
|
41 DEFINE_OCTAVE_ALLOCATOR(octave_struct); |
|
2376
|
42 |
|
3219
|
43 DEFINE_OV_TYPEID_FUNCTIONS_AND_DATA(octave_struct, "struct"); |
|
2376
|
44 |
|
3933
|
45 octave_value_list |
|
|
46 octave_struct::dotref (const octave_value_list& idx) |
|
2962
|
47 { |
|
3933
|
48 octave_value_list retval; |
|
|
49 |
|
|
50 assert (idx.length () == 1); |
|
2962
|
51 |
|
3933
|
52 std::string nm = idx(0).string_value (); |
|
|
53 |
|
|
54 Pix p = map.seek (nm); |
|
2376
|
55 |
|
3933
|
56 if (p) |
|
|
57 retval = map.contents (p); |
|
|
58 else |
|
2376
|
59 error ("structure has no member `%s'", nm.c_str ()); |
|
|
60 |
|
|
61 return retval; |
|
|
62 } |
|
|
63 |
|
3933
|
64 static void |
|
|
65 gripe_invalid_index (void) |
|
|
66 { |
|
|
67 error ("invalid index for structure array"); |
|
|
68 } |
|
|
69 |
|
|
70 static void |
|
|
71 gripe_invalid_index_for_assignment (void) |
|
|
72 { |
|
|
73 error ("invalid index for structure array assignment"); |
|
|
74 } |
|
|
75 |
|
|
76 static void |
|
|
77 gripe_invalid_index_type (const std::string& nm, char t) |
|
|
78 { |
|
|
79 error ("%s cannot be indexed with %c", nm.c_str (), t); |
|
|
80 } |
|
|
81 |
|
|
82 static void |
|
|
83 gripe_failed_assignment (void) |
|
|
84 { |
|
|
85 error ("assignment to structure element failed"); |
|
|
86 } |
|
|
87 |
|
|
88 octave_value |
|
|
89 octave_struct::subsref (const std::string type, |
|
|
90 const SLList<octave_value_list>& idx) |
|
|
91 { |
|
|
92 octave_value retval; |
|
|
93 |
|
|
94 int skip = 1; |
|
|
95 |
|
|
96 switch (type[0]) |
|
|
97 { |
|
|
98 case '(': |
|
|
99 { |
|
|
100 if (type.length () > 1 && type[1] == '.') |
|
|
101 { |
|
|
102 Pix p = idx.first (); |
|
|
103 idx.next (p); |
|
|
104 octave_value_list key_idx = idx(p); |
|
|
105 |
|
|
106 octave_value_list tmp = dotref (key_idx); |
|
|
107 |
|
|
108 if (! error_state) |
|
|
109 { |
|
|
110 octave_value_list t_idx = idx.front (); |
|
|
111 |
|
|
112 if (t_idx.length () == 1) |
|
|
113 { |
|
|
114 idx_vector i = t_idx(0).index_vector (); |
|
|
115 octave_value_list t = tmp.index (i); |
|
|
116 |
|
|
117 retval = (t.length () == 1) ? t(0) : octave_value (t); |
|
|
118 |
|
|
119 // We handled two index elements, so tell |
|
|
120 // next_subsref to skip both of them. |
|
|
121 |
|
|
122 skip++; |
|
|
123 } |
|
|
124 else |
|
|
125 gripe_invalid_index (); |
|
|
126 } |
|
|
127 } |
|
|
128 else |
|
|
129 { |
|
|
130 octave_value_list t_idx = idx.front (); |
|
|
131 |
|
|
132 if (t_idx.length () == 1) |
|
|
133 { |
|
|
134 idx_vector i = t_idx(0).index_vector (); |
|
|
135 retval = map.index (i); |
|
|
136 } |
|
|
137 else |
|
|
138 gripe_invalid_index (); |
|
|
139 } |
|
|
140 } |
|
|
141 break; |
|
|
142 |
|
|
143 case '.': |
|
|
144 { |
|
|
145 octave_value_list t = dotref (idx.front ()); |
|
|
146 |
|
|
147 retval = (t.length () == 1) ? t(0) : octave_value (t); |
|
|
148 } |
|
|
149 break; |
|
|
150 |
|
|
151 case '{': |
|
|
152 gripe_invalid_index_type (type_name (), type[0]); |
|
|
153 break; |
|
|
154 |
|
|
155 default: |
|
|
156 panic_impossible (); |
|
|
157 } |
|
|
158 |
|
|
159 if (! error_state) |
|
|
160 retval = retval.next_subsref (type, idx, skip); |
|
|
161 |
|
|
162 return retval; |
|
|
163 } |
|
|
164 |
|
|
165 octave_value |
|
|
166 octave_struct::numeric_conv (const octave_value_list& val, |
|
|
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 |
|
|
185 octave_struct::subsasgn (const std::string type, |
|
|
186 const SLList<octave_value_list>& idx, |
|
|
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 { |
|
|
203 Pix p = idx.first (); |
|
|
204 octave_value_list t_idx = idx(p); |
|
|
205 |
|
|
206 if (t_idx.length () == 1) |
|
|
207 { |
|
|
208 idx.next (p); |
|
|
209 octave_value_list key_idx = idx(p); |
|
|
210 |
|
|
211 assert (key_idx.length () == 1); |
|
|
212 |
|
|
213 std::string key = key_idx(0).string_value (); |
|
|
214 |
|
|
215 octave_value u; |
|
|
216 |
|
|
217 if (! map.contains (key)) |
|
|
218 u = octave_value::empty_conv (type.substr (2), rhs); |
|
|
219 else |
|
|
220 { |
|
|
221 octave_value_list map_val = map[key]; |
|
|
222 |
|
|
223 octave_value_list t_idx = idx.front (); |
|
|
224 |
|
|
225 idx_vector i = t_idx(0).index_vector (); |
|
|
226 |
|
|
227 octave_value_list map_elt = map_val.index (i, true); |
|
|
228 |
|
|
229 u = numeric_conv (map_elt, type.substr (2)); |
|
|
230 } |
|
|
231 |
|
|
232 if (! error_state) |
|
|
233 { |
|
|
234 SLList<octave_value_list> next_idx (idx); |
|
|
235 |
|
|
236 // We handled two index elements, so subsasgn to |
|
|
237 // needs to skip both of them. |
|
|
238 |
|
|
239 next_idx.remove_front (); |
|
|
240 next_idx.remove_front (); |
|
|
241 |
|
|
242 t_rhs = u.subsasgn (type.substr (2), next_idx, rhs); |
|
|
243 } |
|
|
244 } |
|
|
245 else |
|
|
246 gripe_invalid_index_for_assignment (); |
|
|
247 } |
|
|
248 else |
|
|
249 gripe_invalid_index_for_assignment (); |
|
|
250 } |
|
|
251 break; |
|
|
252 |
|
|
253 case '.': |
|
|
254 { |
|
|
255 octave_value_list key_idx = idx.front (); |
|
|
256 |
|
|
257 assert (key_idx.length () == 1); |
|
|
258 |
|
|
259 std::string key = key_idx(0).string_value (); |
|
|
260 |
|
|
261 octave_value u; |
|
|
262 |
|
|
263 if (! map.contains (key)) |
|
|
264 u = octave_value::empty_conv (type.substr (1), rhs); |
|
|
265 else |
|
|
266 { |
|
|
267 octave_value_list map_val = map[key]; |
|
|
268 |
|
|
269 u = numeric_conv (map_val, type.substr (1)); |
|
|
270 } |
|
|
271 |
|
|
272 if (! error_state) |
|
|
273 { |
|
|
274 SLList<octave_value_list> next_idx (idx); |
|
|
275 |
|
|
276 next_idx.remove_front (); |
|
|
277 |
|
|
278 t_rhs = u.subsasgn (type.substr (1), next_idx, rhs); |
|
|
279 } |
|
|
280 } |
|
|
281 break; |
|
|
282 |
|
|
283 case '{': |
|
|
284 gripe_invalid_index_type (type_name (), type[0]); |
|
|
285 break; |
|
|
286 |
|
|
287 default: |
|
|
288 panic_impossible (); |
|
|
289 } |
|
|
290 } |
|
|
291 |
|
|
292 if (! error_state) |
|
|
293 { |
|
|
294 switch (type[0]) |
|
|
295 { |
|
|
296 case '(': |
|
|
297 { |
|
|
298 if (n > 1 && type[1] == '.') |
|
|
299 { |
|
|
300 Pix p = idx.first (); |
|
|
301 idx.next (p); |
|
|
302 octave_value_list key_idx = idx(p); |
|
|
303 |
|
|
304 assert (key_idx.length () == 1); |
|
|
305 |
|
|
306 std::string key = key_idx(0).string_value (); |
|
|
307 |
|
|
308 if (! error_state) |
|
|
309 { |
|
|
310 octave_value_list t_idx = idx.front (); |
|
|
311 |
|
|
312 if (t_idx.length () == 1) |
|
|
313 { |
|
|
314 idx_vector i = t_idx(0).index_vector (); |
|
|
315 |
|
|
316 map.assign (i, key, t_rhs); |
|
|
317 |
|
|
318 if (! error_state) |
|
|
319 retval = octave_value (this, count + 1); |
|
|
320 else |
|
|
321 gripe_failed_assignment (); |
|
|
322 } |
|
|
323 else |
|
|
324 gripe_invalid_index_for_assignment (); |
|
|
325 } |
|
|
326 else |
|
|
327 gripe_failed_assignment (); |
|
|
328 } |
|
|
329 else |
|
|
330 gripe_invalid_index_for_assignment (); |
|
|
331 } |
|
|
332 break; |
|
|
333 |
|
|
334 case '.': |
|
|
335 { |
|
|
336 octave_value_list key_idx = idx.front (); |
|
|
337 |
|
|
338 assert (key_idx.length () == 1); |
|
|
339 |
|
|
340 std::string key = key_idx(0).string_value (); |
|
|
341 |
|
|
342 map.assign (key, t_rhs); |
|
|
343 |
|
|
344 if (! error_state) |
|
|
345 retval = octave_value (this, count + 1); |
|
|
346 else |
|
|
347 gripe_failed_assignment (); |
|
|
348 } |
|
|
349 break; |
|
|
350 |
|
|
351 case '{': |
|
|
352 gripe_invalid_index_type (type_name (), type[0]); |
|
|
353 break; |
|
|
354 |
|
|
355 default: |
|
|
356 panic_impossible (); |
|
|
357 } |
|
|
358 } |
|
|
359 else |
|
|
360 gripe_failed_assignment (); |
|
|
361 |
|
|
362 return retval; |
|
2376
|
363 } |
|
|
364 |
|
|
365 void |
|
3523
|
366 octave_struct::print (std::ostream& os, bool) const |
|
2901
|
367 { |
|
|
368 print_raw (os); |
|
|
369 } |
|
|
370 |
|
|
371 void |
|
3523
|
372 octave_struct::print_raw (std::ostream& os, bool) const |
|
2376
|
373 { |
|
|
374 // XXX FIXME XXX -- would be nice to print the output in some |
|
|
375 // standard order. Maybe all substructures first, maybe |
|
|
376 // alphabetize entries, etc. |
|
|
377 |
|
2985
|
378 unwind_protect::begin_frame ("octave_struct_print"); |
|
2376
|
379 |
|
|
380 unwind_protect_int (Vstruct_levels_to_print); |
|
|
381 |
|
3961
|
382 if (Vstruct_levels_to_print >= 0) |
|
2376
|
383 { |
|
3961
|
384 bool print_keys_only = (Vstruct_levels_to_print == 0); |
|
|
385 |
|
|
386 Vstruct_levels_to_print--; |
|
|
387 |
|
2901
|
388 indent (os); |
|
|
389 os << "{"; |
|
|
390 newline (os); |
|
2376
|
391 |
|
2901
|
392 increment_indent_level (); |
|
2376
|
393 |
|
3932
|
394 int n = map.array_length (); |
|
|
395 |
|
2901
|
396 for (Pix p = map.first (); p; map.next (p)) |
|
2376
|
397 { |
|
3523
|
398 std::string key = map.key (p); |
|
3932
|
399 octave_value_list val = map.contents (p); |
|
2376
|
400 |
|
3961
|
401 octave_value tmp = (n == 1) ? val(0) : octave_list (val); |
|
|
402 |
|
|
403 if (print_keys_only) |
|
3932
|
404 { |
|
3961
|
405 indent (os); |
|
|
406 os << key << ": " << tmp.type_name (); |
|
|
407 newline (os); |
|
3932
|
408 } |
|
3961
|
409 else |
|
|
410 val(0).print_with_name (os, key); |
|
2376
|
411 } |
|
|
412 |
|
2901
|
413 decrement_indent_level (); |
|
2376
|
414 |
|
2901
|
415 indent (os); |
|
|
416 os << "}"; |
|
|
417 newline (os); |
|
2376
|
418 } |
|
|
419 else |
|
2901
|
420 { |
|
3961
|
421 indent (os); |
|
|
422 os << "<structure>"; |
|
2901
|
423 newline (os); |
|
|
424 } |
|
2376
|
425 |
|
2985
|
426 unwind_protect::run_frame ("octave_struct_print"); |
|
2376
|
427 } |
|
|
428 |
|
2901
|
429 bool |
|
3523
|
430 octave_struct::print_name_tag (std::ostream& os, const std::string& name) const |
|
2901
|
431 { |
|
3961
|
432 bool retval = false; |
|
|
433 |
|
2901
|
434 indent (os); |
|
3961
|
435 |
|
|
436 if (Vstruct_levels_to_print < 0) |
|
|
437 os << name << " = "; |
|
|
438 else |
|
|
439 { |
|
|
440 os << name << " ="; |
|
|
441 newline (os); |
|
|
442 retval = true; |
|
|
443 } |
|
|
444 |
|
|
445 return retval; |
|
2901
|
446 } |
|
|
447 |
|
2376
|
448 /* |
|
|
449 ;;; Local Variables: *** |
|
|
450 ;;; mode: C++ *** |
|
|
451 ;;; End: *** |
|
|
452 */ |
