@@ 420-426 (lines=7) @@ | ||
417 | $t = $this->s[$k]; |
|
418 | $this->s[$k] = $this->s[$k + 1]; |
|
419 | $this->s[$k + 1] = $t; |
|
420 | if ($wantv and ($k < $this->n - 1)) { |
|
421 | for ($i = 0; $i < $this->n; ++$i) { |
|
422 | $t = $this->V[$i][$k + 1]; |
|
423 | $this->V[$i][$k + 1] = $this->V[$i][$k]; |
|
424 | $this->V[$i][$k] = $t; |
|
425 | } |
|
426 | } |
|
427 | if ($wantu and ($k < $this->m - 1)) { |
|
428 | for ($i = 0; $i < $this->m; ++$i) { |
|
429 | $t = $this->U[$i][$k + 1]; |
|
@@ 427-433 (lines=7) @@ | ||
424 | $this->V[$i][$k] = $t; |
|
425 | } |
|
426 | } |
|
427 | if ($wantu and ($k < $this->m - 1)) { |
|
428 | for ($i = 0; $i < $this->m; ++$i) { |
|
429 | $t = $this->U[$i][$k + 1]; |
|
430 | $this->U[$i][$k + 1] = $this->U[$i][$k]; |
|
431 | $this->U[$i][$k] = $t; |
|
432 | } |
|
433 | } |
|
434 | ++$k; |
|
435 | } |
|
436 | $iter = 0; |