|
529
|
1 // tree-const.cc -*- C++ -*- |
|
1
|
2 /* |
|
|
3 |
|
1009
|
4 Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton |
|
1
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
1
|
21 |
|
|
22 */ |
|
|
23 |
|
1299
|
24 #if defined (__GNUG__) |
|
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
240
|
28 #ifdef HAVE_CONFIG_H |
|
1192
|
29 #include <config.h> |
|
1
|
30 #endif |
|
|
31 |
|
1558
|
32 #include <cctype> |
|
1355
|
33 #include <cstring> |
|
|
34 |
|
1558
|
35 #include <fstream.h> |
|
581
|
36 #include <iostream.h> |
|
1199
|
37 #include <strstream.h> |
|
581
|
38 |
|
1558
|
39 #include "mx-base.h" |
|
|
40 #include "Range.h" |
|
|
41 |
|
|
42 #include "arith-ops.h" |
|
1
|
43 #include "error.h" |
|
|
44 #include "gripes.h" |
|
1558
|
45 #include "idx-vector.h" |
|
747
|
46 #include "oct-map.h" |
|
1355
|
47 #include "oct-str.h" |
|
|
48 #include "pager.h" |
|
1558
|
49 #include "pr-output.h" |
|
|
50 #include "sysdep.h" |
|
1355
|
51 #include "tree-const.h" |
|
1558
|
52 #include "unwind-prot.h" |
|
1355
|
53 #include "user-prefs.h" |
|
1430
|
54 #include "utils.h" |
|
1558
|
55 #include "variables.h" |
|
|
56 |
|
|
57 #ifndef TC_REP |
|
|
58 #define TC_REP tree_constant::tree_constant_rep |
|
|
59 #endif |
|
|
60 |
|
|
61 #ifndef MAX |
|
|
62 #define MAX(a,b) ((a) > (b) ? (a) : (b)) |
|
|
63 #endif |
|
|
64 |
|
|
65 #ifndef TC_REP |
|
|
66 #define TC_REP tree_constant::tree_constant_rep |
|
|
67 #endif |
|
|
68 |
|
|
69 #ifndef MAX |
|
|
70 #define MAX(a,b) ((a) > (b) ? (a) : (b)) |
|
|
71 #endif |
|
|
72 |
|
|
73 // The following three variables could be made static members of the |
|
|
74 // TC_REP class. |
|
|
75 |
|
|
76 // Pointer to the blocks of memory we manage. |
|
|
77 static TC_REP *tc_rep_newlist = 0; |
|
|
78 |
|
|
79 // Multiplier for allocating new blocks. |
|
|
80 static const int tc_rep_newlist_grow_size = 128; |
|
|
81 |
|
|
82 // Indentation level for structures. |
|
|
83 static int structure_indent_level = 0; |
|
|
84 |
|
|
85 static void |
|
|
86 increment_structure_indent_level (void) |
|
|
87 { |
|
|
88 structure_indent_level += 2; |
|
|
89 } |
|
|
90 |
|
|
91 static void |
|
|
92 decrement_structure_indent_level (void) |
|
|
93 { |
|
|
94 structure_indent_level -= 2; |
|
|
95 } |
|
|
96 |
|
|
97 static int |
|
|
98 any_element_is_complex (const ComplexMatrix& a) |
|
|
99 { |
|
|
100 int nr = a.rows (); |
|
|
101 int nc = a.columns (); |
|
|
102 for (int j = 0; j < nc; j++) |
|
|
103 for (int i = 0; i < nr; i++) |
|
|
104 if (imag (a.elem (i, j)) != 0.0) |
|
|
105 return 1; |
|
|
106 return 0; |
|
|
107 } |
|
747
|
108 |
|
1168
|
109 // The following three variables could be made static members of the |
|
|
110 // tree_constant class. |
|
|
111 |
|
|
112 // Pointer to the blocks of memory we manage. |
|
1299
|
113 static tree_constant *tc_newlist = 0; |
|
1168
|
114 |
|
|
115 // Multiplier for allocating new blocks. |
|
1299
|
116 static const int tc_newlist_grow_size = 128; |
|
1168
|
117 |
|
747
|
118 Octave_map |
|
|
119 tree_constant::map_value (void) const |
|
|
120 { |
|
|
121 return rep->map_value (); |
|
|
122 } |
|
1
|
123 |
|
|
124 tree_constant::~tree_constant (void) |
|
|
125 { |
|
|
126 #if defined (MDEBUG) |
|
|
127 cerr << "~tree_constant: rep: " << rep |
|
|
128 << " rep->count: " << rep->count << "\n"; |
|
|
129 #endif |
|
|
130 |
|
|
131 if (--rep->count <= 0) |
|
|
132 { |
|
|
133 delete rep; |
|
531
|
134 rep = 0; |
|
1
|
135 } |
|
|
136 } |
|
|
137 |
|
|
138 void * |
|
|
139 tree_constant::operator new (size_t size) |
|
|
140 { |
|
1168
|
141 assert (size == sizeof (tree_constant)); |
|
|
142 |
|
1299
|
143 if (! tc_newlist) |
|
|
144 { |
|
|
145 int block_size = tc_newlist_grow_size * sizeof (tree_constant); |
|
|
146 tc_newlist = (tree_constant *) new char [block_size]; |
|
|
147 |
|
1321
|
148 int i = 0; |
|
|
149 |
|
|
150 for (i = 0; i < tc_newlist_grow_size - 1; i++) |
|
1299
|
151 tc_newlist[i].freeptr = &tc_newlist[i+1]; |
|
|
152 |
|
|
153 tc_newlist[i].freeptr = 0; |
|
|
154 } |
|
|
155 |
|
|
156 tree_constant *tmp = tc_newlist; |
|
|
157 tc_newlist = tc_newlist->freeptr; |
|
1168
|
158 return tmp; |
|
1
|
159 } |
|
|
160 |
|
|
161 void |
|
1488
|
162 tree_constant::operator delete (void *p, size_t /* size */) |
|
1
|
163 { |
|
1168
|
164 tree_constant *tmp = (tree_constant *) p; |
|
1299
|
165 tmp->freeptr = tc_newlist; |
|
|
166 tc_newlist = tmp; |
|
1
|
167 } |
|
|
168 |
|
747
|
169 // Simple assignment. |
|
|
170 |
|
|
171 tree_constant |
|
|
172 tree_constant::operator = (const tree_constant& a) |
|
|
173 { |
|
|
174 if (rep != a.rep) |
|
|
175 { |
|
|
176 if (--rep->count <= 0) |
|
|
177 delete rep; |
|
|
178 rep = a.rep; |
|
|
179 rep->count++; |
|
|
180 } |
|
|
181 return *this; |
|
|
182 } |
|
|
183 |
|
|
184 tree_constant |
|
1277
|
185 tree_constant::lookup_map_element (const char *ref, int insert, |
|
|
186 int silent) |
|
|
187 { |
|
|
188 tree_constant retval; |
|
|
189 |
|
|
190 if (ref) |
|
|
191 { |
|
|
192 char *tmp = strsave (ref); |
|
|
193 |
|
|
194 SLList<char *> list; |
|
|
195 |
|
|
196 char *beg = tmp; |
|
|
197 char *end = 0; |
|
|
198 do |
|
|
199 { |
|
|
200 end = strchr (beg, '.'); |
|
|
201 if (end) |
|
|
202 *end = '\0'; |
|
|
203 |
|
|
204 list.append (strsave (beg)); |
|
|
205 } |
|
|
206 while (end && (beg = end + 1)); |
|
|
207 |
|
|
208 retval = lookup_map_element (list, insert, silent); |
|
|
209 |
|
|
210 delete [] tmp; |
|
|
211 } |
|
|
212 |
|
|
213 return retval; |
|
|
214 } |
|
|
215 |
|
|
216 tree_constant |
|
|
217 tree_constant::lookup_map_element (SLList<char*>& list, int insert, |
|
|
218 int silent) |
|
747
|
219 { |
|
|
220 tree_constant retval; |
|
|
221 |
|
|
222 tree_constant_rep *tmp_rep = rep; |
|
|
223 |
|
|
224 Pix p = list.first (); |
|
|
225 while (p) |
|
|
226 { |
|
|
227 char *elt = list (p); |
|
|
228 |
|
|
229 list.next (p); |
|
|
230 |
|
1277
|
231 tree_constant tmp; |
|
|
232 |
|
|
233 tmp = tmp_rep->lookup_map_element (elt, insert, silent); |
|
747
|
234 |
|
|
235 if (error_state) |
|
|
236 break; |
|
|
237 |
|
|
238 tmp_rep = tmp.rep; |
|
|
239 |
|
|
240 if (! p) |
|
|
241 retval = tmp; |
|
|
242 } |
|
|
243 |
|
|
244 return retval; |
|
|
245 } |
|
|
246 |
|
1199
|
247 void |
|
|
248 tree_constant::print (void) |
|
|
249 { |
|
|
250 ostrstream output_buf; |
|
|
251 print (output_buf); |
|
|
252 output_buf << ends; |
|
|
253 maybe_page_output (output_buf); |
|
|
254 } |
|
|
255 |
|
747
|
256 // Simple structure assignment. |
|
|
257 |
|
|
258 void |
|
|
259 tree_constant::make_unique (void) |
|
|
260 { |
|
|
261 if (rep->count > 1) |
|
|
262 { |
|
|
263 --rep->count; |
|
|
264 rep = new tree_constant_rep (*rep); |
|
|
265 rep->count = 1; |
|
|
266 } |
|
|
267 |
|
|
268 if (rep->is_map ()) |
|
|
269 { |
|
|
270 for (Pix p = rep->a_map->first (); p != 0; rep->a_map->next (p)) |
|
|
271 { |
|
|
272 rep->a_map->contents (p) . make_unique (); |
|
|
273 } |
|
|
274 } |
|
|
275 } |
|
|
276 |
|
|
277 tree_constant::tree_constant_rep * |
|
|
278 tree_constant::make_unique_map (void) |
|
|
279 { |
|
|
280 if (! rep->is_map ()) |
|
|
281 { |
|
|
282 if (--rep->count <= 0) |
|
|
283 delete rep; |
|
|
284 |
|
|
285 Octave_map m; |
|
|
286 rep = new tree_constant_rep (m); |
|
|
287 rep->count = 1; |
|
|
288 } |
|
|
289 |
|
|
290 make_unique (); |
|
|
291 |
|
|
292 return rep; |
|
|
293 } |
|
|
294 |
|
|
295 tree_constant |
|
780
|
296 tree_constant::assign_map_element (SLList<char*>& list, |
|
782
|
297 tree_constant& rhs) |
|
747
|
298 { |
|
|
299 tree_constant_rep *tmp_rep = make_unique_map (); |
|
|
300 |
|
|
301 if (rhs.is_map ()) |
|
|
302 rhs.make_unique (); |
|
|
303 |
|
|
304 Pix p = list.first (); |
|
|
305 while (p) |
|
|
306 { |
|
|
307 char *elt = list (p); |
|
|
308 |
|
|
309 list.next (p); |
|
|
310 |
|
|
311 tree_constant& tmp = tmp_rep->lookup_map_element (elt, 1); |
|
|
312 |
|
|
313 if (! p) |
|
|
314 { |
|
|
315 tmp = rhs; |
|
|
316 return tmp; |
|
|
317 } |
|
|
318 |
|
|
319 tmp_rep = tmp.make_unique_map (); |
|
|
320 } |
|
|
321 |
|
|
322 return tree_constant (); |
|
|
323 } |
|
|
324 |
|
|
325 // Indexed structure assignment. |
|
|
326 |
|
|
327 tree_constant |
|
780
|
328 tree_constant::assign_map_element (SLList<char*>& list, |
|
782
|
329 tree_constant& rhs, |
|
747
|
330 const Octave_object& args) |
|
|
331 { |
|
|
332 tree_constant_rep *tmp_rep = make_unique_map (); |
|
|
333 |
|
|
334 if (rhs.is_map ()) |
|
|
335 rhs.make_unique (); |
|
|
336 |
|
|
337 Pix p = list.first (); |
|
|
338 while (p) |
|
|
339 { |
|
|
340 char *elt = list (p); |
|
|
341 |
|
|
342 list.next (p); |
|
|
343 |
|
|
344 tree_constant& tmp = tmp_rep->lookup_map_element (elt, 1); |
|
|
345 |
|
|
346 if (! p) |
|
|
347 { |
|
|
348 tmp.assign (rhs, args); |
|
|
349 return tmp; |
|
|
350 } |
|
|
351 |
|
|
352 tmp_rep = tmp.make_unique_map (); |
|
|
353 } |
|
|
354 |
|
|
355 return tree_constant (); |
|
|
356 } |
|
|
357 |
|
|
358 void |
|
|
359 tree_constant::print_code (ostream& os) |
|
|
360 { |
|
|
361 print_code_indent (os); |
|
|
362 |
|
|
363 if (in_parens) |
|
|
364 os << "("; |
|
|
365 |
|
|
366 if (rep) |
|
|
367 rep->print_code (os); |
|
|
368 |
|
|
369 if (in_parens) |
|
|
370 os << ")"; |
|
|
371 } |
|
|
372 |
|
1199
|
373 int |
|
|
374 print_as_scalar (const tree_constant& val) |
|
|
375 { |
|
|
376 int nr = val.rows (); |
|
|
377 int nc = val.columns (); |
|
|
378 return (val.is_scalar_type () |
|
1355
|
379 || (val.is_string () && nr <= 1) |
|
1199
|
380 || (val.is_matrix_type () |
|
|
381 && ((nr == 1 && nc == 1) |
|
|
382 || nr == 0 |
|
|
383 || nc == 0))); |
|
|
384 } |
|
|
385 |
|
|
386 int |
|
|
387 print_as_structure (const tree_constant& val) |
|
|
388 { |
|
|
389 return val.is_map (); |
|
|
390 } |
|
|
391 |
|
1299
|
392 // The real representation of constants. |
|
|
393 |
|
|
394 TC_REP::tree_constant_rep (void) |
|
|
395 { |
|
|
396 type_tag = unknown_constant; |
|
|
397 orig_text = 0; |
|
|
398 } |
|
|
399 |
|
|
400 TC_REP::tree_constant_rep (double d) |
|
|
401 { |
|
|
402 scalar = d; |
|
|
403 type_tag = scalar_constant; |
|
|
404 orig_text = 0; |
|
|
405 } |
|
|
406 |
|
|
407 TC_REP::tree_constant_rep (const Matrix& m) |
|
|
408 { |
|
|
409 if (m.rows () == 1 && m.columns () == 1) |
|
|
410 { |
|
|
411 scalar = m.elem (0, 0); |
|
|
412 type_tag = scalar_constant; |
|
|
413 } |
|
|
414 else |
|
|
415 { |
|
|
416 matrix = new Matrix (m); |
|
|
417 type_tag = matrix_constant; |
|
|
418 } |
|
|
419 orig_text = 0; |
|
|
420 } |
|
|
421 |
|
|
422 TC_REP::tree_constant_rep (const DiagMatrix& d) |
|
|
423 { |
|
|
424 if (d.rows () == 1 && d.columns () == 1) |
|
|
425 { |
|
|
426 scalar = d.elem (0, 0); |
|
|
427 type_tag = scalar_constant; |
|
|
428 } |
|
|
429 else |
|
|
430 { |
|
|
431 matrix = new Matrix (d); |
|
|
432 type_tag = matrix_constant; |
|
|
433 } |
|
|
434 orig_text = 0; |
|
|
435 } |
|
|
436 |
|
|
437 TC_REP::tree_constant_rep (const RowVector& v, int prefer_column_vector) |
|
|
438 { |
|
|
439 int len = v.capacity (); |
|
|
440 if (len == 1) |
|
|
441 { |
|
|
442 scalar = v.elem (0); |
|
|
443 type_tag = scalar_constant; |
|
|
444 } |
|
|
445 else |
|
|
446 { |
|
|
447 int pcv = (prefer_column_vector < 0) |
|
|
448 ? user_pref.prefer_column_vectors |
|
|
449 : prefer_column_vector; |
|
|
450 |
|
|
451 if (pcv) |
|
|
452 { |
|
|
453 Matrix m (len, 1); |
|
|
454 for (int i = 0; i < len; i++) |
|
|
455 m.elem (i, 0) = v.elem (i); |
|
|
456 matrix = new Matrix (m); |
|
|
457 type_tag = matrix_constant; |
|
|
458 } |
|
|
459 else |
|
|
460 { |
|
|
461 Matrix m (1, len); |
|
|
462 for (int i = 0; i < len; i++) |
|
|
463 m.elem (0, i) = v.elem (i); |
|
|
464 matrix = new Matrix (m); |
|
|
465 type_tag = matrix_constant; |
|
|
466 } |
|
|
467 } |
|
|
468 orig_text = 0; |
|
|
469 } |
|
|
470 |
|
|
471 TC_REP::tree_constant_rep (const ColumnVector& v, int prefer_column_vector) |
|
|
472 { |
|
|
473 int len = v.capacity (); |
|
|
474 if (len == 1) |
|
|
475 { |
|
|
476 scalar = v.elem (0); |
|
|
477 type_tag = scalar_constant; |
|
|
478 } |
|
|
479 else |
|
|
480 { |
|
|
481 int pcv = (prefer_column_vector < 0) |
|
|
482 ? user_pref.prefer_column_vectors |
|
|
483 : prefer_column_vector; |
|
|
484 |
|
|
485 if (pcv) |
|
|
486 { |
|
|
487 Matrix m (len, 1); |
|
|
488 for (int i = 0; i < len; i++) |
|
|
489 m.elem (i, 0) = v.elem (i); |
|
|
490 matrix = new Matrix (m); |
|
|
491 type_tag = matrix_constant; |
|
|
492 } |
|
|
493 else |
|
|
494 { |
|
|
495 Matrix m (1, len); |
|
|
496 for (int i = 0; i < len; i++) |
|
|
497 m.elem (0, i) = v.elem (i); |
|
|
498 matrix = new Matrix (m); |
|
|
499 type_tag = matrix_constant; |
|
|
500 } |
|
|
501 } |
|
|
502 orig_text = 0; |
|
|
503 } |
|
|
504 |
|
|
505 TC_REP::tree_constant_rep (const Complex& c) |
|
|
506 { |
|
|
507 complex_scalar = new Complex (c); |
|
|
508 type_tag = complex_scalar_constant; |
|
|
509 orig_text = 0; |
|
|
510 } |
|
|
511 |
|
|
512 TC_REP::tree_constant_rep (const ComplexMatrix& m) |
|
|
513 { |
|
|
514 if (m.rows () == 1 && m.columns () == 1) |
|
|
515 { |
|
|
516 complex_scalar = new Complex (m.elem (0, 0)); |
|
|
517 type_tag = complex_scalar_constant; |
|
|
518 } |
|
|
519 else |
|
|
520 { |
|
|
521 complex_matrix = new ComplexMatrix (m); |
|
|
522 type_tag = complex_matrix_constant; |
|
|
523 } |
|
|
524 orig_text = 0; |
|
|
525 } |
|
|
526 |
|
|
527 TC_REP::tree_constant_rep (const ComplexDiagMatrix& d) |
|
|
528 { |
|
|
529 if (d.rows () == 1 && d.columns () == 1) |
|
|
530 { |
|
|
531 complex_scalar = new Complex (d.elem (0, 0)); |
|
|
532 type_tag = complex_scalar_constant; |
|
|
533 } |
|
|
534 else |
|
|
535 { |
|
|
536 complex_matrix = new ComplexMatrix (d); |
|
|
537 type_tag = complex_matrix_constant; |
|
|
538 } |
|
|
539 orig_text = 0; |
|
|
540 } |
|
|
541 |
|
|
542 TC_REP::tree_constant_rep (const ComplexRowVector& v, |
|
|
543 int prefer_column_vector) |
|
|
544 { |
|
|
545 int len = v.capacity (); |
|
|
546 if (len == 1) |
|
|
547 { |
|
|
548 complex_scalar = new Complex (v.elem (0)); |
|
|
549 type_tag = complex_scalar_constant; |
|
|
550 } |
|
|
551 else |
|
|
552 { |
|
|
553 int pcv = (prefer_column_vector < 0) |
|
|
554 ? user_pref.prefer_column_vectors |
|
|
555 : prefer_column_vector; |
|
|
556 |
|
|
557 if (pcv) |
|
|
558 { |
|
|
559 ComplexMatrix m (len, 1); |
|
|
560 for (int i = 0; i < len; i++) |
|
|
561 m.elem (i, 0) = v.elem (i); |
|
|
562 complex_matrix = new ComplexMatrix (m); |
|
|
563 type_tag = complex_matrix_constant; |
|
|
564 } |
|
|
565 else |
|
|
566 { |
|
|
567 ComplexMatrix m (1, len); |
|
|
568 for (int i = 0; i < len; i++) |
|
|
569 m.elem (0, i) = v.elem (i); |
|
|
570 complex_matrix = new ComplexMatrix (m); |
|
|
571 type_tag = complex_matrix_constant; |
|
|
572 } |
|
|
573 } |
|
|
574 orig_text = 0; |
|
|
575 } |
|
|
576 |
|
|
577 TC_REP::tree_constant_rep (const ComplexColumnVector& v, int |
|
|
578 prefer_column_vector) |
|
|
579 { |
|
|
580 int len = v.capacity (); |
|
|
581 if (len == 1) |
|
|
582 { |
|
|
583 complex_scalar = new Complex (v.elem (0)); |
|
|
584 type_tag = complex_scalar_constant; |
|
|
585 } |
|
|
586 else |
|
|
587 { |
|
|
588 int pcv = (prefer_column_vector < 0) |
|
|
589 ? user_pref.prefer_column_vectors |
|
|
590 : prefer_column_vector; |
|
|
591 |
|
|
592 if (pcv) |
|
|
593 { |
|
|
594 ComplexMatrix m (len, 1); |
|
|
595 for (int i = 0; i < len; i++) |
|
|
596 m.elem (i, 0) = v.elem (i); |
|
|
597 complex_matrix = new ComplexMatrix (m); |
|
|
598 type_tag = complex_matrix_constant; |
|
|
599 } |
|
|
600 else |
|
|
601 { |
|
|
602 ComplexMatrix m (1, len); |
|
|
603 for (int i = 0; i < len; i++) |
|
|
604 m.elem (0, i) = v.elem (i); |
|
|
605 complex_matrix = new ComplexMatrix (m); |
|
|
606 type_tag = complex_matrix_constant; |
|
|
607 } |
|
|
608 } |
|
|
609 orig_text = 0; |
|
|
610 } |
|
|
611 |
|
|
612 TC_REP::tree_constant_rep (const char *s) |
|
|
613 { |
|
1355
|
614 str_obj = new Octave_str_obj (s); |
|
|
615 type_tag = string_constant; |
|
|
616 orig_text = 0; |
|
|
617 } |
|
|
618 |
|
|
619 TC_REP::tree_constant_rep (const Octave_str_obj& s) |
|
|
620 { |
|
|
621 str_obj = new Octave_str_obj (s); |
|
1299
|
622 type_tag = string_constant; |
|
|
623 orig_text = 0; |
|
|
624 } |
|
|
625 |
|
|
626 TC_REP::tree_constant_rep (double b, double l, double i) |
|
|
627 { |
|
|
628 range = new Range (b, l, i); |
|
|
629 int nel = range->nelem (); |
|
|
630 if (nel > 1) |
|
|
631 type_tag = range_constant; |
|
|
632 else |
|
|
633 { |
|
|
634 delete range; |
|
|
635 if (nel == 1) |
|
|
636 { |
|
|
637 scalar = b; |
|
|
638 type_tag = scalar_constant; |
|
|
639 } |
|
|
640 else if (nel == 0) |
|
|
641 { |
|
|
642 matrix = new Matrix (); |
|
|
643 type_tag = matrix_constant; |
|
|
644 } |
|
|
645 else |
|
|
646 { |
|
|
647 type_tag = unknown_constant; |
|
|
648 if (nel == -1) |
|
|
649 ::error ("number of elements in range exceeds INT_MAX"); |
|
|
650 else |
|
|
651 ::error ("invalid range"); |
|
|
652 } |
|
|
653 } |
|
|
654 orig_text = 0; |
|
|
655 } |
|
|
656 |
|
|
657 TC_REP::tree_constant_rep (const Range& r) |
|
|
658 { |
|
|
659 int nel = r.nelem (); |
|
|
660 if (nel > 1) |
|
|
661 { |
|
|
662 range = new Range (r); |
|
|
663 type_tag = range_constant; |
|
|
664 } |
|
|
665 else if (nel == 1) |
|
|
666 { |
|
|
667 scalar = r.base (); |
|
|
668 type_tag = scalar_constant; |
|
|
669 } |
|
|
670 else if (nel == 0) |
|
|
671 { |
|
|
672 matrix = new Matrix (); |
|
|
673 type_tag = matrix_constant; |
|
|
674 } |
|
|
675 else |
|
|
676 { |
|
|
677 type_tag = unknown_constant; |
|
|
678 if (nel == -1) |
|
|
679 ::error ("number of elements in range exceeds INT_MAX"); |
|
|
680 else |
|
|
681 ::error ("invalid range"); |
|
|
682 } |
|
|
683 |
|
|
684 orig_text = 0; |
|
|
685 } |
|
|
686 |
|
|
687 TC_REP::tree_constant_rep (const Octave_map& m) |
|
|
688 { |
|
|
689 a_map = new Octave_map (m); |
|
|
690 type_tag = map_constant; |
|
|
691 orig_text = 0; |
|
|
692 } |
|
|
693 |
|
|
694 TC_REP::tree_constant_rep (TC_REP::constant_type t) |
|
|
695 { |
|
|
696 assert (t == magic_colon || t == all_va_args); |
|
|
697 type_tag = t; |
|
|
698 orig_text = 0; |
|
|
699 } |
|
|
700 |
|
|
701 TC_REP::tree_constant_rep (const tree_constant_rep& t) |
|
|
702 { |
|
|
703 type_tag = t.type_tag; |
|
|
704 |
|
|
705 switch (t.type_tag) |
|
|
706 { |
|
|
707 case unknown_constant: |
|
|
708 break; |
|
|
709 |
|
|
710 case scalar_constant: |
|
|
711 scalar = t.scalar; |
|
|
712 break; |
|
|
713 |
|
|
714 case matrix_constant: |
|
|
715 matrix = new Matrix (*(t.matrix)); |
|
|
716 break; |
|
|
717 |
|
|
718 case string_constant: |
|
1355
|
719 str_obj = new Octave_str_obj (*(t.str_obj)); |
|
1299
|
720 break; |
|
|
721 |
|
|
722 case complex_matrix_constant: |
|
|
723 complex_matrix = new ComplexMatrix (*(t.complex_matrix)); |
|
|
724 break; |
|
|
725 |
|
|
726 case complex_scalar_constant: |
|
|
727 complex_scalar = new Complex (*(t.complex_scalar)); |
|
|
728 break; |
|
|
729 |
|
|
730 case range_constant: |
|
|
731 range = new Range (*(t.range)); |
|
|
732 break; |
|
|
733 |
|
|
734 case map_constant: |
|
|
735 a_map = new Octave_map (*(t.a_map)); |
|
|
736 break; |
|
|
737 |
|
|
738 case magic_colon: |
|
|
739 case all_va_args: |
|
|
740 break; |
|
|
741 } |
|
|
742 |
|
|
743 orig_text = strsave (t.orig_text); |
|
|
744 } |
|
|
745 |
|
|
746 TC_REP::~tree_constant_rep (void) |
|
|
747 { |
|
|
748 switch (type_tag) |
|
|
749 { |
|
|
750 case matrix_constant: |
|
|
751 delete matrix; |
|
|
752 break; |
|
|
753 |
|
|
754 case complex_scalar_constant: |
|
|
755 delete complex_scalar; |
|
|
756 break; |
|
|
757 |
|
|
758 case complex_matrix_constant: |
|
|
759 delete complex_matrix; |
|
|
760 break; |
|
|
761 |
|
|
762 case string_constant: |
|
1355
|
763 delete str_obj; |
|
1299
|
764 break; |
|
|
765 |
|
|
766 case range_constant: |
|
|
767 delete range; |
|
|
768 break; |
|
|
769 |
|
|
770 case map_constant: |
|
|
771 delete a_map; |
|
|
772 break; |
|
|
773 |
|
|
774 case unknown_constant: |
|
|
775 case scalar_constant: |
|
|
776 case magic_colon: |
|
|
777 case all_va_args: |
|
|
778 break; |
|
|
779 } |
|
|
780 |
|
|
781 delete [] orig_text; |
|
|
782 } |
|
|
783 |
|
|
784 void * |
|
|
785 TC_REP::operator new (size_t size) |
|
|
786 { |
|
|
787 assert (size == sizeof (TC_REP)); |
|
|
788 |
|
|
789 if (! tc_rep_newlist) |
|
|
790 { |
|
|
791 int block_size = tc_rep_newlist_grow_size * sizeof (TC_REP); |
|
|
792 tc_rep_newlist = (TC_REP *) new char [block_size]; |
|
|
793 |
|
1321
|
794 int i = 0; |
|
|
795 |
|
|
796 for (i = 0; i < tc_rep_newlist_grow_size - 1; i++) |
|
1299
|
797 tc_rep_newlist[i].freeptr = &tc_rep_newlist[i+1]; |
|
|
798 |
|
|
799 tc_rep_newlist[i].freeptr = 0; |
|
|
800 } |
|
|
801 |
|
|
802 TC_REP *tmp = tc_rep_newlist; |
|
|
803 tc_rep_newlist = tc_rep_newlist->freeptr; |
|
|
804 return tmp; |
|
|
805 } |
|
|
806 |
|
|
807 void |
|
1488
|
808 TC_REP::operator delete (void *p, size_t /* size */) |
|
1299
|
809 { |
|
|
810 TC_REP *tmp = (TC_REP *) p; |
|
|
811 tmp->freeptr = tc_rep_newlist; |
|
|
812 tc_rep_newlist = tmp; |
|
|
813 } |
|
|
814 |
|
|
815 int |
|
|
816 TC_REP::rows (void) const |
|
|
817 { |
|
|
818 int retval = -1; |
|
|
819 |
|
|
820 switch (type_tag) |
|
|
821 { |
|
|
822 case scalar_constant: |
|
|
823 case complex_scalar_constant: |
|
|
824 retval = 1; |
|
|
825 break; |
|
|
826 |
|
|
827 case string_constant: |
|
1355
|
828 retval = str_obj->num_strings (); |
|
|
829 break; |
|
|
830 |
|
1299
|
831 case range_constant: |
|
|
832 retval = (columns () > 0); |
|
|
833 break; |
|
|
834 |
|
|
835 case matrix_constant: |
|
|
836 retval = matrix->rows (); |
|
|
837 break; |
|
|
838 |
|
|
839 case complex_matrix_constant: |
|
|
840 retval = complex_matrix->rows (); |
|
|
841 break; |
|
|
842 |
|
|
843 default: |
|
|
844 break; |
|
|
845 } |
|
|
846 |
|
|
847 return retval; |
|
|
848 } |
|
|
849 |
|
|
850 int |
|
|
851 TC_REP::columns (void) const |
|
|
852 { |
|
|
853 int retval = -1; |
|
|
854 |
|
|
855 switch (type_tag) |
|
|
856 { |
|
|
857 case scalar_constant: |
|
|
858 case complex_scalar_constant: |
|
|
859 retval = 1; |
|
|
860 break; |
|
|
861 |
|
|
862 case matrix_constant: |
|
|
863 retval = matrix->columns (); |
|
|
864 break; |
|
|
865 |
|
|
866 case complex_matrix_constant: |
|
|
867 retval = complex_matrix->columns (); |
|
|
868 break; |
|
|
869 |
|
|
870 case string_constant: |
|
1355
|
871 retval = str_obj->max_length (); |
|
1299
|
872 break; |
|
|
873 |
|
|
874 case range_constant: |
|
|
875 retval = range->nelem (); |
|
|
876 break; |
|
|
877 |
|
|
878 default: |
|
|
879 break; |
|
|
880 } |
|
|
881 |
|
|
882 return retval; |
|
|
883 } |
|
|
884 |
|
|
885 tree_constant |
|
|
886 TC_REP::all (void) const |
|
|
887 { |
|
|
888 tree_constant retval; |
|
|
889 |
|
|
890 if (error_state) |
|
|
891 return retval; |
|
|
892 |
|
|
893 if (! is_numeric_type ()) |
|
|
894 { |
|
|
895 tree_constant tmp = make_numeric (); |
|
|
896 |
|
|
897 if (error_state) |
|
|
898 return retval; |
|
|
899 |
|
|
900 return tmp.all (); |
|
|
901 } |
|
|
902 |
|
|
903 switch (type_tag) |
|
|
904 { |
|
|
905 case scalar_constant: |
|
1355
|
906 retval = (double) (scalar != 0.0); |
|
1299
|
907 break; |
|
|
908 |
|
|
909 case matrix_constant: |
|
1355
|
910 retval = matrix->all (); |
|
1299
|
911 break; |
|
|
912 |
|
|
913 case complex_scalar_constant: |
|
1355
|
914 retval = (double) (*complex_scalar != 0.0); |
|
1299
|
915 break; |
|
|
916 |
|
|
917 case complex_matrix_constant: |
|
1355
|
918 retval = complex_matrix->all (); |
|
1299
|
919 break; |
|
|
920 |
|
|
921 default: |
|
|
922 gripe_wrong_type_arg ("all", *this); |
|
|
923 break; |
|
|
924 } |
|
|
925 |
|
|
926 return retval; |
|
|
927 } |
|
|
928 |
|
|
929 tree_constant |
|
|
930 TC_REP::any (void) const |
|
|
931 { |
|
|
932 tree_constant retval; |
|
|
933 |
|
|
934 if (error_state) |
|
|
935 return retval; |
|
|
936 |
|
|
937 if (! is_numeric_type ()) |
|
|
938 { |
|
|
939 tree_constant tmp = make_numeric (); |
|
|
940 |
|
|
941 if (error_state) |
|
|
942 return retval; |
|
|
943 |
|
|
944 return tmp.any (); |
|
|
945 } |
|
|
946 |
|
|
947 switch (type_tag) |
|
|
948 { |
|
|
949 case scalar_constant: |
|
1355
|
950 retval = (double) (scalar != 0.0); |
|
1299
|
951 break; |
|
|
952 |
|
|
953 case matrix_constant: |
|
1355
|
954 retval = matrix->any (); |
|
1299
|
955 break; |
|
|
956 |
|
|
957 case complex_scalar_constant: |
|
1355
|
958 retval = (double) (*complex_scalar != 0.0); |
|
1299
|
959 break; |
|
|
960 |
|
|
961 case complex_matrix_constant: |
|
1355
|
962 retval = complex_matrix->any (); |
|
1299
|
963 break; |
|
|
964 |
|
|
965 default: |
|
|
966 gripe_wrong_type_arg ("any", *this); |
|
|
967 break; |
|
|
968 } |
|
|
969 |
|
|
970 return retval; |
|
|
971 } |
|
|
972 |
|
|
973 int |
|
|
974 TC_REP::valid_as_scalar_index (void) const |
|
|
975 { |
|
|
976 return (type_tag == magic_colon |
|
|
977 || (type_tag == scalar_constant |
|
|
978 && ! xisnan (scalar) |
|
|
979 && NINT (scalar) == 1) |
|
|
980 || (type_tag == range_constant |
|
|
981 && range->nelem () == 1 |
|
|
982 && ! xisnan (range->base ()) |
|
|
983 && NINT (range->base ()) == 1)); |
|
|
984 } |
|
|
985 |
|
|
986 int |
|
|
987 TC_REP::valid_as_zero_index (void) const |
|
|
988 { |
|
|
989 return ((type_tag == scalar_constant |
|
|
990 && ! xisnan (scalar) |
|
|
991 && NINT (scalar) == 0) |
|
|
992 || (type_tag == matrix_constant |
|
|
993 && matrix->rows () == 0 |
|
|
994 && matrix->columns () == 0) |
|
|
995 || (type_tag == range_constant |
|
|
996 && range->nelem () == 1 |
|
|
997 && ! xisnan (range->base ()) |
|
|
998 && NINT (range->base ()) == 0)); |
|
|
999 } |
|
|
1000 |
|
|
1001 int |
|
|
1002 TC_REP::is_true (void) const |
|
|
1003 { |
|
|
1004 int retval = 0; |
|
|
1005 |
|
|
1006 if (error_state) |
|
|
1007 return retval; |
|
|
1008 |
|
|
1009 if (! is_numeric_type ()) |
|
|
1010 { |
|
|
1011 tree_constant tmp = make_numeric (); |
|
|
1012 |
|
|
1013 if (error_state) |
|
|
1014 return retval; |
|
|
1015 |
|
|
1016 return tmp.is_true (); |
|
|
1017 } |
|
|
1018 |
|
|
1019 switch (type_tag) |
|
|
1020 { |
|
|
1021 case scalar_constant: |
|
|
1022 retval = (scalar != 0.0); |
|
|
1023 break; |
|
|
1024 |
|
|
1025 case matrix_constant: |
|
|
1026 { |
|
|
1027 Matrix m = (matrix->all ()) . all (); |
|
|
1028 retval = (m.rows () == 1 |
|
|
1029 && m.columns () == 1 |
|
|
1030 && m.elem (0, 0) != 0.0); |
|
|
1031 } |
|
|
1032 break; |
|
|
1033 |
|
|
1034 case complex_scalar_constant: |
|
|
1035 retval = (*complex_scalar != 0.0); |
|
|
1036 break; |
|
|
1037 |
|
|
1038 case complex_matrix_constant: |
|
|
1039 { |
|
|
1040 Matrix m = (complex_matrix->all ()) . all (); |
|
|
1041 retval = (m.rows () == 1 |
|
|
1042 && m.columns () == 1 |
|
|
1043 && m.elem (0, 0) != 0.0); |
|
|
1044 } |
|
|
1045 break; |
|
|
1046 |
|
|
1047 default: |
|
|
1048 gripe_wrong_type_arg (0, *this); |
|
|
1049 break; |
|
|
1050 } |
|
|
1051 |
|
|
1052 return retval; |
|
|
1053 } |
|
|
1054 |
|
|
1055 static void |
|
|
1056 warn_implicit_conversion (const char *from, const char *to) |
|
|
1057 { |
|
|
1058 warning ("implicit conversion from %s to %s", from, to); |
|
|
1059 } |
|
|
1060 |
|
|
1061 double |
|
|
1062 TC_REP::double_value (int force_string_conversion) const |
|
|
1063 { |
|
|
1064 double retval = octave_NaN; |
|
|
1065 |
|
|
1066 switch (type_tag) |
|
|
1067 { |
|
|
1068 case scalar_constant: |
|
|
1069 retval = scalar; |
|
|
1070 break; |
|
|
1071 |
|
|
1072 case matrix_constant: |
|
|
1073 { |
|
|
1074 if (user_pref.do_fortran_indexing && rows () > 0 && columns () > 0) |
|
|
1075 retval = matrix->elem (0, 0); |
|
|
1076 else |
|
|
1077 gripe_invalid_conversion ("real matrix", "real scalar"); |
|
|
1078 } |
|
|
1079 break; |
|
|
1080 |
|
|
1081 case complex_matrix_constant: |
|
|
1082 case complex_scalar_constant: |
|
|
1083 { |
|
|
1084 int flag = user_pref.ok_to_lose_imaginary_part; |
|
|
1085 |
|
|
1086 if (flag < 0) |
|
|
1087 warn_implicit_conversion ("complex scalar", "real scalar"); |
|
|
1088 |
|
|
1089 if (flag) |
|
|
1090 { |
|
|
1091 if (type_tag == complex_scalar_constant) |
|
|
1092 retval = ::real (*complex_scalar); |
|
|
1093 else if (type_tag == complex_matrix_constant) |
|
|
1094 { |
|
|
1095 if (user_pref.do_fortran_indexing |
|
|
1096 && rows () > 0 && columns () > 0) |
|
|
1097 retval = ::real (complex_matrix->elem (0, 0)); |
|
|
1098 else |
|
|
1099 gripe_invalid_conversion ("complex matrix", "real scalar"); |
|
|
1100 } |
|
|
1101 else |
|
|
1102 panic_impossible (); |
|
|
1103 } |
|
|
1104 else |
|
|
1105 gripe_invalid_conversion ("complex scalar", "real scalar"); |
|
|
1106 } |
|
|
1107 break; |
|
|
1108 |
|
|
1109 case string_constant: |
|
|
1110 { |
|
|
1111 int flag = force_string_conversion; |
|
|
1112 if (! flag) |
|
|
1113 flag = user_pref.implicit_str_to_num_ok; |
|
|
1114 |
|
|
1115 if (flag < 0) |
|
|
1116 warn_implicit_conversion ("string", "real scalar"); |
|
|
1117 |
|
1355
|
1118 int len = str_obj->max_length (); |
|
|
1119 if (flag |
|
|
1120 && ((str_obj->num_strings () == 1 && len == 1) |
|
|
1121 || (len > 1 && user_pref.do_fortran_indexing))) |
|
|
1122 retval = toascii ((int) str_obj->elem (0, 0)); |
|
1299
|
1123 else |
|
|
1124 gripe_invalid_conversion ("string", "real scalar"); |
|
|
1125 } |
|
|
1126 break; |
|
|
1127 |
|
|
1128 case range_constant: |
|
|
1129 { |
|
|
1130 int nel = range->nelem (); |
|
|
1131 if (nel == 1 || (nel > 1 && user_pref.do_fortran_indexing)) |
|
|
1132 retval = range->base (); |
|
|
1133 else |
|
|
1134 gripe_invalid_conversion ("range", "real scalar"); |
|
|
1135 } |
|
|
1136 break; |
|
|
1137 |
|
|
1138 default: |
|
|
1139 gripe_invalid_conversion (type_as_string (), "real scalar"); |
|
|
1140 break; |
|
|
1141 } |
|
|
1142 |
|
|
1143 return retval; |
|
|
1144 } |
|
|
1145 |
|
|
1146 Matrix |
|
|
1147 TC_REP::matrix_value (int force_string_conversion) const |
|
|
1148 { |
|
|
1149 Matrix retval; |
|
|
1150 |
|
|
1151 switch (type_tag) |
|
|
1152 { |
|
|
1153 case scalar_constant: |
|
|
1154 retval = Matrix (1, 1, scalar); |
|
|
1155 break; |
|
|
1156 |
|
|
1157 case matrix_constant: |
|
|
1158 retval = *matrix; |
|
|
1159 break; |
|
|
1160 |
|
|
1161 case complex_scalar_constant: |
|
|
1162 case complex_matrix_constant: |
|
|
1163 { |
|
|
1164 int flag = user_pref.ok_to_lose_imaginary_part; |
|
|
1165 if (flag < 0) |
|
|
1166 warn_implicit_conversion ("complex matrix", "real matrix"); |
|
|
1167 |
|
|
1168 if (flag) |
|
|
1169 { |
|
|
1170 if (type_tag == complex_scalar_constant) |
|
|
1171 retval = Matrix (1, 1, ::real (*complex_scalar)); |
|
|
1172 else if (type_tag == complex_matrix_constant) |
|
|
1173 retval = ::real (*complex_matrix); |
|
|
1174 else |
|
|
1175 panic_impossible (); |
|
|
1176 } |
|
|
1177 else |
|
|
1178 gripe_invalid_conversion ("complex matrix", "real matrix"); |
|
|
1179 } |
|
|
1180 break; |
|
|
1181 |
|
|
1182 case string_constant: |
|
|
1183 { |
|
|
1184 int flag = force_string_conversion; |
|
|
1185 if (! flag) |
|
|
1186 flag = user_pref.implicit_str_to_num_ok; |
|
|
1187 |
|
|
1188 if (flag < 0) |
|
|
1189 warn_implicit_conversion ("string", "real matrix"); |
|
|
1190 |
|
|
1191 if (flag) |
|
|
1192 { |
|
1355
|
1193 int nr = str_obj->num_strings (); |
|
|
1194 int nc = str_obj->max_length (); |
|
|
1195 |
|
|
1196 if (nr > 0 && nc > 0) |
|
1299
|
1197 { |
|
1355
|
1198 retval.resize (nr, nc); |
|
|
1199 |
|
|
1200 for (int i = 0; i < nr; i++) |
|
|
1201 { |
|
|
1202 for (int j = 0; j < nc; j++) |
|
|
1203 { |
|
|
1204 int c = (int) str_obj->elem (i, j); |
|
|
1205 retval.elem (i, j) = toascii (c); |
|
|
1206 } |
|
|
1207 } |
|
1299
|
1208 } |
|
|
1209 else |
|
1355
|
1210 retval = Matrix (); // XXX FIXME XXX -- is this correct? |
|
1299
|
1211 } |
|
|
1212 else |
|
|
1213 gripe_invalid_conversion ("string", "real matrix"); |
|
|
1214 } |
|
|
1215 break; |
|
|
1216 |
|
|
1217 case range_constant: |
|
|
1218 retval = range->matrix_value (); |
|
|
1219 break; |
|
|
1220 |
|
|
1221 default: |
|
|
1222 gripe_invalid_conversion (type_as_string (), "real matrix"); |
|
|
1223 break; |
|
|
1224 } |
|
|
1225 |
|
|
1226 return retval; |
|
|
1227 } |
|
|
1228 |
|
|
1229 Complex |
|
|
1230 TC_REP::complex_value (int force_string_conversion) const |
|
|
1231 { |
|
|
1232 Complex retval (octave_NaN, octave_NaN); |
|
|
1233 |
|
|
1234 switch (type_tag) |
|
|
1235 { |
|
|
1236 case complex_scalar_constant: |
|
|
1237 retval = *complex_scalar; |
|
|
1238 break; |
|
|
1239 |
|
|
1240 case scalar_constant: |
|
|
1241 retval = scalar; |
|
|
1242 break; |
|
|
1243 |
|
|
1244 case complex_matrix_constant: |
|
|
1245 case matrix_constant: |
|
|
1246 { |
|
|
1247 if (user_pref.do_fortran_indexing && rows () > 0 && columns () > 0) |
|
|
1248 { |
|
|
1249 if (type_tag == complex_matrix_constant) |
|
|
1250 retval = complex_matrix->elem (0, 0); |
|
|
1251 else |
|
|
1252 retval = matrix->elem (0, 0); |
|
|
1253 } |
|
|
1254 else |
|
|
1255 gripe_invalid_conversion ("real matrix", "real scalar"); |
|
|
1256 } |
|
|
1257 break; |
|
|
1258 |
|
|
1259 case string_constant: |
|
|
1260 { |
|
|
1261 int flag = force_string_conversion; |
|
|
1262 if (! flag) |
|
|
1263 flag = user_pref.implicit_str_to_num_ok; |
|
|
1264 |
|
|
1265 if (flag < 0) |
|
|
1266 warn_implicit_conversion ("string", "complex scalar"); |
|
|
1267 |
|
1355
|
1268 int len = str_obj->max_length (); |
|
|
1269 if (flag |
|
|
1270 && ((str_obj->num_strings () == 1 && len == 1) |
|
|
1271 || (len > 1 && user_pref.do_fortran_indexing))) |
|
|
1272 retval = toascii ((int) str_obj->elem (0, 0)); |
|
1299
|
1273 else |
|
|
1274 gripe_invalid_conversion ("string", "complex scalar"); |
|
|
1275 } |
|
|
1276 break; |
|
|
1277 |
|
|
1278 case range_constant: |
|
|
1279 { |
|
|
1280 int nel = range->nelem (); |
|
|
1281 if (nel == 1 || (nel > 1 && user_pref.do_fortran_indexing)) |
|
|
1282 retval = range->base (); |
|
|
1283 else |
|
|
1284 gripe_invalid_conversion ("range", "complex scalar"); |
|
|
1285 } |
|
|
1286 break; |
|
|
1287 |
|
|
1288 default: |
|
|
1289 gripe_invalid_conversion (type_as_string (), "complex scalar"); |
|
|
1290 break; |
|
|
1291 } |
|
|
1292 |
|
|
1293 return retval; |
|
|
1294 } |
|
|
1295 |
|
|
1296 ComplexMatrix |
|
|
1297 TC_REP::complex_matrix_value (int force_string_conversion) const |
|
|
1298 { |
|
|
1299 ComplexMatrix retval; |
|
|
1300 |
|
|
1301 switch (type_tag) |
|
|
1302 { |
|
|
1303 case scalar_constant: |
|
|
1304 retval = ComplexMatrix (1, 1, Complex (scalar)); |
|
|
1305 break; |
|
|
1306 |
|
|
1307 case complex_scalar_constant: |
|
|
1308 retval = ComplexMatrix (1, 1, *complex_scalar); |
|
|
1309 break; |
|
|
1310 |
|
|
1311 case matrix_constant: |
|
|
1312 retval = ComplexMatrix (*matrix); |
|
|
1313 break; |
|
|
1314 |
|
|
1315 case complex_matrix_constant: |
|
|
1316 retval = *complex_matrix; |
|
|
1317 break; |
|
|
1318 |
|
|
1319 case string_constant: |
|
|
1320 { |
|
|
1321 int flag = force_string_conversion; |
|
|
1322 if (! flag) |
|
|
1323 flag = user_pref.implicit_str_to_num_ok; |
|
|
1324 |
|
|
1325 if (flag < 0) |
|
|
1326 warn_implicit_conversion ("string", "complex matrix"); |
|
|
1327 |
|
|
1328 if (flag) |
|
|
1329 { |
|
1355
|
1330 int nr = str_obj->num_strings (); |
|
|
1331 int nc = str_obj->max_length (); |
|
|
1332 |
|
|
1333 if (nr > 0 && nc > 0) |
|
1299
|
1334 { |
|
1355
|
1335 retval.resize (nr, nc); |
|
|
1336 |
|
|
1337 for (int i = 0; i < nr; i++) |
|
|
1338 { |
|
|
1339 for (int j = 0; j < nc; j++) |
|
|
1340 { |
|
|
1341 int c = (int) str_obj->elem (i, j); |
|
|
1342 retval.elem (i, j) = toascii (c); |
|
|
1343 } |
|
|
1344 } |
|
1299
|
1345 } |
|
|
1346 else |
|
|
1347 panic_impossible (); |
|
|
1348 } |
|
|
1349 else |
|
|
1350 gripe_invalid_conversion ("string", "real matrix"); |
|
|
1351 } |
|
|
1352 break; |
|
|
1353 |
|
|
1354 case range_constant: |
|
|
1355 retval = range->matrix_value (); |
|
|
1356 break; |
|
|
1357 |
|
|
1358 default: |
|
|
1359 gripe_invalid_conversion (type_as_string (), "complex matrix"); |
|
|
1360 break; |
|
|
1361 } |
|
|
1362 |
|
|
1363 return retval; |
|
|
1364 } |
|
|
1365 |
|
1355
|
1366 Octave_str_obj |
|
|
1367 TC_REP::all_strings (void) const |
|
|
1368 { |
|
|
1369 if (type_tag == string_constant) |
|
|
1370 return *str_obj; |
|
|
1371 else |
|
|
1372 { |
|
|
1373 gripe_invalid_conversion (type_as_string (), "string"); |
|
|
1374 return 0; |
|
|
1375 } |
|
|
1376 } |
|
|
1377 |
|
|
1378 const char * |
|
1299
|
1379 TC_REP::string_value (void) const |
|
|
1380 { |
|
|
1381 if (type_tag == string_constant) |
|
1355
|
1382 return str_obj->elem (0).c_str (); // XXX FIXME??? XXX |
|
1299
|
1383 else |
|
|
1384 { |
|
|
1385 gripe_invalid_conversion (type_as_string (), "string"); |
|
|
1386 return 0; |
|
|
1387 } |
|
|
1388 } |
|
|
1389 |
|
|
1390 Range |
|
|
1391 TC_REP::range_value (void) const |
|
|
1392 { |
|
|
1393 assert (type_tag == range_constant); |
|
|
1394 return *range; |
|
|
1395 } |
|
|
1396 |
|
|
1397 Octave_map |
|
|
1398 TC_REP::map_value (void) const |
|
|
1399 { |
|
|
1400 assert (type_tag == map_constant); |
|
|
1401 return *a_map; |
|
|
1402 } |
|
|
1403 |
|
|
1404 tree_constant& |
|
|
1405 TC_REP::lookup_map_element (const char *name, int insert, int silent) |
|
|
1406 { |
|
|
1407 static tree_constant retval; |
|
|
1408 |
|
|
1409 if (type_tag == map_constant) |
|
|
1410 { |
|
|
1411 Pix idx = a_map->seek (name); |
|
|
1412 |
|
|
1413 if (idx) |
|
|
1414 return a_map->contents (idx); |
|
|
1415 else if (insert) |
|
|
1416 return (*a_map) [name]; |
|
|
1417 else if (! silent) |
|
|
1418 error ("structure has no member `%s'", name); |
|
|
1419 } |
|
|
1420 else if (! silent) |
|
|
1421 error ("invalid structure access attempted"); |
|
|
1422 |
|
|
1423 return retval; |
|
|
1424 } |
|
|
1425 |
|
|
1426 // This could be made more efficient by doing all the work here rather |
|
|
1427 // than relying on matrix_value() to do any possible type conversions. |
|
|
1428 |
|
|
1429 ColumnVector |
|
|
1430 TC_REP::vector_value (int force_string_conversion, |
|
|
1431 int force_vector_conversion) const |
|
|
1432 { |
|
|
1433 ColumnVector retval; |
|
|
1434 |
|
|
1435 Matrix m = matrix_value (force_string_conversion); |
|
|
1436 |
|
|
1437 if (error_state) |
|
|
1438 return retval; |
|
|
1439 |
|
|
1440 int nr = m.rows (); |
|
|
1441 int nc = m.columns (); |
|
|
1442 if (nr == 1) |
|
|
1443 { |
|
|
1444 retval.resize (nc); |
|
|
1445 for (int i = 0; i < nc; i++) |
|
|
1446 retval.elem (i) = m (0, i); |
|
|
1447 } |
|
|
1448 else if (nc == 1) |
|
|
1449 { |
|
|
1450 retval.resize (nr); |
|
|
1451 for (int i = 0; i < nr; i++) |
|
|
1452 retval.elem (i) = m.elem (i, 0); |
|
|
1453 } |
|
|
1454 else if (nr > 0 && nc > 0 |
|
|
1455 && (user_pref.do_fortran_indexing || force_vector_conversion)) |
|
|
1456 { |
|
|
1457 retval.resize (nr * nc); |
|
|
1458 int k = 0; |
|
|
1459 for (int j = 0; j < nc; j++) |
|
|
1460 for (int i = 0; i < nr; i++) |
|
|
1461 retval.elem (k++) = m.elem (i, j); |
|
|
1462 } |
|
|
1463 else |
|
|
1464 gripe_invalid_conversion ("real matrix", "real vector"); |
|
|
1465 |
|
|
1466 return retval; |
|
|
1467 } |
|
|
1468 |
|
|
1469 // This could be made more efficient by doing all the work here rather |
|
|
1470 // than relying on complex_matrix_value() to do any possible type |
|
|
1471 // conversions. |
|
|
1472 |
|
|
1473 ComplexColumnVector |
|
|
1474 TC_REP::complex_vector_value (int force_string_conversion, |
|
|
1475 int force_vector_conversion) const |
|
|
1476 { |
|
|
1477 ComplexColumnVector retval; |
|
|
1478 |
|
|
1479 ComplexMatrix m = complex_matrix_value (force_string_conversion); |
|
|
1480 |
|
|
1481 if (error_state) |
|
|
1482 return retval; |
|
|
1483 |
|
|
1484 int nr = m.rows (); |
|
|
1485 int nc = m.columns (); |
|
|
1486 if (nr == 1) |
|
|
1487 { |
|
|
1488 retval.resize (nc); |
|
|
1489 for (int i = 0; i < nc; i++) |
|
|
1490 retval.elem (i) = m (0, i); |
|
|
1491 } |
|
|
1492 else if (nc == 1) |
|
|
1493 { |
|
|
1494 retval.resize (nr); |
|
|
1495 for (int i = 0; i < nr; i++) |
|
|
1496 retval.elem (i) = m.elem (i, 0); |
|
|
1497 } |
|
|
1498 else if (nr > 0 && nc > 0 |
|
|
1499 && (user_pref.do_fortran_indexing || force_vector_conversion)) |
|
|
1500 { |
|
|
1501 retval.resize (nr * nc); |
|
|
1502 int k = 0; |
|
|
1503 for (int j = 0; j < nc; j++) |
|
|
1504 for (int i = 0; i < nr; i++) |
|
|
1505 retval.elem (k++) = m.elem (i, j); |
|
|
1506 } |
|
|
1507 else |
|
|
1508 gripe_invalid_conversion ("complex matrix", "complex vector"); |
|
|
1509 |
|
|
1510 return retval; |
|
|
1511 } |
|
|
1512 |
|
|
1513 tree_constant |
|
|
1514 TC_REP::convert_to_str (void) const |
|
|
1515 { |
|
|
1516 tree_constant retval; |
|
|
1517 |
|
|
1518 switch (type_tag) |
|
|
1519 { |
|
|
1520 case complex_scalar_constant: |
|
|
1521 case scalar_constant: |
|
|
1522 { |
|
|
1523 double d = double_value (); |
|
|
1524 |
|
|
1525 if (xisnan (d)) |
|
|
1526 { |
|
|
1527 ::error ("invalid conversion from NaN to character"); |
|
|
1528 return retval; |
|
|
1529 } |
|
|
1530 else |
|
|
1531 { |
|
1358
|
1532 // XXX FIXME XXX -- warn about out of range conversions? |
|
|
1533 |
|
1299
|
1534 int i = NINT (d); |
|
|
1535 char s[2]; |
|
|
1536 s[0] = (char) i; |
|
|
1537 s[1] = '\0'; |
|
1355
|
1538 retval = s; |
|
1299
|
1539 } |
|
|
1540 } |
|
|
1541 break; |
|
|
1542 |
|
|
1543 case complex_matrix_constant: |
|
|
1544 case matrix_constant: |
|
|
1545 { |
|
|
1546 if (rows () == 0 && columns () == 0) |
|
|
1547 { |
|
|
1548 char s = '\0'; |
|
1355
|
1549 retval = &s; |
|
1299
|
1550 } |
|
|
1551 else |
|
|
1552 { |
|
1355
|
1553 Matrix m = matrix_value (); |
|
|
1554 |
|
|
1555 int nr = m.rows (); |
|
|
1556 int nc = m.columns (); |
|
|
1557 |
|
|
1558 if (nr == 0 || nc == 0) |
|
1299
|
1559 { |
|
|
1560 char s = '\0'; |
|
1355
|
1561 retval = &s; |
|
1299
|
1562 } |
|
|
1563 else |
|
|
1564 { |
|
1355
|
1565 Octave_str_obj s (nr); |
|
|
1566 |
|
|
1567 for (int i = 0; i < nr; i++) |
|
1299
|
1568 { |
|
1355
|
1569 char buf[nc+1]; |
|
|
1570 buf[nc] = '\0'; |
|
|
1571 |
|
|
1572 for (int j = 0; j < nc; j++) |
|
1299
|
1573 { |
|
1355
|
1574 double d = m.elem (i, j); |
|
|
1575 |
|
|
1576 if (xisnan (d)) |
|
|
1577 { |
|
|
1578 ::error ("invalid conversion from NaN to character"); |
|
|
1579 return retval; |
|
|
1580 } |
|
|
1581 else |
|
|
1582 { |
|
1358
|
1583 // XXX FIXME XXX -- warn about out of |
|
|
1584 // range conversions? |
|
1355
|
1585 |
|
|
1586 int ival = NINT (d); |
|
|
1587 buf[j] = (char) ival; |
|
|
1588 } |
|
1299
|
1589 } |
|
1355
|
1590 |
|
|
1591 s.elem (i).assign (buf, nc); |
|
1299
|
1592 } |
|
1355
|
1593 |
|
|
1594 retval = s; |
|
1299
|
1595 } |
|
|
1596 } |
|
|
1597 } |
|
|
1598 break; |
|
|
1599 |
|
|
1600 case range_constant: |
|
|
1601 { |
|
|
1602 Range r = range_value (); |
|
|
1603 double b = r.base (); |
|
|
1604 double incr = r.inc (); |
|
|
1605 int nel = r.nelem (); |
|
|
1606 char *s = new char [nel+1]; |
|
|
1607 s[nel] = '\0'; |
|
|
1608 for (int i = 0; i < nel; i++) |
|
|
1609 { |
|
|
1610 double d = b + i * incr; |
|
|
1611 |
|
|
1612 if (xisnan (d)) |
|
|
1613 { |
|
|
1614 ::error ("invalid conversion from NaN to character"); |
|
|
1615 delete [] s; |
|
|
1616 return retval; |
|
|
1617 } |
|
|
1618 else |
|
|
1619 { |
|
1358
|
1620 // XXX FIXME XXX -- warn about out of range |
|
|
1621 // conversions? |
|
|
1622 |
|
1299
|
1623 int ival = NINT (d); |
|
|
1624 s[i] = (char) ival; |
|
|
1625 } |
|
|
1626 } |
|
1355
|
1627 retval = s; |
|
1299
|
1628 delete [] s; |
|
|
1629 } |
|
|
1630 break; |
|
|
1631 |
|
|
1632 case string_constant: |
|
1355
|
1633 retval = *str_obj; |
|
1299
|
1634 break; |
|
|
1635 |
|
|
1636 default: |
|
|
1637 gripe_invalid_conversion (type_as_string (), "string"); |
|
|
1638 break; |
|
|
1639 } |
|
|
1640 |
|
|
1641 return retval; |
|
|
1642 } |
|
|
1643 |
|
|
1644 void |
|
|
1645 TC_REP::convert_to_row_or_column_vector (void) |
|
|
1646 { |
|
|
1647 assert (type_tag == matrix_constant || type_tag == complex_matrix_constant); |
|
|
1648 |
|
|
1649 int nr = rows (); |
|
|
1650 int nc = columns (); |
|
|
1651 |
|
|
1652 if (nr == 1 || nc == 1) |
|
|
1653 return; |
|
|
1654 |
|
|
1655 int len = nr * nc; |
|
|
1656 |
|
|
1657 assert (len > 0); |
|
|
1658 |
|
|
1659 int new_nr = 1; |
|
|
1660 int new_nc = 1; |
|
|
1661 |
|
|
1662 if (user_pref.prefer_column_vectors) |
|
|
1663 new_nr = len; |
|
|
1664 else |
|
|
1665 new_nc = len; |
|
|
1666 |
|
|
1667 if (type_tag == matrix_constant) |
|
|
1668 { |
|
|
1669 Matrix *m = new Matrix (new_nr, new_nc); |
|
|
1670 |
|
|
1671 double *cop_out = matrix->fortran_vec (); |
|
|
1672 |
|
|
1673 for (int i = 0; i < len; i++) |
|
|
1674 { |
|
|
1675 if (new_nr == 1) |
|
|
1676 m->elem (0, i) = *cop_out++; |
|
|
1677 else |
|
|
1678 m->elem (i, 0) = *cop_out++; |
|
|
1679 } |
|
|
1680 |
|
|
1681 delete matrix; |
|
|
1682 matrix = m; |
|
|
1683 } |
|
|
1684 else |
|
|
1685 { |
|
|
1686 ComplexMatrix *cm = new ComplexMatrix (new_nr, new_nc); |
|
|
1687 |
|
|
1688 Complex *cop_out = complex_matrix->fortran_vec (); |
|
|
1689 |
|
|
1690 for (int i = 0; i < len; i++) |
|
|
1691 { |
|
|
1692 if (new_nr == 1) |
|
|
1693 cm->elem (0, i) = *cop_out++; |
|
|
1694 else |
|
|
1695 cm->elem (i, 0) = *cop_out++; |
|
|
1696 } |
|
|
1697 |
|
|
1698 delete complex_matrix; |
|
|
1699 complex_matrix = cm; |
|
|
1700 } |
|
|
1701 } |
|
|
1702 |
|
|
1703 void |
|
1558
|
1704 TC_REP::convert_to_matrix_type (void) |
|
|
1705 { |
|
|
1706 switch (type_tag) |
|
|
1707 { |
|
|
1708 case complex_scalar_constant: |
|
|
1709 { |
|
|
1710 Complex *old_complex = complex_scalar; |
|
|
1711 complex_matrix = new ComplexMatrix (1, 1, *complex_scalar); |
|
|
1712 type_tag = complex_matrix_constant; |
|
|
1713 delete old_complex; |
|
|
1714 } |
|
|
1715 break; |
|
|
1716 |
|
|
1717 case scalar_constant: |
|
|
1718 { |
|
|
1719 matrix = new Matrix (1, 1, scalar); |
|
|
1720 type_tag = matrix_constant; |
|
|
1721 } |
|
|
1722 break; |
|
|
1723 |
|
|
1724 case unknown_constant: |
|
|
1725 { |
|
|
1726 matrix = new Matrix (0, 0); |
|
|
1727 type_tag = matrix_constant; |
|
|
1728 } |
|
|
1729 break; |
|
|
1730 |
|
|
1731 default: |
|
|
1732 panic_impossible (); |
|
|
1733 break; |
|
|
1734 } |
|
|
1735 } |
|
|
1736 |
|
|
1737 void |
|
1299
|
1738 TC_REP::force_numeric (int force_str_conv) |
|
|
1739 { |
|
|
1740 switch (type_tag) |
|
|
1741 { |
|
|
1742 case scalar_constant: |
|
|
1743 case matrix_constant: |
|
|
1744 case complex_scalar_constant: |
|
|
1745 case complex_matrix_constant: |
|
|
1746 break; |
|
|
1747 |
|
|
1748 case string_constant: |
|
|
1749 { |
|
|
1750 if (! force_str_conv && ! user_pref.implicit_str_to_num_ok) |
|
|
1751 { |
|
1490
|
1752 ::error ("string to numeric conversion failed --\ |
|
|
1753 default conversion turned off"); |
|
1299
|
1754 return; |
|
|
1755 } |
|
|
1756 |
|
1355
|
1757 int nr = str_obj->num_strings (); |
|
|
1758 int nc = str_obj->max_length (); |
|
|
1759 |
|
|
1760 if (nr == 1 && nc == 1) |
|
1299
|
1761 { |
|
|
1762 type_tag = scalar_constant; |
|
1355
|
1763 scalar = toascii ((int) str_obj->elem (0, 0)); |
|
1299
|
1764 } |
|
1355
|
1765 else if (nr == 0 || nc == 0) |
|
1299
|
1766 { |
|
|
1767 type_tag = matrix_constant; |
|
|
1768 matrix = new Matrix (0, 0); |
|
|
1769 } |
|
1355
|
1770 else if (nr > 0 && nc > 0) |
|
|
1771 { |
|
|
1772 type_tag = matrix_constant; |
|
|
1773 |
|
|
1774 Matrix *tm = new Matrix (nr, nc); |
|
|
1775 |
|
|
1776 for (int i = 0; i < nr; i++) |
|
|
1777 { |
|
|
1778 for (int j = 0; j < nc; j++) |
|
|
1779 { |
|
|
1780 int c = (int) str_obj->elem (i, j); |
|
|
1781 tm->elem (i, j) = toascii (c); |
|
|
1782 } |
|
|
1783 } |
|
|
1784 matrix = tm; |
|
|
1785 } |
|
1299
|
1786 else |
|
|
1787 panic_impossible (); |
|
|
1788 } |
|
|
1789 break; |
|
|
1790 |
|
|
1791 case range_constant: |
|
|
1792 { |
|
|
1793 int len = range->nelem (); |
|
|
1794 if (len > 1) |
|
|
1795 { |
|
|
1796 type_tag = matrix_constant; |
|
|
1797 Matrix *tm = new Matrix (1, len); |
|
|
1798 double b = range->base (); |
|
|
1799 double increment = range->inc (); |
|
|
1800 for (int i = 0; i < len; i++) |
|
|
1801 tm->elem (0, i) = b + i * increment; |
|
|
1802 matrix = tm; |
|
|
1803 } |
|
|
1804 else if (len == 1) |
|
|
1805 { |
|
|
1806 type_tag = scalar_constant; |
|
|
1807 scalar = range->base (); |
|
|
1808 } |
|
|
1809 } |
|
|
1810 break; |
|
|
1811 |
|
|
1812 default: |
|
|
1813 gripe_invalid_conversion (type_as_string (), "numeric type"); |
|
|
1814 break; |
|
|
1815 } |
|
|
1816 } |
|
|
1817 |
|
|
1818 tree_constant |
|
|
1819 TC_REP::make_numeric (int force_str_conv) const |
|
|
1820 { |
|
|
1821 tree_constant retval; |
|
|
1822 |
|
|
1823 switch (type_tag) |
|
|
1824 { |
|
|
1825 case scalar_constant: |
|
1355
|
1826 retval = scalar; |
|
1299
|
1827 break; |
|
|
1828 |
|
|
1829 case matrix_constant: |
|
1355
|
1830 retval = *matrix; |
|
1299
|
1831 break; |
|
|
1832 |
|
|
1833 case complex_scalar_constant: |
|
1355
|
1834 retval = *complex_scalar; |
|
1299
|
1835 break; |
|
|
1836 |
|
|
1837 case complex_matrix_constant: |
|
1355
|
1838 retval = *complex_matrix; |
|
1299
|
1839 break; |
|
|
1840 |
|
|
1841 case string_constant: |
|
1355
|
1842 retval = *str_obj; |
|
1299
|
1843 retval.force_numeric (force_str_conv); |
|
|
1844 break; |
|
|
1845 |
|
|
1846 case range_constant: |
|
1355
|
1847 retval = *range; |
|
1299
|
1848 retval.force_numeric (force_str_conv); |
|
|
1849 break; |
|
|
1850 |
|
|
1851 default: |
|
|
1852 gripe_invalid_conversion (type_as_string (), "numeric value"); |
|
|
1853 break; |
|
|
1854 } |
|
|
1855 |
|
|
1856 return retval; |
|
|
1857 } |
|
|
1858 |
|
|
1859 void |
|
|
1860 TC_REP::bump_value (tree_expression::type etype) |
|
|
1861 { |
|
|
1862 switch (etype) |
|
|
1863 { |
|
|
1864 case tree_expression::increment: |
|
|
1865 switch (type_tag) |
|
|
1866 { |
|
|
1867 case scalar_constant: |
|
|
1868 scalar++; |
|
|
1869 break; |
|
|
1870 |
|
|
1871 case matrix_constant: |
|
|
1872 *matrix = *matrix + 1.0; |
|
|
1873 break; |
|
|
1874 |
|
|
1875 case complex_scalar_constant: |
|
|
1876 *complex_scalar = *complex_scalar + 1.0; |
|
|
1877 break; |
|
|
1878 |
|
|
1879 case complex_matrix_constant: |
|
|
1880 *complex_matrix = *complex_matrix + 1.0; |
|
|
1881 break; |
|
|
1882 |
|
|
1883 case range_constant: |
|
|
1884 range->set_base (range->base () + 1.0); |
|
|
1885 range->set_limit (range->limit () + 1.0); |
|
|
1886 break; |
|
|
1887 |
|
|
1888 default: |
|
|
1889 gripe_wrong_type_arg ("operator ++", type_as_string ()); |
|
|
1890 break; |
|
|
1891 } |
|
|
1892 break; |
|
|
1893 |
|
|
1894 case tree_expression::decrement: |
|
|
1895 switch (type_tag) |
|
|
1896 { |
|
|
1897 case scalar_constant: |
|
|
1898 scalar--; |
|
|
1899 break; |
|
|
1900 |
|
|
1901 case matrix_constant: |
|
|
1902 *matrix = *matrix - 1.0; |
|
|
1903 break; |
|
|
1904 |
|
|
1905 case range_constant: |
|
|
1906 range->set_base (range->base () - 1.0); |
|
|
1907 range->set_limit (range->limit () - 1.0); |
|
|
1908 break; |
|
|
1909 |
|
|
1910 default: |
|
|
1911 gripe_wrong_type_arg ("operator --", type_as_string ()); |
|
|
1912 break; |
|
|
1913 } |
|
|
1914 break; |
|
|
1915 |
|
|
1916 default: |
|
|
1917 panic_impossible (); |
|
|
1918 break; |
|
|
1919 } |
|
|
1920 } |
|
|
1921 |
|
|
1922 void |
|
|
1923 TC_REP::resize (int i, int j) |
|
|
1924 { |
|
|
1925 switch (type_tag) |
|
|
1926 { |
|
|
1927 case matrix_constant: |
|
|
1928 matrix->resize (i, j); |
|
|
1929 break; |
|
|
1930 |
|
|
1931 case complex_matrix_constant: |
|
|
1932 complex_matrix->resize (i, j); |
|
|
1933 break; |
|
|
1934 |
|
|
1935 default: |
|
|
1936 gripe_wrong_type_arg ("resize", type_as_string ()); |
|
|
1937 break; |
|
|
1938 } |
|
|
1939 } |
|
|
1940 |
|
|
1941 void |
|
|
1942 TC_REP::resize (int i, int j, double val) |
|
|
1943 { |
|
|
1944 switch (type_tag) |
|
|
1945 { |
|
|
1946 case matrix_constant: |
|
|
1947 matrix->resize (i, j, val); |
|
|
1948 break; |
|
|
1949 |
|
|
1950 case complex_matrix_constant: |
|
|
1951 complex_matrix->resize (i, j, val); |
|
|
1952 break; |
|
|
1953 |
|
|
1954 default: |
|
|
1955 gripe_wrong_type_arg ("resize", type_as_string ()); |
|
|
1956 break; |
|
|
1957 } |
|
|
1958 } |
|
|
1959 |
|
|
1960 void |
|
|
1961 TC_REP::stash_original_text (char *s) |
|
|
1962 { |
|
|
1963 orig_text = strsave (s); |
|
|
1964 } |
|
|
1965 |
|
|
1966 void |
|
|
1967 TC_REP::maybe_mutate (void) |
|
|
1968 { |
|
|
1969 switch (type_tag) |
|
|
1970 { |
|
|
1971 case complex_scalar_constant: |
|
|
1972 if (::imag (*complex_scalar) == 0.0) |
|
|
1973 { |
|
|
1974 double d = ::real (*complex_scalar); |
|
|
1975 delete complex_scalar; |
|
|
1976 scalar = d; |
|
|
1977 type_tag = scalar_constant; |
|
|
1978 } |
|
|
1979 break; |
|
|
1980 |
|
|
1981 case complex_matrix_constant: |
|
|
1982 if (! any_element_is_complex (*complex_matrix)) |
|
|
1983 { |
|
|
1984 Matrix *m = new Matrix (::real (*complex_matrix)); |
|
|
1985 delete complex_matrix; |
|
|
1986 matrix = m; |
|
|
1987 type_tag = matrix_constant; |
|
|
1988 } |
|
|
1989 break; |
|
|
1990 |
|
|
1991 default: |
|
|
1992 break; |
|
|
1993 } |
|
|
1994 |
|
1358
|
1995 // Avoid calling rows() and columns() for things like magic_colon. |
|
1299
|
1996 |
|
|
1997 int nr = 1; |
|
|
1998 int nc = 1; |
|
|
1999 if (type_tag == matrix_constant |
|
|
2000 || type_tag == complex_matrix_constant |
|
|
2001 || type_tag == range_constant) |
|
|
2002 { |
|
|
2003 nr = rows (); |
|
|
2004 nc = columns (); |
|
|
2005 } |
|
|
2006 |
|
|
2007 switch (type_tag) |
|
|
2008 { |
|
|
2009 case matrix_constant: |
|
|
2010 if (nr == 1 && nc == 1) |
|
|
2011 { |
|
|
2012 double d = matrix->elem (0, 0); |
|
|
2013 delete matrix; |
|
|
2014 scalar = d; |
|
|
2015 type_tag = scalar_constant; |
|
|
2016 } |
|
|
2017 break; |
|
|
2018 |
|
|
2019 case complex_matrix_constant: |
|
|
2020 if (nr == 1 && nc == 1) |
|
|
2021 { |
|
|
2022 Complex c = complex_matrix->elem (0, 0); |
|
|
2023 delete complex_matrix; |
|
|
2024 complex_scalar = new Complex (c); |
|
|
2025 type_tag = complex_scalar_constant; |
|
|
2026 } |
|
|
2027 break; |
|
|
2028 |
|
|
2029 case range_constant: |
|
|
2030 if (nr == 1 && nc == 1) |
|
|
2031 { |
|
|
2032 double d = range->base (); |
|
|
2033 delete range; |
|
|
2034 scalar = d; |
|
|
2035 type_tag = scalar_constant; |
|
|
2036 } |
|
|
2037 break; |
|
|
2038 |
|
|
2039 default: |
|
|
2040 break; |
|
|
2041 } |
|
|
2042 } |
|
|
2043 |
|
|
2044 void |
|
|
2045 TC_REP::print (ostream& output_buf) |
|
|
2046 { |
|
|
2047 if (error_state) |
|
|
2048 return; |
|
|
2049 |
|
|
2050 switch (type_tag) |
|
|
2051 { |
|
|
2052 case scalar_constant: |
|
|
2053 octave_print_internal (output_buf, scalar); |
|
|
2054 break; |
|
|
2055 |
|
|
2056 case matrix_constant: |
|
|
2057 octave_print_internal (output_buf, *matrix); |
|
|
2058 break; |
|
|
2059 |
|
|
2060 case complex_scalar_constant: |
|
|
2061 octave_print_internal (output_buf, *complex_scalar); |
|
|
2062 break; |
|
|
2063 |
|
|
2064 case complex_matrix_constant: |
|
|
2065 octave_print_internal (output_buf, *complex_matrix); |
|
|
2066 break; |
|
|
2067 |
|
|
2068 case string_constant: |
|
1355
|
2069 octave_print_internal (output_buf, *str_obj); |
|
1299
|
2070 break; |
|
|
2071 |
|
|
2072 case range_constant: |
|
|
2073 octave_print_internal (output_buf, *range); |
|
|
2074 break; |
|
|
2075 |
|
|
2076 case map_constant: |
|
|
2077 { |
|
1358
|
2078 // XXX FIXME XXX -- would be nice to print the output in some |
|
|
2079 // standard order. Maybe all substructures first, maybe |
|
|
2080 // alphabetize entries, etc. |
|
|
2081 |
|
1299
|
2082 begin_unwind_frame ("TC_REP_print"); |
|
|
2083 |
|
|
2084 unwind_protect_int (structure_indent_level); |
|
|
2085 unwind_protect_int (user_pref.struct_levels_to_print); |
|
|
2086 |
|
|
2087 if (user_pref.struct_levels_to_print-- > 0) |
|
|
2088 { |
|
|
2089 output_buf << "{\n"; |
|
|
2090 |
|
|
2091 increment_structure_indent_level (); |
|
|
2092 |
|
|
2093 for (Pix p = a_map->first (); p != 0; a_map->next (p)) |
|
|
2094 { |
|
|
2095 const char *key = a_map->key (p); |
|
|
2096 tree_constant val = a_map->contents (p); |
|
|
2097 |
|
|
2098 output_buf.form ("%*s%s = ", structure_indent_level, |
|
|
2099 "", key); |
|
|
2100 |
|
|
2101 if (! (print_as_scalar (val) || print_as_structure (val))) |
|
|
2102 output_buf << "\n"; |
|
|
2103 |
|
|
2104 val.print (output_buf); |
|
|
2105 } |
|
|
2106 |
|
|
2107 decrement_structure_indent_level (); |
|
|
2108 |
|
|
2109 output_buf.form ("%*s%s", structure_indent_level, "", "}\n"); |
|
|
2110 } |
|
|
2111 else |
|
|
2112 output_buf << "<structure>\n"; |
|
|
2113 |
|
|
2114 run_unwind_frame ("TC_REP_print"); |
|
|
2115 } |
|
|
2116 break; |
|
|
2117 |
|
|
2118 case unknown_constant: |
|
|
2119 case magic_colon: |
|
|
2120 case all_va_args: |
|
|
2121 panic_impossible (); |
|
|
2122 break; |
|
|
2123 } |
|
|
2124 } |
|
|
2125 |
|
|
2126 void |
|
|
2127 TC_REP::print_code (ostream& os) |
|
|
2128 { |
|
|
2129 switch (type_tag) |
|
|
2130 { |
|
|
2131 case scalar_constant: |
|
|
2132 if (orig_text) |
|
|
2133 os << orig_text; |
|
|
2134 else |
|
|
2135 octave_print_internal (os, scalar, 1); |
|
|
2136 break; |
|
|
2137 |
|
|
2138 case matrix_constant: |
|
|
2139 octave_print_internal (os, *matrix, 1); |
|
|
2140 break; |
|
|
2141 |
|
|
2142 case complex_scalar_constant: |
|
|
2143 { |
|
|
2144 double re = complex_scalar->real (); |
|
|
2145 double im = complex_scalar->imag (); |
|
|
2146 |
|
1358
|
2147 // If we have the original text and a pure imaginary, just |
|
|
2148 // print the original text, because this must be a constant |
|
|
2149 // that was parsed as part of a function. |
|
1299
|
2150 |
|
|
2151 if (orig_text && re == 0.0 && im > 0.0) |
|
|
2152 os << orig_text; |
|
|
2153 else |
|
|
2154 octave_print_internal (os, *complex_scalar, 1); |
|
|
2155 } |
|
|
2156 break; |
|
|
2157 |
|
|
2158 case complex_matrix_constant: |
|
|
2159 octave_print_internal (os, *complex_matrix, 1); |
|
|
2160 break; |
|
|
2161 |
|
|
2162 case string_constant: |
|
1355
|
2163 octave_print_internal (os, *str_obj, 1); |
|
1299
|
2164 break; |
|
|
2165 |
|
|
2166 case range_constant: |
|
|
2167 octave_print_internal (os, *range, 1); |
|
|
2168 break; |
|
|
2169 |
|
|
2170 case magic_colon: |
|
|
2171 os << ":"; |
|
|
2172 break; |
|
|
2173 |
|
|
2174 case all_va_args: |
|
|
2175 os << "all_va_args"; |
|
|
2176 break; |
|
|
2177 |
|
|
2178 case map_constant: |
|
|
2179 case unknown_constant: |
|
|
2180 panic_impossible (); |
|
|
2181 break; |
|
|
2182 } |
|
|
2183 } |
|
|
2184 |
|
|
2185 void |
|
|
2186 TC_REP::gripe_wrong_type_arg (const char *name, |
|
|
2187 const tree_constant_rep& tcr) const |
|
|
2188 { |
|
|
2189 if (name) |
|
|
2190 ::error ("%s: wrong type argument `%s'", name, tcr.type_as_string ()); |
|
|
2191 else |
|
|
2192 ::error ("wrong type argument `%s'", name, tcr.type_as_string ()); |
|
|
2193 } |
|
|
2194 |
|
|
2195 char * |
|
|
2196 TC_REP::type_as_string (void) const |
|
|
2197 { |
|
|
2198 switch (type_tag) |
|
|
2199 { |
|
|
2200 case scalar_constant: |
|
|
2201 return "real scalar"; |
|
|
2202 |
|
|
2203 case matrix_constant: |
|
|
2204 return "real matrix"; |
|
|
2205 |
|
|
2206 case complex_scalar_constant: |
|
|
2207 return "complex scalar"; |
|
|
2208 |
|
|
2209 case complex_matrix_constant: |
|
|
2210 return "complex matrix"; |
|
|
2211 |
|
|
2212 case string_constant: |
|
|
2213 return "string"; |
|
|
2214 |
|
|
2215 case range_constant: |
|
|
2216 return "range"; |
|
|
2217 |
|
|
2218 case map_constant: |
|
|
2219 return "structure"; |
|
|
2220 |
|
|
2221 default: |
|
|
2222 return "<unknown type>"; |
|
|
2223 } |
|
|
2224 } |
|
|
2225 |
|
|
2226 tree_constant |
|
|
2227 do_binary_op (tree_constant& a, tree_constant& b, tree_expression::type t) |
|
|
2228 { |
|
|
2229 tree_constant retval; |
|
|
2230 |
|
|
2231 int first_empty = (a.rows () == 0 || a.columns () == 0); |
|
|
2232 int second_empty = (b.rows () == 0 || b.columns () == 0); |
|
|
2233 |
|
|
2234 if (first_empty || second_empty) |
|
|
2235 { |
|
|
2236 int flag = user_pref.propagate_empty_matrices; |
|
|
2237 if (flag < 0) |
|
|
2238 warning ("binary operation on empty matrix"); |
|
|
2239 else if (flag == 0) |
|
|
2240 { |
|
|
2241 ::error ("invalid binary operation on empty matrix"); |
|
|
2242 return retval; |
|
|
2243 } |
|
|
2244 } |
|
|
2245 |
|
|
2246 tree_constant tmp_a = a.make_numeric (); |
|
|
2247 |
|
|
2248 if (error_state) |
|
|
2249 return retval; |
|
|
2250 |
|
|
2251 tree_constant tmp_b = b.make_numeric (); |
|
|
2252 |
|
|
2253 if (error_state) |
|
|
2254 return retval; |
|
|
2255 |
|
|
2256 TC_REP::constant_type a_type = tmp_a.const_type (); |
|
|
2257 TC_REP::constant_type b_type = tmp_b.const_type (); |
|
|
2258 |
|
|
2259 double d1, d2; |
|
|
2260 Matrix m1, m2; |
|
|
2261 Complex c1, c2; |
|
|
2262 ComplexMatrix cm1, cm2; |
|
|
2263 |
|
|
2264 switch (a_type) |
|
|
2265 { |
|
|
2266 case TC_REP::scalar_constant: |
|
|
2267 |
|
|
2268 d1 = tmp_a.double_value (); |
|
|
2269 |
|
|
2270 switch (b_type) |
|
|
2271 { |
|
|
2272 case TC_REP::scalar_constant: |
|
|
2273 d2 = tmp_b.double_value (); |
|
|
2274 retval = do_binary_op (d1, d2, t); |
|
|
2275 break; |
|
|
2276 |
|
|
2277 case TC_REP::matrix_constant: |
|
|
2278 m2 = tmp_b.matrix_value (); |
|
|
2279 retval = do_binary_op (d1, m2, t); |
|
|
2280 break; |
|
|
2281 |
|
|
2282 case TC_REP::complex_scalar_constant: |
|
|
2283 c2 = tmp_b.complex_value (); |
|
|
2284 retval = do_binary_op (d1, c2, t); |
|
|
2285 break; |
|
|
2286 |
|
|
2287 case TC_REP::complex_matrix_constant: |
|
|
2288 cm2 = tmp_b.complex_matrix_value (); |
|
|
2289 retval = do_binary_op (d1, cm2, t); |
|
|
2290 break; |
|
|
2291 |
|
|
2292 default: |
|
|
2293 gripe_wrong_type_arg_for_binary_op (tmp_b); |
|
|
2294 break; |
|
|
2295 } |
|
|
2296 break; |
|
|
2297 |
|
|
2298 case TC_REP::matrix_constant: |
|
|
2299 |
|
|
2300 m1 = tmp_a.matrix_value (); |
|
|
2301 |
|
|
2302 switch (b_type) |
|
|
2303 { |
|
|
2304 case TC_REP::scalar_constant: |
|
|
2305 d2 = tmp_b.double_value (); |
|
|
2306 retval = do_binary_op (m1, d2, t); |
|
|
2307 break; |
|
|
2308 |
|
|
2309 case TC_REP::matrix_constant: |
|
|
2310 m2 = tmp_b.matrix_value (); |
|
|
2311 retval = do_binary_op (m1, m2, t); |
|
|
2312 break; |
|
|
2313 |
|
|
2314 case TC_REP::complex_scalar_constant: |
|
|
2315 c2 = tmp_b.complex_value (); |
|
|
2316 retval = do_binary_op (m1, c2, t); |
|
|
2317 break; |
|
|
2318 |
|
|
2319 case TC_REP::complex_matrix_constant: |
|
|
2320 cm2 = tmp_b.complex_matrix_value (); |
|
|
2321 retval = do_binary_op (m1, cm2, t); |
|
|
2322 break; |
|
|
2323 |
|
|
2324 default: |
|
|
2325 gripe_wrong_type_arg_for_binary_op (tmp_b); |
|
|
2326 break; |
|
|
2327 } |
|
|
2328 break; |
|
|
2329 |
|
|
2330 case TC_REP::complex_scalar_constant: |
|
|
2331 |
|
|
2332 c1 = tmp_a.complex_value (); |
|
|
2333 |
|
|
2334 switch (b_type) |
|
|
2335 { |
|
|
2336 case TC_REP::scalar_constant: |
|
|
2337 d2 = tmp_b.double_value (); |
|
|
2338 retval = do_binary_op (c1, d2, t); |
|
|
2339 break; |
|
|
2340 |
|
|
2341 case TC_REP::matrix_constant: |
|
|
2342 m2 = tmp_b.matrix_value (); |
|
|
2343 retval = do_binary_op (c1, m2, t); |
|
|
2344 break; |
|
|
2345 |
|
|
2346 case TC_REP::complex_scalar_constant: |
|
|
2347 c2 = tmp_b.complex_value (); |
|
|
2348 retval = do_binary_op (c1, c2, t); |
|
|
2349 break; |
|
|
2350 |
|
|
2351 case TC_REP::complex_matrix_constant: |
|
|
2352 cm2 = tmp_b.complex_matrix_value (); |
|
|
2353 retval = do_binary_op (c1, cm2, t); |
|
|
2354 break; |
|
|
2355 |
|
|
2356 default: |
|
|
2357 gripe_wrong_type_arg_for_binary_op (tmp_b); |
|
|
2358 break; |
|
|
2359 } |
|
|
2360 break; |
|
|
2361 |
|
|
2362 case TC_REP::complex_matrix_constant: |
|
|
2363 |
|
|
2364 cm1 = tmp_a.complex_matrix_value (); |
|
|
2365 |
|
|
2366 switch (b_type) |
|
|
2367 { |
|
|
2368 case TC_REP::scalar_constant: |
|
|
2369 d2 = tmp_b.double_value (); |
|
|
2370 retval = do_binary_op (cm1, d2, t); |
|
|
2371 break; |
|
|
2372 |
|
|
2373 case TC_REP::matrix_constant: |
|
|
2374 m2 = tmp_b.matrix_value (); |
|
|
2375 retval = do_binary_op (cm1, m2, t); |
|
|
2376 break; |
|
|
2377 |
|
|
2378 case TC_REP::complex_scalar_constant: |
|
|
2379 c2 = tmp_b.complex_value (); |
|
|
2380 retval = do_binary_op (cm1, c2, t); |
|
|
2381 break; |
|
|
2382 |
|
|
2383 case TC_REP::complex_matrix_constant: |
|
|
2384 cm2 = tmp_b.complex_matrix_value (); |
|
|
2385 retval = do_binary_op (cm1, cm2, t); |
|
|
2386 break; |
|
|
2387 |
|
|
2388 default: |
|
|
2389 gripe_wrong_type_arg_for_binary_op (tmp_b); |
|
|
2390 break; |
|
|
2391 } |
|
|
2392 break; |
|
|
2393 |
|
|
2394 default: |
|
|
2395 gripe_wrong_type_arg_for_binary_op (tmp_a); |
|
|
2396 break; |
|
|
2397 } |
|
|
2398 |
|
|
2399 return retval; |
|
|
2400 } |
|
|
2401 |
|
|
2402 tree_constant |
|
|
2403 do_unary_op (tree_constant& a, tree_expression::type t) |
|
|
2404 { |
|
|
2405 tree_constant retval; |
|
|
2406 |
|
|
2407 if (a.rows () == 0 || a.columns () == 0) |
|
|
2408 { |
|
|
2409 int flag = user_pref.propagate_empty_matrices; |
|
|
2410 if (flag < 0) |
|
|
2411 warning ("unary operation on empty matrix"); |
|
|
2412 else if (flag == 0) |
|
|
2413 { |
|
|
2414 ::error ("invalid unary operation on empty matrix"); |
|
|
2415 return retval; |
|
|
2416 } |
|
|
2417 } |
|
|
2418 |
|
|
2419 tree_constant tmp_a = a.make_numeric (); |
|
|
2420 |
|
|
2421 if (error_state) |
|
|
2422 return retval; |
|
|
2423 |
|
|
2424 switch (tmp_a.const_type ()) |
|
|
2425 { |
|
|
2426 case TC_REP::scalar_constant: |
|
|
2427 retval = do_unary_op (tmp_a.double_value (), t); |
|
|
2428 break; |
|
|
2429 |
|
|
2430 case TC_REP::matrix_constant: |
|
|
2431 { |
|
|
2432 Matrix m = tmp_a.matrix_value (); |
|
|
2433 retval = do_unary_op (m, t); |
|
|
2434 } |
|
|
2435 break; |
|
|
2436 |
|
|
2437 case TC_REP::complex_scalar_constant: |
|
|
2438 retval = do_unary_op (tmp_a.complex_value (), t); |
|
|
2439 break; |
|
|
2440 |
|
|
2441 case TC_REP::complex_matrix_constant: |
|
|
2442 { |
|
|
2443 ComplexMatrix m = tmp_a.complex_matrix_value (); |
|
|
2444 retval = do_unary_op (m, t); |
|
|
2445 } |
|
|
2446 break; |
|
|
2447 |
|
|
2448 default: |
|
|
2449 gripe_wrong_type_arg_for_unary_op (tmp_a); |
|
|
2450 break; |
|
|
2451 } |
|
|
2452 |
|
|
2453 return retval; |
|
|
2454 } |
|
|
2455 |
|
|
2456 // Indexing operations for the tree-constant representation class. |
|
1558
|
2457 |
|
|
2458 void |
|
|
2459 TC_REP::clear_index (void) |
|
|
2460 { |
|
|
2461 switch (type_tag) |
|
|
2462 { |
|
|
2463 case matrix_constant: |
|
|
2464 matrix->clear_index (); |
|
|
2465 break; |
|
|
2466 |
|
|
2467 case TC_REP::complex_matrix_constant: |
|
|
2468 complex_matrix->clear_index (); |
|
|
2469 break; |
|
|
2470 |
|
|
2471 default: |
|
|
2472 panic_impossible (); |
|
|
2473 break; |
|
|
2474 } |
|
|
2475 } |
|
|
2476 |
|
|
2477 #if 0 |
|
|
2478 void |
|
|
2479 TC_REP::set_index (double d) |
|
|
2480 { |
|
|
2481 switch (type_tag) |
|
|
2482 { |
|
|
2483 case matrix_constant: |
|
|
2484 matrix->set_index (d); |
|
|
2485 break; |
|
|
2486 |
|
|
2487 case TC_REP::complex_matrix_constant: |
|
|
2488 complex_matrix->set_index (d); |
|
|
2489 break; |
|
|
2490 |
|
|
2491 default: |
|
|
2492 panic_impossible (); |
|
|
2493 break; |
|
|
2494 } |
|
|
2495 } |
|
|
2496 #endif |
|
|
2497 |
|
|
2498 void |
|
|
2499 TC_REP::set_index (const Range& r) |
|
|
2500 { |
|
|
2501 switch (type_tag) |
|
|
2502 { |
|
|
2503 case matrix_constant: |
|
|
2504 matrix->set_index (r); |
|
|
2505 break; |
|
|
2506 |
|
|
2507 case TC_REP::complex_matrix_constant: |
|
|
2508 complex_matrix->set_index (r); |
|
|
2509 break; |
|
|
2510 |
|
|
2511 default: |
|
|
2512 panic_impossible (); |
|
|
2513 break; |
|
|
2514 } |
|
|
2515 } |
|
|
2516 |
|
|
2517 void |
|
|
2518 TC_REP::set_index (const ColumnVector& v) |
|
|
2519 { |
|
|
2520 switch (type_tag) |
|
|
2521 { |
|
|
2522 case matrix_constant: |
|
|
2523 matrix->set_index (v); |
|
|
2524 break; |
|
|
2525 |
|
|
2526 case TC_REP::complex_matrix_constant: |
|
|
2527 complex_matrix->set_index (v); |
|
|
2528 break; |
|
|
2529 |
|
|
2530 default: |
|
|
2531 panic_impossible (); |
|
|
2532 break; |
|
|
2533 } |
|
|
2534 } |
|
|
2535 |
|
|
2536 void |
|
|
2537 TC_REP::set_index (const Matrix& m) |
|
|
2538 { |
|
|
2539 int nr = m.rows (); |
|
|
2540 int nc = m.cols (); |
|
|
2541 |
|
|
2542 if (nr <= 1 || nc <= 1 |
|
|
2543 || user_pref.do_fortran_indexing) |
|
|
2544 { |
|
|
2545 switch (type_tag) |
|
|
2546 { |
|
|
2547 case matrix_constant: |
|
|
2548 matrix->set_index (m); |
|
|
2549 break; |
|
|
2550 |
|
|
2551 case TC_REP::complex_matrix_constant: |
|
|
2552 complex_matrix->set_index (m); |
|
|
2553 break; |
|
|
2554 |
|
|
2555 default: |
|
|
2556 panic_impossible (); |
|
|
2557 break; |
|
|
2558 } |
|
|
2559 } |
|
|
2560 else |
|
|
2561 ::error ("invalid matrix used as index"); |
|
|
2562 } |
|
|
2563 |
|
|
2564 // XXX FIXME XXX -- this should probably be handled some other way... |
|
|
2565 // The arg here is expected to be ':'. |
|
|
2566 void |
|
|
2567 TC_REP::set_index (char c) |
|
|
2568 { |
|
|
2569 switch (type_tag) |
|
|
2570 { |
|
|
2571 case matrix_constant: |
|
|
2572 matrix->set_index (c); |
|
|
2573 break; |
|
|
2574 |
|
|
2575 case TC_REP::complex_matrix_constant: |
|
|
2576 complex_matrix->set_index (c); |
|
|
2577 break; |
|
|
2578 |
|
|
2579 default: |
|
|
2580 panic_impossible (); |
|
|
2581 break; |
|
|
2582 } |
|
|
2583 } |
|
|
2584 |
|
|
2585 void |
|
|
2586 TC_REP::set_index (const Octave_object& args) |
|
|
2587 { |
|
|
2588 switch (type_tag) |
|
|
2589 { |
|
|
2590 case unknown_constant: |
|
|
2591 case scalar_constant: |
|
|
2592 case complex_scalar_constant: |
|
|
2593 case range_constant: |
|
|
2594 convert_to_matrix_type (); |
|
|
2595 break; |
|
|
2596 |
|
|
2597 default: |
|
|
2598 break; |
|
|
2599 } |
|
|
2600 |
|
|
2601 int n = args.length (); |
|
|
2602 |
|
|
2603 for (int i = 0; i < n; i++) |
|
|
2604 { |
|
|
2605 tree_constant arg = args (i); |
|
|
2606 |
|
|
2607 switch (arg.const_type ()) |
|
|
2608 { |
|
|
2609 case range_constant: |
|
|
2610 set_index (arg.range_value ()); |
|
|
2611 break; |
|
|
2612 |
|
|
2613 case magic_colon: |
|
|
2614 set_index (':'); |
|
|
2615 break; |
|
|
2616 |
|
|
2617 default: |
|
|
2618 set_index (arg.matrix_value ()); |
|
|
2619 break; |
|
|
2620 } |
|
|
2621 |
|
|
2622 if (error_state) |
|
|
2623 { |
|
|
2624 clear_index (); |
|
|
2625 break; |
|
|
2626 } |
|
|
2627 } |
|
|
2628 } |
|
|
2629 |
|
|
2630 static inline int |
|
|
2631 valid_scalar_indices (const Octave_object& args) |
|
|
2632 { |
|
|
2633 int nargin = args.length (); |
|
|
2634 |
|
|
2635 for (int i = 0; i < nargin; i++) |
|
|
2636 if (! args(i).valid_as_scalar_index ()) |
|
|
2637 return 0; |
|
|
2638 |
|
|
2639 return 1; |
|
|
2640 } |
|
1299
|
2641 |
|
|
2642 tree_constant |
|
|
2643 TC_REP::do_index (const Octave_object& args) |
|
|
2644 { |
|
|
2645 tree_constant retval; |
|
|
2646 |
|
|
2647 if (error_state) |
|
|
2648 return retval; |
|
|
2649 |
|
1558
|
2650 int originally_scalar_type = is_scalar_type (); |
|
|
2651 |
|
|
2652 if (originally_scalar_type && valid_scalar_indices (args)) |
|
1299
|
2653 { |
|
1558
|
2654 switch (type_tag) |
|
1299
|
2655 { |
|
1558
|
2656 case scalar_constant: |
|
|
2657 retval = scalar; |
|
|
2658 break; |
|
|
2659 |
|
|
2660 case complex_scalar_constant: |
|
|
2661 retval = *complex_scalar; |
|
1299
|
2662 break; |
|
|
2663 |
|
|
2664 default: |
|
1558
|
2665 panic_impossible (); |
|
1299
|
2666 break; |
|
|
2667 } |
|
|
2668 } |
|
|
2669 else |
|
|
2670 { |
|
1558
|
2671 set_index (args); |
|
|
2672 |
|
|
2673 if (! error_state) |
|
|
2674 { |
|
|
2675 switch (type_tag) |
|
|
2676 { |
|
|
2677 case range_constant: |
|
|
2678 force_numeric (); |
|
|
2679 // Fall through... |
|
|
2680 |
|
|
2681 case matrix_constant: |
|
|
2682 retval = Matrix (matrix->value ()); |
|
|
2683 break; |
|
|
2684 |
|
|
2685 case complex_matrix_constant: |
|
|
2686 retval = ComplexMatrix (complex_matrix->value ()); |
|
|
2687 break; |
|
|
2688 |
|
|
2689 default: |
|
|
2690 error ("can't index %s variables", type_as_string ()); |
|
|
2691 break; |
|
|
2692 } |
|
|
2693 } |
|
|
2694 |
|
|
2695 // This is a fairly expensive operation. |
|
|
2696 |
|
|
2697 if (originally_scalar_type) |
|
|
2698 maybe_mutate (); |
|
1299
|
2699 } |
|
|
2700 |
|
|
2701 return retval; |
|
|
2702 } |
|
|
2703 |
|
1558
|
2704 void |
|
|
2705 TC_REP::maybe_widen (TC_REP::constant_type rhs_type) |
|
1299
|
2706 { |
|
1558
|
2707 switch (type_tag) |
|
1299
|
2708 { |
|
|
2709 case matrix_constant: |
|
1558
|
2710 switch (rhs_type) |
|
|
2711 { |
|
|
2712 case complex_scalar_constant: |
|
|
2713 case complex_matrix_constant: |
|
1299
|
2714 { |
|
1558
|
2715 ComplexMatrix *cm = new ComplexMatrix (*matrix); |
|
|
2716 delete matrix; |
|
|
2717 complex_matrix = cm; |
|
|
2718 type_tag = complex_matrix_constant; |
|
1299
|
2719 } |
|
1558
|
2720 break; |
|
|
2721 |
|
|
2722 default: |
|
|
2723 break; |
|
|
2724 } |
|
1299
|
2725 break; |
|
|
2726 |
|
|
2727 default: |
|
|
2728 break; |
|
|
2729 } |
|
|
2730 } |
|
|
2731 |
|
|
2732 // Assignment operations for the tree-constant representation class. |
|
|
2733 |
|
|
2734 // Top-level tree-constant function that handles assignments. Only |
|
|
2735 // decide if the left-hand side is currently a scalar or a matrix and |
|
|
2736 // hand off to other functions to do the real work. |
|
|
2737 |
|
1558
|
2738 extern void assign (Array2<Complex>&, const Array2<Complex>&); |
|
|
2739 extern void assign (Array2<Complex>&, const Array2<double>&); |
|
|
2740 extern void assign (Array2<double>&, const Array2<double>&); |
|
|
2741 |
|
1299
|
2742 void |
|
|
2743 TC_REP::assign (tree_constant& rhs, const Octave_object& args) |
|
|
2744 { |
|
|
2745 tree_constant rhs_tmp = rhs.make_numeric (); |
|
|
2746 |
|
|
2747 if (error_state) |
|
|
2748 return; |
|
|
2749 |
|
1358
|
2750 // This is easier than actually handling assignments to strings. An |
|
|
2751 // assignment to a range will normally require a conversion to a |
|
|
2752 // vector since it will normally destroy the equally-spaced property |
|
|
2753 // of the range elements. |
|
1299
|
2754 |
|
|
2755 if (is_defined () && ! is_numeric_type ()) |
|
|
2756 force_numeric (); |
|
|
2757 |
|
|
2758 if (error_state) |
|
|
2759 return; |
|
|
2760 |
|
1558
|
2761 // Do this before setting the index so that we don't have to copy |
|
|
2762 // indices in the Array class. |
|
|
2763 |
|
|
2764 maybe_widen (rhs.const_type ()); |
|
|
2765 |
|
|
2766 set_index (args); |
|
|
2767 |
|
|
2768 if (! error_state) |
|
1299
|
2769 { |
|
1558
|
2770 switch (type_tag) |
|
1299
|
2771 { |
|
1558
|
2772 case complex_matrix_constant: |
|
1299
|
2773 { |
|
1558
|
2774 switch (rhs.const_type ()) |
|
1299
|
2775 { |
|
1558
|
2776 case complex_scalar_constant: |
|
|
2777 case complex_matrix_constant: |
|
|
2778 ::assign (*complex_matrix, rhs.complex_matrix_value ()); |
|
|
2779 break; |
|
|
2780 |
|
|
2781 case scalar_constant: |
|
|
2782 case matrix_constant: |
|
|
2783 ::assign (*complex_matrix, rhs.matrix_value ()); |
|
|
2784 break; |
|
|
2785 |
|
|
2786 default: |
|
|
2787 panic_impossible ();; |
|
|
2788 break; |
|
1299
|
2789 } |
|
|
2790 } |
|
1558
|
2791 break; |
|
|
2792 |
|
|
2793 case scalar_constant: |
|
|
2794 case matrix_constant: |
|
|
2795 ::assign (*matrix, rhs.matrix_value ()); |
|
|
2796 break; |
|
|
2797 |
|
|
2798 default: |
|
|
2799 panic_impossible (); |
|
|
2800 break; |
|
1299
|
2801 } |
|
|
2802 } |
|
|
2803 } |
|
|
2804 |
|
96
|
2805 /* |
|
1
|
2806 ;;; Local Variables: *** |
|
|
2807 ;;; mode: C++ *** |
|
|
2808 ;;; page-delimiter: "^/\\*" *** |
|
|
2809 ;;; End: *** |
|
|
2810 */ |
