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