@@ 1000-1007 (lines=8) @@ | ||
997 | for ($k = 0; $k < $this->n; ++$k) { |
|
998 | $Bcolj[$k] = $B->A[$k][$j]; |
|
999 | } |
|
1000 | for ($i = 0; $i < $this->m; ++$i) { |
|
1001 | $Arowi = $this->A[$i]; |
|
1002 | $s = 0; |
|
1003 | for ($k = 0; $k < $this->n; ++$k) { |
|
1004 | $s += $Arowi[$k] * $Bcolj[$k]; |
|
1005 | } |
|
1006 | $C->A[$i][$j] = $s; |
|
1007 | } |
|
1008 | } |
|
1009 | ||
1010 | return $C; |
|
@@ 1019-1025 (lines=7) @@ | ||
1016 | if ($this->n == $B->m) { |
|
1017 | $C = new self($this->m, $B->n); |
|
1018 | for ($i = 0; $i < $C->m; ++$i) { |
|
1019 | for ($j = 0; $j < $C->n; ++$j) { |
|
1020 | $s = '0'; |
|
1021 | for ($k = 0; $k < $C->n; ++$k) { |
|
1022 | $s += $this->A[$i][$k] * $B->A[$k][$j]; |
|
1023 | } |
|
1024 | $C->A[$i][$j] = $s; |
|
1025 | } |
|
1026 | } |
|
1027 | ||
1028 | return $C; |