Mercurial > octave

comparison src/pt-exp-base.cc @ 1321:64819a909ed7

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 1995-08-22 05:39:43 by jwe]
author jwe
date Tue, 22 Aug 1995 05:41:48 +0000
parents 611d403c7f3d
children 94bedeb289e5
comparison
equal deleted inserted replaced
1320:c9aecc02c6d4 1321:64819a909ed7
411 // cerr << "all strings\n"; 411 // cerr << "all strings\n";
412 412
413 // Compute size of result matrix, and check to see that the dimensions 413 // Compute size of result matrix, and check to see that the dimensions
414 // of all the elements will match up properly. 414 // of all the elements will match up properly.
415 415
416 for (i = 0; i < len; i++) 416 for (int i = 0; i < len; i++)
417 { 417 {
418 dir direct = list[i].direction; 418 dir direct = list[i].direction;
419 419
420 int nr = list[i].nr; 420 int nr = list[i].nr;
421 int nc = list[i].nc; 421 int nc = list[i].nc;
488 else if (found_complex) 488 else if (found_complex)
489 cm.resize (row_total, col_total, 0.0); 489 cm.resize (row_total, col_total, 0.0);
490 else 490 else
491 m.resize (row_total, col_total, 0.0); 491 m.resize (row_total, col_total, 0.0);
492 492
493 for (i = 0; i < len; i++) 493 for (int i = 0; i < len; i++)
494 { 494 {
495 tree_constant tmp = list[i].elem; 495 tree_constant tmp = list[i].elem;
496 496
497 int nr = list[i].nr; 497 int nr = list[i].nr;
498 int nc = list[i].nc; 498 int nc = list[i].nc;