Show More
@@ -338,7 +338,7 b' def mergecopies(repo, c1, c2, ca):' | |||||
338 | fullcopy = dict(fullcopy1.items() + fullcopy2.items()) |
|
338 | fullcopy = dict(fullcopy1.items() + fullcopy2.items()) | |
339 |
|
339 | |||
340 | renamedelete = {} |
|
340 | renamedelete = {} | |
341 |
renamedelete |
|
341 | renamedeleteset = set() | |
342 | divergeset = set() |
|
342 | divergeset = set() | |
343 | for of, fl in diverge.items(): |
|
343 | for of, fl in diverge.items(): | |
344 | if len(fl) == 1 or of in c1 or of in c2: |
|
344 | if len(fl) == 1 or of in c1 or of in c2: | |
@@ -347,7 +347,7 b' def mergecopies(repo, c1, c2, ca):' | |||||
347 | # renamed on one side, deleted on the other side, but filter |
|
347 | # renamed on one side, deleted on the other side, but filter | |
348 | # out files that have been renamed and then deleted |
|
348 | # out files that have been renamed and then deleted | |
349 | renamedelete[of] = [f for f in fl if f in c1 or f in c2] |
|
349 | renamedelete[of] = [f for f in fl if f in c1 or f in c2] | |
350 |
renamedelete |
|
350 | renamedeleteset.update(fl) # reverse map for below | |
351 | else: |
|
351 | else: | |
352 | divergeset.update(fl) # reverse map for below |
|
352 | divergeset.update(fl) # reverse map for below | |
353 |
|
353 | |||
@@ -372,7 +372,7 b' def mergecopies(repo, c1, c2, ca):' | |||||
372 | note += "*" |
|
372 | note += "*" | |
373 | if f in divergeset: |
|
373 | if f in divergeset: | |
374 | note += "!" |
|
374 | note += "!" | |
375 |
if f in renamedelete |
|
375 | if f in renamedeleteset: | |
376 | note += "%" |
|
376 | note += "%" | |
377 | repo.ui.debug(" src: '%s' -> dst: '%s' %s\n" % (fullcopy[f], f, |
|
377 | repo.ui.debug(" src: '%s' -> dst: '%s' %s\n" % (fullcopy[f], f, | |
378 | note)) |
|
378 | note)) |
General Comments 0
You need to be logged in to leave comments.
Login now