Show More
@@ -340,13 +340,14 b' def mergecopies(repo, c1, c2, ca):' | |||||
340 | # find interesting file sets from manifests |
|
340 | # find interesting file sets from manifests | |
341 | addedinm1 = m1.filesnotin(ma) |
|
341 | addedinm1 = m1.filesnotin(ma) | |
342 | addedinm2 = m2.filesnotin(ma) |
|
342 | addedinm2 = m2.filesnotin(ma) | |
343 | u1, u2 = _computenonoverlap(repo, c1, c2, addedinm1, addedinm2) |
|
343 | u1r, u2r = _computenonoverlap(repo, c1, c2, addedinm1, addedinm2) | |
|
344 | u1u, u2u = u1r, u2r | |||
344 | bothnew = sorted(addedinm1 & addedinm2) |
|
345 | bothnew = sorted(addedinm1 & addedinm2) | |
345 |
|
346 | |||
346 | for f in u1: |
|
347 | for f in u1u: | |
347 | checkcopies(c1, f, m1, m2, ca, limit, diverge, copy1, fullcopy1) |
|
348 | checkcopies(c1, f, m1, m2, ca, limit, diverge, copy1, fullcopy1) | |
348 |
|
349 | |||
349 | for f in u2: |
|
350 | for f in u2u: | |
350 | checkcopies(c2, f, m2, m1, ca, limit, diverge, copy2, fullcopy2) |
|
351 | checkcopies(c2, f, m2, m1, ca, limit, diverge, copy2, fullcopy2) | |
351 |
|
352 | |||
352 | copy = dict(copy1.items() + copy2.items()) |
|
353 | copy = dict(copy1.items() + copy2.items()) | |
@@ -439,7 +440,7 b' def mergecopies(repo, c1, c2, ca):' | |||||
439 | (d, dirmove[d])) |
|
440 | (d, dirmove[d])) | |
440 |
|
441 | |||
441 | # check unaccounted nonoverlapping files against directory moves |
|
442 | # check unaccounted nonoverlapping files against directory moves | |
442 | for f in u1 + u2: |
|
443 | for f in u1r + u2r: | |
443 | if f not in fullcopy: |
|
444 | if f not in fullcopy: | |
444 | for d in dirmove: |
|
445 | for d in dirmove: | |
445 | if f.startswith(d): |
|
446 | if f.startswith(d): |
General Comments 0
You need to be logged in to leave comments.
Login now