mirror of
https://github.com/facebook/sapling.git
synced 2024-10-09 00:14:35 +03:00
f33142790b
The longest_match code compares all the possible positions in two files to find the best match. Given a pair of sequences, it effectively searches a grid like this: a b b b c . d e . f 0 1 2 3 4 5 6 7 8 9 a 1 - - - - - - - - - b - 2 1 1 - - - - - - b - 1 3 2 - - - - - - b - 1 2 4 - - - - - - . - - - - - 1 - - 1 - Here, the 4 in the middle says "the first four lines of the file match", which it can compute be comparing the fourth lines and then adding one to the result found when comparing the third lines in the entry to the upper left. We generally avoid the quadratic worst case by only looking at lines that match, which is precomputed. We also avoid quadratic storage by only keeping a single column vector and then keeping track of the best match. Unfortunately, this can get us into trouble with the sequences above. Because we want to reuse the '3' value when calculating the '4', we need to be careful not to overwrite it with the '2' we calculate immediately before. If we scan left to right, top to bottom, we're going to have a problem: we'll overwrite our 3 before we use it and calculate a suboptimal best match. To address this, we can either keep two column vectors and swap between them (which significantly complicates bookkeeping), or change our scanning order. If we instead scan from left to right, bottom to top, we'll avoid ever overwriting values we'll need in the future. This unfortunately needs several changes to be made simultaneously: - change the order we build the initial hash chains for the b sequence - change the sentinel values from INT_MAX to -1 - change the visit order in the longest_match inner loop - add a tie-breaker preference for earlier matches This last is needed because we previously had an implicit tie-breaker from our visitation order that our test suite relies on. Later matches can also trigger a bug in the normalization code in diff().
74 lines
1.7 KiB
Python
74 lines
1.7 KiB
Python
from __future__ import absolute_import, print_function
|
|
import struct
|
|
from mercurial import (
|
|
bdiff,
|
|
mpatch,
|
|
)
|
|
|
|
def test1(a, b):
|
|
d = bdiff.bdiff(a, b)
|
|
c = a
|
|
if d:
|
|
c = mpatch.patches(a, [d])
|
|
if c != b:
|
|
print("***", repr(a), repr(b))
|
|
print("bad:")
|
|
print(repr(c)[:200])
|
|
print(repr(d))
|
|
|
|
def test(a, b):
|
|
print("***", repr(a), repr(b))
|
|
test1(a, b)
|
|
test1(b, a)
|
|
|
|
test("a\nc\n\n\n\n", "a\nb\n\n\n")
|
|
test("a\nb\nc\n", "a\nc\n")
|
|
test("", "")
|
|
test("a\nb\nc", "a\nb\nc")
|
|
test("a\nb\nc\nd\n", "a\nd\n")
|
|
test("a\nb\nc\nd\n", "a\nc\ne\n")
|
|
test("a\nb\nc\n", "a\nc\n")
|
|
test("a\n", "c\na\nb\n")
|
|
test("a\n", "")
|
|
test("a\n", "b\nc\n")
|
|
test("a\n", "c\na\n")
|
|
test("", "adjfkjdjksdhfksj")
|
|
test("", "ab")
|
|
test("", "abc")
|
|
test("a", "a")
|
|
test("ab", "ab")
|
|
test("abc", "abc")
|
|
test("a\n", "a\n")
|
|
test("a\nb", "a\nb")
|
|
|
|
#issue1295
|
|
def showdiff(a, b):
|
|
bin = bdiff.bdiff(a, b)
|
|
pos = 0
|
|
while pos < len(bin):
|
|
p1, p2, l = struct.unpack(">lll", bin[pos:pos + 12])
|
|
pos += 12
|
|
print(p1, p2, repr(bin[pos:pos + l]))
|
|
pos += l
|
|
showdiff("x\n\nx\n\nx\n\nx\n\nz\n", "x\n\nx\n\ny\n\nx\n\nx\n\nz\n")
|
|
showdiff("x\n\nx\n\nx\n\nx\n\nz\n", "x\n\nx\n\ny\n\nx\n\ny\n\nx\n\nz\n")
|
|
# we should pick up abbbc. rather than bc.de as the longest match
|
|
showdiff("a\nb\nb\nb\nc\n.\nd\ne\n.\nf\n",
|
|
"a\nb\nb\na\nb\nb\nb\nc\n.\nb\nc\n.\nd\ne\nf\n")
|
|
|
|
print("done")
|
|
|
|
def testfixws(a, b, allws):
|
|
c = bdiff.fixws(a, allws)
|
|
if c != b:
|
|
print("*** fixws", repr(a), repr(b), allws)
|
|
print("got:")
|
|
print(repr(c))
|
|
|
|
testfixws(" \ta\r b\t\n", "ab\n", 1)
|
|
testfixws(" \ta\r b\t\n", " a b\n", 0)
|
|
testfixws("", "", 1)
|
|
testfixws("", "", 0)
|
|
|
|
print("done")
|