Show More
@@ -102,6 +102,12 b' def findcopies(repo, m1, m2, ma, limit):' | |||
|
102 | 102 | Find moves and copies between m1 and m2 back to limit linkrev |
|
103 | 103 | """ |
|
104 | 104 | |
|
105 | def nonoverlap(d1, d2, d3): | |
|
106 | "Return list of elements in d1 not in d2 or d3" | |
|
107 | l = [d for d in d1 if d not in d3 and d not in d2] | |
|
108 | l.sort() | |
|
109 | return l | |
|
110 | ||
|
105 | 111 | def dirname(f): |
|
106 | 112 | s = f.rfind("/") |
|
107 | 113 | if s == -1: |
@@ -139,11 +145,8 b' def findcopies(repo, m1, m2, ma, limit):' | |||
|
139 | 145 | old.sort() |
|
140 | 146 | return old |
|
141 | 147 | |
|
142 | def nonoverlap(d1, d2, d3): | |
|
143 | "Return list of elements in d1 not in d2 or d3" | |
|
144 | l = [d for d in d1 if d not in d3 and d not in d2] | |
|
145 | l.sort() | |
|
146 | return l | |
|
148 | copy = {} | |
|
149 | fullcopy = {} | |
|
147 | 150 | |
|
148 | 151 | def checkcopies(c, man): |
|
149 | 152 | '''check possible copies for filectx c''' |
@@ -169,8 +172,6 b' def findcopies(repo, m1, m2, ma, limit):' | |||
|
169 | 172 | return {} |
|
170 | 173 | |
|
171 | 174 | dcopies = repo.dirstate.copies() |
|
172 | copy = {} | |
|
173 | fullcopy = {} | |
|
174 | 175 | u1 = nonoverlap(m1, m2, ma) |
|
175 | 176 | u2 = nonoverlap(m2, m1, ma) |
|
176 | 177 | ctx = util.cachefunc(lambda f, n: repo.filectx(f, fileid=n[:20])) |
General Comments 0
You need to be logged in to leave comments.
Login now