Code Duplication    Length = 11-11 lines in 2 locations

lib/Ajde/Component/lib/finediff.php 2 locations

@@ 518-528 (lines=11) @@
515
            // catch easy cases first
516
            $from_segment_length = $from_segment_end - $from_segment_start;
517
            $to_segment_length = $to_segment_end - $to_segment_start;
518
            if (!$from_segment_length || !$to_segment_length) {
519
                if ($from_segment_length) {
520
                    $result[$from_segment_start * 4] = new FineDiffDeleteOp($from_segment_length);
521
                } else {
522
                    if ($to_segment_length) {
523
                        $result[$from_segment_start * 4 + 1] = new FineDiffInsertOp(substr($to_text, $to_segment_start,
524
                            $to_segment_length));
525
                    }
526
                }
527
                continue;
528
            }
529
530
            // find longest copy operation for the current segments
531
            $best_copy_length = 0;
@@ 657-667 (lines=11) @@
654
            $to_segment_len = $to_segment_end - $to_segment_start;
655
656
            // catch easy cases first
657
            if (!$from_segment_len || !$to_segment_len) {
658
                if ($from_segment_len) {
659
                    $result[$from_segment_start * 4 + 0] = new FineDiffDeleteOp($from_segment_len);
660
                } else {
661
                    if ($to_segment_len) {
662
                        $result[$from_segment_start * 4 + 1] = new FineDiffInsertOp(substr($to_text, $to_segment_start,
663
                            $to_segment_len));
664
                    }
665
                }
666
                continue;
667
            }
668
            if ($from_segment_len >= $to_segment_len) {
669
                $copy_len = $to_segment_len;
670
                while ($copy_len) {