2009-01-24 02:12:19 +03:00
|
|
|
# diffhelpers.py - pure Python implementation of diffhelpers.c
|
|
|
|
#
|
|
|
|
# Copyright 2009 Matt Mackall <mpm@selenic.com> and others
|
|
|
|
#
|
2009-04-26 03:08:54 +04:00
|
|
|
# This software may be used and distributed according to the terms of the
|
2010-01-20 07:20:08 +03:00
|
|
|
# GNU General Public License version 2 or any later version.
|
2009-01-24 02:12:19 +03:00
|
|
|
|
2015-12-12 21:35:41 +03:00
|
|
|
from __future__ import absolute_import
|
|
|
|
|
2009-01-24 02:12:19 +03:00
|
|
|
def addlines(fp, hunk, lena, lenb, a, b):
|
|
|
|
while True:
|
|
|
|
todoa = lena - len(a)
|
|
|
|
todob = lenb - len(b)
|
|
|
|
num = max(todoa, todob)
|
|
|
|
if num == 0:
|
|
|
|
break
|
|
|
|
for i in xrange(num):
|
|
|
|
s = fp.readline()
|
|
|
|
c = s[0]
|
|
|
|
if s == "\\ No newline at end of file\n":
|
|
|
|
fix_newline(hunk, a, b)
|
|
|
|
continue
|
|
|
|
if c == "\n":
|
|
|
|
# Some patches may be missing the control char
|
|
|
|
# on empty lines. Supply a leading space.
|
|
|
|
s = " \n"
|
|
|
|
hunk.append(s)
|
|
|
|
if c == "+":
|
|
|
|
b.append(s[1:])
|
|
|
|
elif c == "-":
|
|
|
|
a.append(s)
|
|
|
|
else:
|
|
|
|
b.append(s[1:])
|
|
|
|
a.append(s)
|
|
|
|
return 0
|
|
|
|
|
|
|
|
def fix_newline(hunk, a, b):
|
|
|
|
l = hunk[-1]
|
2010-02-26 18:52:43 +03:00
|
|
|
# tolerate CRLF in last line
|
|
|
|
if l.endswith('\r\n'):
|
|
|
|
hline = l[:-2]
|
|
|
|
else:
|
|
|
|
hline = l[:-1]
|
|
|
|
c = hline[0]
|
2009-01-24 02:12:19 +03:00
|
|
|
|
2010-09-23 09:02:31 +04:00
|
|
|
if c in " +":
|
2010-02-26 18:52:43 +03:00
|
|
|
b[-1] = hline[1:]
|
2010-09-23 09:02:31 +04:00
|
|
|
if c in " -":
|
2009-01-24 02:12:19 +03:00
|
|
|
a[-1] = hline
|
|
|
|
hunk[-1] = hline
|
|
|
|
return 0
|
|
|
|
|
|
|
|
|
|
|
|
def testhunk(a, b, bstart):
|
|
|
|
alen = len(a)
|
|
|
|
blen = len(b)
|
|
|
|
if alen > blen - bstart:
|
|
|
|
return -1
|
|
|
|
for i in xrange(alen):
|
|
|
|
if a[i][1:] != b[i + bstart]:
|
|
|
|
return -1
|
|
|
|
return 0
|