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