PHPOffice / PhpSpreadsheet

src/PhpSpreadsheet/Shared/JAMA/EigenvalueDecomposition.php

Spacing +115 added lines, -115 removed lines

@@ -81,10 +81,10 @@ 
         //  Bowdler, Martin, Reinsch, and Wilkinson, Handbook for
         //  Auto. Comp., Vol.ii-Linear Algebra, and the corresponding
         //  Fortran subroutine in EISPACK.
-        $this->d = $this->V[$this->n-1];
+        $this->d = $this->V[$this->n - 1];
         // Householder reduction to tridiagonal form.
-        for ($i = $this->n-1; $i > 0; --$i) {
-            $i_ = $i -1;
+        for ($i = $this->n - 1; $i > 0; --$i) {
+            $i_ = $i - 1;
             // Scale to avoid under/overflow.
             $h = $scale = 0.0;
             $scale += array_sum(array_map(abs, $this->d));
@@ -116,7 +116,7 @@ 
                     $f = $this->d[$j];
                     $this->V[$j][$i] = $f;
                     $g = $this->e[$j] + $this->V[$j][$j] * $f;
-                    for ($k = $j+1; $k <= $i_; ++$k) {
+                    for ($k = $j + 1; $k <= $i_; ++$k) {
                         $g += $this->V[$k][$j] * $this->d[$k];
                         $this->e[$k] += $this->V[$k][$j] * $f;
                     }
@@ -128,7 +128,7 @@ 
                     $f += $this->e[$j] * $this->d[$j];
                 }
                 $hh = $f / (2 * $h);
-                for ($j=0; $j < $i; ++$j) {
+                for ($j = 0; $j < $i; ++$j) {
                     $this->e[$j] -= $hh * $this->d[$j];
                 }
                 for ($j = 0; $j < $i; ++$j) {
@@ -137,7 +137,7 @@ 
                     for ($k = $j; $k <= $i_; ++$k) {
                         $this->V[$k][$j] -= ($f * $this->e[$k] + $g * $this->d[$k]);
                     }
-                    $this->d[$j] = $this->V[$i-1][$j];
+                    $this->d[$j] = $this->V[$i - 1][$j];
                     $this->V[$i][$j] = 0.0;
                 }
             }
@@ -145,18 +145,18 @@ 
         }
 
         // Accumulate transformations.
-        for ($i = 0; $i < $this->n-1; ++$i) {
-            $this->V[$this->n-1][$i] = $this->V[$i][$i];
+        for ($i = 0; $i < $this->n - 1; ++$i) {
+            $this->V[$this->n - 1][$i] = $this->V[$i][$i];
             $this->V[$i][$i] = 1.0;
-            $h = $this->d[$i+1];
+            $h = $this->d[$i + 1];
             if ($h != 0.0) {
                 for ($k = 0; $k <= $i; ++$k) {
-                    $this->d[$k] = $this->V[$k][$i+1] / $h;
+                    $this->d[$k] = $this->V[$k][$i + 1] / $h;
                 }
                 for ($j = 0; $j <= $i; ++$j) {
                     $g = 0.0;
                     for ($k = 0; $k <= $i; ++$k) {
-                        $g += $this->V[$k][$i+1] * $this->V[$k][$j];
+                        $g += $this->V[$k][$i + 1] * $this->V[$k][$j];
                     }
                     for ($k = 0; $k <= $i; ++$k) {
                         $this->V[$k][$j] -= $g * $this->d[$k];
@@ -164,13 +164,13 @@ 
                 }
             }
             for ($k = 0; $k <= $i; ++$k) {
-                $this->V[$k][$i+1] = 0.0;
+                $this->V[$k][$i + 1] = 0.0;
             }
         }
 
-        $this->d = $this->V[$this->n-1];
-        $this->V[$this->n-1] = array_fill(0, $j, 0.0);
-        $this->V[$this->n-1][$this->n-1] = 1.0;
+        $this->d = $this->V[$this->n - 1];
+        $this->V[$this->n - 1] = array_fill(0, $j, 0.0);
+        $this->V[$this->n - 1][$this->n - 1] = 1.0;
         $this->e[0] = 0.0;
     }
 
@@ -187,9 +187,9 @@ 
     private function tql2()
     {
         for ($i = 1; $i < $this->n; ++$i) {
-            $this->e[$i-1] = $this->e[$i];
+            $this->e[$i - 1] = $this->e[$i];
         }
-        $this->e[$this->n-1] = 0.0;
+        $this->e[$this->n - 1] = 0.0;
         $f = 0.0;
         $tst1 = 0.0;
         $eps  = pow(2.0, -52.0);
@@ -213,14 +213,14 @@ 
                     $iter += 1;
                     // Compute implicit shift
                     $g = $this->d[$l];
-                    $p = ($this->d[$l+1] - $g) / (2.0 * $this->e[$l]);
+                    $p = ($this->d[$l + 1] - $g) / (2.0 * $this->e[$l]);
                     $r = hypo($p, 1.0);
                     if ($p < 0) {
                         $r *= -1;
                     }
                     $this->d[$l] = $this->e[$l] / ($p + $r);
-                    $this->d[$l+1] = $this->e[$l] * ($p + $r);
-                    $dl1 = $this->d[$l+1];
+                    $this->d[$l + 1] = $this->e[$l] * ($p + $r);
+                    $dl1 = $this->d[$l + 1];
                     $h = $g - $this->d[$l];
                     for ($i = $l + 2; $i < $this->n; ++$i) {
                         $this->d[$i] -= $h;
@@ -232,22 +232,22 @@ 
                     $c2 = $c3 = $c;
                     $el1 = $this->e[$l + 1];
                     $s = $s2 = 0.0;
-                    for ($i = $m-1; $i >= $l; --$i) {
+                    for ($i = $m - 1; $i >= $l; --$i) {
                         $c3 = $c2;
                         $c2 = $c;
                         $s2 = $s;
                         $g  = $c * $this->e[$i];
                         $h  = $c * $p;
                         $r  = hypo($p, $this->e[$i]);
-                        $this->e[$i+1] = $s * $r;
+                        $this->e[$i + 1] = $s * $r;
                         $s = $this->e[$i] / $r;
                         $c = $p / $r;
                         $p = $c * $this->d[$i] - $s * $g;
-                        $this->d[$i+1] = $h + $s * ($c * $g + $s * $this->d[$i]);
+                        $this->d[$i + 1] = $h + $s * ($c * $g + $s * $this->d[$i]);
                         // Accumulate transformation.
                         for ($k = 0; $k < $this->n; ++$k) {
-                            $h = $this->V[$k][$i+1];
-                            $this->V[$k][$i+1] = $s * $this->V[$k][$i] + $c * $h;
+                            $h = $this->V[$k][$i + 1];
+                            $this->V[$k][$i + 1] = $s * $this->V[$k][$i] + $c * $h;
                             $this->V[$k][$i] = $c * $this->V[$k][$i] - $s * $h;
                         }
                     }
@@ -265,7 +265,7 @@ 
         for ($i = 0; $i < $this->n - 1; ++$i) {
             $k = $i;
             $p = $this->d[$i];
-            for ($j = $i+1; $j < $this->n; ++$j) {
+            for ($j = $i + 1; $j < $this->n; ++$j) {
                 if ($this->d[$j] < $p) {
                     $k = $j;
                     $p = $this->d[$j];
@@ -296,19 +296,19 @@ 
     private function orthes()
     {
         $low  = 0;
-        $high = $this->n-1;
+        $high = $this->n - 1;
 
-        for ($m = $low+1; $m <= $high-1; ++$m) {
+        for ($m = $low + 1; $m <= $high - 1; ++$m) {
             // Scale column.
             $scale = 0.0;
             for ($i = $m; $i <= $high; ++$i) {
-                $scale = $scale + abs($this->H[$i][$m-1]);
+                $scale = $scale + abs($this->H[$i][$m - 1]);
             }
             if ($scale != 0.0) {
                 // Compute Householder transformation.
                 $h = 0.0;
                 for ($i = $high; $i >= $m; --$i) {
-                    $this->ort[$i] = $this->H[$i][$m-1] / $scale;
+                    $this->ort[$i] = $this->H[$i][$m - 1] / $scale;
                     $h += $this->ort[$i] * $this->ort[$i];
                 }
                 $g = sqrt($h);
@@ -340,7 +340,7 @@ 
                     }
                 }
                 $this->ort[$m] = $scale * $this->ort[$m];
-                $this->H[$m][$m-1] = $scale * $g;
+                $this->H[$m][$m - 1] = $scale * $g;
             }
         }
 
@@ -350,10 +350,10 @@ 
                 $this->V[$i][$j] = ($i == $j ? 1.0 : 0.0);
             }
         }
-        for ($m = $high-1; $m >= $low+1; --$m) {
-            if ($this->H[$m][$m-1] != 0.0) {
-                for ($i = $m+1; $i <= $high; ++$i) {
-                    $this->ort[$i] = $this->H[$i][$m-1];
+        for ($m = $high - 1; $m >= $low + 1; --$m) {
+            if ($this->H[$m][$m - 1] != 0.0) {
+                for ($i = $m + 1; $i <= $high; ++$i) {
+                    $this->ort[$i] = $this->H[$i][$m - 1];
                 }
                 for ($j = $m; $j <= $high; ++$j) {
                     $g = 0.0;
@@ -361,7 +361,7 @@ 
                         $g += $this->ort[$i] * $this->V[$i][$j];
                     }
                     // Double division avoids possible underflow
-                    $g = ($g / $this->ort[$m]) / $this->H[$m][$m-1];
+                    $g = ($g / $this->ort[$m]) / $this->H[$m][$m - 1];
                     for ($i = $m; $i <= $high; ++$i) {
                         $this->V[$i][$j] += $g * $this->ort[$i];
                     }
@@ -418,7 +418,7 @@ 
                 $this->d[$i] = $this->H[$i][$i];
                 $this->e[$i] = 0.0;
             }
-            for ($j = max($i-1, 0); $j < $nn; ++$j) {
+            for ($j = max($i - 1, 0); $j < $nn; ++$j) {
                 $norm = $norm + abs($this->H[$i][$j]);
             }
         }
@@ -429,11 +429,11 @@ 
             // Look for single small sub-diagonal element
             $l = $n;
             while ($l > $low) {
-                $s = abs($this->H[$l-1][$l-1]) + abs($this->H[$l][$l]);
+                $s = abs($this->H[$l - 1][$l - 1]) + abs($this->H[$l][$l]);
                 if ($s == 0.0) {
                     $s = $norm;
                 }
-                if (abs($this->H[$l][$l-1]) < $eps * $s) {
+                if (abs($this->H[$l][$l - 1]) < $eps * $s) {
                     break;
                 }
                 --$l;
@@ -447,13 +447,13 @@ 
                 --$n;
                 $iter = 0;
             // Two roots found
-            } elseif ($l == $n-1) {
-                $w = $this->H[$n][$n-1] * $this->H[$n-1][$n];
-                $p = ($this->H[$n-1][$n-1] - $this->H[$n][$n]) / 2.0;
+            } elseif ($l == $n - 1) {
+                $w = $this->H[$n][$n - 1] * $this->H[$n - 1][$n];
+                $p = ($this->H[$n - 1][$n - 1] - $this->H[$n][$n]) / 2.0;
                 $q = $p * $p + $w;
                 $z = sqrt(abs($q));
                 $this->H[$n][$n] = $this->H[$n][$n] + $exshift;
-                $this->H[$n-1][$n-1] = $this->H[$n-1][$n-1] + $exshift;
+                $this->H[$n - 1][$n - 1] = $this->H[$n - 1][$n - 1] + $exshift;
                 $x = $this->H[$n][$n];
                 // Real pair
                 if ($q >= 0) {
@@ -462,14 +462,14 @@ 
                     } else {
                         $z = $p - $z;
                     }
-                    $this->d[$n-1] = $x + $z;
-                    $this->d[$n] = $this->d[$n-1];
+                    $this->d[$n - 1] = $x + $z;
+                    $this->d[$n] = $this->d[$n - 1];
                     if ($z != 0.0) {
                         $this->d[$n] = $x - $w / $z;
                     }
-                    $this->e[$n-1] = 0.0;
+                    $this->e[$n - 1] = 0.0;
                     $this->e[$n] = 0.0;
-                    $x = $this->H[$n][$n-1];
+                    $x = $this->H[$n][$n - 1];
                     $s = abs($x) + abs($z);
                     $p = $x / $s;
                     $q = $z / $s;
@@ -477,28 +477,28 @@ 
                     $p = $p / $r;
                     $q = $q / $r;
                     // Row modification
-                    for ($j = $n-1; $j < $nn; ++$j) {
-                        $z = $this->H[$n-1][$j];
-                        $this->H[$n-1][$j] = $q * $z + $p * $this->H[$n][$j];
+                    for ($j = $n - 1; $j < $nn; ++$j) {
+                        $z = $this->H[$n - 1][$j];
+                        $this->H[$n - 1][$j] = $q * $z + $p * $this->H[$n][$j];
                         $this->H[$n][$j] = $q * $this->H[$n][$j] - $p * $z;
                     }
                     // Column modification
                     for ($i = 0; $i <= $n; ++$i) {
-                        $z = $this->H[$i][$n-1];
-                        $this->H[$i][$n-1] = $q * $z + $p * $this->H[$i][$n];
+                        $z = $this->H[$i][$n - 1];
+                        $this->H[$i][$n - 1] = $q * $z + $p * $this->H[$i][$n];
                         $this->H[$i][$n] = $q * $this->H[$i][$n] - $p * $z;
                     }
                     // Accumulate transformations
                     for ($i = $low; $i <= $high; ++$i) {
-                        $z = $this->V[$i][$n-1];
-                        $this->V[$i][$n-1] = $q * $z + $p * $this->V[$i][$n];
+                        $z = $this->V[$i][$n - 1];
+                        $this->V[$i][$n - 1] = $q * $z + $p * $this->V[$i][$n];
                         $this->V[$i][$n] = $q * $this->V[$i][$n] - $p * $z;
                     }
                 // Complex pair
                 } else {
-                    $this->d[$n-1] = $x + $p;
+                    $this->d[$n - 1] = $x + $p;
                     $this->d[$n] = $x + $p;
-                    $this->e[$n-1] = $z;
+                    $this->e[$n - 1] = $z;
                     $this->e[$n] = -$z;
                 }
                 $n = $n - 2;
@@ -510,8 +510,8 @@ 
                 $y = 0.0;
                 $w = 0.0;
                 if ($l < $n) {
-                    $y = $this->H[$n-1][$n-1];
-                    $w = $this->H[$n][$n-1] * $this->H[$n-1][$n];
+                    $y = $this->H[$n - 1][$n - 1];
+                    $w = $this->H[$n][$n - 1] * $this->H[$n - 1][$n];
                 }
                 // Wilkinson's original ad hoc shift
                 if ($iter == 10) {
@@ -519,7 +519,7 @@ 
                     for ($i = $low; $i <= $n; ++$i) {
                         $this->H[$i][$i] -= $x;
                     }
-                    $s = abs($this->H[$n][$n-1]) + abs($this->H[$n-1][$n-2]);
+                    $s = abs($this->H[$n][$n - 1]) + abs($this->H[$n - 1][$n - 2]);
                     $x = $y = 0.75 * $s;
                     $w = -0.4375 * $s * $s;
                 }
@@ -548,9 +548,9 @@ 
                     $z = $this->H[$m][$m];
                     $r = $x - $z;
                     $s = $y - $z;
-                    $p = ($r * $s - $w) / $this->H[$m+1][$m] + $this->H[$m][$m+1];
-                    $q = $this->H[$m+1][$m+1] - $z - $r - $s;
-                    $r = $this->H[$m+2][$m+1];
+                    $p = ($r * $s - $w) / $this->H[$m + 1][$m] + $this->H[$m][$m + 1];
+                    $q = $this->H[$m + 1][$m + 1] - $z - $r - $s;
+                    $r = $this->H[$m + 2][$m + 1];
                     $s = abs($p) + abs($q) + abs($r);
                     $p = $p / $s;
                     $q = $q / $s;
@@ -558,25 +558,25 @@ 
                     if ($m == $l) {
                         break;
                     }
-                    if (abs($this->H[$m][$m-1]) * (abs($q) + abs($r)) <
-                        $eps * (abs($p) * (abs($this->H[$m-1][$m-1]) + abs($z) + abs($this->H[$m+1][$m+1])))) {
+                    if (abs($this->H[$m][$m - 1]) * (abs($q) + abs($r)) <
+                        $eps * (abs($p) * (abs($this->H[$m - 1][$m - 1]) + abs($z) + abs($this->H[$m + 1][$m + 1])))) {
                         break;
                     }
                     --$m;
                 }
                 for ($i = $m + 2; $i <= $n; ++$i) {
-                    $this->H[$i][$i-2] = 0.0;
-                    if ($i > $m+2) {
-                        $this->H[$i][$i-3] = 0.0;
+                    $this->H[$i][$i - 2] = 0.0;
+                    if ($i > $m + 2) {
+                        $this->H[$i][$i - 3] = 0.0;
                     }
                 }
                 // Double QR step involving rows l:n and columns m:n
-                for ($k = $m; $k <= $n-1; ++$k) {
-                    $notlast = ($k != $n-1);
+                for ($k = $m; $k <= $n - 1; ++$k) {
+                    $notlast = ($k != $n - 1);
                     if ($k != $m) {
-                        $p = $this->H[$k][$k-1];
-                        $q = $this->H[$k+1][$k-1];
-                        $r = ($notlast ? $this->H[$k+2][$k-1] : 0.0);
+                        $p = $this->H[$k][$k - 1];
+                        $q = $this->H[$k + 1][$k - 1];
+                        $r = ($notlast ? $this->H[$k + 2][$k - 1] : 0.0);
                         $x = abs($p) + abs($q) + abs($r);
                         if ($x != 0.0) {
                             $p = $p / $x;
@@ -593,9 +593,9 @@ 
                     }
                     if ($s != 0) {
                         if ($k != $m) {
-                            $this->H[$k][$k-1] = -$s * $x;
+                            $this->H[$k][$k - 1] = -$s * $x;
                         } elseif ($l != $m) {
-                            $this->H[$k][$k-1] = -$this->H[$k][$k-1];
+                            $this->H[$k][$k - 1] = -$this->H[$k][$k - 1];
                         }
                         $p = $p + $s;
                         $x = $p / $s;
@@ -605,33 +605,33 @@ 
                         $r = $r / $p;
                         // Row modification
                         for ($j = $k; $j < $nn; ++$j) {
-                            $p = $this->H[$k][$j] + $q * $this->H[$k+1][$j];
+                            $p = $this->H[$k][$j] + $q * $this->H[$k + 1][$j];
                             if ($notlast) {
-                                $p = $p + $r * $this->H[$k+2][$j];
-                                $this->H[$k+2][$j] = $this->H[$k+2][$j] - $p * $z;
+                                $p = $p + $r * $this->H[$k + 2][$j];
+                                $this->H[$k + 2][$j] = $this->H[$k + 2][$j] - $p * $z;
                             }
                             $this->H[$k][$j] = $this->H[$k][$j] - $p * $x;
-                            $this->H[$k+1][$j] = $this->H[$k+1][$j] - $p * $y;
+                            $this->H[$k + 1][$j] = $this->H[$k + 1][$j] - $p * $y;
                         }
                         // Column modification
-                        for ($i = 0; $i <= min($n, $k+3); ++$i) {
-                            $p = $x * $this->H[$i][$k] + $y * $this->H[$i][$k+1];
+                        for ($i = 0; $i <= min($n, $k + 3); ++$i) {
+                            $p = $x * $this->H[$i][$k] + $y * $this->H[$i][$k + 1];
                             if ($notlast) {
-                                $p = $p + $z * $this->H[$i][$k+2];
-                                $this->H[$i][$k+2] = $this->H[$i][$k+2] - $p * $r;
+                                $p = $p + $z * $this->H[$i][$k + 2];
+                                $this->H[$i][$k + 2] = $this->H[$i][$k + 2] - $p * $r;
                             }
                             $this->H[$i][$k] = $this->H[$i][$k] - $p;
-                            $this->H[$i][$k+1] = $this->H[$i][$k+1] - $p * $q;
+                            $this->H[$i][$k + 1] = $this->H[$i][$k + 1] - $p * $q;
                         }
                         // Accumulate transformations
                         for ($i = $low; $i <= $high; ++$i) {
-                            $p = $x * $this->V[$i][$k] + $y * $this->V[$i][$k+1];
+                            $p = $x * $this->V[$i][$k] + $y * $this->V[$i][$k + 1];
                             if ($notlast) {
-                                $p = $p + $z * $this->V[$i][$k+2];
-                                $this->V[$i][$k+2] = $this->V[$i][$k+2] - $p * $r;
+                                $p = $p + $z * $this->V[$i][$k + 2];
+                                $this->V[$i][$k + 2] = $this->V[$i][$k + 2] - $p * $r;
                             }
                             $this->V[$i][$k] = $this->V[$i][$k] - $p;
-                            $this->V[$i][$k+1] = $this->V[$i][$k+1] - $p * $q;
+                            $this->V[$i][$k + 1] = $this->V[$i][$k + 1] - $p * $q;
                         }
                     }  // ($s != 0)
                 }  // k loop
@@ -643,14 +643,14 @@ 
             return;
         }
 
-        for ($n = $nn-1; $n >= 0; --$n) {
+        for ($n = $nn - 1; $n >= 0; --$n) {
             $p = $this->d[$n];
             $q = $this->e[$n];
             // Real vector
             if ($q == 0) {
                 $l = $n;
                 $this->H[$n][$n] = 1.0;
-                for ($i = $n-1; $i >= 0; --$i) {
+                for ($i = $n - 1; $i >= 0; --$i) {
                     $w = $this->H[$i][$i] - $p;
                     $r = 0.0;
                     for ($j = $l; $j <= $n; ++$j) {
@@ -669,15 +669,15 @@ 
                             }
                         // Solve real equations
                         } else {
-                            $x = $this->H[$i][$i+1];
-                            $y = $this->H[$i+1][$i];
+                            $x = $this->H[$i][$i + 1];
+                            $y = $this->H[$i + 1][$i];
                             $q = ($this->d[$i] - $p) * ($this->d[$i] - $p) + $this->e[$i] * $this->e[$i];
                             $t = ($x * $s - $z * $r) / $q;
                             $this->H[$i][$n] = $t;
                             if (abs($x) > abs($z)) {
-                                $this->H[$i+1][$n] = (-$r - $w * $t) / $x;
+                                $this->H[$i + 1][$n] = (-$r - $w * $t) / $x;
                             } else {
-                                $this->H[$i+1][$n] = (-$s - $y * $t) / $z;
+                                $this->H[$i + 1][$n] = (-$s - $y * $t) / $z;
                             }
                         }
                         // Overflow control
@@ -691,24 +691,24 @@ 
                 }
             // Complex vector
             } elseif ($q < 0) {
-                $l = $n-1;
+                $l = $n - 1;
                 // Last vector component imaginary so matrix is triangular
-                if (abs($this->H[$n][$n-1]) > abs($this->H[$n-1][$n])) {
-                    $this->H[$n-1][$n-1] = $q / $this->H[$n][$n-1];
-                    $this->H[$n-1][$n] = -($this->H[$n][$n] - $p) / $this->H[$n][$n-1];
+                if (abs($this->H[$n][$n - 1]) > abs($this->H[$n - 1][$n])) {
+                    $this->H[$n - 1][$n - 1] = $q / $this->H[$n][$n - 1];
+                    $this->H[$n - 1][$n] = -($this->H[$n][$n] - $p) / $this->H[$n][$n - 1];
                 } else {
-                    $this->cdiv(0.0, -$this->H[$n-1][$n], $this->H[$n-1][$n-1] - $p, $q);
-                    $this->H[$n-1][$n-1] = $this->cdivr;
-                    $this->H[$n-1][$n]   = $this->cdivi;
+                    $this->cdiv(0.0, -$this->H[$n - 1][$n], $this->H[$n - 1][$n - 1] - $p, $q);
+                    $this->H[$n - 1][$n - 1] = $this->cdivr;
+                    $this->H[$n - 1][$n]   = $this->cdivi;
                 }
-                $this->H[$n][$n-1] = 0.0;
+                $this->H[$n][$n - 1] = 0.0;
                 $this->H[$n][$n] = 1.0;
-                for ($i = $n-2; $i >= 0; --$i) {
+                for ($i = $n - 2; $i >= 0; --$i) {
                     // double ra,sa,vr,vi;
                     $ra = 0.0;
                     $sa = 0.0;
                     for ($j = $l; $j <= $n; ++$j) {
-                        $ra = $ra + $this->H[$i][$j] * $this->H[$j][$n-1];
+                        $ra = $ra + $this->H[$i][$j] * $this->H[$j][$n - 1];
                         $sa = $sa + $this->H[$i][$j] * $this->H[$j][$n];
                     }
                     $w = $this->H[$i][$i] - $p;
@@ -720,34 +720,34 @@ 
                         $l = $i;
                         if ($this->e[$i] == 0) {
                             $this->cdiv(-$ra, -$sa, $w, $q);
-                            $this->H[$i][$n-1] = $this->cdivr;
+                            $this->H[$i][$n - 1] = $this->cdivr;
                             $this->H[$i][$n]   = $this->cdivi;
                         } else {
                             // Solve complex equations
-                            $x = $this->H[$i][$i+1];
-                            $y = $this->H[$i+1][$i];
+                            $x = $this->H[$i][$i + 1];
+                            $y = $this->H[$i + 1][$i];
                             $vr = ($this->d[$i] - $p) * ($this->d[$i] - $p) + $this->e[$i] * $this->e[$i] - $q * $q;
                             $vi = ($this->d[$i] - $p) * 2.0 * $q;
                             if ($vr == 0.0 & $vi == 0.0) {
                                 $vr = $eps * $norm * (abs($w) + abs($q) + abs($x) + abs($y) + abs($z));
                             }
                             $this->cdiv($x * $r - $z * $ra + $q * $sa, $x * $s - $z * $sa - $q * $ra, $vr, $vi);
-                            $this->H[$i][$n-1] = $this->cdivr;
+                            $this->H[$i][$n - 1] = $this->cdivr;
                             $this->H[$i][$n]   = $this->cdivi;
                             if (abs($x) > (abs($z) + abs($q))) {
-                                $this->H[$i+1][$n-1] = (-$ra - $w * $this->H[$i][$n-1] + $q * $this->H[$i][$n]) / $x;
-                                $this->H[$i+1][$n] = (-$sa - $w * $this->H[$i][$n] - $q * $this->H[$i][$n-1]) / $x;
+                                $this->H[$i + 1][$n - 1] = (-$ra - $w * $this->H[$i][$n - 1] + $q * $this->H[$i][$n]) / $x;
+                                $this->H[$i + 1][$n] = (-$sa - $w * $this->H[$i][$n] - $q * $this->H[$i][$n - 1]) / $x;
                             } else {
-                                $this->cdiv(-$r - $y * $this->H[$i][$n-1], -$s - $y * $this->H[$i][$n], $z, $q);
-                                $this->H[$i+1][$n-1] = $this->cdivr;
-                                $this->H[$i+1][$n]   = $this->cdivi;
+                                $this->cdiv(-$r - $y * $this->H[$i][$n - 1], -$s - $y * $this->H[$i][$n], $z, $q);
+                                $this->H[$i + 1][$n - 1] = $this->cdivr;
+                                $this->H[$i + 1][$n]   = $this->cdivi;
                             }
                         }
                         // Overflow control
-                        $t = max(abs($this->H[$i][$n-1]), abs($this->H[$i][$n]));
+                        $t = max(abs($this->H[$i][$n - 1]), abs($this->H[$i][$n]));
                         if (($eps * $t) * $t > 1) {
                             for ($j = $i; $j <= $n; ++$j) {
-                                $this->H[$j][$n-1] = $this->H[$j][$n-1] / $t;
+                                $this->H[$j][$n - 1] = $this->H[$j][$n - 1] / $t;
                                 $this->H[$j][$n]   = $this->H[$j][$n] / $t;
                             }
                         }
@@ -766,7 +766,7 @@ 
         }
 
         // Back transformation to get eigenvectors of original matrix
-        for ($j = $nn-1; $j >= $low; --$j) {
+        for ($j = $nn - 1; $j >= $low; --$j) {
             for ($i = $low; $i <= $high; ++$i) {
                 $z = 0.0;
                 for ($k = $low; $k <= min($j, $high); ++$k) {

src/PhpSpreadsheet/Shared/JAMA/Matrix.php

Spacing +3 added lines, -3 removed lines

@@ -196,7 +196,7 @@ 
                     } else {
                         throw new \PHPExcel\Calculation\Exception(self::ARGUMENT_BOUNDS_EXCEPTION);
                     }
-                    $R = new Matrix($m+1, $n+1);
+                    $R = new Matrix($m + 1, $n + 1);
                     for ($i = $i0; $i <= $iF; ++$i) {
                         for ($j = $j0; $j <= $jF; ++$j) {
                             $R->set($i - $i0, $j - $j0, $this->A[$i][$j]);
@@ -280,7 +280,7 @@ 
                     } else {
                         throw new \PHPExcel\Calculation\Exception(self::ARGUMENT_BOUNDS_EXCEPTION);
                     }
-                    $R = new Matrix($m, $n+1);
+                    $R = new Matrix($m, $n + 1);
                     for ($i = 0; $i < $m; ++$i) {
                         for ($j = $j0; $j <= $jF; ++$j) {
                             $R->set($i, $j - $j0, $this->A[$RL[$i]][$j]);
@@ -1099,7 +1099,7 @@ 
             $this->checkMatrixDimensions($M);
             for ($i = 0; $i < $this->m; ++$i) {
                 for ($j = 0; $j < $this->n; ++$j) {
-                    $this->A[$i][$j] = trim($this->A[$i][$j], '"').trim($M->get($i, $j), '"');
+                    $this->A[$i][$j] = trim($this->A[$i][$j], '"') . trim($M->get($i, $j), '"');
                 }
             }
             return $this;

src/PhpSpreadsheet/Shared/JAMA/QRDecomposition.php

Spacing +9 added lines, -9 removed lines

@@ -21,7 +21,7 @@ 
  */
 class QRDecomposition
 {
-    const MATRIX_RANK_EXCEPTION  = "Can only perform operation on full-rank matrix.";
+    const MATRIX_RANK_EXCEPTION = "Can only perform operation on full-rank matrix.";
 
     /**
      *    Array for internal storage of decomposition.
@@ -78,12 +78,12 @@ 
                     }
                     $this->QR[$k][$k] += 1.0;
                     // Apply transformation to remaining columns.
-                    for ($j = $k+1; $j < $this->n; ++$j) {
+                    for ($j = $k + 1; $j < $this->n; ++$j) {
                         $s = 0.0;
                         for ($i = $k; $i < $this->m; ++$i) {
                             $s += $this->QR[$i][$k] * $this->QR[$i][$j];
                         }
-                        $s = -$s/$this->QR[$k][$k];
+                        $s = -$s / $this->QR[$k][$k];
                         for ($i = $k; $i < $this->m; ++$i) {
                             $this->QR[$i][$j] += $s * $this->QR[$i][$k];
                         }
@@ -159,7 +159,7 @@ 
      */
     public function getQ()
     {
-        for ($k = $this->n-1; $k >= 0; --$k) {
+        for ($k = $this->n - 1; $k >= 0; --$k) {
             for ($i = 0; $i < $this->m; ++$i) {
                 $Q[$i][$k] = 0.0;
             }
@@ -170,7 +170,7 @@ 
                     for ($i = $k; $i < $this->m; ++$i) {
                         $s += $this->QR[$i][$k] * $Q[$i][$j];
                     }
-                    $s = -$s/$this->QR[$k][$k];
+                    $s = -$s / $this->QR[$k][$k];
                     for ($i = $k; $i < $this->m; ++$i) {
                         $Q[$i][$j] += $s * $this->QR[$i][$k];
                     }
@@ -209,25 +209,25 @@ 
                         for ($i = $k; $i < $this->m; ++$i) {
                             $s += $this->QR[$i][$k] * $X[$i][$j];
                         }
-                        $s = -$s/$this->QR[$k][$k];
+                        $s = -$s / $this->QR[$k][$k];
                         for ($i = $k; $i < $this->m; ++$i) {
                             $X[$i][$j] += $s * $this->QR[$i][$k];
                         }
                     }
                 }
                 // Solve R*X = Y;
-                for ($k = $this->n-1; $k >= 0; --$k) {
+                for ($k = $this->n - 1; $k >= 0; --$k) {
                     for ($j = 0; $j < $nx; ++$j) {
                         $X[$k][$j] /= $this->Rdiag[$k];
                     }
                     for ($i = 0; $i < $k; ++$i) {
                         for ($j = 0; $j < $nx; ++$j) {
-                            $X[$i][$j] -= $X[$k][$j]* $this->QR[$i][$k];
+                            $X[$i][$j] -= $X[$k][$j] * $this->QR[$i][$k];
                         }
                     }
                 }
                 $X = new Matrix($X);
-                return ($X->getMatrix(0, $this->n-1, 0, $nx));
+                return ($X->getMatrix(0, $this->n - 1, 0, $nx));
             } else {
                 throw new \PHPExcel\Calculation\Exception(self::MATRIX_RANK_EXCEPTION);
             }

src/PhpSpreadsheet/Shared/JAMA/CholeskyDecomposition.php

Spacing +1 added lines, -1 removed lines

@@ -71,7 +71,7 @@
                     }
                 }
 
-                for ($k = $i+1; $k < $this->m; ++$k) {
+                for ($k = $i + 1; $k < $this->m; ++$k) {
                     $this->L[$i][$k] = 0.0;
                 }
             }

src/PhpSpreadsheet/Shared/JAMA/LUDecomposition.php

Spacing +5 added lines, -5 removed lines

@@ -94,7 +94,7 @@ 
                 }
                 // Find pivot and exchange if necessary.
                 $p = $j;
-                for ($i = $j+1; $i < $this->m; ++$i) {
+                for ($i = $j + 1; $i < $this->m; ++$i) {
                     if (abs($LUcolj[$i]) > abs($LUcolj[$p])) {
                         $p = $i;
                     }
@@ -112,7 +112,7 @@ 
                 }
                 // Compute multipliers.
                 if (($j < $this->m) && ($this->LU[$j][$j] != 0.0)) {
-                    for ($i = $j+1; $i < $this->m; ++$i) {
+                    for ($i = $j + 1; $i < $this->m; ++$i) {
                         $this->LU[$i][$j] /= $this->LU[$j][$j];
                     }
                 }
@@ -229,17 +229,17 @@ 
             if ($this->isNonsingular()) {
                 // Copy right hand side with pivoting
                 $nx = $B->getColumnDimension();
-                $X  = $B->getMatrix($this->piv, 0, $nx-1);
+                $X  = $B->getMatrix($this->piv, 0, $nx - 1);
                 // Solve L*Y = B(piv,:)
                 for ($k = 0; $k < $this->n; ++$k) {
-                    for ($i = $k+1; $i < $this->n; ++$i) {
+                    for ($i = $k + 1; $i < $this->n; ++$i) {
                         for ($j = 0; $j < $nx; ++$j) {
                             $X->A[$i][$j] -= $X->A[$k][$j] * $this->LU[$i][$k];
                         }
                     }
                 }
                 // Solve U*X = Y;
-                for ($k = $this->n-1; $k >= 0; --$k) {
+                for ($k = $this->n - 1; $k >= 0; --$k) {
                     for ($j = 0; $j < $nx; ++$j) {
                         $X->A[$k][$j] /= $this->LU[$k][$k];
                     }

src/PhpSpreadsheet/Shared/JAMA/SingularValueDecomposition.php

Spacing +54 added lines, -54 removed lines

@@ -131,27 +131,27 @@ 
                     $e[$k] = hypo($e[$k], $e[$i]);
                 }
                 if ($e[$k] != 0.0) {
-                    if ($e[$k+1] < 0.0) {
+                    if ($e[$k + 1] < 0.0) {
                         $e[$k] = -$e[$k];
                     }
                     for ($i = $k + 1; $i < $this->n; ++$i) {
                         $e[$i] /= $e[$k];
                     }
-                    $e[$k+1] += 1.0;
+                    $e[$k + 1] += 1.0;
                 }
                 $e[$k] = -$e[$k];
-                if (($k+1 < $this->m) and ($e[$k] != 0.0)) {
+                if (($k + 1 < $this->m) and ($e[$k] != 0.0)) {
                     // Apply the transformation.
-                    for ($i = $k+1; $i < $this->m; ++$i) {
+                    for ($i = $k + 1; $i < $this->m; ++$i) {
                         $work[$i] = 0.0;
                     }
-                    for ($j = $k+1; $j < $this->n; ++$j) {
-                        for ($i = $k+1; $i < $this->m; ++$i) {
+                    for ($j = $k + 1; $j < $this->n; ++$j) {
+                        for ($i = $k + 1; $i < $this->m; ++$i) {
                             $work[$i] += $e[$j] * $A[$i][$j];
                         }
                     }
                     for ($j = $k + 1; $j < $this->n; ++$j) {
-                        $t = -$e[$j] / $e[$k+1];
+                        $t = -$e[$j] / $e[$k + 1];
                         for ($i = $k + 1; $i < $this->m; ++$i) {
                             $A[$i][$j] += $t * $work[$i];
                         }
@@ -173,12 +173,12 @@ 
             $this->s[$nct] = $A[$nct][$nct];
         }
         if ($this->m < $p) {
-            $this->s[$p-1] = 0.0;
+            $this->s[$p - 1] = 0.0;
         }
         if ($nrt + 1 < $p) {
-            $e[$nrt] = $A[$nrt][$p-1];
+            $e[$nrt] = $A[$nrt][$p - 1];
         }
-        $e[$p-1] = 0.0;
+        $e[$p - 1] = 0.0;
         // If required, generate U.
         if ($wantu) {
             for ($j = $nct; $j < $nu; ++$j) {
@@ -222,9 +222,9 @@ 
                     for ($j = $k + 1; $j < $nu; ++$j) {
                         $t = 0;
                         for ($i = $k + 1; $i < $this->n; ++$i) {
-                            $t += $this->V[$i][$k]* $this->V[$i][$j];
+                            $t += $this->V[$i][$k] * $this->V[$i][$j];
                         }
-                        $t = -$t / $this->V[$k+1][$k];
+                        $t = -$t / $this->V[$k + 1][$k];
                         for ($i = $k + 1; $i < $this->n; ++$i) {
                             $this->V[$i][$j] += $t * $this->V[$i][$k];
                         }
@@ -256,7 +256,7 @@ 
                 if ($k == -1) {
                     break;
                 }
-                if (abs($e[$k]) <= $eps * (abs($this->s[$k]) + abs($this->s[$k+1]))) {
+                if (abs($e[$k]) <= $eps * (abs($this->s[$k]) + abs($this->s[$k + 1]))) {
                     $e[$k] = 0.0;
                     break;
                 }
@@ -268,7 +268,7 @@ 
                     if ($ks == $k) {
                         break;
                     }
-                    $t = ($ks != $p ? abs($e[$ks]) : 0.) + ($ks != $k + 1 ? abs($e[$ks-1]) : 0.);
+                    $t = ($ks != $p ? abs($e[$ks]) : 0.) + ($ks != $k + 1 ? abs($e[$ks - 1]) : 0.);
                     if (abs($this->s[$ks]) <= $eps * $t) {
                         $this->s[$ks] = 0.0;
                         break;
@@ -276,7 +276,7 @@ 
                 }
                 if ($ks == $k) {
                     $kase = 3;
-                } elseif ($ks == $p-1) {
+                } elseif ($ks == $p - 1) {
                     $kase = 1;
                 } else {
                     $kase = 2;
@@ -289,21 +289,21 @@ 
             switch ($kase) {
                 // Deflate negligible s(p).
                 case 1:
-                    $f = $e[$p-2];
-                    $e[$p-2] = 0.0;
+                    $f = $e[$p - 2];
+                    $e[$p - 2] = 0.0;
                     for ($j = $p - 2; $j >= $k; --$j) {
                         $t  = hypo($this->s[$j], $f);
                         $cs = $this->s[$j] / $t;
                         $sn = $f / $t;
                         $this->s[$j] = $t;
                         if ($j != $k) {
-                            $f = -$sn * $e[$j-1];
-                            $e[$j-1] = $cs * $e[$j-1];
+                            $f = -$sn * $e[$j - 1];
+                            $e[$j - 1] = $cs * $e[$j - 1];
                         }
                         if ($wantv) {
                             for ($i = 0; $i < $this->n; ++$i) {
-                                $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$p-1];
-                                $this->V[$i][$p-1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$p-1];
+                                $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$p - 1];
+                                $this->V[$i][$p - 1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$p - 1];
                                 $this->V[$i][$j] = $t;
                             }
                         }
@@ -311,8 +311,8 @@ 
                     break;
                 // Split at negligible s(k).
                 case 2:
-                    $f = $e[$k-1];
-                    $e[$k-1] = 0.0;
+                    $f = $e[$k - 1];
+                    $e[$k - 1] = 0.0;
                     for ($j = $k; $j < $p; ++$j) {
                         $t = hypo($this->s[$j], $f);
                         $cs = $this->s[$j] / $t;
@@ -322,8 +322,8 @@ 
                         $e[$j] = $cs * $e[$j];
                         if ($wantu) {
                             for ($i = 0; $i < $this->m; ++$i) {
-                                $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$k-1];
-                                $this->U[$i][$k-1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$k-1];
+                                $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$k - 1];
+                                $this->U[$i][$k - 1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$k - 1];
                                 $this->U[$i][$j] = $t;
                             }
                         }
@@ -332,10 +332,10 @@ 
                 // Perform one qr step.
                 case 3:
                     // Calculate the shift.
-                    $scale = max(max(max(max(abs($this->s[$p-1]), abs($this->s[$p-2])), abs($e[$p-2])), abs($this->s[$k])), abs($e[$k]));
-                    $sp   = $this->s[$p-1] / $scale;
-                    $spm1 = $this->s[$p-2] / $scale;
-                    $epm1 = $e[$p-2] / $scale;
+                    $scale = max(max(max(max(abs($this->s[$p - 1]), abs($this->s[$p - 2])), abs($e[$p - 2])), abs($this->s[$k])), abs($e[$k]));
+                    $sp   = $this->s[$p - 1] / $scale;
+                    $spm1 = $this->s[$p - 2] / $scale;
+                    $epm1 = $e[$p - 2] / $scale;
                     $sk   = $this->s[$k] / $scale;
                     $ek   = $e[$k] / $scale;
                     $b    = (($spm1 + $sp) * ($spm1 - $sp) + $epm1 * $epm1) / 2.0;
@@ -351,41 +351,41 @@ 
                     $f = ($sk + $sp) * ($sk - $sp) + $shift;
                     $g = $sk * $ek;
                     // Chase zeros.
-                    for ($j = $k; $j < $p-1; ++$j) {
+                    for ($j = $k; $j < $p - 1; ++$j) {
                         $t  = hypo($f, $g);
-                        $cs = $f/$t;
-                        $sn = $g/$t;
+                        $cs = $f / $t;
+                        $sn = $g / $t;
                         if ($j != $k) {
-                            $e[$j-1] = $t;
+                            $e[$j - 1] = $t;
                         }
                         $f = $cs * $this->s[$j] + $sn * $e[$j];
                         $e[$j] = $cs * $e[$j] - $sn * $this->s[$j];
-                        $g = $sn * $this->s[$j+1];
-                        $this->s[$j+1] = $cs * $this->s[$j+1];
+                        $g = $sn * $this->s[$j + 1];
+                        $this->s[$j + 1] = $cs * $this->s[$j + 1];
                         if ($wantv) {
                             for ($i = 0; $i < $this->n; ++$i) {
-                                $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$j+1];
-                                $this->V[$i][$j+1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$j+1];
+                                $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$j + 1];
+                                $this->V[$i][$j + 1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$j + 1];
                                 $this->V[$i][$j] = $t;
                             }
                         }
                         $t = hypo($f, $g);
-                        $cs = $f/$t;
-                        $sn = $g/$t;
+                        $cs = $f / $t;
+                        $sn = $g / $t;
                         $this->s[$j] = $t;
-                        $f = $cs * $e[$j] + $sn * $this->s[$j+1];
-                        $this->s[$j+1] = -$sn * $e[$j] + $cs * $this->s[$j+1];
-                        $g = $sn * $e[$j+1];
-                        $e[$j+1] = $cs * $e[$j+1];
+                        $f = $cs * $e[$j] + $sn * $this->s[$j + 1];
+                        $this->s[$j + 1] = -$sn * $e[$j] + $cs * $this->s[$j + 1];
+                        $g = $sn * $e[$j + 1];
+                        $e[$j + 1] = $cs * $e[$j + 1];
                         if ($wantu && ($j < $this->m - 1)) {
                             for ($i = 0; $i < $this->m; ++$i) {
-                                $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$j+1];
-                                $this->U[$i][$j+1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$j+1];
+                                $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$j + 1];
+                                $this->U[$i][$j + 1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$j + 1];
                                 $this->U[$i][$j] = $t;
                             }
                         }
                     }
-                    $e[$p-2] = $f;
+                    $e[$p - 2] = $f;
                     $iter = $iter + 1;
                     break;
                 // Convergence.
@@ -401,23 +401,23 @@ 
                     }
                     // Order the singular values.
                     while ($k < $pp) {
-                        if ($this->s[$k] >= $this->s[$k+1]) {
+                        if ($this->s[$k] >= $this->s[$k + 1]) {
                             break;
                         }
                         $t = $this->s[$k];
-                        $this->s[$k] = $this->s[$k+1];
-                        $this->s[$k+1] = $t;
+                        $this->s[$k] = $this->s[$k + 1];
+                        $this->s[$k + 1] = $t;
                         if ($wantv and ($k < $this->n - 1)) {
                             for ($i = 0; $i < $this->n; ++$i) {
-                                $t = $this->V[$i][$k+1];
-                                $this->V[$i][$k+1] = $this->V[$i][$k];
+                                $t = $this->V[$i][$k + 1];
+                                $this->V[$i][$k + 1] = $this->V[$i][$k];
                                 $this->V[$i][$k] = $t;
                             }
                         }
-                        if ($wantu and ($k < $this->m-1)) {
+                        if ($wantu and ($k < $this->m - 1)) {
                             for ($i = 0; $i < $this->m; ++$i) {
-                                $t = $this->U[$i][$k+1];
-                                $this->U[$i][$k+1] = $this->U[$i][$k];
+                                $t = $this->U[$i][$k + 1];
+                                $this->U[$i][$k + 1] = $this->U[$i][$k];
                                 $this->U[$i][$k] = $t;
                             }
                         }

src/PhpSpreadsheet/Shared/JAMA/utils/Error.php

Spacing +1 added lines, -1 removed lines

@@ -23,7 +23,7 @@
 
 define('POLYMORPHIC_ARGUMENT_EXCEPTION', -1);
 $error['EN'][POLYMORPHIC_ARGUMENT_EXCEPTION] = "Invalid argument pattern for polymorphic function.";
-$error['FR'][POLYMORPHIC_ARGUMENT_EXCEPTION] = "Modèle inadmissible d'argument pour la fonction polymorphe.".
+$error['FR'][POLYMORPHIC_ARGUMENT_EXCEPTION] = "Modèle inadmissible d'argument pour la fonction polymorphe." .
 $error['DE'][POLYMORPHIC_ARGUMENT_EXCEPTION] = "Unzulässiges Argumentmuster für polymorphe Funktion.";
 
 define('ARGUMENT_TYPE_EXCEPTION', -2);

src/PhpSpreadsheet/Shared/OLERead.php

Spacing +10 added lines, -10 removed lines

@@ -117,7 +117,7 @@ 
         $bbdBlocks = $this->numBigBlockDepotBlocks;
 
         if ($this->numExtensionBlocks != 0) {
-            $bbdBlocks = (self::BIG_BLOCK_SIZE - self::BIG_BLOCK_DEPOT_BLOCKS_POS)/4;
+            $bbdBlocks = (self::BIG_BLOCK_SIZE - self::BIG_BLOCK_DEPOT_BLOCKS_POS) / 4;
         }
 
         for ($i = 0; $i < $bbdBlocks; ++$i) {
@@ -146,8 +146,8 @@ 
         for ($i = 0; $i < $this->numBigBlockDepotBlocks; ++$i) {
             $pos = ($bigBlockDepotBlocks[$i] + 1) * self::BIG_BLOCK_SIZE;
 
-            $this->bigBlockChain .= substr($this->data, $pos, 4*$bbs);
-            $pos += 4*$bbs;
+            $this->bigBlockChain .= substr($this->data, $pos, 4 * $bbs);
+            $pos += 4 * $bbs;
         }
 
         $pos = 0;
@@ -156,10 +156,10 @@ 
         while ($sbdBlock != -2) {
             $pos = ($sbdBlock + 1) * self::BIG_BLOCK_SIZE;
 
-            $this->smallBlockChain .= substr($this->data, $pos, 4*$bbs);
-            $pos += 4*$bbs;
+            $this->smallBlockChain .= substr($this->data, $pos, 4 * $bbs);
+            $pos += 4 * $bbs;
 
-            $sbdBlock = self::getInt4d($this->bigBlockChain, $sbdBlock*4);
+            $sbdBlock = self::getInt4d($this->bigBlockChain, $sbdBlock * 4);
         }
 
         // read the directory stream
@@ -191,7 +191,7 @@ 
                   $pos = $block * self::SMALL_BLOCK_SIZE;
                 $streamData .= substr($rootdata, $pos, self::SMALL_BLOCK_SIZE);
 
-                $block = self::getInt4d($this->smallBlockChain, $block*4);
+                $block = self::getInt4d($this->smallBlockChain, $block * 4);
             }
 
             return $streamData;
@@ -210,7 +210,7 @@ 
             while ($block != -2) {
                 $pos = ($block + 1) * self::BIG_BLOCK_SIZE;
                 $streamData .= substr($this->data, $pos, self::BIG_BLOCK_SIZE);
-                $block = self::getInt4d($this->bigBlockChain, $block*4);
+                $block = self::getInt4d($this->bigBlockChain, $block * 4);
             }
 
             return $streamData;
@@ -231,7 +231,7 @@ 
         while ($block != -2) {
             $pos = ($block + 1) * self::BIG_BLOCK_SIZE;
             $data .= substr($this->data, $pos, self::BIG_BLOCK_SIZE);
-            $block = self::getInt4d($this->bigBlockChain, $block*4);
+            $block = self::getInt4d($this->bigBlockChain, $block * 4);
         }
         return $data;
     }
@@ -250,7 +250,7 @@ 
             $d = substr($this->entry, $offset, self::PROPERTY_STORAGE_BLOCK_SIZE);
 
             // size in bytes of name
-            $nameSize = ord($d[self::SIZE_OF_NAME_POS]) | (ord($d[self::SIZE_OF_NAME_POS+1]) << 8);
+            $nameSize = ord($d[self::SIZE_OF_NAME_POS]) | (ord($d[self::SIZE_OF_NAME_POS + 1]) << 8);
 
             // type of entry
             $type = ord($d[self::TYPE_POS]);

src/PhpSpreadsheet/Shared/Drawing.php

Spacing +13 added lines, -13 removed lines

@@ -144,7 +144,7 @@ 
      */
     public static function degreesToAngle($pValue = 0)
     {
-        return (int)round($pValue * 60000);
+        return (int) round($pValue * 60000);
     }
 
     /**
@@ -174,7 +174,7 @@ 
         //    Load the image into a string
         $file = fopen($p_sFile, "rb");
         $read = fread($file, 10);
-        while (!feof($file) && ($read<>"")) {
+        while (!feof($file) && ($read <> "")) {
             $read .= fread($file, 1024);
         }
 
@@ -184,15 +184,15 @@ 
 
         //    Process the header
         //    Structure: http://www.fastgraph.com/help/bmp_header_format.html
-        if (substr($header, 0, 4)=="424d") {
+        if (substr($header, 0, 4) == "424d") {
             //    Cut it in parts of 2 bytes
             $header_parts = str_split($header, 2);
 
             //    Get the width        4 bytes
-            $width = hexdec($header_parts[19].$header_parts[18]);
+            $width = hexdec($header_parts[19] . $header_parts[18]);
 
             //    Get the height        4 bytes
-            $height = hexdec($header_parts[23].$header_parts[22]);
+            $height = hexdec($header_parts[23] . $header_parts[22]);
 
             //    Unset the header params
             unset($header_parts);
@@ -211,11 +211,11 @@ 
         //    Calculate if padding at the end-line is needed
         //    Divided by two to keep overview.
         //    1 byte = 2 HEX-chars
-        $body_size = (strlen($body)/2);
-        $header_size = ($width*$height);
+        $body_size = (strlen($body) / 2);
+        $header_size = ($width * $height);
 
         //    Use end-line padding? Only when needed
-        $usePadding = ($body_size>($header_size*3)+4);
+        $usePadding = ($body_size > ($header_size * 3) + 4);
 
         //    Using a for-loop with index-calculation instaid of str_split to avoid large memory consumption
         //    Calculate the next DWORD-position in the body
@@ -225,7 +225,7 @@ 
                 // If padding needed, ignore image-padding
                 // Shift i to the ending of the current 32-bit-block
                 if ($usePadding) {
-                    $i += $width%4;
+                    $i += $width % 4;
                 }
 
                 //    Reset horizontal position
@@ -243,13 +243,13 @@ 
             // Calculation of the RGB-pixel (defined as BGR in image-data)
             // Define $i_pos as absolute position in the body
             $i_pos    = $i * 2;
-            $r        = hexdec($body[$i_pos+4].$body[$i_pos+5]);
-            $g        = hexdec($body[$i_pos+2].$body[$i_pos+3]);
-            $b        = hexdec($body[$i_pos].$body[$i_pos+1]);
+            $r        = hexdec($body[$i_pos + 4] . $body[$i_pos + 5]);
+            $g        = hexdec($body[$i_pos + 2] . $body[$i_pos + 3]);
+            $b        = hexdec($body[$i_pos] . $body[$i_pos + 1]);
 
             // Calculate and draw the pixel
             $color    = imagecolorallocate($image, $r, $g, $b);
-            imagesetpixel($image, $x, $height-$y, $color);
+            imagesetpixel($image, $x, $height - $y, $color);
 
             // Raise the horizontal position
             $x++;