|
1
|
1 // tc-assign.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef __GNUG__ |
|
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
|
28 #include "user-prefs.h" |
|
|
29 #include "error.h" |
|
|
30 #include "gripes.h" |
|
|
31 #include "utils.h" |
|
|
32 #include "tree-const.h" |
|
|
33 |
|
|
34 #include "tc-inlines.cc" |
|
|
35 |
|
|
36 void |
|
|
37 tree_constant_rep::assign (tree_constant& rhs, tree_constant *args, int nargs) |
|
|
38 { |
|
|
39 tree_constant rhs_tmp = rhs.make_numeric (); |
|
|
40 |
|
|
41 if (type_tag == string_constant || type_tag == range_constant) |
|
|
42 force_numeric (); |
|
|
43 |
|
|
44 switch (type_tag) |
|
|
45 { |
|
|
46 case complex_scalar_constant: |
|
|
47 case scalar_constant: |
|
|
48 case unknown_constant: |
|
|
49 do_scalar_assignment (rhs_tmp, args, nargs); |
|
|
50 break; |
|
|
51 case complex_matrix_constant: |
|
|
52 case matrix_constant: |
|
|
53 do_matrix_assignment (rhs_tmp, args, nargs); |
|
|
54 break; |
|
|
55 case string_constant: |
|
|
56 error ("invalid assignment to string type"); |
|
|
57 break; |
|
|
58 case range_constant: |
|
|
59 case magic_colon: |
|
|
60 default: |
|
|
61 panic_impossible (); |
|
|
62 break; |
|
|
63 } |
|
|
64 } |
|
|
65 |
|
|
66 void |
|
|
67 tree_constant_rep::do_scalar_assignment (tree_constant& rhs, |
|
|
68 tree_constant *args, int nargs) |
|
|
69 { |
|
|
70 assert (type_tag == unknown_constant |
|
|
71 || type_tag == scalar_constant |
|
|
72 || type_tag == complex_scalar_constant); |
|
|
73 |
|
|
74 if (rhs.is_scalar_type () && valid_scalar_indices (args, nargs)) |
|
|
75 { |
|
|
76 if (type_tag == unknown_constant || type_tag == scalar_constant) |
|
|
77 { |
|
|
78 if (rhs.const_type () == scalar_constant) |
|
|
79 { |
|
|
80 scalar = rhs.double_value (); |
|
|
81 type_tag = scalar_constant; |
|
|
82 } |
|
|
83 else if (rhs.const_type () == complex_scalar_constant) |
|
|
84 { |
|
|
85 complex_scalar = new Complex (rhs.complex_value ()); |
|
|
86 type_tag = complex_scalar_constant; |
|
|
87 } |
|
|
88 else |
|
|
89 { |
|
|
90 error ("invalid assignment to scalar"); |
|
|
91 jump_to_top_level (); |
|
|
92 } |
|
|
93 } |
|
|
94 else |
|
|
95 { |
|
|
96 if (rhs.const_type () == scalar_constant) |
|
|
97 { |
|
|
98 scalar = rhs.double_value (); |
|
|
99 type_tag = scalar_constant; |
|
|
100 } |
|
|
101 else if (rhs.const_type () == complex_scalar_constant) |
|
|
102 { |
|
|
103 *complex_scalar = rhs.complex_value (); |
|
|
104 type_tag = complex_scalar_constant; |
|
|
105 } |
|
|
106 else |
|
|
107 { |
|
|
108 error ("invalid assignment to scalar"); |
|
|
109 jump_to_top_level (); |
|
|
110 } |
|
|
111 } |
|
|
112 } |
|
|
113 else if (user_pref.resize_on_range_error) |
|
|
114 { |
|
|
115 if (type_tag == complex_scalar_constant) |
|
|
116 { |
|
|
117 Complex *old_complex = complex_scalar; |
|
|
118 complex_matrix = new ComplexMatrix (1, 1, *complex_scalar); |
|
|
119 type_tag = complex_matrix_constant; |
|
|
120 delete old_complex; |
|
|
121 } |
|
|
122 else if (type_tag == scalar_constant) |
|
|
123 { |
|
|
124 matrix = new Matrix (1, 1, scalar); |
|
|
125 type_tag = matrix_constant; |
|
|
126 } |
|
|
127 do_matrix_assignment (rhs, args, nargs); |
|
|
128 } |
|
|
129 else if (nargs > 3 || nargs < 2) |
|
|
130 { |
|
|
131 error ("invalid index expression for scalar type"); |
|
|
132 jump_to_top_level (); |
|
|
133 } |
|
|
134 else |
|
|
135 { |
|
|
136 error ("index invalid or out of range for scalar type"); |
|
|
137 jump_to_top_level (); |
|
|
138 } |
|
|
139 } |
|
|
140 |
|
|
141 void |
|
|
142 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
143 tree_constant *args, int nargs) |
|
|
144 { |
|
|
145 assert (type_tag == unknown_constant |
|
|
146 || type_tag == matrix_constant |
|
|
147 || type_tag == complex_matrix_constant); |
|
|
148 |
|
|
149 if (type_tag == matrix_constant && rhs.is_complex_type ()) |
|
|
150 { |
|
|
151 Matrix *old_matrix = matrix; |
|
|
152 complex_matrix = new ComplexMatrix (*matrix); |
|
|
153 type_tag = complex_matrix_constant; |
|
|
154 delete old_matrix; |
|
|
155 } |
|
|
156 else if (type_tag == unknown_constant) |
|
|
157 { |
|
|
158 if (rhs.is_complex_type ()) |
|
|
159 { |
|
|
160 complex_matrix = new ComplexMatrix (); |
|
|
161 type_tag = complex_matrix_constant; |
|
|
162 } |
|
|
163 else |
|
|
164 { |
|
|
165 matrix = new Matrix (); |
|
|
166 type_tag = matrix_constant; |
|
|
167 } |
|
|
168 } |
|
|
169 |
|
|
170 switch (nargs) |
|
|
171 { |
|
|
172 case 2: |
|
|
173 if (args == NULL_TREE_CONST) |
|
|
174 error ("matrix index is null"); |
|
|
175 else if (args[1].is_undefined ()) |
|
|
176 error ("matrix index is a null expression"); |
|
|
177 else |
|
|
178 do_matrix_assignment (rhs, args[1]); |
|
|
179 break; |
|
|
180 case 3: |
|
|
181 if (args == NULL_TREE_CONST) |
|
|
182 error ("matrix indices are null"); |
|
|
183 else if (args[1].is_undefined ()) |
|
|
184 error ("first matrix index is a null expression"); |
|
|
185 else if (args[2].is_undefined ()) |
|
|
186 error ("second matrix index is a null expression"); |
|
|
187 else |
|
|
188 do_matrix_assignment (rhs, args[1], args[2]); |
|
|
189 break; |
|
|
190 default: |
|
|
191 error ("too many indices for matrix expression"); |
|
|
192 break; |
|
|
193 } |
|
|
194 } |
|
|
195 |
|
|
196 void |
|
|
197 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
198 tree_constant& i_arg) |
|
|
199 { |
|
|
200 int nr = rows (); |
|
|
201 int nc = columns (); |
|
|
202 |
|
|
203 if (user_pref.do_fortran_indexing) |
|
|
204 fortran_style_matrix_assignment (rhs, i_arg); |
|
|
205 else if (nr <= 1 || nc <= 1) |
|
|
206 vector_assignment (rhs, i_arg); |
|
|
207 else |
|
|
208 error ("single index only valid for row or column vector"); |
|
|
209 } |
|
|
210 |
|
|
211 void |
|
|
212 tree_constant_rep::fortran_style_matrix_assignment (tree_constant& rhs, |
|
|
213 tree_constant& i_arg) |
|
|
214 { |
|
|
215 tree_constant tmp_i = i_arg.make_numeric_or_magic (); |
|
|
216 |
|
|
217 tree_constant_rep::constant_type itype = tmp_i.const_type (); |
|
|
218 |
|
|
219 int nr = rows (); |
|
|
220 int nc = columns (); |
|
|
221 |
|
|
222 int rhs_nr = rhs.rows (); |
|
|
223 int rhs_nc = rhs.columns (); |
|
|
224 |
|
|
225 switch (itype) |
|
|
226 { |
|
|
227 case complex_scalar_constant: |
|
|
228 case scalar_constant: |
|
|
229 { |
|
|
230 int i = NINT (tmp_i.double_value ()); |
|
|
231 index_check (i-1, ""); |
|
|
232 if (nr <= 1 || nc <= 1) |
|
|
233 maybe_resize (i-1); |
|
|
234 else |
|
|
235 range_max_check (i-1, nr * nc); |
|
|
236 |
|
|
237 nr = rows (); |
|
|
238 nc = columns (); |
|
|
239 |
|
|
240 if (! indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) |
|
|
241 { |
|
|
242 error ("for A(int) = X: X must be a scalar"); |
|
|
243 jump_to_top_level (); |
|
|
244 } |
|
|
245 int ii = fortran_row (i, nr) - 1; |
|
|
246 int jj = fortran_column (i, nr) - 1; |
|
|
247 do_matrix_assignment (rhs, ii, jj); |
|
|
248 } |
|
|
249 break; |
|
|
250 case complex_matrix_constant: |
|
|
251 case matrix_constant: |
|
|
252 { |
|
|
253 Matrix mi = tmp_i.matrix_value (); |
|
|
254 int len = nr * nc; |
|
|
255 idx_vector ii (mi, 1, "", len); // Always do fortran indexing here... |
|
|
256 int imax = ii.max (); |
|
|
257 |
|
|
258 if (nr <= 1 || nc <= 1) |
|
|
259 maybe_resize (imax-1); |
|
|
260 else |
|
|
261 range_max_check (imax-1, len); |
|
|
262 |
|
|
263 if (ii.capacity () != rhs_nr * rhs_nc) |
|
|
264 { |
|
|
265 error ("A(matrix) = X: X and matrix must have the same\ |
|
|
266 number of elements"); |
|
|
267 jump_to_top_level (); |
|
|
268 } |
|
|
269 fortran_style_matrix_assignment (rhs, ii); |
|
|
270 } |
|
|
271 break; |
|
|
272 case string_constant: |
|
|
273 gripe_string_invalid (); |
|
|
274 break; |
|
|
275 case range_constant: |
|
|
276 gripe_range_invalid (); |
|
|
277 break; |
|
|
278 case magic_colon: |
|
|
279 fortran_style_matrix_assignment (rhs, magic_colon); |
|
|
280 break; |
|
|
281 default: |
|
|
282 panic_impossible (); |
|
|
283 break; |
|
|
284 } |
|
|
285 } |
|
|
286 |
|
|
287 void |
|
|
288 tree_constant_rep::vector_assignment (tree_constant& rhs, tree_constant& i_arg) |
|
|
289 { |
|
|
290 int nr = rows (); |
|
|
291 int nc = columns (); |
|
|
292 |
|
|
293 assert ((nr == 1 || nc == 1 || (nr == 0 && nc == 0)) |
|
|
294 && ! user_pref.do_fortran_indexing); |
|
|
295 |
|
|
296 tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); |
|
|
297 |
|
|
298 tree_constant_rep::constant_type itype = tmp_i.const_type (); |
|
|
299 |
|
|
300 switch (itype) |
|
|
301 { |
|
|
302 case complex_scalar_constant: |
|
|
303 case scalar_constant: |
|
|
304 { |
|
|
305 int i = tree_to_mat_idx (tmp_i.double_value ()); |
|
|
306 index_check (i, ""); |
|
|
307 do_vector_assign (rhs, i); |
|
|
308 } |
|
|
309 break; |
|
|
310 case complex_matrix_constant: |
|
|
311 case matrix_constant: |
|
|
312 { |
|
|
313 Matrix mi = tmp_i.matrix_value (); |
|
|
314 int len = nr * nc; |
|
|
315 idx_vector iv (mi, user_pref.do_fortran_indexing, "", len); |
|
|
316 do_vector_assign (rhs, iv); |
|
|
317 } |
|
|
318 break; |
|
|
319 case string_constant: |
|
|
320 gripe_string_invalid (); |
|
|
321 break; |
|
|
322 case range_constant: |
|
|
323 { |
|
|
324 Range ri = tmp_i.range_value (); |
|
|
325 if (rows () == 2 && is_zero_one (ri)) |
|
|
326 { |
|
|
327 do_vector_assign (rhs, 1); |
|
|
328 } |
|
|
329 else |
|
|
330 { |
|
|
331 int imax; |
|
|
332 index_check (ri, imax, ""); |
|
|
333 do_vector_assign (rhs, ri, imax); |
|
|
334 } |
|
|
335 } |
|
|
336 break; |
|
|
337 case magic_colon: |
|
|
338 { |
|
|
339 int rhs_nr = rhs.rows (); |
|
|
340 int rhs_nc = rhs.columns (); |
|
|
341 |
|
|
342 if (! indexed_assign_conforms (nr, nc, rhs_nr, rhs_nc)) |
|
|
343 { |
|
|
344 error ("A(:) = X: X and A must have the same dimensions"); |
|
|
345 jump_to_top_level (); |
|
|
346 } |
|
|
347 do_matrix_assignment (rhs, magic_colon, magic_colon); |
|
|
348 } |
|
|
349 break; |
|
|
350 default: |
|
|
351 panic_impossible (); |
|
|
352 break; |
|
|
353 } |
|
|
354 } |
|
|
355 |
|
|
356 void |
|
|
357 tree_constant_rep::check_vector_assign (int rhs_nr, int rhs_nc, |
|
|
358 int ilen, char *rm) |
|
|
359 { |
|
|
360 int nr = rows (); |
|
|
361 int nc = columns (); |
|
|
362 |
|
|
363 if (nr == 1 && nc == 1) // No orientation to preserve |
|
|
364 { |
|
|
365 if (! ( ilen == rhs_nr || ilen == rhs_nc)) |
|
|
366 { |
|
|
367 error ("A(%s) = X: X and %s must have the same number of\ |
|
|
368 elements", rm, rm); |
|
|
369 jump_to_top_level (); |
|
|
370 } |
|
|
371 } |
|
|
372 else if (nr == 1) // Preserve current row orientation |
|
|
373 { |
|
|
374 if (! (rhs_nr == 1 && rhs_nc == ilen)) |
|
|
375 { |
|
|
376 error ("A(%s) = X: where A is a row vector, X must also be a\ |
|
|
377 row vector with the same number of elements as %s", rm, rm); |
|
|
378 jump_to_top_level (); |
|
|
379 } |
|
|
380 } |
|
|
381 else if (nc == 1) // Preserve current column orientation |
|
|
382 { |
|
|
383 if (! (rhs_nc == 1 && rhs_nr == ilen)) |
|
|
384 { |
|
|
385 error ("A(%s) = X: where A is a column vector, X must also\ |
|
|
386 be a column vector with the same number of elements as %s", rm, rm); |
|
|
387 jump_to_top_level (); |
|
|
388 } |
|
|
389 } |
|
|
390 else |
|
|
391 panic_impossible (); |
|
|
392 } |
|
|
393 |
|
|
394 void |
|
|
395 tree_constant_rep::do_vector_assign (tree_constant& rhs, int i) |
|
|
396 { |
|
|
397 int rhs_nr = rhs.rows (); |
|
|
398 int rhs_nc = rhs.columns (); |
|
|
399 |
|
|
400 if (! indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) |
|
|
401 { |
|
|
402 error ("for A(int) = X: X must be a scalar"); |
|
|
403 jump_to_top_level (); |
|
|
404 } |
|
|
405 |
|
|
406 maybe_resize (i); |
|
|
407 |
|
|
408 int nr = rows (); |
|
|
409 int nc = columns (); |
|
|
410 |
|
|
411 if (nr == 1) |
|
|
412 { |
|
|
413 REP_ELEM_ASSIGN (0, i, rhs.double_value (), rhs.complex_value (), |
|
|
414 rhs.is_real_type ()); |
|
|
415 } |
|
|
416 else if (nc == 1) |
|
|
417 { |
|
|
418 REP_ELEM_ASSIGN (i, 0, rhs.double_value (), rhs.complex_value (), |
|
|
419 rhs.is_real_type ()); |
|
|
420 } |
|
|
421 else |
|
|
422 panic_impossible (); |
|
|
423 } |
|
|
424 |
|
|
425 void |
|
|
426 tree_constant_rep::do_vector_assign (tree_constant& rhs, idx_vector& iv) |
|
|
427 { |
|
|
428 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
429 |
|
|
430 int ilen = iv.capacity (); |
|
|
431 check_vector_assign (rhs_nr, rhs_nc, ilen, "matrix"); |
|
|
432 |
|
|
433 force_orient f_orient = no_orient; |
|
|
434 if (rhs_nr == 1 && rhs_nc != 1) |
|
|
435 f_orient = row_orient; |
|
|
436 else if (rhs_nc == 1 && rhs_nr != 1) |
|
|
437 f_orient = column_orient; |
|
|
438 |
|
|
439 maybe_resize (iv.max (), f_orient); |
|
|
440 |
|
|
441 int nr = rows (); |
|
|
442 int nc = columns (); |
|
|
443 |
|
|
444 if (nr == 1) |
|
|
445 { |
|
|
446 for (int i = 0; i < iv.capacity (); i++) |
|
|
447 REP_ELEM_ASSIGN (0, iv.elem (i), rhs_m.elem (0, i), |
|
|
448 rhs_cm.elem (0, i), rhs.is_real_type ()); |
|
|
449 } |
|
|
450 else if (nc == 1) |
|
|
451 { |
|
|
452 for (int i = 0; i < iv.capacity (); i++) |
|
|
453 REP_ELEM_ASSIGN (iv.elem (i), 0, rhs_m.elem (i, 0), |
|
|
454 rhs_cm.elem (i, 0), rhs.is_real_type ()); |
|
|
455 } |
|
|
456 else |
|
|
457 panic_impossible (); |
|
|
458 } |
|
|
459 |
|
|
460 void |
|
|
461 tree_constant_rep::do_vector_assign (tree_constant& rhs, Range& ri, int imax) |
|
|
462 { |
|
|
463 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
464 |
|
|
465 int ilen = ri.nelem (); |
|
|
466 check_vector_assign (rhs_nr, rhs_nc, ilen, "range"); |
|
|
467 |
|
|
468 force_orient f_orient = no_orient; |
|
|
469 if (rhs_nr == 1 && rhs_nc != 1) |
|
|
470 f_orient = row_orient; |
|
|
471 else if (rhs_nc == 1 && rhs_nr != 1) |
|
|
472 f_orient = column_orient; |
|
|
473 |
|
|
474 maybe_resize (imax, f_orient); |
|
|
475 |
|
|
476 int nr = rows (); |
|
|
477 int nc = columns (); |
|
|
478 |
|
|
479 double b = ri.base (); |
|
|
480 double increment = ri.inc (); |
|
|
481 |
|
|
482 if (nr == 1) |
|
|
483 { |
|
|
484 for (int i = 0; i < ri.nelem (); i++) |
|
|
485 { |
|
|
486 double tmp = b + i * increment; |
|
|
487 int col = tree_to_mat_idx (tmp); |
|
|
488 REP_ELEM_ASSIGN (0, col, rhs_m.elem (0, i), rhs_cm.elem (0, i), |
|
|
489 rhs.is_real_type ()); |
|
|
490 } |
|
|
491 } |
|
|
492 else if (nc == 1) |
|
|
493 { |
|
|
494 for (int i = 0; i < ri.nelem (); i++) |
|
|
495 { |
|
|
496 double tmp = b + i * increment; |
|
|
497 int row = tree_to_mat_idx (tmp); |
|
|
498 REP_ELEM_ASSIGN (row, 0, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), |
|
|
499 rhs.is_real_type ()); |
|
|
500 } |
|
|
501 } |
|
|
502 else |
|
|
503 panic_impossible (); |
|
|
504 } |
|
|
505 |
|
|
506 void |
|
|
507 tree_constant_rep::fortran_style_matrix_assignment |
|
|
508 (tree_constant& rhs, tree_constant_rep::constant_type mci) |
|
|
509 { |
|
|
510 assert (rhs.is_matrix_type ()); |
|
|
511 assert (mci == tree_constant_rep::magic_colon); |
|
|
512 |
|
|
513 int nr = rows (); |
|
|
514 int nc = columns (); |
|
|
515 |
|
|
516 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
517 |
|
|
518 int rhs_size = rhs_nr * rhs_nc; |
|
|
519 if (rhs_size == 0) |
|
|
520 { |
|
|
521 if (rhs.const_type () == matrix_constant) |
|
|
522 { |
|
|
523 delete matrix; |
|
|
524 matrix = new Matrix (0, 0); |
|
|
525 return; |
|
|
526 } |
|
|
527 else |
|
|
528 panic_impossible (); |
|
|
529 } |
|
|
530 else if (nr*nc != rhs_size) |
|
|
531 { |
|
|
532 error ("A(:) = X: X and A must have the same number of elements"); |
|
|
533 jump_to_top_level (); |
|
|
534 } |
|
|
535 |
|
|
536 if (rhs.const_type () == matrix_constant) |
|
|
537 { |
|
|
538 double *cop_out = rhs_m.fortran_vec (); |
|
|
539 for (int j = 0; j < nc; j++) |
|
|
540 for (int i = 0; i < nr; i++) |
|
|
541 matrix->elem (i, j) = *cop_out++; |
|
|
542 } |
|
|
543 else |
|
|
544 { |
|
|
545 Complex *cop_out = rhs_cm.fortran_vec (); |
|
|
546 for (int j = 0; j < nc; j++) |
|
|
547 for (int i = 0; i < nr; i++) |
|
|
548 complex_matrix->elem (i, j) = *cop_out++; |
|
|
549 } |
|
|
550 } |
|
|
551 |
|
|
552 void |
|
|
553 tree_constant_rep::fortran_style_matrix_assignment (tree_constant& rhs, |
|
|
554 idx_vector& i) |
|
|
555 { |
|
|
556 assert (rhs.is_matrix_type ()); |
|
|
557 |
|
|
558 int ilen = i.capacity (); |
|
|
559 |
|
|
560 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
561 |
|
|
562 int len = rhs_nr * rhs_nc; |
|
|
563 |
|
|
564 if (len == ilen) |
|
|
565 { |
|
|
566 int nr = rows (); |
|
|
567 if (rhs.const_type () == matrix_constant) |
|
|
568 { |
|
|
569 double *cop_out = rhs_m.fortran_vec (); |
|
|
570 for (int k = 0; k < len; k++) |
|
|
571 { |
|
|
572 int ii = fortran_row (i.elem (k) + 1, nr) - 1; |
|
|
573 int jj = fortran_column (i.elem (k) + 1, nr) - 1; |
|
|
574 |
|
|
575 matrix->elem (ii, jj) = *cop_out++; |
|
|
576 } |
|
|
577 } |
|
|
578 else |
|
|
579 { |
|
|
580 Complex *cop_out = rhs_cm.fortran_vec (); |
|
|
581 for (int k = 0; k < len; k++) |
|
|
582 { |
|
|
583 int ii = fortran_row (i.elem (k) + 1, nr) - 1; |
|
|
584 int jj = fortran_column (i.elem (k) + 1, nr) - 1; |
|
|
585 |
|
|
586 complex_matrix->elem (ii, jj) = *cop_out++; |
|
|
587 } |
|
|
588 } |
|
|
589 } |
|
|
590 else |
|
|
591 { |
|
|
592 error ("number of rows and columns must match for indexed assignment"); |
|
|
593 jump_to_top_level (); |
|
|
594 } |
|
|
595 } |
|
|
596 |
|
|
597 void |
|
|
598 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
599 tree_constant& i_arg, |
|
|
600 tree_constant& j_arg) |
|
|
601 { |
|
|
602 tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); |
|
|
603 |
|
|
604 tree_constant_rep::constant_type itype = tmp_i.const_type (); |
|
|
605 |
|
|
606 // index_check() and matrix_to_index_vector() jump to the top level on |
|
|
607 // errors. |
|
|
608 |
|
|
609 switch (itype) |
|
|
610 { |
|
|
611 case complex_scalar_constant: |
|
|
612 case scalar_constant: |
|
|
613 { |
|
|
614 int i = tree_to_mat_idx (tmp_i.double_value ()); |
|
|
615 index_check (i, "row"); |
|
|
616 do_matrix_assignment (rhs, i, j_arg); |
|
|
617 } |
|
|
618 break; |
|
|
619 case complex_matrix_constant: |
|
|
620 case matrix_constant: |
|
|
621 { |
|
|
622 Matrix mi = tmp_i.matrix_value (); |
|
|
623 idx_vector iv (mi, user_pref.do_fortran_indexing, "row", rows ()); |
|
|
624 do_matrix_assignment (rhs, iv, j_arg); |
|
|
625 } |
|
|
626 break; |
|
|
627 case string_constant: |
|
|
628 gripe_string_invalid (); |
|
|
629 break; |
|
|
630 case range_constant: |
|
|
631 { |
|
|
632 Range ri = tmp_i.range_value (); |
|
|
633 if (rows () == 2 && is_zero_one (ri)) |
|
|
634 { |
|
|
635 do_matrix_assignment (rhs, 1, j_arg); |
|
|
636 } |
|
|
637 else |
|
|
638 { |
|
|
639 int imax; |
|
|
640 index_check (ri, imax, "row"); |
|
|
641 do_matrix_assignment (rhs, ri, imax, j_arg); |
|
|
642 } |
|
|
643 } |
|
|
644 break; |
|
|
645 case magic_colon: |
|
|
646 do_matrix_assignment (rhs, magic_colon, j_arg); |
|
|
647 break; |
|
|
648 default: |
|
|
649 panic_impossible (); |
|
|
650 break; |
|
|
651 } |
|
|
652 } |
|
|
653 |
|
|
654 void |
|
|
655 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, int i, |
|
|
656 tree_constant& j_arg) |
|
|
657 { |
|
|
658 tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); |
|
|
659 |
|
|
660 tree_constant_rep::constant_type jtype = tmp_j.const_type (); |
|
|
661 |
|
|
662 int rhs_nr = rhs.rows (); |
|
|
663 int rhs_nc = rhs.columns (); |
|
|
664 |
|
|
665 // index_check() and matrix_to_index_vector() jump to the top level on |
|
|
666 // errors. |
|
|
667 |
|
|
668 switch (jtype) |
|
|
669 { |
|
|
670 case complex_scalar_constant: |
|
|
671 case scalar_constant: |
|
|
672 { |
|
|
673 int j = tree_to_mat_idx (tmp_j.double_value ()); |
|
|
674 index_check (j, "column"); |
|
|
675 if (! indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) |
|
|
676 { |
|
|
677 error ("A(int,int) = X, X must be a scalar"); |
|
|
678 jump_to_top_level (); |
|
|
679 } |
|
|
680 maybe_resize (i, j); |
|
|
681 do_matrix_assignment (rhs, i, j); |
|
|
682 } |
|
|
683 break; |
|
|
684 case complex_matrix_constant: |
|
|
685 case matrix_constant: |
|
|
686 { |
|
|
687 Matrix mj = tmp_j.matrix_value (); |
|
|
688 idx_vector jv (mj, user_pref.do_fortran_indexing, "column", |
|
|
689 columns ()); |
|
|
690 if (! indexed_assign_conforms (1, jv.capacity (), rhs_nr, rhs_nc)) |
|
|
691 { |
|
|
692 error ("A(int,matrix) = X: X must be a row vector with the\ |
|
|
693 same number of elements as matrix"); |
|
|
694 jump_to_top_level (); |
|
|
695 } |
|
|
696 maybe_resize (i, jv.max ()); |
|
|
697 do_matrix_assignment (rhs, i, jv); |
|
|
698 } |
|
|
699 break; |
|
|
700 case string_constant: |
|
|
701 gripe_string_invalid (); |
|
|
702 break; |
|
|
703 case range_constant: |
|
|
704 { |
|
|
705 Range rj = tmp_j.range_value (); |
|
|
706 if (! indexed_assign_conforms (1, rj.nelem (), rhs_nr, rhs_nc)) |
|
|
707 { |
|
|
708 error ("A(int,range) = X: X must be a row vector with the\ |
|
|
709 same number of elements as range"); |
|
|
710 jump_to_top_level (); |
|
|
711 } |
|
|
712 if (columns () == 2 && is_zero_one (rj) && rhs_nc == 1) |
|
|
713 { |
|
|
714 do_matrix_assignment (rhs, i, 1); |
|
|
715 } |
|
|
716 else |
|
|
717 { |
|
|
718 int jmax; |
|
|
719 index_check (rj, jmax, "column"); |
|
|
720 maybe_resize (i, jmax); |
|
|
721 do_matrix_assignment (rhs, i, rj); |
|
|
722 } |
|
|
723 } |
|
|
724 break; |
|
|
725 case magic_colon: |
|
|
726 { |
|
|
727 int nc = columns (); |
|
|
728 if (nc == 0 && rows () == 0 && rhs_nr == 1) |
|
|
729 { |
|
|
730 if (rhs.is_complex_type ()) |
|
|
731 { |
|
|
732 complex_matrix = new ComplexMatrix (); |
|
|
733 type_tag = complex_matrix_constant; |
|
|
734 } |
|
|
735 else |
|
|
736 { |
|
|
737 matrix = new Matrix (); |
|
|
738 type_tag = matrix_constant; |
|
|
739 } |
|
|
740 maybe_resize (i, rhs_nc-1); |
|
|
741 } |
|
|
742 else if (indexed_assign_conforms (1, nc, rhs_nr, rhs_nc)) |
|
|
743 maybe_resize (i, nc-1); |
|
|
744 else |
|
|
745 { |
|
|
746 error ("A(int,:) = X: X must be a row vector with the\ |
|
|
747 same number of columns as A"); |
|
|
748 jump_to_top_level (); |
|
|
749 } |
|
|
750 |
|
|
751 do_matrix_assignment (rhs, i, magic_colon); |
|
|
752 } |
|
|
753 break; |
|
|
754 default: |
|
|
755 panic_impossible (); |
|
|
756 break; |
|
|
757 } |
|
|
758 } |
|
|
759 |
|
|
760 void |
|
|
761 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, idx_vector& iv, |
|
|
762 tree_constant& j_arg) |
|
|
763 { |
|
|
764 tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); |
|
|
765 |
|
|
766 tree_constant_rep::constant_type jtype = tmp_j.const_type (); |
|
|
767 |
|
|
768 int rhs_nr = rhs.rows (); |
|
|
769 int rhs_nc = rhs.columns (); |
|
|
770 |
|
|
771 // index_check() and matrix_to_index_vector() jump to the top level on |
|
|
772 // errors. |
|
|
773 |
|
|
774 switch (jtype) |
|
|
775 { |
|
|
776 case complex_scalar_constant: |
|
|
777 case scalar_constant: |
|
|
778 { |
|
|
779 int j = tree_to_mat_idx (tmp_j.double_value ()); |
|
|
780 index_check (j, "column"); |
|
|
781 if (! indexed_assign_conforms (iv.capacity (), 1, rhs_nr, rhs_nc)) |
|
|
782 { |
|
|
783 error ("A(matrix,int) = X: X must be a column vector with\ |
|
|
784 the same number of elements as matrix"); |
|
|
785 jump_to_top_level (); |
|
|
786 } |
|
|
787 maybe_resize (iv.max (), j); |
|
|
788 do_matrix_assignment (rhs, iv, j); |
|
|
789 } |
|
|
790 break; |
|
|
791 case complex_matrix_constant: |
|
|
792 case matrix_constant: |
|
|
793 { |
|
|
794 Matrix mj = tmp_j.matrix_value (); |
|
|
795 idx_vector jv (mj, user_pref.do_fortran_indexing, "column", |
|
|
796 columns ()); |
|
|
797 if (! indexed_assign_conforms (iv.capacity (), jv.capacity (), |
|
|
798 rhs_nr, rhs_nc)) |
|
|
799 { |
|
|
800 error ("A(r_matrix,c_matrix) = X: the number of rows in X\ |
|
|
801 must match the number of elements in r_matrix and the number of\ |
|
|
802 columns in X must match the number of elements in c_matrix"); |
|
|
803 jump_to_top_level (); |
|
|
804 } |
|
|
805 maybe_resize (iv.max (), jv.max ()); |
|
|
806 do_matrix_assignment (rhs, iv, jv); |
|
|
807 } |
|
|
808 break; |
|
|
809 case string_constant: |
|
|
810 gripe_string_invalid (); |
|
|
811 break; |
|
|
812 case range_constant: |
|
|
813 { |
|
|
814 Range rj = tmp_j.range_value (); |
|
|
815 if (! indexed_assign_conforms (iv.capacity (), rj.nelem (), |
|
|
816 rhs_nr, rhs_nc)) |
|
|
817 { |
|
|
818 error ("A(matrix,range) = X: the number of rows in X must\ |
|
|
819 match the number of elements in matrix and the number of columns in X\ |
|
|
820 must match the number of elements in range"); |
|
|
821 jump_to_top_level (); |
|
|
822 } |
|
|
823 if (columns () == 2 && is_zero_one (rj) && rhs_nc == 1) |
|
|
824 { |
|
|
825 do_matrix_assignment (rhs, iv, 1); |
|
|
826 } |
|
|
827 else |
|
|
828 { |
|
|
829 int jmax; |
|
|
830 index_check (rj, jmax, "column"); |
|
|
831 maybe_resize (iv.max (), jmax); |
|
|
832 do_matrix_assignment (rhs, iv, rj); |
|
|
833 } |
|
|
834 } |
|
|
835 break; |
|
|
836 case magic_colon: |
|
|
837 { |
|
|
838 int nc = columns (); |
|
|
839 if (! indexed_assign_conforms (iv.capacity (), nc, rhs_nr, rhs_nc)) |
|
|
840 { |
|
|
841 error ("A(matrix,:) = X: the number of rows in X must\ |
|
|
842 match the number of elements in matrix, and the number of columns in\ |
|
|
843 X must match the number of columns in A"); |
|
|
844 jump_to_top_level (); |
|
|
845 } |
|
|
846 maybe_resize (iv.max (), nc-1); |
|
|
847 do_matrix_assignment (rhs, iv, magic_colon); |
|
|
848 } |
|
|
849 break; |
|
|
850 default: |
|
|
851 panic_impossible (); |
|
|
852 break; |
|
|
853 } |
|
|
854 } |
|
|
855 |
|
|
856 void |
|
|
857 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
858 Range& ri, int imax, |
|
|
859 tree_constant& j_arg) |
|
|
860 { |
|
|
861 tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); |
|
|
862 |
|
|
863 tree_constant_rep::constant_type jtype = tmp_j.const_type (); |
|
|
864 |
|
|
865 int rhs_nr = rhs.rows (); |
|
|
866 int rhs_nc = rhs.columns (); |
|
|
867 |
|
|
868 // index_check() and matrix_to_index_vector() jump to the top level on |
|
|
869 // errors. |
|
|
870 |
|
|
871 switch (jtype) |
|
|
872 { |
|
|
873 case complex_scalar_constant: |
|
|
874 case scalar_constant: |
|
|
875 { |
|
|
876 int j = tree_to_mat_idx (tmp_j.double_value ()); |
|
|
877 index_check (j, "column"); |
|
|
878 if (! indexed_assign_conforms (ri.nelem (), 1, rhs_nr, rhs_nc)) |
|
|
879 { |
|
|
880 error ("A(range,int) = X: X must be a column vector with\ |
|
|
881 the same number of elements as range"); |
|
|
882 jump_to_top_level (); |
|
|
883 jump_to_top_level (); |
|
|
884 } |
|
|
885 maybe_resize (imax, j); |
|
|
886 do_matrix_assignment (rhs, ri, j); |
|
|
887 } |
|
|
888 break; |
|
|
889 case complex_matrix_constant: |
|
|
890 case matrix_constant: |
|
|
891 { |
|
|
892 Matrix mj = tmp_j.matrix_value (); |
|
|
893 idx_vector jv (mj, user_pref.do_fortran_indexing, "column", |
|
|
894 columns ()); |
|
|
895 if (! indexed_assign_conforms (ri.nelem (), jv.capacity (), |
|
|
896 rhs_nr, rhs_nc)) |
|
|
897 { |
|
|
898 error ("A(range,matrix) = X: the number of rows in X must\ |
|
|
899 match the number of elements in range and the number of columns in X\ |
|
|
900 must match the number of elements in matrix"); |
|
|
901 jump_to_top_level (); |
|
|
902 } |
|
|
903 maybe_resize (imax, jv.max ()); |
|
|
904 do_matrix_assignment (rhs, ri, jv); |
|
|
905 } |
|
|
906 break; |
|
|
907 case string_constant: |
|
|
908 gripe_string_invalid (); |
|
|
909 break; |
|
|
910 case range_constant: |
|
|
911 { |
|
|
912 Range rj = tmp_j.range_value (); |
|
|
913 if (! indexed_assign_conforms (ri.nelem (), rj.nelem (), |
|
|
914 rhs_nr, rhs_nc)) |
|
|
915 { |
|
|
916 error ("A(r_range,c_range) = X: the number of rows in X\ |
|
|
917 must match the number of elements in r_range and the number of\ |
|
|
918 columns in X must match the number of elements in c_range\n"); |
|
|
919 jump_to_top_level (); |
|
|
920 } |
|
|
921 if (columns () == 2 && is_zero_one (rj) && rhs_nc == 1) |
|
|
922 { |
|
|
923 do_matrix_assignment (rhs, ri, 1); |
|
|
924 } |
|
|
925 else |
|
|
926 { |
|
|
927 int jmax; |
|
|
928 index_check (rj, jmax, "column"); |
|
|
929 maybe_resize (imax, jmax); |
|
|
930 do_matrix_assignment (rhs, ri, rj); |
|
|
931 } |
|
|
932 } |
|
|
933 break; |
|
|
934 case magic_colon: |
|
|
935 { |
|
|
936 int nc = columns (); |
|
|
937 if (! indexed_assign_conforms (ri.nelem (), nc, rhs_nr, rhs_nc)) |
|
|
938 { |
|
|
939 error ("A(range,:) = X: the number of rows in X must match\ |
|
|
940 the number of elements in range, and the number of columns in X must\ |
|
|
941 match the number of columns in A"); |
|
|
942 jump_to_top_level (); |
|
|
943 } |
|
|
944 maybe_resize (imax, nc-1); |
|
|
945 do_matrix_assignment (rhs, ri, magic_colon); |
|
|
946 } |
|
|
947 break; |
|
|
948 default: |
|
|
949 panic_impossible (); |
|
|
950 break; |
|
|
951 } |
|
|
952 } |
|
|
953 |
|
|
954 void |
|
|
955 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
956 tree_constant_rep::constant_type i, |
|
|
957 tree_constant& j_arg) |
|
|
958 { |
|
|
959 tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); |
|
|
960 |
|
|
961 tree_constant_rep::constant_type jtype = tmp_j.const_type (); |
|
|
962 |
|
|
963 int rhs_nr = rhs.rows (); |
|
|
964 int rhs_nc = rhs.columns (); |
|
|
965 |
|
|
966 // index_check() and matrix_to_index_vector() jump to the top level on |
|
|
967 // errors. |
|
|
968 |
|
|
969 switch (jtype) |
|
|
970 { |
|
|
971 case complex_scalar_constant: |
|
|
972 case scalar_constant: |
|
|
973 { |
|
|
974 int j = tree_to_mat_idx (tmp_j.double_value ()); |
|
|
975 index_check (j, "column"); |
|
|
976 int nr = rows (); |
|
|
977 if (nr == 0 && columns () == 0 && rhs_nc == 1) |
|
|
978 { |
|
|
979 if (rhs.is_complex_type ()) |
|
|
980 { |
|
|
981 complex_matrix = new ComplexMatrix (); |
|
|
982 type_tag = complex_matrix_constant; |
|
|
983 } |
|
|
984 else |
|
|
985 { |
|
|
986 matrix = new Matrix (); |
|
|
987 type_tag = matrix_constant; |
|
|
988 } |
|
|
989 maybe_resize (rhs_nr-1, j); |
|
|
990 } |
|
|
991 else if (indexed_assign_conforms (nr, 1, rhs_nr, rhs_nc)) |
|
|
992 maybe_resize (nr-1, j); |
|
|
993 else |
|
|
994 { |
|
|
995 error ("A(:,int) = X: X must be a column vector with the\ |
|
|
996 same number of rows as A"); |
|
|
997 jump_to_top_level (); |
|
|
998 } |
|
|
999 |
|
|
1000 do_matrix_assignment (rhs, magic_colon, j); |
|
|
1001 } |
|
|
1002 break; |
|
|
1003 case complex_matrix_constant: |
|
|
1004 case matrix_constant: |
|
|
1005 { |
|
|
1006 Matrix mj = tmp_j.matrix_value (); |
|
|
1007 idx_vector jv (mj, user_pref.do_fortran_indexing, "column", |
|
|
1008 columns ()); |
|
|
1009 int nr = rows (); |
|
|
1010 if (! indexed_assign_conforms (nr, jv.capacity (), rhs_nr, rhs_nc)) |
|
|
1011 { |
|
|
1012 error ("A(:,matrix) = X: the number of rows in X must\ |
|
|
1013 match the number of rows in A, and the number of columns in X must\ |
|
|
1014 match the number of elements in matrix"); |
|
|
1015 jump_to_top_level (); |
|
|
1016 } |
|
|
1017 maybe_resize (nr-1, jv.max ()); |
|
|
1018 do_matrix_assignment (rhs, magic_colon, jv); |
|
|
1019 } |
|
|
1020 break; |
|
|
1021 case string_constant: |
|
|
1022 gripe_string_invalid (); |
|
|
1023 break; |
|
|
1024 case range_constant: |
|
|
1025 { |
|
|
1026 Range rj = tmp_j.range_value (); |
|
|
1027 int nr = rows (); |
|
|
1028 if (! indexed_assign_conforms (nr, rj.nelem (), rhs_nr, rhs_nc)) |
|
|
1029 { |
|
|
1030 error ("A(:,range) = X: the number of rows in X must match\ |
|
|
1031 the number of rows in A, and the number of columns in X must match\ |
|
|
1032 the number of elements in range"); |
|
|
1033 jump_to_top_level (); |
|
|
1034 } |
|
|
1035 if (columns () == 2 && is_zero_one (rj) && rhs_nc == 1) |
|
|
1036 { |
|
|
1037 do_matrix_assignment (rhs, magic_colon, 1); |
|
|
1038 } |
|
|
1039 else |
|
|
1040 { |
|
|
1041 int jmax; |
|
|
1042 index_check (rj, jmax, "column"); |
|
|
1043 maybe_resize (nr-1, jmax); |
|
|
1044 do_matrix_assignment (rhs, magic_colon, rj); |
|
|
1045 } |
|
|
1046 } |
|
|
1047 break; |
|
|
1048 case magic_colon: |
|
|
1049 // a(:,:) = foo is equivalent to a = foo. |
|
|
1050 do_matrix_assignment (rhs, magic_colon, magic_colon); |
|
|
1051 break; |
|
|
1052 default: |
|
|
1053 panic_impossible (); |
|
|
1054 break; |
|
|
1055 } |
|
|
1056 } |
|
|
1057 |
|
|
1058 void |
|
|
1059 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, int i, int j) |
|
|
1060 { |
|
|
1061 REP_ELEM_ASSIGN (i, j, rhs.double_value (), rhs.complex_value (), |
|
|
1062 rhs.is_real_type ()); |
|
|
1063 } |
|
|
1064 |
|
|
1065 void |
|
|
1066 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, int i, |
|
|
1067 idx_vector& jv) |
|
|
1068 { |
|
|
1069 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1070 for (int j = 0; j < jv.capacity (); j++) |
|
|
1071 REP_ELEM_ASSIGN (i, jv.elem (j), rhs_m.elem (0, j), |
|
|
1072 rhs_cm.elem (0, j), rhs.is_real_type ()); |
|
|
1073 } |
|
|
1074 |
|
|
1075 void |
|
|
1076 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, int i, Range& rj) |
|
|
1077 { |
|
|
1078 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1079 |
|
|
1080 double b = rj.base (); |
|
|
1081 double increment = rj.inc (); |
|
|
1082 |
|
|
1083 for (int j = 0; j < rj.nelem (); j++) |
|
|
1084 { |
|
|
1085 double tmp = b + j * increment; |
|
|
1086 int col = tree_to_mat_idx (tmp); |
|
|
1087 REP_ELEM_ASSIGN (i, col, rhs_m.elem (0, j), rhs_cm.elem (0, j), |
|
|
1088 rhs.is_real_type ()); |
|
|
1089 } |
|
|
1090 } |
|
|
1091 |
|
|
1092 void |
|
|
1093 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, int i, |
|
|
1094 tree_constant_rep::constant_type mcj) |
|
|
1095 { |
|
|
1096 assert (mcj == magic_colon); |
|
|
1097 |
|
|
1098 int nc = columns (); |
|
|
1099 |
|
|
1100 if (rhs.is_matrix_type ()) |
|
|
1101 { |
|
|
1102 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1103 |
|
|
1104 for (int j = 0; j < nc; j++) |
|
|
1105 REP_ELEM_ASSIGN (i, j, rhs_m.elem (0, j), rhs_cm.elem (0, j), |
|
|
1106 rhs.is_real_type ()); |
|
|
1107 } |
|
|
1108 else if (rhs.const_type () == scalar_constant && nc == 1) |
|
|
1109 { |
|
|
1110 REP_ELEM_ASSIGN (i, 0, rhs.double_value (), |
|
|
1111 rhs.complex_value (), rhs.is_real_type ()); |
|
|
1112 } |
|
|
1113 else |
|
|
1114 panic_impossible (); |
|
|
1115 } |
|
|
1116 |
|
|
1117 void |
|
|
1118 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1119 idx_vector& iv, int j) |
|
|
1120 { |
|
|
1121 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1122 |
|
|
1123 for (int i = 0; i < iv.capacity (); i++) |
|
|
1124 { |
|
|
1125 int row = iv.elem (i); |
|
|
1126 REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, 0), |
|
|
1127 rhs_cm.elem (i, 0), rhs.is_real_type ()); |
|
|
1128 } |
|
|
1129 } |
|
|
1130 |
|
|
1131 void |
|
|
1132 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1133 idx_vector& iv, idx_vector& jv) |
|
|
1134 { |
|
|
1135 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1136 |
|
|
1137 for (int i = 0; i < iv.capacity (); i++) |
|
|
1138 { |
|
|
1139 int row = iv.elem (i); |
|
|
1140 for (int j = 0; j < jv.capacity (); j++) |
|
|
1141 { |
|
|
1142 int col = jv.elem (j); |
|
|
1143 REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), |
|
|
1144 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1145 } |
|
|
1146 } |
|
|
1147 } |
|
|
1148 |
|
|
1149 void |
|
|
1150 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1151 idx_vector& iv, Range& rj) |
|
|
1152 { |
|
|
1153 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1154 |
|
|
1155 double b = rj.base (); |
|
|
1156 double increment = rj.inc (); |
|
|
1157 |
|
|
1158 for (int i = 0; i < iv.capacity (); i++) |
|
|
1159 { |
|
|
1160 int row = iv.elem (i); |
|
|
1161 for (int j = 0; j < rj.nelem (); j++) |
|
|
1162 { |
|
|
1163 double tmp = b + j * increment; |
|
|
1164 int col = tree_to_mat_idx (tmp); |
|
|
1165 REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), |
|
|
1166 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1167 } |
|
|
1168 } |
|
|
1169 } |
|
|
1170 |
|
|
1171 void |
|
|
1172 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, idx_vector& iv, |
|
|
1173 tree_constant_rep::constant_type mcj) |
|
|
1174 { |
|
|
1175 assert (mcj == magic_colon); |
|
|
1176 |
|
|
1177 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1178 |
|
|
1179 int nc = columns (); |
|
|
1180 |
|
|
1181 for (int j = 0; j < nc; j++) |
|
|
1182 { |
|
|
1183 for (int i = 0; i < iv.capacity (); i++) |
|
|
1184 { |
|
|
1185 int row = iv.elem (i); |
|
|
1186 REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, j), |
|
|
1187 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1188 } |
|
|
1189 } |
|
|
1190 } |
|
|
1191 |
|
|
1192 void |
|
|
1193 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, Range& ri, int j) |
|
|
1194 { |
|
|
1195 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1196 |
|
|
1197 double b = ri.base (); |
|
|
1198 double increment = ri.inc (); |
|
|
1199 |
|
|
1200 for (int i = 0; i < ri.nelem (); i++) |
|
|
1201 { |
|
|
1202 double tmp = b + i * increment; |
|
|
1203 int row = tree_to_mat_idx (tmp); |
|
|
1204 REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, 0), |
|
|
1205 rhs_cm.elem (i, 0), rhs.is_real_type ()); |
|
|
1206 } |
|
|
1207 } |
|
|
1208 |
|
|
1209 void |
|
|
1210 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, Range& ri, |
|
|
1211 idx_vector& jv) |
|
|
1212 { |
|
|
1213 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1214 |
|
|
1215 double b = ri.base (); |
|
|
1216 double increment = ri.inc (); |
|
|
1217 |
|
|
1218 for (int j = 0; j < jv.capacity (); j++) |
|
|
1219 { |
|
|
1220 int col = jv.elem (j); |
|
|
1221 for (int i = 0; i < ri.nelem (); i++) |
|
|
1222 { |
|
|
1223 double tmp = b + i * increment; |
|
|
1224 int row = tree_to_mat_idx (tmp); |
|
|
1225 REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), |
|
|
1226 rhs_m.elem (i, j), rhs.is_real_type ()); |
|
|
1227 } |
|
|
1228 } |
|
|
1229 } |
|
|
1230 |
|
|
1231 void |
|
|
1232 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, Range& ri, |
|
|
1233 Range& rj) |
|
|
1234 { |
|
|
1235 double ib = ri.base (); |
|
|
1236 double iinc = ri.inc (); |
|
|
1237 double jb = rj.base (); |
|
|
1238 double jinc = rj.inc (); |
|
|
1239 |
|
|
1240 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1241 |
|
|
1242 for (int i = 0; i < ri.nelem (); i++) |
|
|
1243 { |
|
|
1244 double itmp = ib + i * iinc; |
|
|
1245 int row = tree_to_mat_idx (itmp); |
|
|
1246 for (int j = 0; j < rj.nelem (); j++) |
|
|
1247 { |
|
|
1248 double jtmp = jb + j * jinc; |
|
|
1249 int col = tree_to_mat_idx (jtmp); |
|
|
1250 REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), |
|
|
1251 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1252 } |
|
|
1253 } |
|
|
1254 } |
|
|
1255 |
|
|
1256 void |
|
|
1257 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, Range& ri, |
|
|
1258 tree_constant_rep::constant_type mcj) |
|
|
1259 { |
|
|
1260 assert (mcj == magic_colon); |
|
|
1261 |
|
|
1262 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1263 |
|
|
1264 double ib = ri.base (); |
|
|
1265 double iinc = ri.inc (); |
|
|
1266 |
|
|
1267 int nc = columns (); |
|
|
1268 |
|
|
1269 for (int i = 0; i < ri.nelem (); i++) |
|
|
1270 { |
|
|
1271 double itmp = ib + i * iinc; |
|
|
1272 int row = tree_to_mat_idx (itmp); |
|
|
1273 for (int j = 0; j < nc; j++) |
|
|
1274 REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, j), |
|
|
1275 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1276 } |
|
|
1277 } |
|
|
1278 |
|
|
1279 void |
|
|
1280 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1281 tree_constant_rep::constant_type mci, |
|
|
1282 int j) |
|
|
1283 { |
|
|
1284 assert (mci == magic_colon); |
|
|
1285 |
|
|
1286 int nr = rows (); |
|
|
1287 |
|
|
1288 if (rhs.is_matrix_type ()) |
|
|
1289 { |
|
|
1290 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1291 |
|
|
1292 for (int i = 0; i < nr; i++) |
|
|
1293 REP_ELEM_ASSIGN (i, j, rhs_m.elem (i, 0), |
|
|
1294 rhs_cm.elem (i, 0), rhs.is_real_type ()); |
|
|
1295 } |
|
|
1296 else if (rhs.const_type () == scalar_constant && nr == 1) |
|
|
1297 { |
|
|
1298 REP_ELEM_ASSIGN (0, j, rhs.double_value (), |
|
|
1299 rhs.complex_value (), rhs.is_real_type ()); |
|
|
1300 } |
|
|
1301 else |
|
|
1302 panic_impossible (); |
|
|
1303 } |
|
|
1304 |
|
|
1305 void |
|
|
1306 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1307 tree_constant_rep::constant_type mci, |
|
|
1308 idx_vector& jv) |
|
|
1309 { |
|
|
1310 assert (mci == magic_colon); |
|
|
1311 |
|
|
1312 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1313 |
|
|
1314 int nr = rows (); |
|
|
1315 |
|
|
1316 for (int i = 0; i < nr; i++) |
|
|
1317 { |
|
|
1318 for (int j = 0; j < jv.capacity (); j++) |
|
|
1319 { |
|
|
1320 int col = jv.elem (j); |
|
|
1321 REP_ELEM_ASSIGN (i, col, rhs_m.elem (i, j), |
|
|
1322 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1323 } |
|
|
1324 } |
|
|
1325 } |
|
|
1326 |
|
|
1327 void |
|
|
1328 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1329 tree_constant_rep::constant_type mci, |
|
|
1330 Range& rj) |
|
|
1331 { |
|
|
1332 assert (mci == magic_colon); |
|
|
1333 |
|
|
1334 REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); |
|
|
1335 |
|
|
1336 int nr = rows (); |
|
|
1337 |
|
|
1338 double jb = rj.base (); |
|
|
1339 double jinc = rj.inc (); |
|
|
1340 |
|
|
1341 for (int j = 0; j < rj.nelem (); j++) |
|
|
1342 { |
|
|
1343 double jtmp = jb + j * jinc; |
|
|
1344 int col = tree_to_mat_idx (jtmp); |
|
|
1345 for (int i = 0; i < nr; i++) |
|
|
1346 { |
|
|
1347 REP_ELEM_ASSIGN (i, col, rhs_m.elem (i, j), |
|
|
1348 rhs_cm.elem (i, j), rhs.is_real_type ()); |
|
|
1349 } |
|
|
1350 } |
|
|
1351 } |
|
|
1352 |
|
|
1353 void |
|
|
1354 tree_constant_rep::do_matrix_assignment (tree_constant& rhs, |
|
|
1355 tree_constant_rep::constant_type mci, |
|
|
1356 tree_constant_rep::constant_type mcj) |
|
|
1357 { |
|
|
1358 assert (mci == magic_colon && mcj == magic_colon); |
|
|
1359 |
|
|
1360 switch (type_tag) |
|
|
1361 { |
|
|
1362 case scalar_constant: |
|
|
1363 break; |
|
|
1364 case matrix_constant: |
|
|
1365 delete matrix; |
|
|
1366 break; |
|
|
1367 case complex_scalar_constant: |
|
|
1368 delete complex_scalar; |
|
|
1369 break; |
|
|
1370 case complex_matrix_constant: |
|
|
1371 delete complex_matrix; |
|
|
1372 break; |
|
|
1373 case string_constant: |
|
|
1374 delete [] string; |
|
|
1375 break; |
|
|
1376 case range_constant: |
|
|
1377 delete range; |
|
|
1378 break; |
|
|
1379 case magic_colon: |
|
|
1380 default: |
|
|
1381 panic_impossible (); |
|
|
1382 break; |
|
|
1383 } |
|
|
1384 |
|
|
1385 type_tag = rhs.const_type (); |
|
|
1386 |
|
|
1387 switch (type_tag) |
|
|
1388 { |
|
|
1389 case scalar_constant: |
|
|
1390 scalar = rhs.double_value (); |
|
|
1391 break; |
|
|
1392 case matrix_constant: |
|
|
1393 matrix = new Matrix (rhs.matrix_value ()); |
|
|
1394 break; |
|
|
1395 case string_constant: |
|
|
1396 string = strsave (rhs.string_value ()); |
|
|
1397 break; |
|
|
1398 case complex_matrix_constant: |
|
|
1399 complex_matrix = new ComplexMatrix (rhs.complex_matrix_value ()); |
|
|
1400 break; |
|
|
1401 case complex_scalar_constant: |
|
|
1402 complex_scalar = new Complex (rhs.complex_value ()); |
|
|
1403 break; |
|
|
1404 case range_constant: |
|
|
1405 range = new Range (rhs.range_value ()); |
|
|
1406 break; |
|
|
1407 case magic_colon: |
|
|
1408 default: |
|
|
1409 panic_impossible (); |
|
|
1410 break; |
|
|
1411 } |
|
|
1412 } |
|
|
1413 |
|
|
1414 /* |
|
|
1415 ;;; Local Variables: *** |
|
|
1416 ;;; mode: C++ *** |
|
|
1417 ;;; page-delimiter: "^/\\*" *** |
|
|
1418 ;;; End: *** |
|
|
1419 */ |
|
|
1420 |
