reginaldojunior / winners

app/Vendor/PHPExcel/PHPExcel/Shared/File.php

Indentation +5 added lines, -5 removed lines

@@ -36,11 +36,11 @@
 class PHPExcel_Shared_File
 {
 	/**
-	  * Verify if a file exists
-	  *
-	  * @param 	string	$pFilename	Filename
-	  * @return bool
-	  */
+	 * Verify if a file exists
+	 *
+	 * @param 	string	$pFilename	Filename
+	 * @return bool
+	 */
 	public static function file_exists($pFilename) {
 		// Sick construction, but it seems that
 		// file_exists returns strange values when

Spacing +9 added lines, -9 removed lines

@@ -45,10 +45,10 @@ 
 		// Sick construction, but it seems that
 		// file_exists returns strange values when
 		// doing the original file_exists on ZIP archives...
-		if ( strtolower(substr($pFilename, 0, 3)) == 'zip' ) {
+		if (strtolower(substr($pFilename, 0, 3)) == 'zip') {
 			// Open ZIP file and verify if the file exists
-			$zipFile 		= substr($pFilename, 6, strpos($pFilename, '#') - 6);
-			$archiveFile 	= substr($pFilename, strpos($pFilename, '#') + 1);
+			$zipFile = substr($pFilename, 6, strpos($pFilename, '#') - 6);
+			$archiveFile = substr($pFilename, strpos($pFilename, '#') + 1);
 
 			$zip = new ZipArchive();
 			if ($zip->open($zipFile) === true) {
@@ -81,8 +81,8 @@ 
 
 		// Found something?
 		if ($returnValue == '' || ($returnValue === NULL)) {
-			$pathArray = explode('/' , $pFilename);
-			while(in_array('..', $pathArray) && $pathArray[0] != '..') {
+			$pathArray = explode('/', $pFilename);
+			while (in_array('..', $pathArray) && $pathArray[0] != '..') {
 				for ($i = 0; $i < count($pathArray); ++$i) {
 					if ($pathArray[$i] == '..' && $i > 0) {
 						unset($pathArray[$i]);
@@ -108,14 +108,14 @@ 
 		// sys_get_temp_dir is only available since PHP 5.2.1
 		// http://php.net/manual/en/function.sys-get-temp-dir.php#94119
 
-		if ( !function_exists('sys_get_temp_dir')) {
-			if ($temp = getenv('TMP') ) {
+		if ( ! function_exists('sys_get_temp_dir')) {
+			if ($temp = getenv('TMP')) {
 				if (file_exists($temp)) { return realpath($temp); }
 			}
-			if ($temp = getenv('TEMP') ) {
+			if ($temp = getenv('TEMP')) {
 				if (file_exists($temp)) { return realpath($temp); }
 			}
-			if ($temp = getenv('TMPDIR') ) {
+			if ($temp = getenv('TMPDIR')) {
 				if (file_exists($temp)) { return realpath($temp); }
 			}
 

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/CholeskyDecomposition.php

Spacing +4 added lines, -4 removed lines

@@ -50,9 +50,9 @@ 
 			$this->L = $A->getArray();
 			$this->m = $A->getRowDimension();
 
-			for($i = 0; $i < $this->m; ++$i) {
-				for($j = $i; $j < $this->m; ++$j) {
-					for($sum = $this->L[$i][$j], $k = $i - 1; $k >= 0; --$k) {
+			for ($i = 0; $i < $this->m; ++$i) {
+				for ($j = $i; $j < $this->m; ++$j) {
+					for ($sum = $this->L[$i][$j], $k = $i - 1; $k >= 0; --$k) {
 						$sum -= $this->L[$i][$k] * $this->L[$j][$k];
 					}
 					if ($i == $j) {
@@ -68,7 +68,7 @@ 
 					}
 				}
 
-				for ($k = $i+1; $k < $this->m; ++$k) {
+				for ($k = $i + 1; $k < $this->m; ++$k) {
 					$this->L[$i][$k] = 0.0;
 				}
 			}

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/EigenvalueDecomposition.php

Indentation +9 added lines, -9 removed lines

@@ -49,21 +49,21 @@
 	private $V = array();
 
 	/**
-	*	Array for internal storage of nonsymmetric Hessenberg form.
-	*	@var array
-	*/
+	 *	Array for internal storage of nonsymmetric Hessenberg form.
+	 *	@var array
+	 */
 	private $H = array();
 
 	/**
-	*	Working storage for nonsymmetric algorithm.
-	*	@var array
-	*/
+	 *	Working storage for nonsymmetric algorithm.
+	 *	@var array
+	 */
 	private $ort;
 
 	/**
-	*	Used for complex scalar division.
-	*	@var float
-	*/
+	 *	Used for complex scalar division.
+	 *	@var float
+	 */
 	private $cdivr;
 	private $cdivi;
 

Spacing +120 added lines, -120 removed lines

@@ -73,15 +73,15 @@ 
 	 *
 	 *	@access private
 	 */
-	private function tred2 () {
+	private function tred2() {
 		//  This is derived from the Algol procedures tred2 by
 		//  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));
@@ -113,7 +113,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;
 					}
@@ -125,7 +125,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) {
@@ -134,7 +134,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;
 				}
 			}
@@ -142,18 +142,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];
@@ -161,13 +161,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;
 	}
 
@@ -184,12 +184,12 @@ 
 	 */
 	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);
+		$eps  = pow(2.0, -52.0);
 
 		for ($l = 0; $l < $this->n; ++$l) {
 			// Find small subdiagonal element
@@ -209,13 +209,13 @@ 
 					$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;
@@ -226,22 +226,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;
 						}
 					}
@@ -259,7 +259,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];
@@ -288,21 +288,21 @@ 
 	 *
 	 *	@access private
 	 */
-	private function orthes () {
+	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);
@@ -334,7 +334,7 @@ 
 					}
 				}
 				$this->ort[$m] = $scale * $this->ort[$m];
-				$this->H[$m][$m-1] = $scale * $g;
+				$this->H[$m][$m - 1] = $scale * $g;
 			}
 		}
 
@@ -344,10 +344,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;
@@ -355,7 +355,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];
 					}
@@ -395,7 +395,7 @@ 
 	 *
 	 *	@access private
 	 */
-	private function hqr2 () {
+	private function hqr2() {
 		//  Initialize
 		$nn = $this->n;
 		$n  = $nn - 1;
@@ -412,7 +412,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]);
 			}
 		}
@@ -423,11 +423,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;
@@ -441,13 +441,13 @@ 
 				--$n;
 				$iter = 0;
 			// Two roots found
-			} else if ($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;
+			} else if ($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) {
@@ -456,14 +456,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;
@@ -471,28 +471,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;
@@ -504,8 +504,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) {
@@ -513,7 +513,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;
 				}
@@ -542,9 +542,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;
@@ -552,25 +552,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;
@@ -587,9 +587,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;
@@ -599,33 +599,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
@@ -637,14 +637,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) {
@@ -663,15 +663,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
@@ -685,24 +685,24 @@ 
 				}
 			// Complex vector
 			} else if ($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;
@@ -714,34 +714,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;
 							}
 						}
@@ -760,10 +760,10 @@ 
 		}
 
 		// 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) {
+				for ($k = $low; $k <= min($j, $high); ++$k) {
 					$z = $z + $this->V[$i][$k] * $this->H[$k][$j];
 				}
 				$this->V[$i][$j] = $z;

Braces +9 added lines, -6 removed lines

@@ -196,8 +196,9 @@ 
 			$tst1 = max($tst1, abs($this->d[$l]) + abs($this->e[$l]));
 			$m = $l;
 			while ($m < $this->n) {
-				if (abs($this->e[$m]) <= $eps * $tst1)
-					break;
+				if (abs($this->e[$m]) <= $eps * $tst1) {
+									break;
+				}
 				++$m;
 			}
 			// If m == l, $this->d[l] is an eigenvalue,
@@ -211,14 +212,16 @@ 
 					$g = $this->d[$l];
 					$p = ($this->d[$l+1] - $g) / (2.0 * $this->e[$l]);
 					$r = hypo($p, 1.0);
-					if ($p < 0)
-						$r *= -1;
+					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];
 					$h = $g - $this->d[$l];
-					for ($i = $l + 2; $i < $this->n; ++$i)
-						$this->d[$i] -= $h;
+					for ($i = $l + 2; $i < $this->n; ++$i) {
+											$this->d[$i] -= $h;
+					}
 					$f += $h;
 					// Implicit QL transformation.
 					$p = $this->d[$m];

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/SingularValueDecomposition.php

Spacing +61 added lines, -61 removed lines

@@ -17,7 +17,7 @@ 
  *	@license PHP v3.0
  *	@version 1.1
  */
-class SingularValueDecomposition  {
+class SingularValueDecomposition {
 
 	/**
 	 *	Internal storage of U.
@@ -74,7 +74,7 @@ 
 
 		// Reduce A to bidiagonal form, storing the diagonal elements
 		// in s and the super-diagonal elements in e.
-		for ($k = 0; $k < max($nct,$nrt); ++$k) {
+		for ($k = 0; $k < max($nct, $nrt); ++$k) {
 
 			if ($k < $nct) {
 				// Compute the transformation for the k-th column and
@@ -130,27 +130,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];
 						}
@@ -172,12 +172,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) {
@@ -198,7 +198,7 @@ 
 							$this->U[$i][$j] += $t * $this->U[$i][$k];
 						}
 					}
-					for ($i = $k; $i < $this->m; ++$i ) {
+					for ($i = $k; $i < $this->m; ++$i) {
 						$this->U[$i][$k] = -$this->U[$i][$k];
 					}
 					$this->U[$k][$k] = 1.0 + $this->U[$k][$k];
@@ -221,9 +221,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];
 						}
@@ -255,7 +255,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;
 				}
@@ -267,15 +267,15 @@ 
 					if ($ks == $k) {
 						break;
 					}
-					$t = ($ks != $p ? abs($e[$ks]) : 0.) + ($ks != $k + 1 ? abs($e[$ks-1]) : 0.);
-					if (abs($this->s[$ks]) <= $eps * $t)  {
+					$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;
 					}
 				}
 				if ($ks == $k) {
 					$kase = 3;
-				} else if ($ks == $p-1) {
+				} else if ($ks == $p - 1) {
 					$kase = 1;
 				} else {
 					$kase = 2;
@@ -288,21 +288,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);
+							$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;
 								}
 							}
@@ -310,8 +310,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;
@@ -321,8 +321,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,11 +332,11 @@ 
 				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[$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;
+						$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;
@@ -352,41 +352,41 @@ 
 						$f = ($sk + $sp) * ($sk - $sp) + $shift;
 						$g = $sk * $ek;
 						// Chase zeros.
-						for ($j = $k; $j < $p-1; ++$j) {
-							$t  = hypo($f,$g);
-							$cs = $f/$t;
-							$sn = $g/$t;
+						for ($j = $k; $j < $p - 1; ++$j) {
+							$t  = hypo($f, $g);
+							$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;
+							$t = hypo($f, $g);
+							$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.
@@ -402,23 +402,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;
 								}
 							}

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/docs/download.php

Spacing +2 added lines, -2 removed lines

@@ -25,11 +25,11 @@
 
 $tarPath = $buildDir.$pkgName."/downloads/".$tarName;
 
-if($_GET['op'] == "download") {  
+if ($_GET['op'] == "download") {  
   
 	require_once('Archive/Tar.php');  
 	
-	$tar   = new Archive_Tar($tarPath);
+	$tar = new Archive_Tar($tarPath);
 
   // create $pkgName archive under $pkgName folder
   $files = glob("$pkgName/*.php");

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/docs/package.php

Indentation +1 added lines, -1 removed lines

@@ -11,7 +11,7 @@
   $files = glob("*.php");
   $files = array_merge($files, glob("util/*.php"));
   foreach ($files as $fileName) {
-    ?>
+	?>
   	<li><a href="package.php?view=<?php echo sha1($fileName);?>"><?php echo $fileName;?></a>&nbsp;-&nbsp;<?php echo date ("F d Y - g:i a", filemtime($fileName));?></li>
     <?php
   }

Spacing +3 added lines, -3 removed lines

@@ -12,19 +12,19 @@
   $files = array_merge($files, glob("util/*.php"));
   foreach ($files as $fileName) {
     ?>
-  	<li><a href="package.php?view=<?php echo sha1($fileName);?>"><?php echo $fileName;?></a>&nbsp;-&nbsp;<?php echo date ("F d Y - g:i a", filemtime($fileName));?></li>
+  	<li><a href="package.php?view=<?php echo sha1($fileName); ?>"><?php echo $fileName; ?></a>&nbsp;-&nbsp;<?php echo date("F d Y - g:i a", filemtime($fileName)); ?></li>
     <?php
   }
   ?>
 </ul>
 <?php
-if( isset($_REQUEST['view']) ) {
+if (isset($_REQUEST['view'])) {
 	$hash = $_REQUEST['view'];
 	$n = array_search($hash, array_map(sha1, $files));
 	$fileName = $files[$n];
   ?>
   <hr />  
-	Viewing: <?php echo $fileName;?>	
+	Viewing: <?php echo $fileName; ?>	
 	<hr />
 	<?php
 	highlight_file($fileName);

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/examples/LagrangeInterpolation.php

Spacing +3 added lines, -3 removed lines

@@ -23,13 +23,13 @@
 	public function findPolynomialFactors($x, $y) {
 		$n = count($x);
 
-		$data = array();  // double[n][n];
-		$rhs  = array();  // double[n];
+		$data = array(); // double[n][n];
+		$rhs  = array(); // double[n];
 
 		for ($i = 0; $i < $n; ++$i) {
 			$v = 1;
 			for ($j = 0; $j < $n; ++$j) {
-				$data[$i][$n-$j-1] = $v;
+				$data[$i][$n - $j - 1] = $v;
 				$v *= $x[$i];
 			}
 			$rhs[$i] = $y[$i];

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/examples/MagicSquareExample.php

Indentation +119 added lines, -119 removed lines

@@ -11,94 +11,94 @@ 
 class MagicSquareExample {
 
   /**
-  * Generate magic square test matrix.
-  * @param int n dimension of matrix
-  */
+   * Generate magic square test matrix.
+   * @param int n dimension of matrix
+   */
   function magic($n) {
 
-    // Odd order
-
-    if (($n % 2) == 1) {
-      $a = ($n+1)/2;
-      $b = ($n+1);
-      for ($j = 0; $j < $n; ++$j)
-        for ($i = 0; $i < $n; ++$i)
-          $M[$i][$j] = $n*(($i+$j+$a) % $n) + (($i+2*$j+$b) % $n) + 1;
-
-    // Doubly Even Order
-
-    } else if (($n % 4) == 0) {
-      for ($j = 0; $j < $n; ++$j) {
-        for ($i = 0; $i < $n; ++$i) {
-          if ((($i+1)/2)%2 == (($j+1)/2)%2)
-            $M[$i][$j] = $n*$n-$n*$i-$j;
-          else
-            $M[$i][$j] = $n*$i+$j+1;
-        }
-      }
-
-    // Singly Even Order
-
-    } else {
-
-      $p = $n/2;
-      $k = ($n-2)/4;
-      $A = $this->magic($p);
-      $M = array();
-      for ($j = 0; $j < $p; ++$j) {
-        for ($i = 0; $i < $p; ++$i) {
-          $aij = $A->get($i,$j);
-          $M[$i][$j]       = $aij;
-          $M[$i][$j+$p]    = $aij + 2*$p*$p;
-          $M[$i+$p][$j]    = $aij + 3*$p*$p;
-          $M[$i+$p][$j+$p] = $aij + $p*$p;
-        }
-      }
-
-      for ($i = 0; $i < $p; ++$i) {
-        for ($j = 0; $j < $k; ++$j) {
-          $t = $M[$i][$j];
-          $M[$i][$j] = $M[$i+$p][$j];
-          $M[$i+$p][$j] = $t;
-        }
-        for ($j = $n-$k+1; $j < $n; ++$j) {
-          $t = $M[$i][$j];
-          $M[$i][$j] = $M[$i+$p][$j];
-          $M[$i+$p][$j] = $t;
-        }
-      }
-
-      $t = $M[$k][0];  $M[$k][0]  = $M[$k+$p][0];  $M[$k+$p][0]  = $t;
-      $t = $M[$k][$k]; $M[$k][$k] = $M[$k+$p][$k]; $M[$k+$p][$k] = $t;
-
-    }
-
-    return new Matrix($M);
+	// Odd order
+
+	if (($n % 2) == 1) {
+	  $a = ($n+1)/2;
+	  $b = ($n+1);
+	  for ($j = 0; $j < $n; ++$j)
+		for ($i = 0; $i < $n; ++$i)
+		  $M[$i][$j] = $n*(($i+$j+$a) % $n) + (($i+2*$j+$b) % $n) + 1;
+
+	// Doubly Even Order
+
+	} else if (($n % 4) == 0) {
+	  for ($j = 0; $j < $n; ++$j) {
+		for ($i = 0; $i < $n; ++$i) {
+		  if ((($i+1)/2)%2 == (($j+1)/2)%2)
+			$M[$i][$j] = $n*$n-$n*$i-$j;
+		  else
+			$M[$i][$j] = $n*$i+$j+1;
+		}
+	  }
+
+	// Singly Even Order
+
+	} else {
+
+	  $p = $n/2;
+	  $k = ($n-2)/4;
+	  $A = $this->magic($p);
+	  $M = array();
+	  for ($j = 0; $j < $p; ++$j) {
+		for ($i = 0; $i < $p; ++$i) {
+		  $aij = $A->get($i,$j);
+		  $M[$i][$j]       = $aij;
+		  $M[$i][$j+$p]    = $aij + 2*$p*$p;
+		  $M[$i+$p][$j]    = $aij + 3*$p*$p;
+		  $M[$i+$p][$j+$p] = $aij + $p*$p;
+		}
+	  }
+
+	  for ($i = 0; $i < $p; ++$i) {
+		for ($j = 0; $j < $k; ++$j) {
+		  $t = $M[$i][$j];
+		  $M[$i][$j] = $M[$i+$p][$j];
+		  $M[$i+$p][$j] = $t;
+		}
+		for ($j = $n-$k+1; $j < $n; ++$j) {
+		  $t = $M[$i][$j];
+		  $M[$i][$j] = $M[$i+$p][$j];
+		  $M[$i+$p][$j] = $t;
+		}
+	  }
+
+	  $t = $M[$k][0];  $M[$k][0]  = $M[$k+$p][0];  $M[$k+$p][0]  = $t;
+	  $t = $M[$k][$k]; $M[$k][$k] = $M[$k+$p][$k]; $M[$k+$p][$k] = $t;
+
+	}
+
+	return new Matrix($M);
 
   }
 
   /**
-  * Simple function to replicate PHP 5 behaviour
-  */
+   * Simple function to replicate PHP 5 behaviour
+   */
   function microtime_float() {
-    list($usec, $sec) = explode(" ", microtime());
-    return ((float)$usec + (float)$sec);
+	list($usec, $sec) = explode(" ", microtime());
+	return ((float)$usec + (float)$sec);
   }
 
   /**
-  * Tests LU, QR, SVD and symmetric Eig decompositions.
-  *
-  *   n       = order of magic square.
-  *   trace   = diagonal sum, should be the magic sum, (n^3 + n)/2.
-  *   max_eig = maximum eigenvalue of (A + A')/2, should equal trace.
-  *   rank    = linear algebraic rank, should equal n if n is odd,
-  *             be less than n if n is even.
-  *   cond    = L_2 condition number, ratio of singular values.
-  *   lu_res  = test of LU factorization, norm1(L*U-A(p,:))/(n*eps).
-  *   qr_res  = test of QR factorization, norm1(Q*R-A)/(n*eps).
-  */
+   * Tests LU, QR, SVD and symmetric Eig decompositions.
+   *
+   *   n       = order of magic square.
+   *   trace   = diagonal sum, should be the magic sum, (n^3 + n)/2.
+   *   max_eig = maximum eigenvalue of (A + A')/2, should equal trace.
+   *   rank    = linear algebraic rank, should equal n if n is odd,
+   *             be less than n if n is even.
+   *   cond    = L_2 condition number, ratio of singular values.
+   *   lu_res  = test of LU factorization, norm1(L*U-A(p,:))/(n*eps).
+   *   qr_res  = test of QR factorization, norm1(Q*R-A)/(n*eps).
+   */
   function main() {
-    ?>
+	?>
     <p>Test of Matrix Class, using magic squares.</p>
     <p>See MagicSquareExample.main() for an explanation.</p>
     <table border='1' cellspacing='0' cellpadding='4'>
@@ -112,65 +112,65 @@ 
         <th>qr_res</th>
       </tr>
       <?php
-      $start_time = $this->microtime_float();
-      $eps = pow(2.0,-52.0);
-      for ($n = 3; $n <= 6; ++$n) {
-        echo "<tr>";
+	  $start_time = $this->microtime_float();
+	  $eps = pow(2.0,-52.0);
+	  for ($n = 3; $n <= 6; ++$n) {
+		echo "<tr>";
 
-        echo "<td align='right'>$n</td>";
+		echo "<td align='right'>$n</td>";
 
-        $M = $this->magic($n);
-        $t = (int) $M->trace();
+		$M = $this->magic($n);
+		$t = (int) $M->trace();
 
-        echo "<td align='right'>$t</td>";
+		echo "<td align='right'>$t</td>";
 
-        $O = $M->plus($M->transpose());
-        $E = new EigenvalueDecomposition($O->times(0.5));
-        $d = $E->getRealEigenvalues();
+		$O = $M->plus($M->transpose());
+		$E = new EigenvalueDecomposition($O->times(0.5));
+		$d = $E->getRealEigenvalues();
 
-        echo "<td align='right'>".$d[$n-1]."</td>";
+		echo "<td align='right'>".$d[$n-1]."</td>";
 
-        $r = $M->rank();
+		$r = $M->rank();
 
-        echo "<td align='right'>".$r."</td>";
+		echo "<td align='right'>".$r."</td>";
 
-        $c = $M->cond();
+		$c = $M->cond();
 
-        if ($c < 1/$eps)
-          echo "<td align='right'>".sprintf("%.3f",$c)."</td>";
-        else
-          echo "<td align='right'>Inf</td>";
+		if ($c < 1/$eps)
+		  echo "<td align='right'>".sprintf("%.3f",$c)."</td>";
+		else
+		  echo "<td align='right'>Inf</td>";
 
-        $LU = new LUDecomposition($M);
-        $L = $LU->getL();
-        $U = $LU->getU();
-        $p = $LU->getPivot();
-        // Java version: R = L.times(U).minus(M.getMatrix(p,0,n-1));
-        $S = $L->times($U);
-        $R = $S->minus($M->getMatrix($p,0,$n-1));
-        $res = $R->norm1()/($n*$eps);
+		$LU = new LUDecomposition($M);
+		$L = $LU->getL();
+		$U = $LU->getU();
+		$p = $LU->getPivot();
+		// Java version: R = L.times(U).minus(M.getMatrix(p,0,n-1));
+		$S = $L->times($U);
+		$R = $S->minus($M->getMatrix($p,0,$n-1));
+		$res = $R->norm1()/($n*$eps);
 
-        echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
+		echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
 
-        $QR = new QRDecomposition($M);
-        $Q = $QR->getQ();
-        $R = $QR->getR();
-        $S = $Q->times($R);
-        $R = $S->minus($M);
-        $res = $R->norm1()/($n*$eps);
+		$QR = new QRDecomposition($M);
+		$Q = $QR->getQ();
+		$R = $QR->getR();
+		$S = $Q->times($R);
+		$R = $S->minus($M);
+		$res = $R->norm1()/($n*$eps);
 
-        echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
+		echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
 
-        echo "</tr>";
+		echo "</tr>";
 
-     }
-     echo "<table>";
-     echo "<br />";
+	 }
+	 echo "<table>";
+	 echo "<br />";
 
-     $stop_time = $this->microtime_float();
-     $etime = $stop_time - $start_time;
+	 $stop_time = $this->microtime_float();
+	 $etime = $stop_time - $start_time;
 
-     echo "<p>Elapsed time is ". sprintf("%.4f",$etime) ." seconds.</p>";
+	 echo "<p>Elapsed time is ". sprintf("%.4f",$etime) ." seconds.</p>";
 
   }
 

Spacing +30 added lines, -30 removed lines

@@ -19,21 +19,21 @@ 
     // Odd order
 
     if (($n % 2) == 1) {
-      $a = ($n+1)/2;
-      $b = ($n+1);
+      $a = ($n + 1) / 2;
+      $b = ($n + 1);
       for ($j = 0; $j < $n; ++$j)
         for ($i = 0; $i < $n; ++$i)
-          $M[$i][$j] = $n*(($i+$j+$a) % $n) + (($i+2*$j+$b) % $n) + 1;
+          $M[$i][$j] = $n * (($i + $j + $a) % $n) + (($i + 2 * $j + $b) % $n) + 1;
 
     // Doubly Even Order
 
     } else if (($n % 4) == 0) {
       for ($j = 0; $j < $n; ++$j) {
         for ($i = 0; $i < $n; ++$i) {
-          if ((($i+1)/2)%2 == (($j+1)/2)%2)
-            $M[$i][$j] = $n*$n-$n*$i-$j;
+          if ((($i + 1) / 2) % 2 == (($j + 1) / 2) % 2)
+            $M[$i][$j] = $n * $n - $n * $i - $j;
           else
-            $M[$i][$j] = $n*$i+$j+1;
+            $M[$i][$j] = $n * $i + $j + 1;
         }
       }
 
@@ -41,35 +41,35 @@ 
 
     } else {
 
-      $p = $n/2;
-      $k = ($n-2)/4;
+      $p = $n / 2;
+      $k = ($n - 2) / 4;
       $A = $this->magic($p);
       $M = array();
       for ($j = 0; $j < $p; ++$j) {
         for ($i = 0; $i < $p; ++$i) {
-          $aij = $A->get($i,$j);
+          $aij = $A->get($i, $j);
           $M[$i][$j]       = $aij;
-          $M[$i][$j+$p]    = $aij + 2*$p*$p;
-          $M[$i+$p][$j]    = $aij + 3*$p*$p;
-          $M[$i+$p][$j+$p] = $aij + $p*$p;
+          $M[$i][$j + $p]    = $aij + 2 * $p * $p;
+          $M[$i + $p][$j]    = $aij + 3 * $p * $p;
+          $M[$i + $p][$j + $p] = $aij + $p * $p;
         }
       }
 
       for ($i = 0; $i < $p; ++$i) {
         for ($j = 0; $j < $k; ++$j) {
           $t = $M[$i][$j];
-          $M[$i][$j] = $M[$i+$p][$j];
-          $M[$i+$p][$j] = $t;
+          $M[$i][$j] = $M[$i + $p][$j];
+          $M[$i + $p][$j] = $t;
         }
-        for ($j = $n-$k+1; $j < $n; ++$j) {
+        for ($j = $n - $k + 1; $j < $n; ++$j) {
           $t = $M[$i][$j];
-          $M[$i][$j] = $M[$i+$p][$j];
-          $M[$i+$p][$j] = $t;
+          $M[$i][$j] = $M[$i + $p][$j];
+          $M[$i + $p][$j] = $t;
         }
       }
 
-      $t = $M[$k][0];  $M[$k][0]  = $M[$k+$p][0];  $M[$k+$p][0]  = $t;
-      $t = $M[$k][$k]; $M[$k][$k] = $M[$k+$p][$k]; $M[$k+$p][$k] = $t;
+      $t = $M[$k][0]; $M[$k][0]  = $M[$k + $p][0]; $M[$k + $p][0]  = $t;
+      $t = $M[$k][$k]; $M[$k][$k] = $M[$k + $p][$k]; $M[$k + $p][$k] = $t;
 
     }
 
@@ -82,7 +82,7 @@ 
   */
   function microtime_float() {
     list($usec, $sec) = explode(" ", microtime());
-    return ((float)$usec + (float)$sec);
+    return ((float) $usec + (float) $sec);
   }
 
   /**
@@ -113,7 +113,7 @@ 
       </tr>
       <?php
       $start_time = $this->microtime_float();
-      $eps = pow(2.0,-52.0);
+      $eps = pow(2.0, -52.0);
       for ($n = 3; $n <= 6; ++$n) {
         echo "<tr>";
 
@@ -128,7 +128,7 @@ 
         $E = new EigenvalueDecomposition($O->times(0.5));
         $d = $E->getRealEigenvalues();
 
-        echo "<td align='right'>".$d[$n-1]."</td>";
+        echo "<td align='right'>".$d[$n - 1]."</td>";
 
         $r = $M->rank();
 
@@ -136,8 +136,8 @@ 
 
         $c = $M->cond();
 
-        if ($c < 1/$eps)
-          echo "<td align='right'>".sprintf("%.3f",$c)."</td>";
+        if ($c < 1 / $eps)
+          echo "<td align='right'>".sprintf("%.3f", $c)."</td>";
         else
           echo "<td align='right'>Inf</td>";
 
@@ -147,19 +147,19 @@ 
         $p = $LU->getPivot();
         // Java version: R = L.times(U).minus(M.getMatrix(p,0,n-1));
         $S = $L->times($U);
-        $R = $S->minus($M->getMatrix($p,0,$n-1));
-        $res = $R->norm1()/($n*$eps);
+        $R = $S->minus($M->getMatrix($p, 0, $n - 1));
+        $res = $R->norm1() / ($n * $eps);
 
-        echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
+        echo "<td align='right'>".sprintf("%.3f", $res)."</td>";
 
         $QR = new QRDecomposition($M);
         $Q = $QR->getQ();
         $R = $QR->getR();
         $S = $Q->times($R);
         $R = $S->minus($M);
-        $res = $R->norm1()/($n*$eps);
+        $res = $R->norm1() / ($n * $eps);
 
-        echo "<td align='right'>".sprintf("%.3f",$res)."</td>";
+        echo "<td align='right'>".sprintf("%.3f", $res)."</td>";
 
         echo "</tr>";
 
@@ -170,7 +170,7 @@ 
      $stop_time = $this->microtime_float();
      $etime = $stop_time - $start_time;
 
-     echo "<p>Elapsed time is ". sprintf("%.4f",$etime) ." seconds.</p>";
+     echo "<p>Elapsed time is ".sprintf("%.4f", $etime)." seconds.</p>";
 
   }
 

Braces +16 added lines, -11 removed lines

@@ -21,19 +21,23 @@ 
     if (($n % 2) == 1) {
       $a = ($n+1)/2;
       $b = ($n+1);
-      for ($j = 0; $j < $n; ++$j)
-        for ($i = 0; $i < $n; ++$i)
-          $M[$i][$j] = $n*(($i+$j+$a) % $n) + (($i+2*$j+$b) % $n) + 1;
+      for ($j = 0; $j < $n; ++$j) {
+              for ($i = 0;
+      }
+      $i < $n; ++$i) {
+                  $M[$i][$j] = $n*(($i+$j+$a) % $n) + (($i+2*$j+$b) % $n) + 1;
+        }
 
     // Doubly Even Order
 
     } else if (($n % 4) == 0) {
       for ($j = 0; $j < $n; ++$j) {
         for ($i = 0; $i < $n; ++$i) {
-          if ((($i+1)/2)%2 == (($j+1)/2)%2)
-            $M[$i][$j] = $n*$n-$n*$i-$j;
-          else
-            $M[$i][$j] = $n*$i+$j+1;
+          if ((($i+1)/2)%2 == (($j+1)/2)%2) {
+                      $M[$i][$j] = $n*$n-$n*$i-$j;
+          } else {
+                      $M[$i][$j] = $n*$i+$j+1;
+          }
         }
       }
 
@@ -136,10 +140,11 @@ 
 
         $c = $M->cond();
 
-        if ($c < 1/$eps)
-          echo "<td align='right'>".sprintf("%.3f",$c)."</td>";
-        else
-          echo "<td align='right'>Inf</td>";
+        if ($c < 1/$eps) {
+                  echo "<td align='right'>".sprintf("%.3f",$c)."</td>";
+        } else {
+                  echo "<td align='right'>Inf</td>";
+        }
 
         $LU = new LUDecomposition($M);
         $L = $LU->getL();

app/Vendor/PHPExcel/PHPExcel/Shared/JAMA/examples/benchmark.php

Spacing +20 added lines, -20 removed lines

@@ -23,7 +23,7 @@ 
 	function microtime_float() {
 		list($usec, $sec) = explode(" ", microtime());
 
-		return ((float)$usec + (float)$sec);
+		return ((float) $usec + (float) $sec);
 	}	//	function microtime_float()
 
 
@@ -32,13 +32,13 @@ 
 		$stats = $this->stat->calcFull();
 
 		echo '<table style="margin-left:32px;">';
-		echo '<tr><td style="text-align:right;"><b>n:</b><td style="text-align:right;">' . $stats['count'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>Mean:</b><td style="text-align:right;">' . $stats['mean'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>Min.:</b><td style="text-align:right;">' . $stats['min'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>Max.:</b><td style="text-align:right;">' . $stats['max'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>&sigma;:</b><td style="text-align:right;">' . $stats['stdev'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>Variance:</b><td style="text-align:right;">' . $stats['variance'] . ' </td></tr>';
-		echo '<tr><td style="text-align:right;"><b>Range:</b><td style="text-align:right;">' . $stats['range'] . ' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>n:</b><td style="text-align:right;">'.$stats['count'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>Mean:</b><td style="text-align:right;">'.$stats['mean'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>Min.:</b><td style="text-align:right;">'.$stats['min'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>Max.:</b><td style="text-align:right;">'.$stats['max'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>&sigma;:</b><td style="text-align:right;">'.$stats['stdev'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>Variance:</b><td style="text-align:right;">'.$stats['variance'].' </td></tr>';
+		echo '<tr><td style="text-align:right;"><b>Range:</b><td style="text-align:right;">'.$stats['range'].' </td></tr>';
 		echo '</table>';
 
 		return $stats;
@@ -165,7 +165,7 @@ 
 
 $benchmark = new Benchmark();
 
-switch($_REQUEST['decomposition']) {
+switch ($_REQUEST['decomposition']) {
 	case 'cholesky':
 		$m = array();
 		for ($i = 2; $i <= 8; $i *= 2) {
@@ -176,8 +176,8 @@ 
 			echo "<br />";
 		}
 		echo '<pre>';
-		foreach($m as $x => $y) {
-			echo "$x\t" . 1000*$y . "\n";
+		foreach ($m as $x => $y) {
+			echo "$x\t".1000 * $y."\n";
 		}
 		echo '</pre>';
 		break;
@@ -191,8 +191,8 @@ 
 			echo "<br />";
 		}
 		echo '<pre>';
-		foreach($m as $x => $y) {
-			echo "$x\t" . 1000*$y . "\n";
+		foreach ($m as $x => $y) {
+			echo "$x\t".1000 * $y."\n";
 		}
 		echo '</pre>';
 		break;
@@ -206,8 +206,8 @@ 
 			echo "<br />";
 		}
 		echo '<pre>';
-		foreach($m as $x => $y) {
-			echo "$x\t" . 1000*$y . "\n";
+		foreach ($m as $x => $y) {
+			echo "$x\t".1000 * $y."\n";
 		}
 		echo '</pre>';
 		break;
@@ -221,14 +221,14 @@ 
 			echo "<br />";
 		}
 		echo '<pre>';
-		foreach($m as $x => $y) {
-			echo "$x\t" . 1000*$y . "\n";
+		foreach ($m as $x => $y) {
+			echo "$x\t".1000 * $y."\n";
 		}
 		echo '</pre>';
 		break;
 	case 'svd':
 		$m = array();
-		for($i = 2; $i <= 8; $i *= 2) {
+		for ($i = 2; $i <= 8; $i *= 2) {
 			$t = 32 / $i;
 			echo "<b>Singular value decomposition: $t random {$i}x{$i} matrices</b><br />";
 			$s = $benchmark->displayStats($benchmark->runSVD($i, $t));
@@ -236,8 +236,8 @@ 
 			echo "<br />";
 		}
 		echo '<pre>';
-		foreach($m as $x => $y) {
-			echo "$x\t" . 1000*$y . "\n";
+		foreach ($m as $x => $y) {
+			echo "$x\t".1000 * $y."\n";
 		}
 		echo '</pre>';
 		break;