Fix CS/WS issues

Author: sebastianbergmann

src/Chunk.php

@@ -11,12 +11,6 @@
 namespace SebastianBergmann\Diff;
 
 /**
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class Chunk
 {

src/Diff.php

@@ -11,12 +11,6 @@
 namespace SebastianBergmann\Diff;
 
 /**
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class Diff
 {

src/Differ.php

@@ -16,13 +16,6 @@
 
 /**
  * Diff implementation.
- *
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class Differ
 {
@@ -221,8 +214,8 @@ public function diffToArray($from, $to, LongestCommonSubsequence $lcs = null)
     }
 
     /**
-     * @param  array $from
-     * @param  array $to
+     * @param  array                    $from
+     * @param  array                    $to
      * @return LongestCommonSubsequence
      */
     private function selectLcsImplementation(array $from, array $to)
@@ -245,7 +238,7 @@ private function selectLcsImplementation(array $from, array $to)
      *
      * @param  array $from
      * @param  array $to
-     * @return integer
+     * @return int
      */
     private function calculateEstimatedFootprint(array $from, array $to)
     {

src/LCS/LongestCommonSubsequence.php

@@ -12,13 +12,6 @@
 
 /**
  * Interface for implementations of longest common subsequence calculation.
- *
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 interface LongestCommonSubsequence
 {

src/LCS/MemoryEfficientLongestCommonSubsequenceImplementation.php

@@ -12,13 +12,6 @@
 
 /**
  * Memory-efficient implementation of longest common subsequence calculation.
- *
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Denes Lados <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class MemoryEfficientImplementation implements LongestCommonSubsequence
 {
@@ -71,8 +64,8 @@ public function calculate(array $from, array $to)
     }
 
     /**
-     * @param array $from
-     * @param array $to
+     * @param  array $from
+     * @param  array $to
      * @return array
      */
     private function length(array $from, array $to)

src/LCS/TimeEfficientLongestCommonSubsequenceImplementation.php

@@ -12,13 +12,6 @@
 
 /**
  * Time-efficient implementation of longest common subsequence calculation.
- *
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class TimeEfficientImplementation implements LongestCommonSubsequence
 {
@@ -47,7 +40,7 @@ public function calculate(array $from, array $to)
 
         for ($i = 1; $i <= $fromLength; ++$i) {
             for ($j = 1; $j <= $toLength; ++$j) {
-                $o = ($j * $width) + $i;
+                $o          = ($j * $width) + $i;
                 $matrix[$o] = max(
                     $matrix[$o - 1],
                     $matrix[$o - $width],

src/Line.php

@@ -11,17 +11,11 @@
 namespace SebastianBergmann\Diff;
 
 /**
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class Line
 {
-    const ADDED = 1;
-    const REMOVED = 2;
+    const ADDED     = 1;
+    const REMOVED   = 2;
     const UNCHANGED = 3;
 
     /**

src/Parser.php

@@ -12,13 +12,6 @@
 
 /**
  * Unified diff parser.
- *
- * @package    Diff
- * @author     Sebastian Bergmann <[email protected]>
- * @author     Kore Nordmann <[email protected]>
- * @copyright  Sebastian Bergmann <[email protected]>
- * @license    http://www.opensource.org/licenses/BSD-3-Clause  The BSD 3-Clause License
- * @link       http://www.github.com/sebastianbergmann/diff
  */
 class Parser
 {
@@ -78,7 +71,7 @@ private function parseFileDiff(Diff $diff, array $lines)
                     isset($match['endrange']) ? max(1, $match['endrange']) : 1
                 );
 
-                $chunks[] = $chunk;
+                $chunks[]  = $chunk;
                 $diffLines = array();
                 continue;
             }