Show More
@@ -341,7 +341,7 def mergecopies(repo, c1, c2, ca): | |||||
341 |
|
341 | |||
342 | renamedelete = {} |
|
342 | renamedelete = {} | |
343 | renamedelete2 = set() |
|
343 | renamedelete2 = set() | |
344 |
diverge |
|
344 | divergeset = set() | |
345 | for of, fl in diverge.items(): |
|
345 | for of, fl in diverge.items(): | |
346 | if len(fl) == 1 or of in c1 or of in c2: |
|
346 | if len(fl) == 1 or of in c1 or of in c2: | |
347 | del diverge[of] # not actually divergent, or not a rename |
|
347 | del diverge[of] # not actually divergent, or not a rename | |
@@ -351,7 +351,7 def mergecopies(repo, c1, c2, ca): | |||||
351 | renamedelete[of] = [f for f in fl if f in c1 or f in c2] |
|
351 | renamedelete[of] = [f for f in fl if f in c1 or f in c2] | |
352 | renamedelete2.update(fl) # reverse map for below |
|
352 | renamedelete2.update(fl) # reverse map for below | |
353 | else: |
|
353 | else: | |
354 |
diverge |
|
354 | divergeset.update(fl) # reverse map for below | |
355 |
|
355 | |||
356 | bothnew = sorted(addedinm1 & addedinm2) |
|
356 | bothnew = sorted(addedinm1 & addedinm2) | |
357 | if bothnew: |
|
357 | if bothnew: | |
@@ -376,13 +376,13 def mergecopies(repo, c1, c2, ca): | |||||
376 | note = "" |
|
376 | note = "" | |
377 | if f in copy: |
|
377 | if f in copy: | |
378 | note += "*" |
|
378 | note += "*" | |
379 |
if f in diverge |
|
379 | if f in divergeset: | |
380 | note += "!" |
|
380 | note += "!" | |
381 | if f in renamedelete2: |
|
381 | if f in renamedelete2: | |
382 | note += "%" |
|
382 | note += "%" | |
383 | repo.ui.debug(" src: '%s' -> dst: '%s' %s\n" % (fullcopy[f], f, |
|
383 | repo.ui.debug(" src: '%s' -> dst: '%s' %s\n" % (fullcopy[f], f, | |
384 | note)) |
|
384 | note)) | |
385 |
del diverge |
|
385 | del divergeset | |
386 |
|
386 | |||
387 | if not fullcopy: |
|
387 | if not fullcopy: | |
388 | return copy, movewithdir, diverge, renamedelete |
|
388 | return copy, movewithdir, diverge, renamedelete |
General Comments 0
You need to be logged in to leave comments.
Login now