/script/lib/PHPUnit/Util/Diff.php
PHP | 261 lines | 149 code | 40 blank | 72 comment | 35 complexity | c938d66d0195cd641509dcbb8a5cbb37 MD5 | raw file
Possible License(s): GPL-2.0, BSD-3-Clause, LGPL-2.1, LGPL-3.0, GPL-3.0, MIT
- <?php
- /**
- * PHPUnit
- *
- * Copyright (c) 2002-2011, Sebastian Bergmann <sebastian@phpunit.de>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in
- * the documentation and/or other materials provided with the
- * distribution.
- *
- * * Neither the name of Sebastian Bergmann nor the names of his
- * contributors may be used to endorse or promote products derived
- * from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
- * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
- * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
- * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
- * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * @package PHPUnit
- * @subpackage Util
- * @author Sebastian Bergmann <sebastian@phpunit.de>
- * @author Kore Nordmann <mail@kore-nordmann.de>
- * @copyright 2002-2011 Sebastian Bergmann <sebastian@phpunit.de>
- * @license http://www.opensource.org/licenses/bsd-license.php BSD License
- * @link http://www.phpunit.de/
- * @since File available since Release 3.4.0
- */
- /**
- * Diff implementation.
- *
- * @package PHPUnit
- * @subpackage Util
- * @author Sebastian Bergmann <sebastian@phpunit.de>
- * @author Kore Nordmann <mail@kore-nordmann.de>
- * @copyright 2002-2011 Sebastian Bergmann <sebastian@phpunit.de>
- * @license http://www.opensource.org/licenses/bsd-license.php BSD License
- * @version Release: 3.5.9
- * @link http://www.phpunit.de/
- * @since Class available since Release 3.4.0
- */
- class PHPUnit_Util_Diff
- {
- /**
- * Returns the diff between two arrays or strings.
- *
- * @param array|string $from
- * @param array|string $to
- * @return string
- */
- public static function diff($from, $to)
- {
- if (is_string($from)) {
- $from = preg_split('(\r\n|\r|\n)', $from);
- }
- if (is_string($to)) {
- $to = preg_split('(\r\n|\r|\n)', $to);
- }
- $buffer = "--- Expected\n+++ Actual\n";
- $start = array();
- $end = array();
- $fromLength = count($from);
- $toLength = count($to);
- $length = min($fromLength, $toLength);
- for ($i = 0; $i < $length; ++$i) {
- if ($from[$i] === $to[$i]) {
- $start[] = $from[$i];
- unset($from[$i], $to[$i]);
- } else {
- break;
- }
- }
- $length -= $i;
- for ($i = 1; $i < $length; ++$i) {
- if ($from[$fromLength - $i] === $to[$toLength - $i]) {
- array_unshift($end, $from[$fromLength - $i]);
- unset($from[$fromLength - $i], $to[$toLength - $i]);
- } else {
- break;
- }
- }
- $common = self::longestCommonSubsequence(
- array_values($from), array_values($to)
- );
- $diff = array();
- $line = 0;
- foreach ($start as $token) {
- $diff[] = array($token, 0 /* OLD */);
- }
- reset($from);
- reset($to);
- foreach ($common as $token) {
- while ((($fromToken = reset($from)) !== $token)) {
- $diff[] = array(array_shift($from), 2 /* REMOVED */);
- }
- while ((($toToken = reset($to)) !== $token)) {
- $diff[] = array(array_shift($to), 1 /* ADDED */);
- }
- $diff[] = array($token, 0 /* OLD */);
- array_shift($from);
- array_shift($to);
- }
- while (($token = array_shift($from)) !== NULL) {
- $diff[] = array($token, 2 /* REMOVED */);
- }
- while (($token = array_shift($to)) !== NULL) {
- $diff[] = array($token, 1 /* ADDED */);
- }
- foreach ($end as $token) {
- $diff[] = array($token, 0 /* OLD */);
- }
- $inOld = FALSE;
- $i = 0;
- $old = array();
- foreach ($diff as $line) {
- if ($line[1] === 0 /* OLD */) {
- if ($inOld === FALSE) {
- $inOld = $i;
- }
- }
- else if ($inOld !== FALSE) {
- if (($i - $inOld) > 5) {
- $old[$inOld] = $i - 1;
- }
- $inOld = FALSE;
- }
- ++$i;
- }
- $start = isset($old[0]) ? $old[0] : 0;
- $end = count($diff);
- $i = 0;
- if ($tmp = array_search($end, $old)) {
- $end = $tmp;
- }
- $newChunk = TRUE;
- for ($i = $start; $i < $end; $i++) {
- if (isset($old[$i])) {
- $buffer .= "\n";
- $newChunk = TRUE;
- $i = $old[$i];
- }
- if ($newChunk) {
- // TODO: Implement chunk range information.
- $buffer .= "@@ @@\n";
- $newChunk = FALSE;
- }
- if ($diff[$i][1] === 1 /* ADDED */) {
- $buffer .= '+' . $diff[$i][0] . "\n";
- }
- else if ($diff[$i][1] === 2 /* REMOVED */) {
- $buffer .= '-' . $diff[$i][0] . "\n";
- }
- else {
- $buffer .= ' ' . $diff[$i][0] . "\n";
- }
- }
- return $buffer;
- }
- /**
- * Calculates the longest common subsequence of two arrays.
- *
- * @param array $from
- * @param array $to
- * @return array
- */
- protected static function longestCommonSubsequence(array $from, array $to)
- {
- $common = array();
- $matrix = array();
- $fromLength = count($from);
- $toLength = count($to);
- for ($i = 0; $i <= $fromLength; ++$i) {
- $matrix[$i][0] = 0;
- }
- for ($j = 0; $j <= $toLength; ++$j) {
- $matrix[0][$j] = 0;
- }
- for ($i = 1; $i <= $fromLength; ++$i) {
- for ($j = 1; $j <= $toLength; ++$j) {
- $matrix[$i][$j] = max(
- $matrix[$i-1][$j],
- $matrix[$i][$j-1],
- $from[$i-1] === $to[$j-1] ? $matrix[$i-1][$j-1] + 1 : 0
- );
- }
- }
- $i = $fromLength;
- $j = $toLength;
- while ($i > 0 && $j > 0) {
- if ($from[$i-1] === $to[$j-1]) {
- array_unshift($common, $from[$i-1]);
- --$i;
- --$j;
- }
- else if ($matrix[$i][$j-1] > $matrix[$i-1][$j]) {
- --$j;
- }
- else {
- --$i;
- }
- }
- return $common;
- }
- }