Code Duplication    Length = 7-7 lines in 4 locations

includes/diff/DiffEngine.php 4 locations

@@ 541-547 (lines=7) @@
538
539
				// compute forward furthest reaching paths
540
				for ( $k = $start_diag; $k <= $end_diag; $k += 2 ) {
541
					if ( $k == -$d || ( $k < $d
542
							&& $V0[$limit_min_1 + $k] < $V0[$limit_plus_1 + $k] )
543
					) {
544
						$x = $V0[$limit_plus_1 + $k];
545
					} else {
546
						$x = $V0[$limit_min_1 + $k] + 1;
547
					}
548
549
					$absx = $snake0 = $x + $bottoml1;
550
					$absy = $snake1 = $x - $k + $bottoml2;
@@ 581-587 (lines=7) @@
578
579
				// compute backward furthest reaching paths
580
				for ( $k = $start_diag; $k <= $end_diag; $k += 2 ) {
581
					if ( $k == $d
582
						|| ( $k != -$d && $V1[$limit_min_1 + $k] < $V1[$limit_plus_1 + $k] )
583
					) {
584
						$x = $V1[$limit_min_1 + $k];
585
					} else {
586
						$x = $V1[$limit_plus_1 + $k] - 1;
587
					}
588
589
					$y = $x - $k - $delta;
590
@@ 618-624 (lines=7) @@
615
616
				// compute forward furthest reaching paths
617
				for ( $k = $start_diag; $k <= $end_diag; $k += 2 ) {
618
					if ( $k == -$d
619
						|| ( $k < $d && $V0[$limit_min_1 + $k] < $V0[$limit_plus_1 + $k] )
620
					) {
621
						$x = $V0[$limit_plus_1 + $k];
622
					} else {
623
						$x = $V0[$limit_min_1 + $k] + 1;
624
					}
625
626
					$absx = $snake0 = $x + $bottoml1;
627
					$absy = $snake1 = $x - $k + $bottoml2;
@@ 652-658 (lines=7) @@
649
650
				// compute backward furthest reaching paths
651
				for ( $k = $start_diag; $k <= $end_diag; $k += 2 ) {
652
					if ( $k == $d
653
						|| ( $k != -$d && $V1[$limit_min_1 + $k] < $V1[$limit_plus_1 + $k] )
654
					) {
655
						$x = $V1[$limit_min_1 + $k];
656
					} else {
657
						$x = $V1[$limit_plus_1 + $k] - 1;
658
					}
659
660
					$y = $x - $k - $delta;
661