|
1
|
1 // The constants for the tree class. -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 John W. Eaton |
|
|
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 |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef __GNUG__ |
|
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
|
28 #include <ctype.h> |
|
|
29 #include <string.h> |
|
|
30 #include <iostream.h> |
|
|
31 #include <strstream.h> |
|
|
32 #include <math.h> |
|
|
33 |
|
|
34 #include "variables.h" |
|
|
35 #include "error.h" |
|
|
36 #include "gripes.h" |
|
|
37 #include "user-prefs.h" |
|
|
38 #include "utils.h" |
|
|
39 #include "pager.h" |
|
|
40 #include "mappers.h" |
|
|
41 #include "pr-output.h" |
|
|
42 #include "tree-const.h" |
|
|
43 #include "arith-ops.h" |
|
|
44 |
|
|
45 // A couple of handy helper functions. |
|
|
46 |
|
|
47 static int |
|
|
48 any_element_is_negative (const Matrix& a) |
|
|
49 { |
|
|
50 int nr = a.rows (); |
|
|
51 int nc = a.columns (); |
|
|
52 for (int j = 0; j < nc; j++) |
|
|
53 for (int i = 0; i < nr; i++) |
|
|
54 if (a.elem (i, j) < 0.0) |
|
|
55 return 1; |
|
|
56 return 0; |
|
|
57 } |
|
|
58 |
|
|
59 static int |
|
|
60 any_element_is_complex (const ComplexMatrix& a) |
|
|
61 { |
|
|
62 int nr = a.rows (); |
|
|
63 int nc = a.columns (); |
|
|
64 for (int j = 0; j < nc; j++) |
|
|
65 for (int i = 0; i < nr; i++) |
|
|
66 if (imag (a.elem (i, j)) != 0.0) |
|
|
67 return 1; |
|
|
68 return 0; |
|
|
69 } |
|
|
70 |
|
|
71 // Now, the classes. |
|
|
72 |
|
|
73 /* |
|
|
74 * The real representation of constants. |
|
|
75 */ |
|
|
76 tree_constant_rep::tree_constant_rep (void) |
|
|
77 { |
|
|
78 type_tag = unknown_constant; |
|
|
79 } |
|
|
80 |
|
|
81 tree_constant_rep::tree_constant_rep (double d) |
|
|
82 { |
|
|
83 scalar = d; |
|
|
84 type_tag = scalar_constant; |
|
|
85 } |
|
|
86 |
|
|
87 tree_constant_rep::tree_constant_rep (Matrix& m) |
|
|
88 { |
|
|
89 if (m.rows () == 1 && m.columns () == 1) |
|
|
90 { |
|
|
91 scalar = m.elem (0, 0); |
|
|
92 type_tag = scalar_constant; |
|
|
93 } |
|
|
94 else |
|
|
95 { |
|
|
96 matrix = new Matrix (m); |
|
|
97 type_tag = matrix_constant; |
|
|
98 } |
|
|
99 } |
|
|
100 |
|
|
101 tree_constant_rep::tree_constant_rep (DiagMatrix& d) |
|
|
102 { |
|
|
103 if (d.rows () == 1 && d.columns () == 1) |
|
|
104 { |
|
|
105 scalar = d.elem (0, 0); |
|
|
106 type_tag = scalar_constant; |
|
|
107 } |
|
|
108 else |
|
|
109 { |
|
|
110 matrix = new Matrix (d); |
|
|
111 type_tag = matrix_constant; |
|
|
112 } |
|
|
113 } |
|
|
114 |
|
|
115 tree_constant_rep::tree_constant_rep (RowVector& v) |
|
|
116 { |
|
|
117 int len = v.capacity (); |
|
|
118 if (len == 1) |
|
|
119 { |
|
|
120 scalar = v.elem (0); |
|
|
121 type_tag = scalar_constant; |
|
|
122 } |
|
|
123 else |
|
|
124 { |
|
|
125 if (user_pref.prefer_column_vectors) |
|
|
126 { |
|
|
127 Matrix m (len, 1); |
|
|
128 for (int i = 0; i < len; i++) |
|
|
129 m.elem (i, 0) = v.elem (i); |
|
|
130 matrix = new Matrix (m); |
|
|
131 type_tag = matrix_constant; |
|
|
132 } |
|
|
133 else |
|
|
134 { |
|
|
135 Matrix m (1, len); |
|
|
136 for (int i = 0; i < len; i++) |
|
|
137 m.elem (0, i) = v.elem (i); |
|
|
138 matrix = new Matrix (m); |
|
|
139 type_tag = matrix_constant; |
|
|
140 } |
|
|
141 } |
|
|
142 } |
|
|
143 |
|
|
144 tree_constant_rep::tree_constant_rep (RowVector& v, int prefer_column_vector) |
|
|
145 { |
|
|
146 int len = v.capacity (); |
|
|
147 if (len == 1) |
|
|
148 { |
|
|
149 scalar = v.elem (0); |
|
|
150 type_tag = scalar_constant; |
|
|
151 } |
|
|
152 else |
|
|
153 { |
|
|
154 if (prefer_column_vector) |
|
|
155 { |
|
|
156 Matrix m (len, 1); |
|
|
157 for (int i = 0; i < len; i++) |
|
|
158 m.elem (i, 0) = v.elem (i); |
|
|
159 matrix = new Matrix (m); |
|
|
160 type_tag = matrix_constant; |
|
|
161 } |
|
|
162 else |
|
|
163 { |
|
|
164 Matrix m (1, len); |
|
|
165 for (int i = 0; i < len; i++) |
|
|
166 m.elem (0, i) = v.elem (i); |
|
|
167 matrix = new Matrix (m); |
|
|
168 type_tag = matrix_constant; |
|
|
169 } |
|
|
170 } |
|
|
171 } |
|
|
172 |
|
|
173 tree_constant_rep::tree_constant_rep (ColumnVector& v) |
|
|
174 { |
|
|
175 int len = v.capacity (); |
|
|
176 if (len == 1) |
|
|
177 { |
|
|
178 scalar = v.elem (0); |
|
|
179 type_tag = scalar_constant; |
|
|
180 } |
|
|
181 else |
|
|
182 { |
|
|
183 if (user_pref.prefer_column_vectors) |
|
|
184 { |
|
|
185 Matrix m (len, 1); |
|
|
186 for (int i = 0; i < len; i++) |
|
|
187 m.elem (i, 0) = v.elem (i); |
|
|
188 matrix = new Matrix (m); |
|
|
189 type_tag = matrix_constant; |
|
|
190 } |
|
|
191 else |
|
|
192 { |
|
|
193 Matrix m (1, len); |
|
|
194 for (int i = 0; i < len; i++) |
|
|
195 m.elem (0, i) = v.elem (i); |
|
|
196 matrix = new Matrix (m); |
|
|
197 type_tag = matrix_constant; |
|
|
198 } |
|
|
199 } |
|
|
200 } |
|
|
201 |
|
|
202 tree_constant_rep::tree_constant_rep (ColumnVector& v, |
|
|
203 int prefer_column_vector) |
|
|
204 { |
|
|
205 int len = v.capacity (); |
|
|
206 if (len == 1) |
|
|
207 { |
|
|
208 scalar = v.elem (0); |
|
|
209 type_tag = scalar_constant; |
|
|
210 } |
|
|
211 else |
|
|
212 { |
|
|
213 if (prefer_column_vector) |
|
|
214 { |
|
|
215 Matrix m (len, 1); |
|
|
216 for (int i = 0; i < len; i++) |
|
|
217 m.elem (i, 0) = v.elem (i); |
|
|
218 matrix = new Matrix (m); |
|
|
219 type_tag = matrix_constant; |
|
|
220 } |
|
|
221 else |
|
|
222 { |
|
|
223 Matrix m (1, len); |
|
|
224 for (int i = 0; i < len; i++) |
|
|
225 m.elem (0, i) = v.elem (i); |
|
|
226 matrix = new Matrix (m); |
|
|
227 type_tag = matrix_constant; |
|
|
228 } |
|
|
229 } |
|
|
230 } |
|
|
231 |
|
|
232 tree_constant_rep::tree_constant_rep (Complex c) |
|
|
233 { |
|
|
234 complex_scalar = new Complex (c); |
|
|
235 type_tag = complex_scalar_constant; |
|
|
236 } |
|
|
237 |
|
|
238 tree_constant_rep::tree_constant_rep (ComplexRowVector& v) |
|
|
239 { |
|
|
240 int len = v.capacity (); |
|
|
241 if (len == 1) |
|
|
242 { |
|
|
243 complex_scalar = new Complex (v.elem (0)); |
|
|
244 type_tag = complex_scalar_constant; |
|
|
245 } |
|
|
246 else |
|
|
247 { |
|
|
248 if (user_pref.prefer_column_vectors) |
|
|
249 { |
|
|
250 ComplexMatrix m (len, 1); |
|
|
251 for (int i = 0; i < len; i++) |
|
|
252 m.elem (i, 0) = v.elem (i); |
|
|
253 complex_matrix = new ComplexMatrix (m); |
|
|
254 type_tag = complex_matrix_constant; |
|
|
255 } |
|
|
256 else |
|
|
257 { |
|
|
258 ComplexMatrix m (1, len); |
|
|
259 for (int i = 0; i < len; i++) |
|
|
260 m.elem (0, i) = v.elem (i); |
|
|
261 complex_matrix = new ComplexMatrix (m); |
|
|
262 type_tag = complex_matrix_constant; |
|
|
263 } |
|
|
264 } |
|
|
265 } |
|
|
266 |
|
|
267 tree_constant_rep::tree_constant_rep (ComplexMatrix& m) |
|
|
268 { |
|
|
269 if (m.rows () == 1 && m.columns () == 1) |
|
|
270 { |
|
|
271 complex_scalar = new Complex (m.elem (0, 0)); |
|
|
272 type_tag = complex_scalar_constant; |
|
|
273 } |
|
|
274 else |
|
|
275 { |
|
|
276 complex_matrix = new ComplexMatrix (m); |
|
|
277 type_tag = complex_matrix_constant; |
|
|
278 } |
|
|
279 } |
|
|
280 |
|
|
281 tree_constant_rep::tree_constant_rep (ComplexDiagMatrix& d) |
|
|
282 { |
|
|
283 if (d.rows () == 1 && d.columns () == 1) |
|
|
284 { |
|
|
285 complex_scalar = new Complex (d.elem (0, 0)); |
|
|
286 type_tag = complex_scalar_constant; |
|
|
287 } |
|
|
288 else |
|
|
289 { |
|
|
290 complex_matrix = new ComplexMatrix (d); |
|
|
291 type_tag = complex_matrix_constant; |
|
|
292 } |
|
|
293 } |
|
|
294 |
|
|
295 tree_constant_rep::tree_constant_rep (ComplexRowVector& v, |
|
|
296 int prefer_column_vector) |
|
|
297 { |
|
|
298 int len = v.capacity (); |
|
|
299 if (len == 1) |
|
|
300 { |
|
|
301 complex_scalar = new Complex (v.elem (0)); |
|
|
302 type_tag = complex_scalar_constant; |
|
|
303 } |
|
|
304 else |
|
|
305 { |
|
|
306 if (prefer_column_vector) |
|
|
307 { |
|
|
308 ComplexMatrix m (len, 1); |
|
|
309 for (int i = 0; i < len; i++) |
|
|
310 m.elem (i, 0) = v.elem (i); |
|
|
311 complex_matrix = new ComplexMatrix (m); |
|
|
312 type_tag = complex_matrix_constant; |
|
|
313 } |
|
|
314 else |
|
|
315 { |
|
|
316 ComplexMatrix m (1, len); |
|
|
317 for (int i = 0; i < len; i++) |
|
|
318 m.elem (0, i) = v.elem (i); |
|
|
319 complex_matrix = new ComplexMatrix (m); |
|
|
320 type_tag = complex_matrix_constant; |
|
|
321 } |
|
|
322 } |
|
|
323 } |
|
|
324 |
|
|
325 tree_constant_rep::tree_constant_rep (ComplexColumnVector& v) |
|
|
326 { |
|
|
327 int len = v.capacity (); |
|
|
328 if (len == 1) |
|
|
329 { |
|
|
330 complex_scalar = new Complex (v.elem (0)); |
|
|
331 type_tag = complex_scalar_constant; |
|
|
332 } |
|
|
333 else |
|
|
334 { |
|
|
335 if (user_pref.prefer_column_vectors) |
|
|
336 { |
|
|
337 ComplexMatrix m (len, 1); |
|
|
338 for (int i = 0; i < len; i++) |
|
|
339 m.elem (i, 0) = v.elem (i); |
|
|
340 complex_matrix = new ComplexMatrix (m); |
|
|
341 type_tag = complex_matrix_constant; |
|
|
342 } |
|
|
343 else |
|
|
344 { |
|
|
345 ComplexMatrix m (1, len); |
|
|
346 for (int i = 0; i < len; i++) |
|
|
347 m.elem (0, i) = v.elem (i); |
|
|
348 complex_matrix = new ComplexMatrix (m); |
|
|
349 type_tag = complex_matrix_constant; |
|
|
350 } |
|
|
351 } |
|
|
352 } |
|
|
353 |
|
|
354 tree_constant_rep::tree_constant_rep (ComplexColumnVector& v, |
|
|
355 int prefer_column_vector) |
|
|
356 { |
|
|
357 int len = v.capacity (); |
|
|
358 if (len == 1) |
|
|
359 { |
|
|
360 complex_scalar = new Complex (v.elem (0)); |
|
|
361 type_tag = complex_scalar_constant; |
|
|
362 } |
|
|
363 else |
|
|
364 { |
|
|
365 if (prefer_column_vector) |
|
|
366 { |
|
|
367 ComplexMatrix m (len, 1); |
|
|
368 for (int i = 0; i < len; i++) |
|
|
369 m.elem (i, 0) = v.elem (i); |
|
|
370 complex_matrix = new ComplexMatrix (m); |
|
|
371 type_tag = complex_matrix_constant; |
|
|
372 } |
|
|
373 else |
|
|
374 { |
|
|
375 ComplexMatrix m (1, len); |
|
|
376 for (int i = 0; i < len; i++) |
|
|
377 m.elem (0, i) = v.elem (i); |
|
|
378 complex_matrix = new ComplexMatrix (m); |
|
|
379 type_tag = complex_matrix_constant; |
|
|
380 } |
|
|
381 } |
|
|
382 } |
|
|
383 |
|
|
384 tree_constant_rep::tree_constant_rep (const char *s) |
|
|
385 { |
|
|
386 string = strsave (s); |
|
|
387 type_tag = string_constant; |
|
|
388 } |
|
|
389 |
|
|
390 tree_constant_rep::tree_constant_rep (String& s) |
|
|
391 { |
|
|
392 string = strsave (s); |
|
|
393 type_tag = string_constant; |
|
|
394 } |
|
|
395 |
|
|
396 tree_constant_rep::tree_constant_rep (double b, double l, double i) |
|
|
397 { |
|
|
398 range = new Range (b, l, i); |
|
|
399 int nel = range->nelem (); |
|
|
400 if (nel < 0) |
|
|
401 { |
|
|
402 if (nel == -1) |
|
|
403 error ("number of elements in range exceeds INT_MAX"); |
|
|
404 else |
|
|
405 error ("invalid range"); |
|
|
406 |
|
|
407 jump_to_top_level (); |
|
|
408 } |
|
|
409 else if (nel > 1) |
|
|
410 type_tag = range_constant; |
|
|
411 else |
|
|
412 { |
|
|
413 delete range; |
|
|
414 if (nel == 1) |
|
|
415 { |
|
|
416 scalar = b; |
|
|
417 type_tag = scalar_constant; |
|
|
418 } |
|
|
419 else if (nel == 0) |
|
|
420 { |
|
|
421 matrix = new Matrix (); |
|
|
422 type_tag = matrix_constant; |
|
|
423 } |
|
|
424 else |
|
|
425 panic_impossible (); |
|
|
426 } |
|
|
427 } |
|
|
428 |
|
|
429 tree_constant_rep::tree_constant_rep (Range& r) |
|
|
430 { |
|
|
431 if (r.nelem () > 1) |
|
|
432 { |
|
|
433 range = new Range (r); |
|
|
434 type_tag = range_constant; |
|
|
435 } |
|
|
436 else if (r.nelem () == 1) |
|
|
437 { |
|
|
438 scalar = r.base (); |
|
|
439 type_tag = scalar_constant; |
|
|
440 } |
|
|
441 else if (r.nelem () == 0) |
|
|
442 { |
|
|
443 matrix = new Matrix (); |
|
|
444 type_tag = matrix_constant; |
|
|
445 } |
|
|
446 else |
|
|
447 panic_impossible (); |
|
|
448 } |
|
|
449 |
|
|
450 tree_constant_rep::tree_constant_rep (tree_constant_rep::constant_type t) |
|
|
451 { |
|
|
452 assert (t == magic_colon); |
|
|
453 |
|
|
454 type_tag = magic_colon; |
|
|
455 } |
|
|
456 |
|
|
457 tree_constant_rep::tree_constant_rep (tree_constant_rep& t) |
|
|
458 { |
|
|
459 type_tag = t.type_tag; |
|
|
460 |
|
|
461 switch (t.type_tag) |
|
|
462 { |
|
|
463 case unknown_constant: |
|
|
464 break; |
|
|
465 case scalar_constant: |
|
|
466 scalar = t.scalar; |
|
|
467 break; |
|
|
468 case matrix_constant: |
|
|
469 matrix = new Matrix (*(t.matrix)); |
|
|
470 break; |
|
|
471 case string_constant: |
|
|
472 string = strsave (t.string); |
|
|
473 break; |
|
|
474 case complex_matrix_constant: |
|
|
475 complex_matrix = new ComplexMatrix (*(t.complex_matrix)); |
|
|
476 break; |
|
|
477 case complex_scalar_constant: |
|
|
478 complex_scalar = new Complex (*(t.complex_scalar)); |
|
|
479 break; |
|
|
480 case range_constant: |
|
|
481 range = new Range (*(t.range)); |
|
|
482 break; |
|
|
483 case magic_colon: |
|
|
484 break; |
|
|
485 default: |
|
|
486 panic_impossible (); |
|
|
487 break; |
|
|
488 } |
|
|
489 } |
|
|
490 |
|
|
491 tree_constant_rep::~tree_constant_rep (void) |
|
|
492 { |
|
|
493 switch (type_tag) |
|
|
494 { |
|
|
495 case unknown_constant: |
|
|
496 break; |
|
|
497 case scalar_constant: |
|
|
498 break; |
|
|
499 case matrix_constant: |
|
|
500 delete matrix; |
|
|
501 break; |
|
|
502 case complex_scalar_constant: |
|
|
503 delete complex_scalar; |
|
|
504 break; |
|
|
505 case complex_matrix_constant: |
|
|
506 delete complex_matrix; |
|
|
507 break; |
|
|
508 case string_constant: |
|
|
509 delete [] string; |
|
|
510 break; |
|
|
511 case range_constant: |
|
|
512 delete range; |
|
|
513 break; |
|
|
514 case magic_colon: |
|
|
515 break; |
|
|
516 default: |
|
|
517 panic_impossible (); |
|
|
518 break; |
|
|
519 } |
|
|
520 } |
|
|
521 |
|
|
522 #if defined (MDEBUG) |
|
|
523 void * |
|
|
524 tree_constant_rep::operator new (size_t size) |
|
|
525 { |
|
|
526 tree_constant_rep *p = ::new tree_constant_rep; |
|
|
527 cerr << "tree_constant_rep::new(): " << p << "\n"; |
|
|
528 return p; |
|
|
529 } |
|
|
530 |
|
|
531 void |
|
|
532 tree_constant_rep::operator delete (void *p, size_t size) |
|
|
533 { |
|
|
534 cerr << "tree_constant_rep::delete(): " << p << "\n"; |
|
|
535 ::delete p; |
|
|
536 } |
|
|
537 #endif |
|
|
538 |
|
|
539 void |
|
|
540 tree_constant_rep::resize (int i, int j) |
|
|
541 { |
|
|
542 switch (type_tag) |
|
|
543 { |
|
|
544 case matrix_constant: |
|
|
545 matrix->resize (i, j); |
|
|
546 break; |
|
|
547 case complex_matrix_constant: |
|
|
548 complex_matrix->resize (i, j); |
|
|
549 break; |
|
|
550 default: |
|
|
551 panic_impossible (); |
|
|
552 break; |
|
|
553 } |
|
|
554 } |
|
|
555 |
|
|
556 void |
|
|
557 tree_constant_rep::resize (int i, int j, double val) |
|
|
558 { |
|
|
559 switch (type_tag) |
|
|
560 { |
|
|
561 case matrix_constant: |
|
|
562 matrix->resize (i, j, val); |
|
|
563 break; |
|
|
564 case complex_matrix_constant: |
|
|
565 complex_matrix->resize (i, j, val); |
|
|
566 break; |
|
|
567 default: |
|
|
568 panic_impossible (); |
|
|
569 break; |
|
|
570 } |
|
|
571 } |
|
|
572 |
|
|
573 void |
|
|
574 tree_constant_rep::maybe_resize (int i, int j) |
|
|
575 { |
|
|
576 int nr = rows (); |
|
|
577 int nc = columns (); |
|
|
578 |
|
|
579 i++; |
|
|
580 j++; |
|
|
581 |
|
|
582 assert (i > 0 && j > 0); |
|
|
583 |
|
|
584 if (i > nr || j > nc) |
|
|
585 { |
|
|
586 if (user_pref.resize_on_range_error) |
|
|
587 resize (MAX (i, nr), MAX (j, nc), 0.0); |
|
|
588 else |
|
|
589 { |
|
|
590 if (i > nr) |
|
|
591 message ((char *) NULL, |
|
|
592 "row index = %d exceeds max row dimension = %d", i, nr); |
|
|
593 if (j > nc) |
|
|
594 message ((char *) NULL, |
|
|
595 "column index = %d exceeds max column dimension = %d", |
|
|
596 j, nc); |
|
|
597 |
|
|
598 jump_to_top_level (); |
|
|
599 } |
|
|
600 } |
|
|
601 } |
|
|
602 |
|
|
603 void |
|
|
604 tree_constant_rep::maybe_resize (int i, force_orient f_orient = no_orient) |
|
|
605 { |
|
|
606 int nr = rows (); |
|
|
607 int nc = columns (); |
|
|
608 |
|
|
609 i++; |
|
|
610 |
|
|
611 assert (i > 0 && (nr <= 1 || nc <= 1)); |
|
|
612 |
|
|
613 if (nr <= 1 && nc <= 1 && i >= 1) |
|
|
614 { |
|
|
615 if (user_pref.resize_on_range_error) |
|
|
616 { |
|
|
617 if (f_orient == row_orient) |
|
|
618 resize (1, i, 0.0); |
|
|
619 else if (f_orient == column_orient) |
|
|
620 resize (i, 1, 0.0); |
|
|
621 else if (user_pref.prefer_column_vectors) |
|
|
622 resize (i, 1, 0.0); |
|
|
623 else |
|
|
624 resize (1, i, 0.0); |
|
|
625 } |
|
|
626 else |
|
|
627 { |
|
|
628 message ((char *) NULL, |
|
|
629 "matrix index = %d exceeds max dimension = %d", i, nc); |
|
|
630 jump_to_top_level (); |
|
|
631 } |
|
|
632 } |
|
|
633 else if (nr == 1 && i > nc) |
|
|
634 { |
|
|
635 if (user_pref.resize_on_range_error) |
|
|
636 resize (1, i, 0.0); |
|
|
637 else |
|
|
638 { |
|
|
639 message ((char *) NULL, |
|
|
640 "matrix index = %d exceeds max dimension = %d", i, nc); |
|
|
641 jump_to_top_level (); |
|
|
642 } |
|
|
643 } |
|
|
644 else if (nc == 1 && i > nr) |
|
|
645 { |
|
|
646 if (user_pref.resize_on_range_error) |
|
|
647 resize (i, 1, 0.0); |
|
|
648 else |
|
|
649 { |
|
|
650 message ((char *) NULL, |
|
|
651 "matrix index = %d exceeds max dimension = ", i, nc); |
|
|
652 jump_to_top_level (); |
|
|
653 } |
|
|
654 } |
|
|
655 } |
|
|
656 |
|
|
657 double |
|
|
658 tree_constant_rep::to_scalar (void) |
|
|
659 { |
|
|
660 tree_constant tmp = make_numeric (); |
|
|
661 |
|
|
662 double retval = 0.0; |
|
|
663 |
|
|
664 switch (tmp.const_type ()) |
|
|
665 { |
|
|
666 case tree_constant_rep::scalar_constant: |
|
|
667 case tree_constant_rep::complex_scalar_constant: |
|
|
668 retval = tmp.double_value (); |
|
|
669 break; |
|
|
670 case tree_constant_rep::matrix_constant: |
|
|
671 if (user_pref.do_fortran_indexing) |
|
|
672 { |
|
|
673 Matrix m = tmp.matrix_value (); |
|
|
674 retval = m (0, 0); |
|
|
675 } |
|
|
676 break; |
|
|
677 case tree_constant_rep::complex_matrix_constant: |
|
|
678 if (user_pref.do_fortran_indexing) |
|
|
679 { |
|
|
680 int flag = user_pref.ok_to_lose_imaginary_part; |
|
|
681 if (flag == -1) |
|
|
682 warning ("implicit conversion of complex value to real value"); |
|
|
683 |
|
|
684 if (flag != 0) |
|
|
685 { |
|
|
686 ComplexMatrix m = tmp.complex_matrix_value (); |
|
|
687 return real (m (0, 0)); |
|
|
688 } |
|
|
689 else |
|
|
690 jump_to_top_level (); |
|
|
691 } |
|
|
692 else |
|
|
693 { |
|
|
694 error ("complex matrix used in invalid context"); |
|
|
695 jump_to_top_level (); |
|
|
696 } |
|
|
697 break; |
|
|
698 default: |
|
|
699 break; |
|
|
700 } |
|
|
701 return retval; |
|
|
702 } |
|
|
703 |
|
|
704 ColumnVector |
|
|
705 tree_constant_rep::to_vector (void) |
|
|
706 { |
|
|
707 tree_constant tmp = make_numeric (); |
|
|
708 |
|
|
709 ColumnVector retval; |
|
|
710 |
|
|
711 switch (tmp.const_type ()) |
|
|
712 { |
|
|
713 case tree_constant_rep::scalar_constant: |
|
|
714 case tree_constant_rep::complex_scalar_constant: |
|
|
715 retval.resize (1); |
|
|
716 retval.elem (0) = tmp.double_value (); |
|
|
717 break; |
|
|
718 case tree_constant_rep::complex_matrix_constant: |
|
|
719 case tree_constant_rep::matrix_constant: |
|
|
720 { |
|
|
721 Matrix m = tmp.matrix_value (); |
|
|
722 int nr = m.rows (); |
|
|
723 int nc = m.columns (); |
|
|
724 if (nr == 1) |
|
|
725 { |
|
|
726 retval.resize (nc); |
|
|
727 for (int i = 0; i < nc; i++) |
|
|
728 retval.elem (i) = m (0, i); |
|
|
729 } |
|
|
730 else if (nc == 1) |
|
|
731 { |
|
|
732 retval.resize (nr); |
|
|
733 for (int i = 0; i < nr; i++) |
|
|
734 retval.elem (i) = m.elem (i, 0); |
|
|
735 } |
|
|
736 } |
|
|
737 break; |
|
|
738 default: |
|
|
739 panic_impossible (); |
|
|
740 break; |
|
|
741 } |
|
|
742 return retval; |
|
|
743 } |
|
|
744 |
|
|
745 Matrix |
|
|
746 tree_constant_rep::to_matrix (void) |
|
|
747 { |
|
|
748 tree_constant tmp = make_numeric (); |
|
|
749 |
|
|
750 Matrix retval; |
|
|
751 |
|
|
752 switch (tmp.const_type ()) |
|
|
753 { |
|
|
754 case tree_constant_rep::scalar_constant: |
|
|
755 retval.resize (1, 1); |
|
|
756 retval.elem (0, 0) = tmp.double_value (); |
|
|
757 break; |
|
|
758 case tree_constant_rep::matrix_constant: |
|
|
759 retval = tmp.matrix_value (); |
|
|
760 break; |
|
|
761 default: |
|
|
762 break; |
|
|
763 } |
|
|
764 return retval; |
|
|
765 } |
|
|
766 |
|
|
767 tree_constant_rep::constant_type |
|
|
768 tree_constant_rep::force_numeric (int force_str_conv = 0) |
|
|
769 { |
|
|
770 switch (type_tag) |
|
|
771 { |
|
|
772 case scalar_constant: |
|
|
773 case matrix_constant: |
|
|
774 case complex_scalar_constant: |
|
|
775 case complex_matrix_constant: |
|
|
776 break; |
|
|
777 case string_constant: |
|
|
778 { |
|
|
779 if (! force_str_conv && ! user_pref.implicit_str_to_num_ok) |
|
|
780 { |
|
|
781 error ("failed to convert `%s' to a numeric type -- default\ |
|
|
782 conversion turned off", string); |
|
|
783 // Abort! |
|
|
784 jump_to_top_level (); |
|
|
785 } |
|
|
786 |
|
|
787 int len = strlen (string); |
|
|
788 if (len > 1) |
|
|
789 { |
|
|
790 type_tag = matrix_constant; |
|
|
791 Matrix *tm = new Matrix (1, len); |
|
|
792 for (int i = 0; i < len; i++) |
|
|
793 tm->elem (0, i) = toascii ((int) string[i]); |
|
|
794 matrix = tm; |
|
|
795 } |
|
|
796 else if (len == 1) |
|
|
797 { |
|
|
798 type_tag = scalar_constant; |
|
|
799 scalar = toascii ((int) string[0]); |
|
|
800 } |
|
|
801 } |
|
|
802 break; |
|
|
803 case range_constant: |
|
|
804 { |
|
|
805 int len = range->nelem (); |
|
|
806 if (len > 1) |
|
|
807 { |
|
|
808 type_tag = matrix_constant; |
|
|
809 Matrix *tm = new Matrix (1, len); |
|
|
810 double b = range->base (); |
|
|
811 double increment = range->inc (); |
|
|
812 for (int i = 0; i < len; i++) |
|
|
813 tm->elem (0, i) = b + i * increment; |
|
|
814 matrix = tm; |
|
|
815 } |
|
|
816 else if (len == 1) |
|
|
817 { |
|
|
818 type_tag = scalar_constant; |
|
|
819 scalar = range->base (); |
|
|
820 } |
|
|
821 } |
|
|
822 break; |
|
|
823 case magic_colon: |
|
|
824 default: |
|
|
825 panic_impossible (); |
|
|
826 break; |
|
|
827 } |
|
|
828 return type_tag; |
|
|
829 } |
|
|
830 |
|
|
831 tree_constant |
|
|
832 tree_constant_rep::make_numeric (int force_str_conv = 0) |
|
|
833 { |
|
|
834 tree_constant retval; |
|
|
835 switch (type_tag) |
|
|
836 { |
|
|
837 case scalar_constant: |
|
|
838 retval = tree_constant (scalar); |
|
|
839 break; |
|
|
840 case matrix_constant: |
|
|
841 retval = tree_constant (*matrix); |
|
|
842 break; |
|
|
843 case complex_scalar_constant: |
|
|
844 retval = tree_constant (*complex_scalar); |
|
|
845 break; |
|
|
846 case complex_matrix_constant: |
|
|
847 retval = tree_constant (*complex_matrix); |
|
|
848 break; |
|
|
849 case string_constant: |
|
|
850 retval = tree_constant (string); |
|
|
851 retval.force_numeric (force_str_conv); |
|
|
852 break; |
|
|
853 case range_constant: |
|
|
854 retval = tree_constant (*range); |
|
|
855 retval.force_numeric (force_str_conv); |
|
|
856 break; |
|
|
857 case magic_colon: |
|
|
858 default: |
|
|
859 panic_impossible (); |
|
|
860 break; |
|
|
861 } |
|
|
862 return retval; |
|
|
863 } |
|
|
864 |
|
|
865 tree_constant |
|
|
866 do_binary_op (tree_constant& a, tree_constant& b, tree::expression_type t) |
|
|
867 { |
|
143
|
868 tree_constant ans; |
|
|
869 |
|
1
|
870 int first_empty = (a.rows () == 0 || a.columns () == 0); |
|
|
871 int second_empty = (b.rows () == 0 || b.columns () == 0); |
|
|
872 |
|
|
873 if (first_empty || second_empty) |
|
|
874 { |
|
|
875 int flag = user_pref.propagate_empty_matrices; |
|
|
876 if (flag < 0) |
|
|
877 warning ("binary operation on empty matrix"); |
|
|
878 else if (flag == 0) |
|
|
879 { |
|
|
880 error ("invalid binary operation on empty matrix"); |
|
143
|
881 return ans; |
|
1
|
882 } |
|
|
883 } |
|
|
884 |
|
|
885 tree_constant tmp_a = a.make_numeric (); |
|
|
886 tree_constant tmp_b = b.make_numeric (); |
|
|
887 |
|
|
888 tree_constant_rep::constant_type a_type = tmp_a.const_type (); |
|
|
889 tree_constant_rep::constant_type b_type = tmp_b.const_type (); |
|
|
890 |
|
|
891 double d1, d2; |
|
|
892 Matrix m1, m2; |
|
|
893 Complex c1, c2; |
|
|
894 ComplexMatrix cm1, cm2; |
|
|
895 |
|
|
896 switch (a_type) |
|
|
897 { |
|
|
898 case tree_constant_rep::scalar_constant: |
|
|
899 d1 = tmp_a.double_value (); |
|
|
900 switch (b_type) |
|
|
901 { |
|
|
902 case tree_constant_rep::scalar_constant: |
|
|
903 d2 = tmp_b.double_value (); |
|
|
904 ans = do_binary_op (d1, d2, t); |
|
|
905 break; |
|
|
906 case tree_constant_rep::matrix_constant: |
|
|
907 m2 = tmp_b.matrix_value (); |
|
|
908 ans = do_binary_op (d1, m2, t); |
|
|
909 break; |
|
|
910 case tree_constant_rep::complex_scalar_constant: |
|
|
911 c2 = tmp_b.complex_value (); |
|
|
912 ans = do_binary_op (d1, c2, t); |
|
|
913 break; |
|
|
914 case tree_constant_rep::complex_matrix_constant: |
|
|
915 cm2 = tmp_b.complex_matrix_value (); |
|
|
916 ans = do_binary_op (d1, cm2, t); |
|
|
917 break; |
|
|
918 case tree_constant_rep::magic_colon: |
|
|
919 default: |
|
|
920 panic_impossible (); |
|
|
921 break; |
|
|
922 } |
|
|
923 break; |
|
|
924 case tree_constant_rep::matrix_constant: |
|
|
925 m1 = tmp_a.matrix_value (); |
|
|
926 switch (b_type) |
|
|
927 { |
|
|
928 case tree_constant_rep::scalar_constant: |
|
|
929 d2 = tmp_b.double_value (); |
|
|
930 ans = do_binary_op (m1, d2, t); |
|
|
931 break; |
|
|
932 case tree_constant_rep::matrix_constant: |
|
|
933 m2 = tmp_b.matrix_value (); |
|
|
934 ans = do_binary_op (m1, m2, t); |
|
|
935 break; |
|
|
936 case tree_constant_rep::complex_scalar_constant: |
|
|
937 c2 = tmp_b.complex_value (); |
|
|
938 ans = do_binary_op (m1, c2, t); |
|
|
939 break; |
|
|
940 case tree_constant_rep::complex_matrix_constant: |
|
|
941 cm2 = tmp_b.complex_matrix_value (); |
|
|
942 ans = do_binary_op (m1, cm2, t); |
|
|
943 break; |
|
|
944 case tree_constant_rep::magic_colon: |
|
|
945 default: |
|
|
946 panic_impossible (); |
|
|
947 break; |
|
|
948 } |
|
|
949 break; |
|
|
950 case tree_constant_rep::complex_scalar_constant: |
|
|
951 c1 = tmp_a.complex_value (); |
|
|
952 switch (b_type) |
|
|
953 { |
|
|
954 case tree_constant_rep::scalar_constant: |
|
|
955 d2 = tmp_b.double_value (); |
|
|
956 ans = do_binary_op (c1, d2, t); |
|
|
957 break; |
|
|
958 case tree_constant_rep::matrix_constant: |
|
|
959 m2 = tmp_b.matrix_value (); |
|
|
960 ans = do_binary_op (c1, m2, t); |
|
|
961 break; |
|
|
962 case tree_constant_rep::complex_scalar_constant: |
|
|
963 c2 = tmp_b.complex_value (); |
|
|
964 ans = do_binary_op (c1, c2, t); |
|
|
965 break; |
|
|
966 case tree_constant_rep::complex_matrix_constant: |
|
|
967 cm2 = tmp_b.complex_matrix_value (); |
|
|
968 ans = do_binary_op (c1, cm2, t); |
|
|
969 break; |
|
|
970 case tree_constant_rep::magic_colon: |
|
|
971 default: |
|
|
972 panic_impossible (); |
|
|
973 break; |
|
|
974 } |
|
|
975 break; |
|
|
976 case tree_constant_rep::complex_matrix_constant: |
|
|
977 cm1 = tmp_a.complex_matrix_value (); |
|
|
978 switch (b_type) |
|
|
979 { |
|
|
980 case tree_constant_rep::scalar_constant: |
|
|
981 d2 = tmp_b.double_value (); |
|
|
982 ans = do_binary_op (cm1, d2, t); |
|
|
983 break; |
|
|
984 case tree_constant_rep::matrix_constant: |
|
|
985 m2 = tmp_b.matrix_value (); |
|
|
986 ans = do_binary_op (cm1, m2, t); |
|
|
987 break; |
|
|
988 case tree_constant_rep::complex_scalar_constant: |
|
|
989 c2 = tmp_b.complex_value (); |
|
|
990 ans = do_binary_op (cm1, c2, t); |
|
|
991 break; |
|
|
992 case tree_constant_rep::complex_matrix_constant: |
|
|
993 cm2 = tmp_b.complex_matrix_value (); |
|
|
994 ans = do_binary_op (cm1, cm2, t); |
|
|
995 break; |
|
|
996 case tree_constant_rep::magic_colon: |
|
|
997 default: |
|
|
998 panic_impossible (); |
|
|
999 break; |
|
|
1000 } |
|
|
1001 break; |
|
|
1002 case tree_constant_rep::magic_colon: |
|
|
1003 default: |
|
|
1004 panic_impossible (); |
|
|
1005 break; |
|
|
1006 } |
|
|
1007 return ans; |
|
|
1008 } |
|
|
1009 |
|
|
1010 tree_constant |
|
|
1011 do_unary_op (tree_constant& a, tree::expression_type t) |
|
|
1012 { |
|
143
|
1013 tree_constant ans; |
|
|
1014 |
|
1
|
1015 if (a.rows () == 0 || a.columns () == 0) |
|
|
1016 { |
|
|
1017 int flag = user_pref.propagate_empty_matrices; |
|
|
1018 if (flag < 0) |
|
|
1019 warning ("unary operation on empty matrix"); |
|
|
1020 else if (flag == 0) |
|
|
1021 { |
|
|
1022 error ("invalid unary operation on empty matrix"); |
|
143
|
1023 return ans; |
|
1
|
1024 } |
|
|
1025 } |
|
|
1026 |
|
|
1027 tree_constant tmp_a = a.make_numeric (); |
|
|
1028 |
|
|
1029 switch (tmp_a.const_type ()) |
|
|
1030 { |
|
|
1031 case tree_constant_rep::scalar_constant: |
|
|
1032 ans = do_unary_op (tmp_a.double_value (), t); |
|
|
1033 break; |
|
|
1034 case tree_constant_rep::matrix_constant: |
|
|
1035 { |
|
|
1036 Matrix m = tmp_a.matrix_value (); |
|
|
1037 ans = do_unary_op (m, t); |
|
|
1038 } |
|
|
1039 break; |
|
|
1040 case tree_constant_rep::complex_scalar_constant: |
|
|
1041 ans = do_unary_op (tmp_a.complex_value (), t); |
|
|
1042 break; |
|
|
1043 case tree_constant_rep::complex_matrix_constant: |
|
|
1044 { |
|
|
1045 ComplexMatrix m = tmp_a.complex_matrix_value (); |
|
|
1046 ans = do_unary_op (m, t); |
|
|
1047 } |
|
|
1048 break; |
|
|
1049 case tree_constant_rep::magic_colon: |
|
|
1050 default: |
|
|
1051 panic_impossible (); |
|
|
1052 break; |
|
|
1053 } |
|
|
1054 return ans; |
|
|
1055 } |
|
|
1056 |
|
|
1057 void |
|
|
1058 tree_constant_rep::bump_value (tree::expression_type etype) |
|
|
1059 { |
|
|
1060 switch (etype) |
|
|
1061 { |
|
|
1062 case tree::increment: |
|
|
1063 switch (type_tag) |
|
|
1064 { |
|
|
1065 case scalar_constant: |
|
|
1066 scalar++; |
|
|
1067 break; |
|
|
1068 case matrix_constant: |
|
|
1069 *matrix = *matrix + 1.0; |
|
|
1070 break; |
|
|
1071 case complex_scalar_constant: |
|
|
1072 *complex_scalar = *complex_scalar + 1.0; |
|
|
1073 break; |
|
|
1074 case complex_matrix_constant: |
|
|
1075 *complex_matrix = *complex_matrix + 1.0; |
|
|
1076 break; |
|
|
1077 case string_constant: |
|
|
1078 error ("string++ and ++string not implemented yet, ok?"); |
|
|
1079 break; |
|
|
1080 case range_constant: |
|
|
1081 range->set_base (range->base () + 1.0); |
|
|
1082 range->set_limit (range->limit () + 1.0); |
|
|
1083 break; |
|
|
1084 case magic_colon: |
|
|
1085 default: |
|
|
1086 panic_impossible (); |
|
|
1087 break; |
|
|
1088 } |
|
|
1089 break; |
|
|
1090 case tree::decrement: |
|
|
1091 switch (type_tag) |
|
|
1092 { |
|
|
1093 case scalar_constant: |
|
|
1094 scalar--; |
|
|
1095 break; |
|
|
1096 case matrix_constant: |
|
|
1097 *matrix = *matrix - 1.0; |
|
|
1098 break; |
|
|
1099 case string_constant: |
|
|
1100 error ("string-- and -- string not implemented yet, ok?"); |
|
|
1101 break; |
|
|
1102 case range_constant: |
|
|
1103 range->set_base (range->base () - 1.0); |
|
|
1104 range->set_limit (range->limit () - 1.0); |
|
|
1105 break; |
|
|
1106 case magic_colon: |
|
|
1107 default: |
|
|
1108 panic_impossible (); |
|
|
1109 break; |
|
|
1110 } |
|
|
1111 break; |
|
|
1112 default: |
|
|
1113 panic_impossible (); |
|
|
1114 break; |
|
|
1115 } |
|
|
1116 } |
|
|
1117 |
|
|
1118 void |
|
|
1119 tree_constant_rep::eval (int print) |
|
|
1120 { |
|
143
|
1121 if (error_state) |
|
|
1122 return; |
|
|
1123 |
|
1
|
1124 switch (type_tag) |
|
|
1125 { |
|
|
1126 case complex_scalar_constant: |
|
|
1127 if (imag (*complex_scalar) == 0.0) |
|
|
1128 { |
|
|
1129 double d = real (*complex_scalar); |
|
|
1130 delete complex_scalar; |
|
|
1131 scalar = d; |
|
|
1132 type_tag = scalar_constant; |
|
|
1133 } |
|
|
1134 break; |
|
|
1135 case complex_matrix_constant: |
|
|
1136 if (! any_element_is_complex (*complex_matrix)) |
|
|
1137 { |
|
|
1138 Matrix *m = new Matrix (real (*complex_matrix)); |
|
|
1139 delete complex_matrix; |
|
|
1140 matrix = m; |
|
|
1141 type_tag = matrix_constant; |
|
|
1142 } |
|
|
1143 break; |
|
|
1144 case scalar_constant: |
|
|
1145 case matrix_constant: |
|
|
1146 case string_constant: |
|
|
1147 case range_constant: |
|
|
1148 case magic_colon: |
|
|
1149 break; |
|
|
1150 default: |
|
|
1151 panic_impossible (); |
|
|
1152 break; |
|
|
1153 } |
|
|
1154 |
|
145
|
1155 // Avoid calling rows() and columns() for things like magic_colon. |
|
143
|
1156 |
|
145
|
1157 int nr = 1; |
|
|
1158 int nc = 1; |
|
|
1159 if (type_tag == matrix_constant |
|
|
1160 || type_tag == complex_matrix_constant |
|
|
1161 || type_tag == range_constant) |
|
143
|
1162 { |
|
145
|
1163 nr = rows (); |
|
|
1164 nc = columns (); |
|
|
1165 } |
|
|
1166 |
|
|
1167 switch (type_tag) |
|
|
1168 { |
|
|
1169 case matrix_constant: |
|
|
1170 if (nr == 1 && nc == 1) |
|
143
|
1171 { |
|
145
|
1172 double d = matrix->elem (0, 0); |
|
|
1173 delete matrix; |
|
|
1174 scalar = d; |
|
|
1175 type_tag = scalar_constant; |
|
143
|
1176 } |
|
145
|
1177 break; |
|
|
1178 case complex_matrix_constant: |
|
|
1179 if (nr == 1 && nc == 1) |
|
|
1180 { |
|
|
1181 Complex c = complex_matrix->elem (0, 0); |
|
|
1182 delete complex_matrix; |
|
|
1183 complex_scalar = new Complex (c); |
|
|
1184 type_tag = complex_scalar_constant; |
|
|
1185 } |
|
|
1186 break; |
|
|
1187 case range_constant: |
|
|
1188 if (nr == 1 && nc == 1) |
|
|
1189 { |
|
|
1190 double d = range->base (); |
|
|
1191 delete range; |
|
|
1192 scalar = d; |
|
|
1193 type_tag = scalar_constant; |
|
|
1194 } |
|
|
1195 break; |
|
|
1196 default: |
|
|
1197 break; |
|
143
|
1198 } |
|
|
1199 |
|
1
|
1200 if (print) |
|
|
1201 { |
|
|
1202 ostrstream output_buf; |
|
|
1203 switch (type_tag) |
|
|
1204 { |
|
|
1205 case scalar_constant: |
|
|
1206 octave_print_internal (output_buf, scalar); |
|
|
1207 break; |
|
|
1208 case matrix_constant: |
|
|
1209 if (nr == 0 || nc == 0) |
|
|
1210 { |
|
|
1211 output_buf << "[]"; |
|
|
1212 if (user_pref.print_empty_dimensions) |
|
|
1213 output_buf << "(" << nr << "x" << nc << ")"; |
|
|
1214 output_buf << "\n"; |
|
|
1215 } |
|
|
1216 else |
|
|
1217 octave_print_internal (output_buf, *matrix); |
|
|
1218 break; |
|
|
1219 case complex_scalar_constant: |
|
|
1220 octave_print_internal (output_buf, *complex_scalar); |
|
|
1221 break; |
|
|
1222 case complex_matrix_constant: |
|
|
1223 if (nr == 0 || nc == 0) |
|
|
1224 { |
|
|
1225 output_buf << "[]"; |
|
|
1226 if (user_pref.print_empty_dimensions) |
|
|
1227 output_buf << "(" << nr << "x" << nc << ")"; |
|
|
1228 output_buf << "\n"; |
|
|
1229 } |
|
|
1230 else |
|
|
1231 octave_print_internal (output_buf, *complex_matrix); |
|
|
1232 break; |
|
|
1233 case string_constant: |
|
|
1234 output_buf << string << "\n"; |
|
|
1235 break; |
|
|
1236 case range_constant: |
|
|
1237 octave_print_internal (output_buf, *range); |
|
|
1238 break; |
|
|
1239 case magic_colon: |
|
|
1240 default: |
|
|
1241 panic_impossible (); |
|
|
1242 break; |
|
|
1243 } |
|
|
1244 |
|
|
1245 output_buf << ends; |
|
|
1246 maybe_page_output (output_buf); |
|
|
1247 } |
|
|
1248 } |
|
|
1249 |
|
|
1250 tree_constant * |
|
|
1251 tree_constant_rep::eval (tree_constant *args, int nargin, int nargout, |
|
|
1252 int print) |
|
|
1253 { |
|
143
|
1254 if (error_state) |
|
|
1255 return NULL_TREE_CONST; |
|
|
1256 |
|
1
|
1257 tree_constant *retval = new tree_constant [2]; |
|
|
1258 switch (type_tag) |
|
|
1259 { |
|
|
1260 case complex_scalar_constant: |
|
|
1261 case scalar_constant: |
|
|
1262 retval[0] = do_scalar_index (args, nargin); |
|
|
1263 break; |
|
|
1264 case complex_matrix_constant: |
|
|
1265 case matrix_constant: |
|
|
1266 retval[0] = do_matrix_index (args, nargin); |
|
|
1267 break; |
|
|
1268 case string_constant: |
|
|
1269 gripe_string_invalid (); |
|
|
1270 // retval[0] = do_string_index (args, nargin); |
|
|
1271 break; |
|
|
1272 case magic_colon: |
|
|
1273 case range_constant: |
|
|
1274 // This isn\'t great, but it\'s easier than implementing a lot of |
|
|
1275 // range indexing functions. |
|
|
1276 force_numeric (); |
|
|
1277 assert (type_tag != magic_colon && type_tag != range_constant); |
|
|
1278 return eval (args, nargin, nargout, print); |
|
|
1279 break; |
|
|
1280 default: |
|
|
1281 panic_impossible (); |
|
|
1282 break; |
|
|
1283 } |
|
|
1284 |
|
|
1285 if (retval[0].is_defined ()) |
|
|
1286 retval[0].eval (print); |
|
|
1287 return retval; |
|
|
1288 } |
|
|
1289 |
|
|
1290 int |
|
|
1291 tree_constant_rep::save (ostream& os, int mark_as_global) |
|
|
1292 { |
|
|
1293 switch (type_tag) |
|
|
1294 { |
|
|
1295 case scalar_constant: |
|
|
1296 case matrix_constant: |
|
|
1297 case complex_scalar_constant: |
|
|
1298 case complex_matrix_constant: |
|
|
1299 case string_constant: |
|
|
1300 case range_constant: |
|
|
1301 if (mark_as_global) |
|
|
1302 os << "# type: global "; |
|
|
1303 else |
|
|
1304 os << "# type: "; |
|
|
1305 break; |
|
|
1306 case magic_colon: |
|
|
1307 default: |
|
|
1308 break; |
|
|
1309 } |
|
|
1310 |
|
|
1311 switch (type_tag) |
|
|
1312 { |
|
|
1313 case scalar_constant: |
|
|
1314 os << "scalar\n" |
|
|
1315 << scalar << "\n"; |
|
|
1316 break; |
|
|
1317 case matrix_constant: |
|
|
1318 os << "matrix\n" |
|
|
1319 << "# rows: " << rows () << "\n" |
|
|
1320 << "# columns: " << columns () << "\n" |
|
|
1321 << *matrix ; |
|
|
1322 break; |
|
|
1323 case complex_scalar_constant: |
|
|
1324 os << "complex scalar\n" |
|
|
1325 << *complex_scalar << "\n"; |
|
|
1326 break; |
|
|
1327 case complex_matrix_constant: |
|
|
1328 os << "complex matrix\n" |
|
|
1329 << "# rows: " << rows () << "\n" |
|
|
1330 << "# columns: " << columns () << "\n" |
|
|
1331 << *complex_matrix ; |
|
|
1332 break; |
|
|
1333 case string_constant: |
|
|
1334 os << "string\n" |
|
|
1335 << "# length: " << strlen (string) << "\n" |
|
|
1336 << string << "\n"; |
|
|
1337 break; |
|
|
1338 case range_constant: |
|
|
1339 { |
|
|
1340 os << "range\n" |
|
|
1341 << "# base, limit, increment\n" |
|
|
1342 << range->base () << " " |
|
|
1343 << range->limit () << " " |
|
|
1344 << range->inc () << "\n"; |
|
|
1345 } |
|
|
1346 break; |
|
|
1347 case magic_colon: |
|
|
1348 default: |
|
|
1349 panic_impossible (); |
|
|
1350 break; |
|
|
1351 } |
|
|
1352 // Really want to return 1 only if write is successful. |
|
|
1353 return 1; |
|
|
1354 } |
|
|
1355 |
|
|
1356 int |
|
|
1357 tree_constant_rep::save_three_d (ostream& os, int parametric) |
|
|
1358 { |
|
|
1359 int nr = rows (); |
|
|
1360 int nc = columns (); |
|
|
1361 |
|
|
1362 switch (type_tag) |
|
|
1363 { |
|
|
1364 case matrix_constant: |
|
|
1365 os << "# 3D data...\n" |
|
|
1366 << "# type: matrix\n" |
|
|
1367 << "# total rows: " << nr << "\n" |
|
|
1368 << "# total columns: " << nc << "\n"; |
|
|
1369 |
|
|
1370 if (parametric) |
|
|
1371 { |
|
|
1372 int extras = nc % 3; |
|
|
1373 if (extras) |
|
|
1374 warning ("ignoring last %d columns", extras); |
|
|
1375 |
|
|
1376 for (int i = 0; i < nc-extras; i += 3) |
|
|
1377 { |
|
|
1378 os << matrix->extract (0, i, nr-1, i+2); |
|
|
1379 if (i+3 < nc-extras) |
|
|
1380 os << "\n"; |
|
|
1381 } |
|
|
1382 } |
|
|
1383 else |
|
|
1384 { |
|
|
1385 for (int i = 0; i < nc; i++) |
|
|
1386 { |
|
|
1387 os << matrix->extract (0, i, nr-1, i); |
|
|
1388 if (i+1 < nc) |
|
|
1389 os << "\n"; |
|
|
1390 } |
|
|
1391 } |
|
|
1392 break; |
|
|
1393 default: |
|
|
1394 error ("for now, I can only save real matrices in 3D format"); |
|
|
1395 return 0; |
|
|
1396 break; |
|
|
1397 } |
|
|
1398 // Really want to return 1 only if write is successful. |
|
|
1399 return 1; |
|
|
1400 } |
|
|
1401 |
|
|
1402 int |
|
|
1403 tree_constant_rep::load (istream& is) |
|
|
1404 { |
|
|
1405 int is_global = 0; |
|
|
1406 |
|
|
1407 type_tag = unknown_constant; |
|
|
1408 |
|
|
1409 // Look for type keyword |
|
|
1410 char tag [128]; |
|
|
1411 if (extract_keyword (is, "type", tag)) |
|
|
1412 { |
|
|
1413 if (tag != (char *) NULL && *tag != '\0') |
|
|
1414 { |
|
|
1415 char *ptr = strchr (tag, ' '); |
|
|
1416 if (ptr != (char *) NULL) |
|
|
1417 { |
|
|
1418 *ptr = '\0'; |
|
|
1419 is_global = (strncmp (tag, "global", 6) == 0); |
|
|
1420 *ptr = ' '; |
|
|
1421 ptr++; |
|
|
1422 } |
|
|
1423 else |
|
|
1424 ptr = &tag[0]; |
|
|
1425 |
|
|
1426 if (strncmp (ptr, "scalar", 6) == 0) |
|
|
1427 type_tag = load (is, scalar_constant); |
|
|
1428 else if (strncmp (ptr, "matrix", 6) == 0) |
|
|
1429 type_tag = load (is, matrix_constant); |
|
|
1430 else if (strncmp (ptr, "complex scalar", 14) == 0) |
|
|
1431 type_tag = load (is, complex_scalar_constant); |
|
|
1432 else if (strncmp (ptr, "complex matrix", 14) == 0) |
|
|
1433 type_tag = load (is, complex_matrix_constant); |
|
|
1434 else if (strncmp (ptr, "string", 6) == 0) |
|
|
1435 type_tag = load (is, string_constant); |
|
|
1436 else if (strncmp (ptr, "range", 5) == 0) |
|
|
1437 type_tag = load (is, range_constant); |
|
|
1438 else |
|
|
1439 error ("unknown constant type `%s'", tag); |
|
|
1440 } |
|
|
1441 else |
|
|
1442 error ("failed to extract keyword specifying value type"); |
|
|
1443 } |
|
|
1444 |
|
|
1445 return is_global; |
|
|
1446 } |
|
|
1447 |
|
|
1448 tree_constant_rep::constant_type |
|
|
1449 tree_constant_rep::load (istream& is, tree_constant_rep::constant_type t) |
|
|
1450 { |
|
|
1451 tree_constant_rep::constant_type status = unknown_constant; |
|
|
1452 |
|
|
1453 switch (t) |
|
|
1454 { |
|
|
1455 case scalar_constant: |
|
|
1456 is >> scalar; |
|
|
1457 if (is) |
|
|
1458 status = scalar_constant; |
|
|
1459 else |
|
|
1460 error ("failed to load scalar constant"); |
|
|
1461 break; |
|
|
1462 case matrix_constant: |
|
|
1463 { |
|
|
1464 int nr = 0, nc = 0; |
|
|
1465 |
|
|
1466 if (extract_keyword (is, "rows", nr) && nr > 0 |
|
|
1467 && extract_keyword (is, "columns", nc) && nc > 0) |
|
|
1468 { |
|
|
1469 matrix = new Matrix (nr, nc); |
|
|
1470 is >> *matrix; |
|
|
1471 if (is) |
|
|
1472 status = matrix_constant; |
|
|
1473 else |
|
|
1474 error ("failed to load matrix constant"); |
|
|
1475 } |
|
|
1476 else |
|
|
1477 error ("failed to extract number of rows and columns"); |
|
|
1478 } |
|
|
1479 break; |
|
|
1480 case complex_scalar_constant: |
|
|
1481 is >> *complex_scalar; |
|
|
1482 if (is) |
|
|
1483 status = complex_scalar_constant; |
|
|
1484 else |
|
|
1485 error ("failed to load complex scalar constant"); |
|
|
1486 break; |
|
|
1487 case complex_matrix_constant: |
|
|
1488 { |
|
|
1489 int nr = 0, nc = 0; |
|
|
1490 |
|
|
1491 if (extract_keyword (is, "rows", nr) && nr > 0 |
|
|
1492 && extract_keyword (is, "columns", nc) && nc > 0) |
|
|
1493 { |
|
|
1494 complex_matrix = new ComplexMatrix (nr, nc); |
|
|
1495 is >> *complex_matrix; |
|
|
1496 if (is) |
|
|
1497 status = complex_matrix_constant; |
|
|
1498 else |
|
|
1499 error ("failed to load complex matrix constant"); |
|
|
1500 } |
|
|
1501 else |
|
|
1502 error ("failed to extract number of rows and columns"); |
|
|
1503 } |
|
|
1504 break; |
|
|
1505 case string_constant: |
|
|
1506 { |
|
|
1507 int len; |
|
|
1508 if (extract_keyword (is, "length", len) && len > 0) |
|
|
1509 { |
|
|
1510 string = new char [len+1]; |
|
|
1511 is.get (string, len+1, EOF); |
|
|
1512 if (is) |
|
|
1513 status = string_constant; |
|
|
1514 else |
|
|
1515 error ("failed to load string constant"); |
|
|
1516 } |
|
|
1517 else |
|
|
1518 error ("failed to extract string length"); |
|
|
1519 } |
|
|
1520 break; |
|
|
1521 case range_constant: |
|
|
1522 skip_comments (is); |
|
|
1523 range = new Range (); |
|
|
1524 is >> *range; |
|
|
1525 if (is) |
|
|
1526 status = range_constant; |
|
|
1527 else |
|
|
1528 error ("failed to load range constant"); |
|
|
1529 break; |
|
|
1530 default: |
|
|
1531 panic_impossible (); |
|
|
1532 break; |
|
|
1533 } |
|
|
1534 return status; |
|
|
1535 } |
|
|
1536 |
|
|
1537 double |
|
|
1538 tree_constant_rep::double_value (void) |
|
|
1539 { |
|
105
|
1540 switch (type_tag) |
|
1
|
1541 { |
|
105
|
1542 case scalar_constant: |
|
|
1543 return scalar; |
|
|
1544 case complex_scalar_constant: |
|
|
1545 { |
|
|
1546 int flag = user_pref.ok_to_lose_imaginary_part; |
|
|
1547 if (flag == -1) |
|
|
1548 warning ("implicit conversion of complex value to real value"); |
|
1
|
1549 |
|
105
|
1550 if (flag != 0) |
|
|
1551 return real (*complex_scalar); |
|
|
1552 |
|
|
1553 error ("implicit conversion of complex value to real value not allowed"); |
|
|
1554 jump_to_top_level (); |
|
|
1555 } |
|
|
1556 default: |
|
|
1557 panic_impossible (); |
|
|
1558 break; |
|
1
|
1559 } |
|
|
1560 } |
|
|
1561 |
|
|
1562 Matrix |
|
|
1563 tree_constant_rep::matrix_value (void) |
|
|
1564 { |
|
105
|
1565 switch (type_tag) |
|
1
|
1566 { |
|
105
|
1567 case matrix_constant: |
|
|
1568 return *matrix; |
|
|
1569 case complex_matrix_constant: |
|
|
1570 { |
|
|
1571 int flag = user_pref.ok_to_lose_imaginary_part; |
|
|
1572 if (flag == -1) |
|
|
1573 warning ("implicit conversion of complex matrix to real matrix"); |
|
1
|
1574 |
|
105
|
1575 if (flag != 0) |
|
|
1576 return real (*complex_matrix); |
|
|
1577 else |
|
1
|
1578 error ("implicit conversion of complex matrix to real matrix not allowed"); |
|
105
|
1579 jump_to_top_level (); |
|
|
1580 } |
|
|
1581 default: |
|
|
1582 panic_impossible (); |
|
|
1583 break; |
|
1
|
1584 } |
|
|
1585 } |
|
|
1586 |
|
|
1587 Complex |
|
|
1588 tree_constant_rep::complex_value (void) |
|
|
1589 { |
|
101
|
1590 switch (type_tag) |
|
|
1591 { |
|
|
1592 case complex_scalar_constant: |
|
105
|
1593 return *complex_scalar; |
|
101
|
1594 case scalar_constant: |
|
105
|
1595 return Complex (scalar); |
|
101
|
1596 default: |
|
|
1597 panic_impossible (); |
|
|
1598 break; |
|
|
1599 } |
|
1
|
1600 } |
|
|
1601 |
|
|
1602 ComplexMatrix |
|
|
1603 tree_constant_rep::complex_matrix_value (void) |
|
|
1604 { |
|
105
|
1605 switch (type_tag) |
|
101
|
1606 { |
|
|
1607 case scalar_constant: |
|
|
1608 { |
|
105
|
1609 return ComplexMatrix (scalar); |
|
101
|
1610 } |
|
|
1611 case complex_scalar_constant: |
|
105
|
1612 { |
|
|
1613 return ComplexMatrix (*complex_scalar); |
|
|
1614 } |
|
101
|
1615 case matrix_constant: |
|
|
1616 { |
|
105
|
1617 return ComplexMatrix (*matrix); |
|
101
|
1618 } |
|
|
1619 case complex_matrix_constant: |
|
105
|
1620 return *complex_matrix; |
|
101
|
1621 break; |
|
|
1622 default: |
|
|
1623 panic_impossible (); |
|
|
1624 break; |
|
|
1625 } |
|
1
|
1626 } |
|
|
1627 |
|
|
1628 char * |
|
|
1629 tree_constant_rep::string_value (void) |
|
|
1630 { |
|
|
1631 assert (type_tag == string_constant); |
|
|
1632 return string; |
|
|
1633 } |
|
|
1634 |
|
|
1635 Range |
|
|
1636 tree_constant_rep::range_value (void) |
|
|
1637 { |
|
|
1638 assert (type_tag == range_constant); |
|
|
1639 return *range; |
|
|
1640 } |
|
|
1641 |
|
|
1642 int |
|
|
1643 tree_constant_rep::rows (void) |
|
|
1644 { |
|
|
1645 int retval = -1; |
|
|
1646 switch (type_tag) |
|
|
1647 { |
|
|
1648 case scalar_constant: |
|
|
1649 case complex_scalar_constant: |
|
|
1650 case string_constant: |
|
|
1651 case range_constant: |
|
|
1652 retval = 1; |
|
|
1653 break; |
|
|
1654 case matrix_constant: |
|
|
1655 retval = matrix->rows (); |
|
|
1656 break; |
|
|
1657 case complex_matrix_constant: |
|
|
1658 retval = complex_matrix->rows (); |
|
|
1659 break; |
|
|
1660 case magic_colon: |
|
|
1661 error ("invalid use of colon operator"); |
|
|
1662 break; |
|
|
1663 case unknown_constant: |
|
|
1664 retval = 0; |
|
|
1665 break; |
|
|
1666 default: |
|
|
1667 panic_impossible (); |
|
|
1668 break; |
|
|
1669 } |
|
|
1670 return retval; |
|
|
1671 } |
|
|
1672 |
|
|
1673 int |
|
|
1674 tree_constant_rep::columns (void) |
|
|
1675 { |
|
|
1676 int retval = -1; |
|
|
1677 switch (type_tag) |
|
|
1678 { |
|
|
1679 case scalar_constant: |
|
|
1680 case complex_scalar_constant: |
|
|
1681 retval = 1; |
|
|
1682 break; |
|
|
1683 case matrix_constant: |
|
|
1684 retval = matrix->columns (); |
|
|
1685 break; |
|
|
1686 case complex_matrix_constant: |
|
|
1687 retval = complex_matrix->columns (); |
|
|
1688 break; |
|
|
1689 case string_constant: |
|
|
1690 retval = strlen (string); |
|
|
1691 break; |
|
|
1692 case range_constant: |
|
|
1693 retval = range->nelem (); |
|
|
1694 break; |
|
|
1695 case magic_colon: |
|
|
1696 error ("invalid use of colon operator"); |
|
|
1697 break; |
|
|
1698 case unknown_constant: |
|
|
1699 retval = 0; |
|
|
1700 break; |
|
|
1701 default: |
|
|
1702 panic_impossible (); |
|
|
1703 break; |
|
|
1704 } |
|
|
1705 return retval; |
|
|
1706 } |
|
|
1707 |
|
|
1708 tree_constant |
|
|
1709 tree_constant_rep::all (void) |
|
|
1710 { |
|
|
1711 if (type_tag == string_constant || type_tag == range_constant) |
|
|
1712 { |
|
|
1713 tree_constant tmp = make_numeric (); |
|
|
1714 return tmp.all (); |
|
|
1715 } |
|
|
1716 |
|
|
1717 tree_constant retval; |
|
|
1718 switch (type_tag) |
|
|
1719 { |
|
|
1720 case scalar_constant: |
|
|
1721 { |
|
|
1722 double status = (scalar != 0.0); |
|
|
1723 retval = tree_constant (status); |
|
|
1724 } |
|
|
1725 break; |
|
|
1726 case matrix_constant: |
|
|
1727 { |
|
|
1728 Matrix m = matrix->all (); |
|
|
1729 retval = tree_constant (m); |
|
|
1730 } |
|
|
1731 break; |
|
|
1732 case complex_scalar_constant: |
|
|
1733 { |
|
|
1734 double status = (*complex_scalar != 0.0); |
|
|
1735 retval = tree_constant (status); |
|
|
1736 } |
|
|
1737 break; |
|
|
1738 case complex_matrix_constant: |
|
|
1739 { |
|
|
1740 Matrix m = complex_matrix->all (); |
|
|
1741 retval = tree_constant (m); |
|
|
1742 } |
|
|
1743 break; |
|
|
1744 case string_constant: |
|
|
1745 case range_constant: |
|
|
1746 case magic_colon: |
|
|
1747 default: |
|
|
1748 panic_impossible (); |
|
|
1749 break; |
|
|
1750 } |
|
|
1751 return retval; |
|
|
1752 } |
|
|
1753 |
|
|
1754 tree_constant |
|
|
1755 tree_constant_rep::any (void) |
|
|
1756 { |
|
|
1757 if (type_tag == string_constant || type_tag == range_constant) |
|
|
1758 { |
|
|
1759 tree_constant tmp = make_numeric (); |
|
|
1760 return tmp.any (); |
|
|
1761 } |
|
|
1762 |
|
|
1763 tree_constant retval; |
|
|
1764 switch (type_tag) |
|
|
1765 { |
|
|
1766 case scalar_constant: |
|
|
1767 { |
|
|
1768 double status = (scalar != 0.0); |
|
|
1769 retval = tree_constant (status); |
|
|
1770 } |
|
|
1771 break; |
|
|
1772 case matrix_constant: |
|
|
1773 { |
|
|
1774 Matrix m = matrix->any (); |
|
|
1775 retval = tree_constant (m); |
|
|
1776 } |
|
|
1777 break; |
|
|
1778 case complex_scalar_constant: |
|
|
1779 { |
|
|
1780 double status = (*complex_scalar != 0.0); |
|
|
1781 retval = tree_constant (status); |
|
|
1782 } |
|
|
1783 break; |
|
|
1784 case complex_matrix_constant: |
|
|
1785 { |
|
|
1786 Matrix m = complex_matrix->any (); |
|
|
1787 retval = tree_constant (m); |
|
|
1788 } |
|
|
1789 break; |
|
|
1790 case string_constant: |
|
|
1791 case range_constant: |
|
|
1792 case magic_colon: |
|
|
1793 default: |
|
|
1794 panic_impossible (); |
|
|
1795 break; |
|
|
1796 } |
|
|
1797 return retval; |
|
|
1798 } |
|
|
1799 |
|
|
1800 tree_constant |
|
|
1801 tree_constant_rep::isstr (void) |
|
|
1802 { |
|
|
1803 double status = 0.0; |
|
|
1804 if (const_type () == string_constant) |
|
|
1805 status = 1.0; |
|
|
1806 tree_constant retval (status); |
|
|
1807 return retval; |
|
|
1808 } |
|
|
1809 |
|
|
1810 tree_constant |
|
|
1811 tree_constant_rep::convert_to_str (void) |
|
|
1812 { |
|
|
1813 tree_constant retval; |
|
|
1814 |
|
|
1815 switch (type_tag) |
|
|
1816 { |
|
|
1817 case complex_scalar_constant: |
|
|
1818 case scalar_constant: |
|
|
1819 { |
|
|
1820 double d = double_value (); |
|
|
1821 int i = NINT (d); |
|
|
1822 // Warn about out of range conversions? |
|
|
1823 char s[2]; |
|
|
1824 s[0] = (char) i; |
|
|
1825 retval = tree_constant (s); |
|
|
1826 } |
|
|
1827 break; |
|
|
1828 case complex_matrix_constant: |
|
|
1829 case matrix_constant: |
|
|
1830 { |
|
|
1831 ColumnVector v = to_vector (); |
|
|
1832 int len = v.length (); |
|
|
1833 if (len == 0) |
|
|
1834 error ("can only convert vectors and scalars to strings"); |
|
|
1835 else |
|
|
1836 { |
|
|
1837 char *s = new char [len+1]; |
|
|
1838 s[len] = '\0'; |
|
|
1839 for (int i = 0; i < len; i++) |
|
|
1840 { |
|
|
1841 double d = v.elem (i); |
|
|
1842 int ival = NINT (d); |
|
|
1843 // Warn about out of range conversions? |
|
|
1844 s[i] = (char) ival; |
|
|
1845 } |
|
|
1846 retval = tree_constant (s); |
|
|
1847 delete [] s; |
|
|
1848 } |
|
|
1849 } |
|
|
1850 break; |
|
|
1851 case range_constant: |
|
|
1852 { |
|
|
1853 Range r = range_value (); |
|
|
1854 double b = r.base (); |
|
|
1855 double incr = r.inc (); |
|
|
1856 int nel = r.nelem (); |
|
|
1857 char *s = new char [nel+1]; |
|
|
1858 s[nel] = '\0'; |
|
|
1859 for (int i = 0; i < nel; i++) |
|
|
1860 { |
|
|
1861 double d = b + i * incr; |
|
|
1862 int ival = NINT (d); |
|
|
1863 // Warn about out of range conversions? |
|
|
1864 s[i] = (char) ival; |
|
|
1865 } |
|
|
1866 retval = tree_constant (s); |
|
|
1867 delete [] s; |
|
|
1868 } |
|
|
1869 break; |
|
|
1870 case string_constant: |
|
|
1871 retval = tree_constant (*this); |
|
|
1872 break; |
|
|
1873 case magic_colon: |
|
|
1874 default: |
|
|
1875 panic_impossible (); |
|
|
1876 break; |
|
|
1877 } |
|
|
1878 return retval; |
|
|
1879 } |
|
|
1880 |
|
|
1881 tree_constant |
|
|
1882 tree_constant_rep::cumprod (void) |
|
|
1883 { |
|
|
1884 if (type_tag == string_constant || type_tag == range_constant) |
|
|
1885 { |
|
|
1886 tree_constant tmp = make_numeric (); |
|
|
1887 return tmp.cumprod (); |
|
|
1888 } |
|
|
1889 |
|
|
1890 tree_constant retval; |
|
|
1891 switch (type_tag) |
|
|
1892 { |
|
|
1893 case scalar_constant: |
|
|
1894 retval = tree_constant (scalar); |
|
|
1895 break; |
|
|
1896 case matrix_constant: |
|
|
1897 { |
|
|
1898 Matrix m = matrix->cumprod (); |
|
|
1899 retval = tree_constant (m); |
|
|
1900 } |
|
|
1901 break; |
|
|
1902 case complex_scalar_constant: |
|
|
1903 retval = tree_constant (*complex_scalar); |
|
|
1904 break; |
|
|
1905 case complex_matrix_constant: |
|
|
1906 { |
|
|
1907 ComplexMatrix m = complex_matrix->cumprod (); |
|
|
1908 retval = tree_constant (m); |
|
|
1909 } |
|
|
1910 break; |
|
|
1911 case string_constant: |
|
|
1912 case range_constant: |
|
|
1913 case magic_colon: |
|
|
1914 default: |
|
|
1915 panic_impossible (); |
|
|
1916 break; |
|
|
1917 } |
|
|
1918 return retval; |
|
|
1919 } |
|
|
1920 |
|
|
1921 tree_constant |
|
|
1922 tree_constant_rep::cumsum (void) |
|
|
1923 { |
|
|
1924 if (type_tag == string_constant || type_tag == range_constant) |
|
|
1925 { |
|
|
1926 tree_constant tmp = make_numeric (); |
|
|
1927 return tmp.cumsum (); |
|
|
1928 } |
|
|
1929 |
|
|
1930 tree_constant retval; |
|
|
1931 switch (type_tag) |
|
|
1932 { |
|
|
1933 case scalar_constant: |
|
|
1934 retval = tree_constant (scalar); |
|
|
1935 break; |
|
|
1936 case matrix_constant: |
|
|
1937 { |
|
|
1938 Matrix m = matrix->cumsum (); |
|
|
1939 retval = tree_constant (m); |
|
|
1940 } |
|
|
1941 break; |
|
|
1942 case complex_scalar_constant: |
|
|
1943 retval = tree_constant (*complex_scalar); |
|
|
1944 break; |
|
|
1945 case complex_matrix_constant: |
|
|
1946 { |
|
|
1947 ComplexMatrix m = complex_matrix->cumsum (); |
|
|
1948 retval = tree_constant (m); |
|
|
1949 } |
|
|
1950 break; |
|
|
1951 case string_constant: |
|
|
1952 case range_constant: |
|
|
1953 case magic_colon: |
|
|
1954 default: |
|
|
1955 panic_impossible (); |
|
|
1956 break; |
|
|
1957 } |
|
|
1958 return retval; |
|
|
1959 } |
|
|
1960 |
|
|
1961 tree_constant |
|
|
1962 tree_constant_rep::prod (void) |
|
|
1963 { |
|
|
1964 if (type_tag == string_constant || type_tag == range_constant) |
|
|
1965 { |
|
|
1966 tree_constant tmp = make_numeric (); |
|
|
1967 return tmp.prod (); |
|
|
1968 } |
|
|
1969 |
|
|
1970 tree_constant retval; |
|
|
1971 switch (type_tag) |
|
|
1972 { |
|
|
1973 case scalar_constant: |
|
|
1974 retval = tree_constant (scalar); |
|
|
1975 break; |
|
|
1976 case matrix_constant: |
|
|
1977 { |
|
|
1978 Matrix m = matrix->prod (); |
|
|
1979 retval = tree_constant (m); |
|
|
1980 } |
|
|
1981 break; |
|
|
1982 case complex_scalar_constant: |
|
|
1983 retval = tree_constant (*complex_scalar); |
|
|
1984 break; |
|
|
1985 case complex_matrix_constant: |
|
|
1986 { |
|
|
1987 ComplexMatrix m = complex_matrix->prod (); |
|
|
1988 retval = tree_constant (m); |
|
|
1989 } |
|
|
1990 break; |
|
|
1991 case string_constant: |
|
|
1992 case range_constant: |
|
|
1993 case magic_colon: |
|
|
1994 default: |
|
|
1995 panic_impossible (); |
|
|
1996 break; |
|
|
1997 } |
|
|
1998 return retval; |
|
|
1999 } |
|
|
2000 |
|
|
2001 tree_constant |
|
|
2002 tree_constant_rep::sum (void) |
|
|
2003 { |
|
|
2004 if (type_tag == string_constant || type_tag == range_constant) |
|
|
2005 { |
|
|
2006 tree_constant tmp = make_numeric (); |
|
|
2007 return tmp.sum (); |
|
|
2008 } |
|
|
2009 |
|
|
2010 tree_constant retval; |
|
|
2011 switch (type_tag) |
|
|
2012 { |
|
|
2013 case scalar_constant: |
|
|
2014 retval = tree_constant (scalar); |
|
|
2015 break; |
|
|
2016 case matrix_constant: |
|
|
2017 { |
|
|
2018 Matrix m = matrix->sum (); |
|
|
2019 retval = tree_constant (m); |
|
|
2020 } |
|
|
2021 break; |
|
|
2022 case complex_scalar_constant: |
|
|
2023 retval = tree_constant (*complex_scalar); |
|
|
2024 break; |
|
|
2025 case complex_matrix_constant: |
|
|
2026 { |
|
|
2027 ComplexMatrix m = complex_matrix->sum (); |
|
|
2028 retval = tree_constant (m); |
|
|
2029 } |
|
|
2030 break; |
|
|
2031 case string_constant: |
|
|
2032 case range_constant: |
|
|
2033 case magic_colon: |
|
|
2034 default: |
|
|
2035 panic_impossible (); |
|
|
2036 break; |
|
|
2037 } |
|
|
2038 return retval; |
|
|
2039 } |
|
|
2040 |
|
|
2041 tree_constant |
|
|
2042 tree_constant_rep::sumsq (void) |
|
|
2043 { |
|
|
2044 if (type_tag == string_constant || type_tag == range_constant) |
|
|
2045 { |
|
|
2046 tree_constant tmp = make_numeric (); |
|
|
2047 return tmp.sumsq (); |
|
|
2048 } |
|
|
2049 |
|
|
2050 tree_constant retval; |
|
|
2051 switch (type_tag) |
|
|
2052 { |
|
|
2053 case scalar_constant: |
|
|
2054 retval = tree_constant (scalar * scalar); |
|
|
2055 break; |
|
|
2056 case matrix_constant: |
|
|
2057 { |
|
|
2058 Matrix m = matrix->sumsq (); |
|
|
2059 retval = tree_constant (m); |
|
|
2060 } |
|
|
2061 break; |
|
|
2062 case complex_scalar_constant: |
|
|
2063 { |
|
|
2064 Complex c (*complex_scalar); |
|
|
2065 retval = tree_constant (c * c); |
|
|
2066 } |
|
|
2067 break; |
|
|
2068 case complex_matrix_constant: |
|
|
2069 { |
|
|
2070 ComplexMatrix m = complex_matrix->sumsq (); |
|
|
2071 retval = tree_constant (m); |
|
|
2072 } |
|
|
2073 break; |
|
|
2074 case string_constant: |
|
|
2075 case range_constant: |
|
|
2076 case magic_colon: |
|
|
2077 default: |
|
|
2078 panic_impossible (); |
|
|
2079 break; |
|
|
2080 } |
|
|
2081 return retval; |
|
|
2082 } |
|
|
2083 |
|
|
2084 static tree_constant |
|
|
2085 make_diag (Matrix& v, int k) |
|
|
2086 { |
|
|
2087 int nr = v.rows (); |
|
|
2088 int nc = v.columns (); |
|
|
2089 assert (nc == 1 || nr == 1); |
|
|
2090 |
|
|
2091 tree_constant retval; |
|
|
2092 |
|
|
2093 int roff = 0; |
|
|
2094 int coff = 0; |
|
|
2095 if (k > 0) |
|
|
2096 { |
|
|
2097 roff = 0; |
|
|
2098 coff = k; |
|
|
2099 } |
|
|
2100 else if (k < 0) |
|
|
2101 { |
|
|
2102 roff = -k; |
|
|
2103 coff = 0; |
|
|
2104 } |
|
|
2105 |
|
|
2106 if (nr == 1) |
|
|
2107 { |
|
|
2108 int n = nc + ABS (k); |
|
|
2109 Matrix m (n, n, 0.0); |
|
|
2110 for (int i = 0; i < nc; i++) |
|
|
2111 m.elem (i+roff, i+coff) = v.elem (0, i); |
|
|
2112 retval = tree_constant (m); |
|
|
2113 } |
|
|
2114 else |
|
|
2115 { |
|
|
2116 int n = nr + ABS (k); |
|
|
2117 Matrix m (n, n, 0.0); |
|
|
2118 for (int i = 0; i < nr; i++) |
|
|
2119 m.elem (i+roff, i+coff) = v.elem (i, 0); |
|
|
2120 retval = tree_constant (m); |
|
|
2121 } |
|
|
2122 |
|
|
2123 return retval; |
|
|
2124 } |
|
|
2125 |
|
|
2126 static tree_constant |
|
|
2127 make_diag (ComplexMatrix& v, int k) |
|
|
2128 { |
|
|
2129 int nr = v.rows (); |
|
|
2130 int nc = v.columns (); |
|
|
2131 assert (nc == 1 || nr == 1); |
|
|
2132 |
|
|
2133 tree_constant retval; |
|
|
2134 |
|
|
2135 int roff = 0; |
|
|
2136 int coff = 0; |
|
|
2137 if (k > 0) |
|
|
2138 { |
|
|
2139 roff = 0; |
|
|
2140 coff = k; |
|
|
2141 } |
|
|
2142 else if (k < 0) |
|
|
2143 { |
|
|
2144 roff = -k; |
|
|
2145 coff = 0; |
|
|
2146 } |
|
|
2147 |
|
|
2148 if (nr == 1) |
|
|
2149 { |
|
|
2150 int n = nc + ABS (k); |
|
|
2151 ComplexMatrix m (n, n, 0.0); |
|
|
2152 for (int i = 0; i < nc; i++) |
|
|
2153 m.elem (i+roff, i+coff) = v.elem (0, i); |
|
|
2154 retval = tree_constant (m); |
|
|
2155 } |
|
|
2156 else |
|
|
2157 { |
|
|
2158 int n = nr + ABS (k); |
|
|
2159 ComplexMatrix m (n, n, 0.0); |
|
|
2160 for (int i = 0; i < nr; i++) |
|
|
2161 m.elem (i+roff, i+coff) = v.elem (i, 0); |
|
|
2162 retval = tree_constant (m); |
|
|
2163 } |
|
|
2164 |
|
|
2165 return retval; |
|
|
2166 } |
|
|
2167 |
|
|
2168 tree_constant |
|
|
2169 tree_constant_rep::diag (void) |
|
|
2170 { |
|
|
2171 if (type_tag == string_constant || type_tag == range_constant) |
|
|
2172 { |
|
|
2173 tree_constant tmp = make_numeric (); |
|
|
2174 return tmp.diag (); |
|
|
2175 } |
|
|
2176 |
|
|
2177 tree_constant retval; |
|
|
2178 switch (type_tag) |
|
|
2179 { |
|
|
2180 case scalar_constant: |
|
|
2181 retval = tree_constant (scalar); |
|
|
2182 break; |
|
|
2183 case matrix_constant: |
|
|
2184 { |
|
|
2185 int nr = rows (); |
|
|
2186 int nc = columns (); |
|
|
2187 if (nr == 1 || nc == 1) |
|
|
2188 retval = make_diag (matrix_value (), 0); |
|
|
2189 else |
|
|
2190 { |
|
|
2191 ColumnVector v = matrix->diag (); |
|
|
2192 if (v.capacity () > 0) |
|
|
2193 retval = tree_constant (v); |
|
|
2194 } |
|
|
2195 } |
|
|
2196 break; |
|
|
2197 case complex_scalar_constant: |
|
|
2198 retval = tree_constant (*complex_scalar); |
|
|
2199 break; |
|
|
2200 case complex_matrix_constant: |
|
|
2201 { |
|
|
2202 int nr = rows (); |
|
|
2203 int nc = columns (); |
|
|
2204 if (nr == 1 || nc == 1) |
|
|
2205 retval = make_diag (complex_matrix_value (), 0); |
|
|
2206 else |
|
|
2207 { |
|
|
2208 ComplexColumnVector v = complex_matrix->diag (); |
|
|
2209 if (v.capacity () > 0) |
|
|
2210 retval = tree_constant (v); |
|
|
2211 } |
|
|
2212 } |
|
|
2213 break; |
|
|
2214 case string_constant: |
|
|
2215 case range_constant: |
|
|
2216 case magic_colon: |
|
|
2217 default: |
|
|
2218 panic_impossible (); |
|
|
2219 break; |
|
|
2220 } |
|
|
2221 return retval; |
|
|
2222 } |
|
|
2223 |
|
|
2224 tree_constant |
|
|
2225 tree_constant_rep::diag (tree_constant& a) |
|
|
2226 { |
|
|
2227 if (type_tag == string_constant || type_tag == range_constant) |
|
|
2228 { |
|
|
2229 tree_constant tmp = make_numeric (); |
|
|
2230 return tmp.diag (a); |
|
|
2231 } |
|
|
2232 |
|
|
2233 tree_constant tmp_a = a.make_numeric (); |
|
|
2234 |
|
|
2235 tree_constant_rep::constant_type a_type = tmp_a.const_type (); |
|
|
2236 |
|
|
2237 tree_constant retval; |
|
|
2238 |
|
|
2239 switch (type_tag) |
|
|
2240 { |
|
|
2241 case scalar_constant: |
|
|
2242 if (a_type == scalar_constant) |
|
|
2243 { |
|
|
2244 int k = NINT (tmp_a.double_value ()); |
|
|
2245 int n = ABS (k) + 1; |
|
|
2246 if (k == 0) |
|
|
2247 retval = tree_constant (scalar); |
|
|
2248 else if (k > 0) |
|
|
2249 { |
|
|
2250 Matrix m (n, n, 0.0); |
|
|
2251 m.elem (0, k) = scalar; |
|
|
2252 retval = tree_constant (m); |
|
|
2253 } |
|
|
2254 else if (k < 0) |
|
|
2255 { |
|
|
2256 Matrix m (n, n, 0.0); |
|
|
2257 m.elem (-k, 0) = scalar; |
|
|
2258 retval = tree_constant (m); |
|
|
2259 } |
|
|
2260 } |
|
|
2261 break; |
|
|
2262 case matrix_constant: |
|
|
2263 if (a_type == scalar_constant) |
|
|
2264 { |
|
|
2265 int k = NINT (tmp_a.double_value ()); |
|
|
2266 int nr = rows (); |
|
|
2267 int nc = columns (); |
|
|
2268 if (nr == 1 || nc == 1) |
|
|
2269 retval = make_diag (matrix_value (), k); |
|
|
2270 else |
|
|
2271 { |
|
|
2272 ColumnVector d = matrix->diag (k); |
|
|
2273 retval = tree_constant (d); |
|
|
2274 } |
|
|
2275 } |
|
|
2276 else |
|
|
2277 message ("diag", "invalid second argument"); |
|
|
2278 |
|
|
2279 break; |
|
|
2280 case complex_scalar_constant: |
|
|
2281 if (a_type == scalar_constant) |
|
|
2282 { |
|
|
2283 int k = NINT (tmp_a.double_value ()); |
|
|
2284 int n = ABS (k) + 1; |
|
|
2285 if (k == 0) |
|
|
2286 retval = tree_constant (*complex_scalar); |
|
|
2287 else if (k > 0) |
|
|
2288 { |
|
|
2289 ComplexMatrix m (n, n, 0.0); |
|
|
2290 m.elem (0, k) = *complex_scalar; |
|
|
2291 retval = tree_constant (m); |
|
|
2292 } |
|
|
2293 else if (k < 0) |
|
|
2294 { |
|
|
2295 ComplexMatrix m (n, n, 0.0); |
|
|
2296 m.elem (-k, 0) = *complex_scalar; |
|
|
2297 retval = tree_constant (m); |
|
|
2298 } |
|
|
2299 } |
|
|
2300 break; |
|
|
2301 case complex_matrix_constant: |
|
|
2302 if (a_type == scalar_constant) |
|
|
2303 { |
|
|
2304 int k = NINT (tmp_a.double_value ()); |
|
|
2305 int nr = rows (); |
|
|
2306 int nc = columns (); |
|
|
2307 if (nr == 1 || nc == 1) |
|
|
2308 retval = make_diag (complex_matrix_value (), k); |
|
|
2309 else |
|
|
2310 { |
|
|
2311 ComplexColumnVector d = complex_matrix->diag (k); |
|
|
2312 retval = tree_constant (d); |
|
|
2313 } |
|
|
2314 } |
|
|
2315 else |
|
|
2316 message ("diag", "invalid second argument"); |
|
|
2317 |
|
|
2318 break; |
|
|
2319 case string_constant: |
|
|
2320 case range_constant: |
|
|
2321 case magic_colon: |
|
|
2322 default: |
|
|
2323 panic_impossible (); |
|
|
2324 break; |
|
|
2325 } |
|
|
2326 return retval; |
|
|
2327 } |
|
|
2328 |
|
|
2329 void |
|
|
2330 tree_constant_rep::print_if_string (ostream& os, int warn) |
|
|
2331 { |
|
|
2332 if (type_tag == string_constant) |
|
|
2333 os << string << "\n"; |
|
|
2334 else if (warn) |
|
|
2335 warning ("expecting string, found numeric constant"); |
|
|
2336 } |
|
|
2337 |
|
|
2338 tree_constant |
|
|
2339 tree_constant_rep::mapper (Mapper_fcn& m_fcn, int print) |
|
|
2340 { |
|
|
2341 tree_constant retval; |
|
|
2342 |
|
|
2343 if (type_tag == string_constant || type_tag == range_constant) |
|
|
2344 { |
|
|
2345 tree_constant tmp = make_numeric (); |
|
|
2346 return tmp.mapper (m_fcn, print); |
|
|
2347 } |
|
|
2348 |
|
|
2349 switch (type_tag) |
|
|
2350 { |
|
|
2351 case scalar_constant: |
|
|
2352 if (m_fcn.neg_arg_complex && scalar < 0.0) |
|
|
2353 { |
|
|
2354 if (m_fcn.c_c_mapper != NULL) |
|
|
2355 { |
|
|
2356 Complex c = m_fcn.c_c_mapper (Complex (scalar)); |
|
|
2357 retval = tree_constant (c); |
|
|
2358 } |
|
|
2359 else |
|
|
2360 panic_impossible (); |
|
|
2361 } |
|
|
2362 else |
|
|
2363 { |
|
|
2364 if (m_fcn.d_d_mapper != NULL) |
|
|
2365 { |
|
|
2366 double d = m_fcn.d_d_mapper (scalar); |
|
|
2367 retval = tree_constant (d); |
|
|
2368 } |
|
|
2369 else |
|
|
2370 panic_impossible (); |
|
|
2371 } |
|
|
2372 break; |
|
|
2373 case matrix_constant: |
|
|
2374 if (m_fcn.neg_arg_complex && any_element_is_negative (*matrix)) |
|
|
2375 { |
|
|
2376 if (m_fcn.c_c_mapper != NULL) |
|
|
2377 { |
|
|
2378 ComplexMatrix cm = map (m_fcn.c_c_mapper, |
|
|
2379 ComplexMatrix (*matrix)); |
|
|
2380 retval = tree_constant (cm); |
|
|
2381 } |
|
|
2382 else |
|
|
2383 panic_impossible (); |
|
|
2384 } |
|
|
2385 else |
|
|
2386 { |
|
|
2387 if (m_fcn.d_d_mapper != NULL) |
|
|
2388 { |
|
|
2389 Matrix m = map (m_fcn.d_d_mapper, *matrix); |
|
|
2390 retval = tree_constant (m); |
|
|
2391 } |
|
|
2392 else |
|
|
2393 panic_impossible (); |
|
|
2394 } |
|
|
2395 break; |
|
|
2396 case complex_scalar_constant: |
|
|
2397 if (m_fcn.d_c_mapper != NULL) |
|
|
2398 { |
|
|
2399 double d; |
|
|
2400 d = m_fcn.d_c_mapper (*complex_scalar); |
|
|
2401 retval = tree_constant (d); |
|
|
2402 } |
|
|
2403 else if (m_fcn.c_c_mapper != NULL) |
|
|
2404 { |
|
|
2405 Complex c; |
|
|
2406 c = m_fcn.c_c_mapper (*complex_scalar); |
|
|
2407 retval = tree_constant (c); |
|
|
2408 } |
|
|
2409 else |
|
|
2410 panic_impossible (); |
|
|
2411 break; |
|
|
2412 case complex_matrix_constant: |
|
|
2413 if (m_fcn.d_c_mapper != NULL) |
|
|
2414 { |
|
|
2415 Matrix m; |
|
|
2416 m = map (m_fcn.d_c_mapper, *complex_matrix); |
|
|
2417 retval = tree_constant (m); |
|
|
2418 } |
|
|
2419 else if (m_fcn.c_c_mapper != NULL) |
|
|
2420 { |
|
|
2421 ComplexMatrix cm; |
|
|
2422 cm = map (m_fcn.c_c_mapper, *complex_matrix); |
|
|
2423 retval = tree_constant (cm); |
|
|
2424 } |
|
|
2425 else |
|
|
2426 panic_impossible (); |
|
|
2427 break; |
|
|
2428 case string_constant: |
|
|
2429 case range_constant: |
|
|
2430 case magic_colon: |
|
|
2431 default: |
|
|
2432 panic_impossible (); |
|
|
2433 break; |
|
|
2434 } |
|
|
2435 |
|
|
2436 if (retval.is_defined ()) |
|
|
2437 return retval.eval (print); |
|
|
2438 else |
|
|
2439 return retval; |
|
|
2440 } |
|
|
2441 |
|
|
2442 tree_constant::~tree_constant (void) |
|
|
2443 { |
|
|
2444 #if defined (MDEBUG) |
|
|
2445 cerr << "~tree_constant: rep: " << rep |
|
|
2446 << " rep->count: " << rep->count << "\n"; |
|
|
2447 #endif |
|
|
2448 |
|
|
2449 if (--rep->count <= 0) |
|
|
2450 { |
|
|
2451 delete rep; |
|
|
2452 rep = (tree_constant_rep *) NULL; |
|
|
2453 } |
|
|
2454 } |
|
|
2455 |
|
|
2456 #if defined (MDEBUG) |
|
|
2457 void * |
|
|
2458 tree_constant::operator new (size_t size) |
|
|
2459 { |
|
|
2460 tree_constant *p = ::new tree_constant; |
|
|
2461 cerr << "tree_constant::new(): " << p << "\n"; |
|
|
2462 return p; |
|
|
2463 } |
|
|
2464 |
|
|
2465 void |
|
|
2466 tree_constant::operator delete (void *p, size_t size) |
|
|
2467 { |
|
|
2468 cerr << "tree_constant::delete(): " << p << "\n"; |
|
|
2469 ::delete p; |
|
|
2470 } |
|
|
2471 #endif |
|
|
2472 |
|
|
2473 /* |
|
96
|
2474 * Construct return vector of empty matrices. Return empty matrices |
|
|
2475 * and/or gripe when appropriate. |
|
|
2476 */ |
|
|
2477 tree_constant * |
|
|
2478 vector_of_empties (int nargout, char *fcn_name) |
|
|
2479 { |
|
|
2480 tree_constant *retval = NULL_TREE_CONST; |
|
|
2481 |
|
|
2482 // Got an empty argument, check if should gripe/return empty values. |
|
|
2483 |
|
|
2484 int flag = user_pref.propagate_empty_matrices; |
|
|
2485 if (flag != 0) |
|
|
2486 { |
|
|
2487 if (flag < 0) |
|
|
2488 gripe_empty_arg (fcn_name, 0); |
|
|
2489 |
|
|
2490 Matrix m; |
|
|
2491 retval = new tree_constant [nargout+1]; |
|
|
2492 for (int i = 0; i < nargout; i++) |
|
|
2493 retval[i] = tree_constant (m); |
|
|
2494 } |
|
|
2495 else |
|
|
2496 gripe_empty_arg (fcn_name, 1); |
|
|
2497 |
|
|
2498 return retval; |
|
|
2499 } |
|
|
2500 |
|
|
2501 /* |
|
1
|
2502 ;;; Local Variables: *** |
|
|
2503 ;;; mode: C++ *** |
|
|
2504 ;;; page-delimiter: "^/\\*" *** |
|
|
2505 ;;; End: *** |
|
|
2506 */ |
