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