summaryrefslogtreecommitdiff
path: root/lib/gitlab/diff/inline_diff.rb
blob: b8a61ad6115a7f830525e612ab3057cbe3ca8d2f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
module Gitlab
  module Diff
    class InlineDiff
      attr_accessor :lines

      def initialize(lines)
        @lines = lines
      end

      def inline_diffs
        inline_diffs = []

        local_edit_indexes.each do |index|
          old_index = index
          new_index = index + 1
          old_line = @lines[old_index]
          new_line = @lines[new_index]

          # Skip inline diff if empty line was replaced with content
          next if old_line[1..-1] == ""

          # Add one, because this is based on the prefixless version
          lcp = longest_common_prefix(old_line[1..-1], new_line[1..-1]) + 1
          lcs = longest_common_suffix(old_line[lcp..-1], new_line[lcp..-1])

          old_diff_range = lcp..(old_line.length - lcs - 1)
          new_diff_range = lcp..(new_line.length - lcs - 1)

          inline_diffs[old_index] = [old_diff_range] if old_diff_range.begin <= old_diff_range.end
          inline_diffs[new_index] = [new_diff_range] if new_diff_range.begin <= new_diff_range.end
        end

        inline_diffs
      end

      private

      # Find runs of single line edits
      def local_edit_indexes
        line_prefixes = @lines.map { |line| line.match(/\A([+-])/) ? $1 : ' ' }
        joined_line_prefixes = " #{line_prefixes.join} "

        offset = 0
        local_edit_indexes = []
        while index = joined_line_prefixes.index(" -+ ", offset)
          local_edit_indexes << index
          offset = index + 1
        end

        local_edit_indexes
      end

      def longest_common_prefix(a, b)
        max_length = [a.length, b.length].max

        length = 0
        (0..max_length - 1).each do |pos|
          old_char = a[pos]
          new_char = b[pos]

          break if old_char != new_char
          length += 1
        end

        length
      end

      def longest_common_suffix(a, b)
        longest_common_prefix(a.reverse, b.reverse)
      end
    end
  end
end