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