View GitHub Repository php-ml

Schedule Inspection
Subscribe

Code Duplication    Length = 3-3 lines in 2 locations

src/Math/LinearAlgebra/LUDecomposition.php 2 locations

@@ 101-103 (lines=3) @@
98 
        // Outer loop.
99 
        for ($j = 0; $j < $this->n; ++$j) {
100 
            // Make a copy of the j-th column to localize references.
101 
            for ($i = 0; $i < $this->m; ++$i) {
102 
                $LUcolj[$i] = &$this->LU[$i][$j];
103 
            }
104 

                                

                                                            

                                    105
                                    
                                    
            // Apply previous transformations.

                                

                                                            

                                    106
                                    
                                    
            for ($i = 0; $i < $this->m; ++$i) {

                                

                                                                                

                                
                                
                                    @@ 141-143 (lines=3) @@
                                
                            


                                                            

                                    138
                                    
                                    

                                

                                                            

                                    139
                                    
                                    
            // Compute multipliers.

                                

                                                            

                                    140
                                    
                                    
            if (($j < $this->m) && ($this->LU[$j][$j] != 0.0)) {

                                

                                                            

                                    141
                                    
                                    
                for ($i = $j + 1; $i < $this->m; ++$i) {

                                

                                                            

                                    142
                                    
                                    
                    $this->LU[$i][$j] /= $this->LU[$j][$j];

                                

                                                            

                                    143
                                    
                                    
                }

                                

                                                            

                                    144
                                    
                                    
            }

                                

                                                            

                                    145
                                    
                                    
        }

                                

                                                            

                                    146
                                    
                                    
    }