equal
deleted
inserted
replaced
432 baserevs = tuple(ctx.rev() for ctx in basectxs[rev]) |
432 baserevs = tuple(ctx.rev() for ctx in basectxs[rev]) |
433 dstrevmap[(fctx.filerev(), baserevs, path)].append(rev) |
433 dstrevmap[(fctx.filerev(), baserevs, path)].append(rev) |
434 numitems[rev] += 1 |
434 numitems[rev] += 1 |
435 workqueue = [ |
435 workqueue = [ |
436 (min(dstrevs), path, dstrevs) |
436 (min(dstrevs), path, dstrevs) |
437 for (filerev, baserevs, path), dstrevs in dstrevmap.items() |
437 for (_filerev, _baserevs, path), dstrevs in dstrevmap.items() |
438 ] |
438 ] |
439 # Move work items for earlier changesets to the front of the queue, so we |
439 # Move work items for earlier changesets to the front of the queue, so we |
440 # might be able to replace those changesets (in topological order) while |
440 # might be able to replace those changesets (in topological order) while |
441 # we're still processing later work items. Note the min() in the previous |
441 # we're still processing later work items. Note the min() in the previous |
442 # expression, which means we don't need a custom comparator here. The path |
442 # expression, which means we don't need a custom comparator here. The path |