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