Code Duplication    Length = 9-9 lines in 3 locations

src/Phpml/Math/LinearAlgebra/EigenvalueDecomposition.php 3 locations

@@ 776-784 (lines=9) @@
773
                        $q = $q / $p;
774
                        $r = $r / $p;
775
                        // Row modification
776
                        for ($j = $k; $j < $nn; ++$j) {
777
                            $p = $this->H[$k][$j] + $q * $this->H[$k + 1][$j];
778
                            if ($notlast) {
779
                                $p = $p + $r * $this->H[$k + 2][$j];
780
                                $this->H[$k + 2][$j] = $this->H[$k + 2][$j] - $p * $z;
781
                            }
782
783
                            $this->H[$k][$j] = $this->H[$k][$j] - $p * $x;
784
                            $this->H[$k + 1][$j] = $this->H[$k + 1][$j] - $p * $y;
785
                        }
786
787
                        // Column modification
@@ 788-796 (lines=9) @@
785
                        }
786
787
                        // Column modification
788
                        for ($i = 0; $i <= min($n, $k + 3); ++$i) {
789
                            $p = $x * $this->H[$i][$k] + $y * $this->H[$i][$k + 1];
790
                            if ($notlast) {
791
                                $p = $p + $z * $this->H[$i][$k + 2];
792
                                $this->H[$i][$k + 2] = $this->H[$i][$k + 2] - $p * $r;
793
                            }
794
795
                            $this->H[$i][$k] = $this->H[$i][$k] - $p;
796
                            $this->H[$i][$k + 1] = $this->H[$i][$k + 1] - $p * $q;
797
                        }
798
799
                        // Accumulate transformations
@@ 800-808 (lines=9) @@
797
                        }
798
799
                        // Accumulate transformations
800
                        for ($i = $low; $i <= $high; ++$i) {
801
                            $p = $x * $this->V[$i][$k] + $y * $this->V[$i][$k + 1];
802
                            if ($notlast) {
803
                                $p = $p + $z * $this->V[$i][$k + 2];
804
                                $this->V[$i][$k + 2] = $this->V[$i][$k + 2] - $p * $r;
805
                            }
806
807
                            $this->V[$i][$k] = $this->V[$i][$k] - $p;
808
                            $this->V[$i][$k + 1] = $this->V[$i][$k + 1] - $p * $q;
809
                        }
810
                    }  // ($s != 0)
811
                }  // k loop