@@ 409-415 (lines=7) @@ | ||
406 | $t = $this->s[$k]; |
|
407 | $this->s[$k] = $this->s[$k+1]; |
|
408 | $this->s[$k+1] = $t; |
|
409 | if ($wantv and ($k < $this->n - 1)) { |
|
410 | for ($i = 0; $i < $this->n; ++$i) { |
|
411 | $t = $this->V[$i][$k+1]; |
|
412 | $this->V[$i][$k+1] = $this->V[$i][$k]; |
|
413 | $this->V[$i][$k] = $t; |
|
414 | } |
|
415 | } |
|
416 | if ($wantu and ($k < $this->m-1)) { |
|
417 | for ($i = 0; $i < $this->m; ++$i) { |
|
418 | $t = $this->U[$i][$k+1]; |
|
@@ 416-422 (lines=7) @@ | ||
413 | $this->V[$i][$k] = $t; |
|
414 | } |
|
415 | } |
|
416 | if ($wantu and ($k < $this->m-1)) { |
|
417 | for ($i = 0; $i < $this->m; ++$i) { |
|
418 | $t = $this->U[$i][$k+1]; |
|
419 | $this->U[$i][$k+1] = $this->U[$i][$k]; |
|
420 | $this->U[$i][$k] = $t; |
|
421 | } |
|
422 | } |
|
423 | ++$k; |
|
424 | } |
|
425 | $iter = 0; |