Mercurial > hg > octave-lyh

comparison liboctave/Array.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 7eb93d12654c
comparison
equal deleted inserted replaced
1320:c9aecc02c6d4 1321:64819a909ed7
567 d2 = c; 567 d2 = c;
568 568
569 int min_r = old_d1 < r ? old_d1 : r; 569 int min_r = old_d1 < r ? old_d1 : r;
570 int min_c = old_d2 < c ? old_d2 : c; 570 int min_c = old_d2 < c ? old_d2 : c;
571 571
572 int i, j;
573
574 if (old_data && old_len > 0) 572 if (old_data && old_len > 0)
575 { 573 {
576 for (j = 0; j < min_c; j++) 574 for (int j = 0; j < min_c; j++)
577 for (i = 0; i < min_r; i++) 575 for (int i = 0; i < min_r; i++)
578 xelem (i, j) = old_data[old_d1*j+i]; 576 xelem (i, j) = old_data[old_d1*j+i];
579 } 577 }
580 578
581 for (j = 0; j < min_c; j++) 579 for (int j = 0; j < min_c; j++)
582 for (i = min_r; i < r; i++) 580 for (int i = min_r; i < r; i++)
583 xelem (i, j) = val; 581 xelem (i, j) = val;
584 582
585 for (j = min_c; j < c; j++) 583 for (int j = min_c; j < c; j++)
586 for (i = 0; i < r; i++) 584 for (int i = 0; i < r; i++)
587 xelem (i, j) = val; 585 xelem (i, j) = val;
588 586
589 if (--old_rep->count <= 0) 587 if (--old_rep->count <= 0)
590 delete old_rep; 588 delete old_rep;
591 } 589 }