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