Show More
@@ -268,6 +268,10 b' def _changesetforwardcopies(a, b, match)' | |||||
268 | # 'work' contains 3-tuples of a (revision number, parent number, copies). |
|
268 | # 'work' contains 3-tuples of a (revision number, parent number, copies). | |
269 | # The parent number is only used for knowing which parent the copies dict |
|
269 | # The parent number is only used for knowing which parent the copies dict | |
270 | # came from. |
|
270 | # came from. | |
|
271 | # NOTE: To reduce costly copying the 'copies' dicts, we reuse the same | |||
|
272 | # instance for *one* of the child nodes (the last one). Once an instance | |||
|
273 | # has been put on the queue, it is thus no longer safe to modify it. | |||
|
274 | # Conversely, it *is* safe to modify an instance popped off the queue. | |||
271 | work = [(r, 1, {}) for r in roots] |
|
275 | work = [(r, 1, {}) for r in roots] | |
272 | heapq.heapify(work) |
|
276 | heapq.heapify(work) | |
273 | alwaysmatch = match.always() |
|
277 | alwaysmatch = match.always() |
General Comments 0
You need to be logged in to leave comments.
Login now