Sha256: d3dd853217a4c07eded6637f06f27d4170faf709bc7700ebf0cced27fa1245ca
Contents?: true
Size: 1.65 KB
Versions: 6
Compression:
Stored size: 1.65 KB
Contents
module HashDiff
# @private
#
# caculate array difference using LCS algorithm
# http://en.wikipedia.org/wiki/Longest_common_subsequence_problem
def self.lcs(arraya, arrayb, options = {})
opts = { similarity: 0.8 }.merge!(options)
opts[:prefix] = prefix_append_array_index(opts[:prefix], '*', opts)
return [] if arraya.empty? || arrayb.empty?
a_start = b_start = 0
a_finish = arraya.size - 1
b_finish = arrayb.size - 1
vector = []
lcs = []
(b_start..b_finish).each do |bi|
lcs[bi] = []
(a_start..a_finish).each do |ai|
if similar?(arraya[ai], arrayb[bi], opts)
topleft = (ai > 0) && (bi > 0) ? lcs[bi - 1][ai - 1][1] : 0
lcs[bi][ai] = [:topleft, topleft + 1]
elsif (top = bi > 0 ? lcs[bi - 1][ai][1] : 0)
left = ai > 0 ? lcs[bi][ai - 1][1] : 0
count = top > left ? top : left
direction = if top > left
:top
elsif top < left
:left
elsif bi.zero?
:top
elsif ai.zero?
:left
else
:both
end
lcs[bi][ai] = [direction, count]
end
end
end
x = a_finish
y = b_finish
while (x >= 0) && (y >= 0) && (lcs[y][x][1] > 0)
if lcs[y][x][0] == :both
x -= 1
elsif lcs[y][x][0] == :topleft
vector.insert(0, [x, y])
x -= 1
y -= 1
elsif lcs[y][x][0] == :top
y -= 1
elsif lcs[y][x][0] == :left
x -= 1
end
end
vector
end
end
Version data entries
6 entries across 4 versions & 2 rubygems