Show More
@@ -8,10 +8,6 b'' | |||
|
8 | 8 | import util |
|
9 | 9 | import heapq |
|
10 | 10 | |
|
11 | def _nonoverlap(d1, d2, d3): | |
|
12 | "Return list of elements in d1 not in d2 or d3" | |
|
13 | return sorted([d for d in d1 if d not in d3 and d not in d2]) | |
|
14 | ||
|
15 | 11 | def _dirname(f): |
|
16 | 12 | s = f.rfind("/") |
|
17 | 13 | if s == -1: |
@@ -218,8 +214,10 b' def _computenonoverlap(repo, m1, m2, ma)' | |||
|
218 | 214 | This is its own function so extensions can easily wrap this call to see what |
|
219 | 215 | files mergecopies is about to process. |
|
220 | 216 | """ |
|
221 | u1 = _nonoverlap(m1, m2, ma) | |
|
222 | u2 = _nonoverlap(m2, m1, ma) | |
|
217 | addedinm1 = m1.filesnotin(ma) | |
|
218 | addedinm2 = m2.filesnotin(ma) | |
|
219 | u1 = sorted(addedinm1 - addedinm2) | |
|
220 | u2 = sorted(addedinm2 - addedinm1) | |
|
223 | 221 | |
|
224 | 222 | if u1: |
|
225 | 223 | repo.ui.debug(" unmatched files in local:\n %s\n" |
General Comments 0
You need to be logged in to leave comments.
Login now