|
529
|
1 // tree-const.h -*- C++ -*- |
|
1
|
2 /* |
|
|
3 |
|
296
|
4 Copyright (C) 1992, 1993, 1994 John W. Eaton |
|
1
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
383
|
24 #if !defined (octave_tree_const_h) |
|
|
25 #define octave_tree_const_h 1 |
|
1
|
26 |
|
581
|
27 #include <iostream.h> |
|
|
28 |
|
1
|
29 #include <stdlib.h> |
|
|
30 |
|
500
|
31 #include "mx-base.h" |
|
|
32 #include "Range.h" |
|
|
33 |
|
1
|
34 #include "tree-base.h" |
|
495
|
35 #include "tree-expr.h" |
|
500
|
36 #include "oct-obj.h" |
|
164
|
37 |
|
|
38 class idx_vector; |
|
747
|
39 class Octave_map; |
|
1
|
40 |
|
529
|
41 struct Mapper_fcn; |
|
|
42 |
|
581
|
43 // Constants. |
|
|
44 |
|
1
|
45 class |
|
495
|
46 tree_constant : public tree_fvc |
|
1
|
47 { |
|
620
|
48 private: |
|
|
49 |
|
|
50 #include "tc-rep.h" |
|
|
51 |
|
|
52 // The real representation of a constant, declared in tc-rep.h |
|
|
53 |
|
|
54 tree_constant_rep *rep; |
|
1
|
55 |
|
|
56 public: |
|
620
|
57 |
|
|
58 enum magic_colon { magic_colon_t }; |
|
|
59 |
|
|
60 // Constructors. It is possible to create the following types of |
|
|
61 // constants: |
|
|
62 // |
|
|
63 // constant type constructor arguments |
|
|
64 // ------------- --------------------- |
|
|
65 // unknown none |
|
|
66 // real scalar double |
|
|
67 // real matrix Matrix |
|
|
68 // DiagMatrix |
|
|
69 // RowVector |
|
|
70 // ColumnVector |
|
|
71 // complex scalar Complex |
|
|
72 // complex matrix ComplexMatrix |
|
|
73 // ComplexDiagMatrix |
|
|
74 // ComplexRowVector |
|
|
75 // ComplexColumnVector |
|
|
76 // string char* (null terminated) |
|
|
77 // range double, double, dobule |
|
|
78 // Range |
|
|
79 // magic colon tree_constant::magic_colon |
|
|
80 |
|
581
|
81 tree_constant (void) : tree_fvc () |
|
1
|
82 { rep = new tree_constant_rep (); rep->count = 1; } |
|
|
83 |
|
581
|
84 tree_constant (double d) : tree_fvc () |
|
1
|
85 { rep = new tree_constant_rep (d); rep->count = 1; } |
|
620
|
86 |
|
581
|
87 tree_constant (const Matrix& m) : tree_fvc () |
|
1
|
88 { rep = new tree_constant_rep (m); rep->count = 1; } |
|
620
|
89 |
|
581
|
90 tree_constant (const DiagMatrix& d) : tree_fvc () |
|
1
|
91 { rep = new tree_constant_rep (d); rep->count = 1; } |
|
620
|
92 |
|
581
|
93 tree_constant (const RowVector& v, int pcv = -1) : tree_fvc () |
|
1
|
94 { rep = new tree_constant_rep (v, pcv); rep->count = 1; } |
|
620
|
95 |
|
581
|
96 tree_constant (const ColumnVector& v, int pcv = -1) : tree_fvc () |
|
1
|
97 { rep = new tree_constant_rep (v, pcv); rep->count = 1; } |
|
|
98 |
|
581
|
99 tree_constant (const Complex& c) : tree_fvc () |
|
1
|
100 { rep = new tree_constant_rep (c); rep->count = 1; } |
|
620
|
101 |
|
581
|
102 tree_constant (const ComplexMatrix& m) : tree_fvc () |
|
1
|
103 { rep = new tree_constant_rep (m); rep->count = 1; } |
|
620
|
104 |
|
581
|
105 tree_constant (const ComplexDiagMatrix& d) : tree_fvc () |
|
1
|
106 { rep = new tree_constant_rep (d); rep->count = 1; } |
|
620
|
107 |
|
581
|
108 tree_constant (const ComplexRowVector& v, int pcv = -1) : tree_fvc () |
|
|
109 { rep = new tree_constant_rep (v, pcv); rep->count = 1; } |
|
620
|
110 |
|
581
|
111 tree_constant (const ComplexColumnVector& v, int pcv = -1) : tree_fvc () |
|
|
112 { rep = new tree_constant_rep (v, pcv); rep->count = 1; } |
|
1
|
113 |
|
581
|
114 tree_constant (const char *s) : tree_fvc () |
|
1
|
115 { rep = new tree_constant_rep (s); rep->count = 1; } |
|
|
116 |
|
581
|
117 tree_constant (double base, double limit, double inc) : tree_fvc () |
|
1
|
118 { rep = new tree_constant_rep (base, limit, inc); rep->count = 1; } |
|
620
|
119 |
|
581
|
120 tree_constant (const Range& r) : tree_fvc () |
|
1
|
121 { rep = new tree_constant_rep (r); rep->count = 1; } |
|
|
122 |
|
747
|
123 tree_constant (const Octave_map& m) : tree_fvc () |
|
|
124 { rep = new tree_constant_rep (m); rep->count = 1; } |
|
|
125 |
|
620
|
126 tree_constant (tree_constant::magic_colon t) : tree_fvc () |
|
|
127 { |
|
|
128 tree_constant_rep::constant_type tmp; |
|
|
129 tmp = tree_constant_rep::magic_colon; |
|
|
130 rep = new tree_constant_rep (tmp); |
|
|
131 rep->count = 1; |
|
|
132 } |
|
|
133 |
|
|
134 // Copy constructor. |
|
1
|
135 |
|
581
|
136 tree_constant (const tree_constant& a) : tree_fvc () |
|
1
|
137 { rep = a.rep; rep->count++; } |
|
|
138 |
|
620
|
139 // Delete the representation of this constant if the count drops to |
|
|
140 // zero. |
|
|
141 |
|
1
|
142 ~tree_constant (void); |
|
|
143 |
|
|
144 #if defined (MDEBUG) |
|
|
145 void *operator new (size_t size); |
|
|
146 void operator delete (void *p, size_t size); |
|
|
147 #endif |
|
|
148 |
|
620
|
149 // Simple assignment. |
|
|
150 |
|
747
|
151 tree_constant operator = (const tree_constant& a); |
|
1
|
152 |
|
620
|
153 // Indexed assignment. |
|
1
|
154 |
|
782
|
155 tree_constant assign (tree_constant& rhs, const Octave_object& args) |
|
1
|
156 { |
|
|
157 if (rep->count > 1) |
|
|
158 { |
|
|
159 --rep->count; |
|
|
160 rep = new tree_constant_rep (*rep); |
|
|
161 rep->count = 1; |
|
|
162 } |
|
506
|
163 rep->assign (rhs, args); |
|
1
|
164 return *this; |
|
|
165 } |
|
|
166 |
|
747
|
167 // Simple structure assignment. |
|
|
168 |
|
782
|
169 tree_constant assign_map_element (SLList<char*>& list, |
|
|
170 tree_constant& rhs); |
|
747
|
171 |
|
|
172 // Indexed structure assignment. |
|
|
173 |
|
782
|
174 tree_constant assign_map_element (SLList<char*>& list, |
|
|
175 tree_constant& rhs, |
|
747
|
176 const Octave_object& args); |
|
|
177 |
|
620
|
178 // Type. It would be nice to eliminate the need for this. |
|
|
179 |
|
|
180 int is_constant (void) const { return 1; } |
|
|
181 |
|
|
182 // Size. |
|
|
183 |
|
|
184 int rows (void) const { return rep->rows (); } |
|
|
185 int columns (void) const { return rep->columns (); } |
|
|
186 |
|
|
187 // Does this constant have a type? Both of these are provided since |
|
|
188 // it is sometimes more natural to write is_undefined() instead of |
|
|
189 // ! is_defined(). |
|
|
190 |
|
|
191 int is_defined (void) const { return rep->is_defined (); } |
|
|
192 int is_undefined (void) const { return rep->is_undefined (); } |
|
|
193 |
|
|
194 // What type is this constant? |
|
|
195 |
|
|
196 int is_unknown (void) const { return rep->is_unknown (); } |
|
|
197 int is_real_scalar (void) const { return rep->is_real_scalar (); } |
|
|
198 int is_real_matrix (void) const { return rep->is_real_matrix (); } |
|
|
199 int is_complex_scalar (void) const { return rep->is_complex_scalar (); } |
|
|
200 int is_complex_matrix (void) const { return rep->is_complex_matrix (); } |
|
|
201 int is_string (void) const { return rep->is_string (); } |
|
|
202 int is_range (void) const { return rep->is_range (); } |
|
747
|
203 int is_map (void) const { return rep->is_map (); } |
|
620
|
204 int is_magic_colon (void) const { return rep->is_magic_colon (); } |
|
|
205 |
|
|
206 // Are any or all of the elements in this constant nonzero? |
|
|
207 |
|
|
208 tree_constant all (void) const { return rep->all (); } |
|
|
209 tree_constant any (void) const { return rep->any (); } |
|
|
210 |
|
|
211 int is_real_type (void) const { return rep->is_real_type (); } |
|
628
|
212 |
|
620
|
213 int is_complex_type (void) const { return rep->is_complex_type (); } |
|
|
214 |
|
636
|
215 // Would be nice to get rid of the next four functions: |
|
|
216 |
|
|
217 int is_scalar_type (void) const { return rep->is_scalar_type (); } |
|
|
218 int is_matrix_type (void) const { return rep->is_matrix_type (); } |
|
620
|
219 |
|
628
|
220 int is_numeric_type (void) const |
|
|
221 { return rep->is_numeric_type (); } |
|
620
|
222 |
|
|
223 int is_numeric_or_range_type (void) const |
|
|
224 { return rep->is_numeric_or_range_type (); } |
|
|
225 |
|
|
226 // Is this constant valid as a scalar index? |
|
|
227 |
|
|
228 int valid_as_scalar_index (void) const |
|
|
229 { return rep->valid_as_scalar_index (); } |
|
|
230 |
|
|
231 // Does this constant correspond to a truth value? |
|
|
232 |
|
|
233 int is_true (void) const { return rep->is_true (); } |
|
|
234 |
|
|
235 // Is at least one of the dimensions of this constant zero? |
|
|
236 |
|
|
237 int is_empty (void) const |
|
|
238 { |
|
|
239 return ((! (is_magic_colon () || is_unknown ())) |
|
|
240 && (rows () == 0 || columns () == 0)); |
|
|
241 } |
|
|
242 |
|
|
243 // Are the dimensions of this constant zero by zero? |
|
|
244 |
|
|
245 int is_zero_by_zero (void) const |
|
|
246 { |
|
|
247 return ((! (is_magic_colon () || is_unknown ())) |
|
|
248 && rows () == 0 && columns () == 0); |
|
|
249 } |
|
|
250 |
|
|
251 // Values. |
|
|
252 |
|
628
|
253 double double_value (int force_string_conversion = 0) const |
|
|
254 { return rep->double_value (force_string_conversion); } |
|
|
255 |
|
|
256 Matrix matrix_value (int force_string_conversion = 0) const |
|
|
257 { return rep->matrix_value (force_string_conversion); } |
|
|
258 |
|
|
259 Complex complex_value (int force_string_conversion = 0) const |
|
|
260 { return rep->complex_value (force_string_conversion); } |
|
|
261 |
|
|
262 ComplexMatrix complex_matrix_value (int force_string_conversion = 0) const |
|
|
263 { return rep->complex_matrix_value (force_string_conversion); } |
|
|
264 |
|
|
265 char *string_value (void) const |
|
|
266 { return rep->string_value (); } |
|
|
267 |
|
|
268 Range range_value (void) const |
|
|
269 { return rep->range_value (); } |
|
|
270 |
|
747
|
271 Octave_map map_value (void) const; |
|
|
272 |
|
|
273 tree_constant lookup_map_element (SLList<char*>& list); |
|
|
274 |
|
628
|
275 ColumnVector vector_value (int force_string_conversion = 0, |
|
|
276 int force_vector_conversion = 0) const |
|
|
277 { return rep->vector_value (); } |
|
|
278 |
|
|
279 ComplexColumnVector complex_vector_value (int force_string_conv = 0, |
|
|
280 int force_vec_conv = 0) const |
|
|
281 { return rep->complex_vector_value (); } |
|
1
|
282 |
|
620
|
283 // Conversions. These should probably be private. If a user of this |
|
|
284 // class wants a certain kind of constant, he should simply ask for |
|
|
285 // it, and we should convert it if possible. |
|
1
|
286 |
|
628
|
287 tree_constant convert_to_str (void) |
|
|
288 { return rep->convert_to_str (); } |
|
1
|
289 |
|
435
|
290 void convert_to_row_or_column_vector (void) |
|
455
|
291 { rep->convert_to_row_or_column_vector (); } |
|
435
|
292 |
|
620
|
293 // Increment or decrement this constant. |
|
1
|
294 |
|
578
|
295 void bump_value (tree_expression::type et) |
|
1
|
296 { |
|
|
297 if (rep->count > 1) |
|
|
298 { |
|
|
299 --rep->count; |
|
|
300 rep = new tree_constant_rep (*rep); |
|
|
301 rep->count = 1; |
|
|
302 } |
|
|
303 rep->bump_value (et); |
|
|
304 } |
|
|
305 |
|
620
|
306 // Evaluate this constant, possibly converting complex to real, or |
|
|
307 // matrix to scalar, etc. |
|
|
308 |
|
1
|
309 tree_constant eval (int print) |
|
495
|
310 { |
|
|
311 rep->maybe_mutate (); |
|
|
312 if (print) |
|
|
313 rep->print (); |
|
|
314 return *this; |
|
|
315 } |
|
1
|
316 |
|
506
|
317 Octave_object eval (int print, int nargout, const Octave_object& args) |
|
1
|
318 { |
|
565
|
319 Octave_object retval; |
|
495
|
320 |
|
506
|
321 // XXX FIXME XXX -- make it safe to call do_index() with |
|
|
322 // args.length () == 0 |
|
|
323 if (args.length () > 0) |
|
|
324 retval(0) = rep->do_index (args); |
|
495
|
325 else |
|
500
|
326 retval(0) = *this; |
|
495
|
327 |
|
500
|
328 if (retval(0).is_defined ()) |
|
|
329 retval(0).eval (print); |
|
1
|
330 return retval; |
|
|
331 } |
|
|
332 |
|
620
|
333 // Store the original text corresponding to this constant for later |
|
|
334 // pretty printing. |
|
|
335 |
|
|
336 void stash_original_text (char *s) |
|
|
337 { rep->stash_original_text (s); } |
|
|
338 |
|
|
339 // Pretty print this constant. |
|
|
340 |
|
581
|
341 void print_code (ostream& os); |
|
|
342 |
|
628
|
343 char *type_as_string (void) const |
|
|
344 { return rep->type_as_string (); } |
|
|
345 |
|
747
|
346 // We really do need this, and it should be private: |
|
|
347 |
|
|
348 private: |
|
|
349 |
|
|
350 void make_unique (void); |
|
|
351 |
|
|
352 tree_constant_rep *make_unique_map (void); |
|
|
353 |
|
|
354 public: |
|
|
355 |
|
620
|
356 // ------------------------------------------------------------------- |
|
|
357 |
|
|
358 // We want to eliminate this, or at least make it private. |
|
|
359 |
|
|
360 tree_constant_rep::constant_type const_type (void) const |
|
|
361 { return rep->const_type (); } |
|
|
362 |
|
636
|
363 private: |
|
|
364 |
|
|
365 // Can we make these go away? |
|
|
366 |
|
|
367 // These need better names, since a range really is a numeric type. |
|
|
368 |
|
|
369 void force_numeric (int force_str_conv = 0) |
|
|
370 { rep->force_numeric (force_str_conv); } |
|
|
371 |
|
|
372 tree_constant make_numeric (int force_str_conv = 0) const |
|
|
373 { |
|
|
374 if (is_numeric_type ()) |
|
|
375 return *this; |
|
|
376 else |
|
|
377 return rep->make_numeric (force_str_conv); |
|
|
378 } |
|
|
379 |
|
|
380 #if 0 |
|
|
381 tree_constant make_numeric_or_range (void) const |
|
|
382 { |
|
|
383 if (is_numeric_type () || is_range ()) |
|
|
384 return *this; |
|
|
385 else |
|
|
386 return rep->make_numeric (); |
|
|
387 } |
|
|
388 #endif |
|
|
389 |
|
|
390 tree_constant make_numeric_or_magic (void) const |
|
|
391 { |
|
|
392 if (is_numeric_type () || is_magic_colon ()) |
|
|
393 return *this; |
|
|
394 else |
|
|
395 return rep->make_numeric (); |
|
|
396 } |
|
|
397 |
|
|
398 tree_constant make_numeric_or_range_or_magic (void) const |
|
|
399 { |
|
|
400 if (is_numeric_type () || is_range () || is_magic_colon ()) |
|
|
401 return *this; |
|
|
402 else |
|
|
403 return rep->make_numeric (); |
|
|
404 } |
|
1
|
405 }; |
|
|
406 |
|
529
|
407 // XXX FIXME XXX -- this is not used very much now. Perhaps it can be |
|
|
408 // eliminated. |
|
500
|
409 extern Octave_object vector_of_empties (int nargout, const char *fcn_name); |
|
94
|
410 |
|
1
|
411 #endif |
|
|
412 |
|
|
413 /* |
|
|
414 ;;; Local Variables: *** |
|
|
415 ;;; mode: C++ *** |
|
|
416 ;;; page-delimiter: "^/\\*" *** |
|
|
417 ;;; End: *** |
|
|
418 */ |
